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.
Type de document :
Communication dans un congrès
ICASSP - 37th International Conference on Acoustics, Speech, and Signal Processing, Mar 2012, Kyoto, Japan. 2012
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger


https://hal.inria.fr/hal-00661591
Contributeur : Hervé Jégou <>
Soumis le : vendredi 20 janvier 2012 - 10:29:34
Dernière modification le : mardi 16 janvier 2018 - 15:54:20
Document(s) archivé(s) le : lundi 19 novembre 2012 - 14:05:42

Fichiers

antisparse_final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. 2012. 〈hal-00661591〉

Partager

Métriques

Consultations de la notice

401

Téléchargements de fichiers

322