Anti-sparse coding for approximate nearest neighbor search

Hervé Jégou 1 Teddy Furon 1 Jean-Jacques Fuchs 2
1 TEXMEX - Multimedia content-based indexing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
2 Sirocco - Analysis representation, compression and communication of visual data
Inria Rennes – Bretagne Atlantique , IRISA-D5 - SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE
Abstract : This paper proposes a binarization scheme for vectors of high dimension based on the recent concept of anti-sparse coding, and shows its excellent performance for approximate nearest neighbor search. Unlike other binarization schemes, this framework allows, up to a scaling factor, the explicit reconstruction from the binary representation of the original vector. The paper also shows that random projections which are used in Locality Sensitive Hashing algorithms, are significantly outperformed by regular frames for both synthetic and real data if the number of bits exceeds the vector dimensionality, i.e., when high precision is required.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download


https://hal.inria.fr/hal-00661591
Contributor : Hervé Jégou <>
Submitted on : Friday, January 20, 2012 - 10:29:34 AM
Last modification on : Friday, November 16, 2018 - 1:31:06 AM
Long-term archiving on : Monday, November 19, 2012 - 2:05:42 PM

Files

antisparse_final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00661591, version 1

Citation

Hervé Jégou, Teddy Furon, Jean-Jacques Fuchs. Anti-sparse coding for approximate nearest neighbor search. ICASSP - 37th International Conference on Acoustics, Speech, and Signal Processing, Mar 2012, Kyoto, Japan. ⟨hal-00661591⟩

Share

Metrics

Record views

719

Files downloads

525