16 search results - page 1 / 4 » Shape Indexing Using Approximate Nearest-Neighbour Search in... |
CVPR
1997
IEEE
14 years 6 months ago
1997
IEEE
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...
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
ENGL
2008
13 years 4 months ago
2008
With the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexi...
PCM
2001
Springer
13 years 9 months ago
2001
Springer
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...