CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2014 vol.36 Issue No.06 - June
Issue No.06 - June (2014 vol.36)
David J. Fleet , Department of Computer Science, University of Toronto, Toronto, ON, Canada
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 straight-forward 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.
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
David J. Fleet, "Fast Exact Search in Hamming Space With Multi-Index Hashing", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.36, no. 6, pp. 1107-1119, June 2014, doi:10.1109/TPAMI.2013.231