Skip to Main content Skip to Navigation

Searching with quantization: approximate nearest neighbor search using short codes and distance estimators

Hervé Jégou 1 Matthijs Douze 1 Cordelia Schmid 1
1 LEAR - Learning and recognition in vision
Inria Grenoble - Rhône-Alpes, LJK - Laboratoire Jean Kuntzmann, Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology
Abstract : We propose an approximate nearest neighbor search method based on quantization. It uses, in particular, product quantizer to produce short codes and corresponding distance estimators approximating the Euclidean distance between the orginal vectors. The method is advantageously used in an asymmetric manner, by computing the distance between a vector and code, unlike competing techniques such as spectral hashing that only compare codes. Our approach approximates the Euclidean distance based on memory efficient codes and, thus, permits efficient nearest neighbor search. Experiments performed on SIFT and GIST image descriptors show excellent search accuracy. The method is shown to outperform two state-of-the-art approaches of the literature. Timings measured when searching a vector set of 2 billion vectors are shown to be excellent given the high accuracy of the method.
Document type :
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Hervé Jégou Connect in order to contact the contributor
Submitted on : Monday, August 24, 2009 - 12:57:37 PM
Last modification on : Thursday, January 20, 2022 - 5:28:05 PM
Long-term archiving on: : Monday, October 15, 2012 - 4:21:05 PM


Files produced by the author(s)


  • HAL Id : inria-00410767, version 1



Hervé Jégou, Matthijs Douze, Cordelia Schmid. Searching with quantization: approximate nearest neighbor search using short codes and distance estimators. [Research Report] RR-7020, INRIA. 2009, pp.25. ⟨inria-00410767⟩



Les métriques sont temporairement indisponibles