Sciweavers

22 search results - page 1 / 5
» The Hybrid Tree: An Index Structure for High Dimensional Fea...
Sort
View
VLDB
2000
ACM
114views Database» more  VLDB 2000»
13 years 8 months ago
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uem...
CVPR
1997
IEEE
14 years 7 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
BTW
2009
Springer
133views Database» more  BTW 2009»
13 years 8 months ago
High-Dimensional Indexing for Multimedia Features
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
Ira Assent, Stephan Günnemann, Hardy Kremer, ...
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 5 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...