Fast Exact Search in Hamming Space with Multi-Index Hashing

07/11/2013
by   Mohammad Norouzi, et al.
0

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.

READ FULL TEXT
research
02/20/2019

Empowering Elasticsearch with Exact and Fast r-Neighbor Search in Hamming Space

A growing interest has been witnessed recently in building nearest neigh...
research
11/21/2019

Efficient Querying from Weighted Binary Codes

Binary codes are widely used to represent the data due to their small st...
research
09/26/2017

FSL-BM: Fuzzy Supervised Learning with Binary Meta-Feature for Classification

This paper introduces a novel real-time Fuzzy Supervised Learning with B...
research
08/26/2019

Nearest Neighbor Search-Based Bitwise Source Separation Using Discriminant Winner-Take-All Hashing

We propose an iteration-free source separation algorithm based on Winner...
research
06/06/2023

Constant Sequence Extension for Fast Search Using Weighted Hamming Distance

Representing visual data using compact binary codes is attracting increa...
research
07/13/2022

Rapid Person Re-Identification via Sub-space Consistency Regularization

Person Re-Identification (ReID) matches pedestrians across disjoint came...
research
09/18/2020

Accelerating Search on Binary Codes in Weighted Hamming Space

Compared to Hamming distance, weighted Hamming distance as a similarity ...

Please sign up or login with your details

Forgot password? Click here to reset