Memory vectors for similarity search in high-dimensional spaces - Université de Rennes Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Big Data Année : 2017

Memory vectors for similarity search in high-dimensional spaces

Résumé

We study an indexing architecture to store and search in a database of high-dimensional vectors from the perspective of statistical signal processing and decision theory. This architecture is composed of several memory units, each of which summarizes a fraction of the database by a single representative vector. The potential similarity of the query to one of the vectors stored in the memory unit is gauged by a simple correlation with the memory unit's representative vector. This representative optimizes the test of the following hypothesis: the query is independent from any vector in the memory unit vs. the query is a simple perturbation of one of the stored vectors. Compared to exhaustive search, our approach finds the most similar database vectors significantly faster without a noticeable reduction in search quality. Interestingly, the reduction of complexity is provably better in high-dimensional spaces. We empirically demonstrate its practical interest in a large-scale image search scenario with off-the-shelf state-of-the-art descriptors.
Fichier principal
Vignette du fichier
iscen_tbd.pdf (787.47 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01481220 , version 1 (02-03-2017)

Identifiants

Citer

Ahmet Iscen, Teddy Furon, Vincent Gripon, Michael Rabbat, Hervé Jégou. Memory vectors for similarity search in high-dimensional spaces. IEEE Transactions on Big Data, 2017, 4 (1), pp.65 - 77. ⟨10.1109/TBDATA.2017.2677964⟩. ⟨hal-01481220⟩
612 Consultations
326 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More