Product Quantization for Nearest Neighbor Search

H. Jégou,Matthijs Douze,C. Schmid

Published 2011 in IEEE Transactions on Pattern Analysis and Machine Intelligence

ABSTRACT

This paper introduces a product quantization-based approach for approximate nearest neighbor search. The idea is to decompose the space into a Cartesian product of low-dimensional subspaces and to quantize each subspace separately. A vector is represented by a short code composed of its subspace quantization indices. The euclidean distance between two vectors can be efficiently estimated from their codes. An asymmetric version increases precision, as it computes the approximate distance between a vector and a code. Experimental results show that our approach searches for nearest neighbors efficiently, in particular in combination with an inverted file system. Results for SIFT and GIST image descriptors show excellent search accuracy, outperforming three state-of-the-art approaches. The scalability of our approach is validated on a data set of two billion vectors.

PUBLICATION RECORD

  • Publication year

    2011

  • Venue

    IEEE Transactions on Pattern Analysis and Machine Intelligence

  • Publication date

    Unknown publication date

  • Fields of study

    Mathematics, Computer Science, Medicine

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar, PubMed

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-36 of 36 references · Page 1 of 1

CITED BY

Showing 1-100 of 3304 citing papers · Page 1 of 34