120 search results - page 8 / 24 » Complementary Hashing for Approximate Nearest Neighbor Searc... |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
This paper improves recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We, first, analyze bag-of-features in t...
ISMIR
2005
Springer
14 years 1 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Matching of high-dimensional features using nearest neighbors search is an important part of image matching methods which are based on local invariant features. In this work we hi...