Cluster-Aware Similarity Diffusion for Instance Retrieval
Not on the map. Why?
Abstract (arXiv)
Diffusion-based re-ranking is a common method used for retrieving instances by performing similarity propagation in a nearest neighbor graph. However, existing techniques that construct the affinity graph based on pairwise instances can lead to the propagation of misinformation from outliers and other manifolds, resulting in inaccurate results. To overcome this issue, we propose a novel Cluster-Aware Similarity (CAS) diffusion for instance retrieval. The primary concept of CAS is to conduct similarity diffusion within local clusters, which can reduce the influence from other manifolds explicitly. To obtain a symmetrical and smooth similarity matrix, our Bidirectional Similarity Diffusion strategy introduces an inverse constraint term to the optimization objective of local cluster diffusion. Additionally, we have optimized a Neighbor-guided Similarity Smoothing approach to ensure similarity consistency among the local neighbors of each instance. Evaluations in instance retrieval and object re-identification validate the effectiveness of the proposed CAS, our code is publicly available.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 31 of its 66 references that are in the map. First posted on arXiv 4 Jun 2024.
Builds on
31 of 66 references.
References · 31
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
- 2020Deep Learning for Person Re-identification: A Survey and Outlookcited by 547
- 2017Fine-tuning CNN Image Retrieval with No Human Annotationcited by 497
- 2021TransReID: Transformer-based Object Re-Identificationcited by 432
- 2019Bag of Tricks and A Strong Baseline for Deep Person Re-identificationcited by 429
- 2018Learning Discriminative Features with Multiple Granularities for Person Re-Identificationcited by 290
- 2017Re-ranking Person Re-identification with k-reciprocal Encodingcited by 260
- 2020Self-paced Contrastive Learning with Hybrid Memory for Domain Adaptive Object Re-IDcited by 212
- 2018Revisiting Oxford and Paris: Large-Scale Image Retrieval Benchmarkingcited by 189
- 2022CLIP-ReID: Exploiting Vision-Language Model for Image Re-Identification without Concrete Text Labelscited by 177
19 more
- 2015Particular object retrieval with integral max-pooling of CNN activationscited by 160
- 2019ABD-Net: Attentive but Diverse Person Re-Identificationcited by 126
- 2016End-to-end Learning of Deep Visual Representations for Image Retrievalcited by 122
- 2017A Pose-Sensitive Embedding for Person Re-Identification with Expanded Cross Neighborhood Re-Rankingcited by 74
- 2019Learning Generalisable Omni-Scale Representations for Person Re-Identificationcited by 73
- 2016Efficient Diffusion on Region Manifolds: Recovering Small Objects with Compact CNN Representationscited by 49
- 2022Correlation Verification for Image Retrievalcited by 47
- 2023Global Features are All You Need for Image Retrieval and Rerankingcited by 41
- 2022Implicit Sample Extension for Unsupervised Person Re-Identificationcited by 31
- 2020Understanding Image Retrieval Re-Ranking: A Graph Neural Network Perspectivecited by 24
- 2020Attention-Based Query Expansion Learningcited by 21
- 2018Efficient Image Retrieval via Decoupling Diffusion into Online and Offline Processingcited by 20
- 2023Adaptive Sparse Pairwise Loss for Object Re-Identificationcited by 20
- 2021Contextual Similarity Aggregation with Self-attention for Visual Re-rankingcited by 14
- 2022Self-Taught Metric Learning without Labelscited by 13
- 2017Fast Spectral Ranking for Similarity Searchcited by 12
- 2023Graph Convolution Based Efficient Re-Ranking for Visual Retrievalcited by 11
- 2023Contextually Affinitive Neighborhood Refinery for Deep Clusteringcited by 10
- 2018Deep Feature Aggregation and Image Re-ranking with Heat Diffusion for Image Retrievalcited by 7
Built on by
Citing papers per year: 2025: 1.
1 paper.