This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Exact Search in Hamming Space With Multi-Index Hashing
PrePrint
ISSN: 0162-8828
Mohammad Norouzi, University of Toronto, Toronto
Ali Punjani, University of Toronto, Toronto
David J. Fleet, University of Toronto, Toronto
There is growing interest in representing image data and feature descriptors using compact binary codes for fast near neighbor search. Although binary codes are motivated by their use as direct indices (addresses) into a hash table, codes longer than 32 bits are not being used as such, as it was thought to be ineffective. We introduce a rigorous way to build multiple hash tables on binary code substrings that enables exact k-nearest neighbor search in Hamming space. The approach is storage efficient and straightforward to implement. Theoretical analysis shows that the algorithm exhibits sub-linear run-time behavior for uniformly distributed codes. Empirical results show dramatic speedups over a linear scan baseline for datasets of up to one billion codes of 64, 128, or 256 bits.
Index Terms:
Binary codes,Databases,Hamming distance,Search problems,Algorithm design and analysis,Upper bound,Complexity theory,large-scale image retrieval,Binary codes,Hamming distance,nearest neighbor search,multi index hashing
Citation:
Mohammad Norouzi, Ali Punjani, David J. Fleet, "Fast Exact Search in Hamming Space With Multi-Index Hashing," IEEE Transactions on Pattern Analysis and Machine Intelligence, 27 Feb. 2014. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TPAMI.2013.231>
Usage of this product signifies your acceptance of the Terms of Use.