inria-00548629, version 1
Searching with expectations
Harsimrat Sandhawalia 1, 2Hervé Jégou
a, 3
IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP '10) (2010) 1242--1245
Abstract: Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spectral hashing have addressed the problem of obtaining compact binary codes optimizing the trade-off between the memory usage and the probability of retrieving the true nearest neighbors. In this paper, we formulate the problem of generating compact signatures as a rate-distortion problem. In the spirit of source coding algorithms, we aim at minimizing the reconstruction error on the squared distances with a constraint on the memory usage. The vectors are ranked based on the distance estimates to the query vector. Experiments on image descriptors show a significant improvement over spectral hashing.
- a – INRIA
- 1: Laboratoire Jean Kuntzmann (LJK)
- CNRS : UMR5224 – Université Joseph Fourier - Grenoble I – Université Pierre Mendès-France - Grenoble II – Institut Polytechnique de Grenoble - Grenoble Institute of Technology
- 2: LEAR (INRIA Grenoble Rhône-Alpes / LJK Laboratoire Jean Kuntzmann)
- CNRS : FR71 – CNRS : UMR5527 – INRIA – Laboratoire Jean Kuntzmann – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG)
- 3: TEXMEX (INRIA - IRISA)
- CNRS : UMR6074 – INRIA – INSA Rennes – Université de Rennes 1
- Domain : Computer Science/Computer Vision and Pattern Recognition
- Keywords : nearest neighbor search – quantization – source coding
- inria-00548629, version 1
- http://hal.inria.fr/inria-00548629
- oai:hal.inria.fr:inria-00548629
- From: Hervé Jégou
- Submitted for:
- Submitted on: Monday, 20 December 2010 10:21:36
- Updated on: Monday, 10 January 2011 14:24:44







Associated documents
Export