Fast Search in Hamming Space with Multi-Index Hashing
Abstract
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. 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 in this way, 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 algorithm is straightforward to implement, storage efficient, and it has sub-linear run-time behavior for uniformly distributed codes. Empirical results show dramatic speed-ups over a linear scan baseline and for datasets with up to one billion items, 64- or 128-bit codes, and search radii up to 25 bits.
Cite
Text
Norouzi et al. "Fast Search in Hamming Space with Multi-Index Hashing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012. doi:10.1109/CVPR.2012.6248043Markdown
[Norouzi et al. "Fast Search in Hamming Space with Multi-Index Hashing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012.](https://mlanthology.org/cvpr/2012/norouzi2012cvpr-fast/) doi:10.1109/CVPR.2012.6248043BibTeX
@inproceedings{norouzi2012cvpr-fast,
title = {{Fast Search in Hamming Space with Multi-Index Hashing}},
author = {Norouzi, Mohammad and Punjani, Ali and Fleet, David J.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2012},
pages = {3108-3115},
doi = {10.1109/CVPR.2012.6248043},
url = {https://mlanthology.org/cvpr/2012/norouzi2012cvpr-fast/}
}