Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Fast Spectral Ranking for Similarity Search

Ahmet Iscen 1 Yannis Avrithis 2 Giorgos Tolias 1 Teddy Furon 2 Ondrej Chum 1
1 VRG - Visual Recognition Group [Prague]
CTU/FEE - Faculty of electrical engineering [Prague]
2 LinkMedia - Creating and exploiting explicit links between multimedia fragments
Inria Rennes – Bretagne Atlantique , IRISA-D6 - MEDIA ET INTERACTIONS
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [73 references]  Display  Hide  Download
Contributor : Yannis Avrithis <>
Submitted on : Tuesday, November 19, 2019 - 1:48:01 PM
Last modification on : Friday, July 10, 2020 - 4:01:51 PM
Long-term archiving on: : Thursday, February 20, 2020 - 4:29:05 PM


Files produced by the author(s)


  • HAL Id : hal-02370336, version 1
  • ARXIV : 1703.06935


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