Search For:

Displaying 1-2 out of 2 total
Fast Exact Search in Hamming Space With Multi-Index Hashing
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Mohammad Norouzi,Ali Punjani,David Fleet
Issue Date:February 2014
pp. 1
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 bi...
Cartesian K-Means
Found in: 2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
By Mohammad Norouzi,David J. Fleet
Issue Date:June 2013
pp. 3017-3024
A fundamental limitation of quantization techniques like the k-means clustering algorithm is the storage and run-time cost associated with the large numbers of clusters required to keep quantization errors small and model fidelity high. We develop new mode...