HmSearch: an efficient hamming distance query processing algorithm
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Listen, look, and gotcha: instant video search with mobile phones by layered audio-video indexing
Proceedings of the 21st ACM international conference on Multimedia
Linear cross-modal hashing for efficient multimedia search
Proceedings of the 21st ACM international conference on Multimedia
LAVES: an instant mobile video search system based on layered audio-video indexing
Proceedings of the 21st ACM international conference on Multimedia
A unified approximate nearest neighbor search scheme by combining data structure and hashing
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Parametric local multimodal hashing for cross-view similarity search
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
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.