Fast Spectral Ranking for Similarity Search - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Fast Spectral Ranking for Similarity Search

(1) , (2) , (1) , (2) , (1)
1
2

Abstract

Despite the success of deep learning on representing images for particular object retrieval, recent studies show that the learned representations still lie on manifolds in a high dimensional space. This makes the Euclidean nearest neighbor search biased for this task. Exploring the mani-folds online remains expensive even if a nearest neighbor graph has been computed offline. This work introduces an explicit embedding reducing manifold search to Euclidean search followed by dot product similarity search. This is equivalent to linear graph filtering of a sparse signal in the frequency domain. To speed up online search, we compute an approximate Fourier basis of the graph offline. We improve the state of art on particular object retrieval datasets including the challenging Instre dataset containing small objects. At a scale of 10 5 images, the offline cost is only a few hours, while query time is comparable to standard similarity search.
Fichier principal
Vignette du fichier
1703.06935.pdf (1.09 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02370336 , version 1 (19-11-2019)

Identifiers

Cite

Ahmet Iscen, Yannis Avrithis, Giorgos Tolias, Teddy Furon, Ondrej Chum. Fast Spectral Ranking for Similarity Search. 2017. ⟨hal-02370336⟩
43 View
68 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More