Searching with expectations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Searching with expectations

Résumé

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.
Fichier principal
Vignette du fichier
searching_with_expectations.pdf (181.23 Ko) Télécharger le fichier
Vignette du fichier
SJ10.png (12.79 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Figure, Image
Loading...

Dates et versions

inria-00548629 , version 1 (20-12-2010)

Identifiants

Citer

Harsimrat Sandhawalia, Hervé Jégou. Searching with expectations. ICASSP 2010 - IEEE International Conference on Acoustics Speech and Signal Processing, IEEE, Mar 2010, Dallas, United States. pp.1242-1245, ⟨10.1109/ICASSP.2010.5495403⟩. ⟨inria-00548629⟩
302 Consultations
706 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More