89 search results - page 6 / 18 » Efficient Search for Approximate Nearest Neighbor in High Di... |
CVPR
1997
IEEE
14 years 9 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...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
PAMI
2011
13 years 2 months ago
2011
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Important factors affecting the efficiency and performance of the nearest neighbor classifier (NNC) are space, classification time requirements and for high dimensional data, due ...