Fast Exact Search in Hamming Space With Multi-Index Hashing
Fast Exact Search in Hamming Space With Multi-Index Hashing
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 …