Hybrid Diffusion: Spectral-temporal Graph Filtering For Manifold Ranking

Abstract

State of the art image retrieval performance is achieved with CNN features and manifold ranking using a k-NN similarity graph that is pre-computed off-line. The two most successful existing approaches are temporal filtering, where manifold ranking amounts to solving a sparse linear system online, and spectral filtering, where eigen-decomposition of the adjacency matrix is performed off-line and then manifold ranking amounts to dot-product search online. The former suffers from expensive queries and the latter from significant space overhead. Here we introduce a novel, theoretically well-founded hybrid filtering approach allowing full control of the space-time trade-off between these two extremes. Experimentally, we verify that our hybrid method delivers results on par with the state of the art, with lower memory demands compared to spectral filtering approaches and faster compared to temporal filtering.

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keyiscen2018hybrid

Related papers

• Fast Spectral Ranking For Similarity Search (2017)11.58
• Three Tiers Neighborhood Graph And Multi-graph Fusion Ranking For Multi-feature Image Retrieval: A Manifold Aspect (2016)0.00
• Efficient Diffusion On Region Manifolds: Recovering Small Objects With Compact CNN Representations (2016)15.83
• Deepdiffusion: Unsupervised Learning Of Retrieval-adapted Representations Via Diffusion-based Ranking On Latent Feature Manifold (2021)5.13
• Perceptual Uniform Descriptor And Ranking On Manifold: A Bridge Between Image Representation And Ranking For Image Retrieval (2016)0.00
• Efficient Image Retrieval Via Decoupling Diffusion Into Online And Offline Processing (2018)12.25
• Cross-modal Manifold Learning For Cross-modal Retrieval (2016)0.00
• Locality Preserving Markovian Transition For Instance Retrieval (2025)0.00