Sciweavers

Share
CVPR
2007
IEEE

Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences

10 years 1 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have been developed [6, 4, 11]. However, given a query image, searching a very large image database with such measures remains impractical. We introduce a sublinear time randomized hashing algorithm for indexing sets of feature vectors under their partial correspondences. We develop an efficient embedding function for the normalized partial matching similarity between sets, and show how to exploit random hyperplane properties to construct hash functions that satisfy locality-sensitive constraints. The result is a bounded approximate similarity search algorithm that finds (1 + )-approximate nearest neighbor images in O(N1/(1+ ) ) time for a database containing N images represented by (varying numbers of) local features. By design the indexing is robust to outlier features, as it favors strong one-to-one matchings bu...
Kristen Grauman, Trevor Darrell
Added 12 Oct 2009
Updated 28 Oct 2009
Type Conference
Year 2007
Where CVPR
Authors Kristen Grauman, Trevor Darrell
Comments (0)
books