Asymmetric Hamming Embedding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Asymmetric Hamming Embedding

Mihir Jain
  • Function : Author
  • PersonId : 905230
Hervé Jégou
  • Function : Author
  • PersonId : 833473
Patrick Gros

Abstract

This paper proposes an asymmetric Hamming Embedding scheme for large scale image search based on local descriptors. The comparison of two descriptors relies on an vector-to-binary code comparison, which limits the quantization error associated with the query compared with the original Hamming Embedding method. The approach is used in combination with an inverted file structure that offers high efficiency, comparable to that of a regular bag-of-features retrieval systems. The comparison is performed on two popular datasets. Our method consistently improves the search quality over the symmetric version. The trade-off between memory usage and precision is evaluated, showing that the method is especially useful for short binary signatures.
Fichier principal
Vignette du fichier
hal.pdf (2.6 Mo) Télécharger le fichier
Vignette du fichier
hal.png (34.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...

Dates and versions

inria-00607278 , version 1 (08-07-2011)
inria-00607278 , version 2 (08-07-2011)

Identifiers

  • HAL Id : inria-00607278 , version 2

Cite

Mihir Jain, Hervé Jégou, Patrick Gros. Asymmetric Hamming Embedding. ACM Multimedia, Nov 2011, Scottsdale, United States. ⟨inria-00607278v2⟩
500 View
904 Download

Share

Gmail Facebook X LinkedIn More