Introspective Deep Metric Learning for Image Retrieval
Not on the map. Why?
Abstract (arXiv)
This paper proposes an introspective deep metric learning (IDML) framework for uncertainty-aware comparisons of images. Conventional deep metric learning methods produce confident semantic distances between images regardless of the uncertainty level. However, we argue that a good similarity model should consider the semantic discrepancies with caution to better deal with ambiguous images for more robust training. To achieve this, we propose to represent an image using not only a semantic embedding but also an accompanying uncertainty embedding, which describes the semantic characteristics and ambiguity of an image, respectively. We further propose an introspective similarity metric to make similarity judgments between images considering both their semantic differences and ambiguities. The proposed IDML framework improves the performance of deep metric learning through uncertainty modeling and attains state-of-the-art results on the widely used CUB-200-2011, Cars196, and Stanford Online Products datasets for image retrieval and clustering. We further provide an in-depth analysis of our framework to demonstrate the effectiveness and reliability of IDML. Code is available at: https://github.com/wzzheng/IDML.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 56 of its 77 references that are in the map. First posted on arXiv 9 May 2022.
Builds on
56 of 77 references.
References · 56
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2014Going Deeper with Convolutionscited by 4,231
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
- 2020Exploring Simple Siamese Representation Learningcited by 2,853
38 more
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,335
- 2018CosFace: Large Margin Cosine Loss for Deep Face Recognitioncited by 968
- 2015Deep Metric Learning via Lifted Structured Feature Embeddingcited by 449
- 2020Circle Loss: A Unified Perspective of Pair Similarity Optimizationcited by 402
- 2019Multi-Similarity Loss with General Pair Weighting for Deep Metric Learningcited by 368
- 2020A Metric Learning Reality Checkcited by 317
- 2017Sampling Matters in Deep Embedding Learningcited by 285
- 2017No Fuss Distance Metric Learning using Proxiescited by 225
- 2020Proxy Anchor Loss for Deep Metric Learningcited by 195
- 2014Learning Fine-grained Image Similarity with Deep Rankingcited by 189
- 2019Probabilistic Face Embeddingscited by 171
- 2019SoftTriple Loss: Deep Metric Learning Without Triplet Samplingcited by 163
- 2016Learning a Deep Embedding Model for Zero-Shot Learningcited by 153
- 2021Probabilistic Embeddings for Cross-Modal Retrievalcited by 150
- 2020Remix: Rebalanced Mixupcited by 144
- 2020Data Uncertainty Learning in Face Recognitioncited by 134
- 2019Cross-Batch Memory for Embedding Learningcited by 130
- 2017Deep Metric Learning with Angular Losscited by 107
- 2020ProxyNCA++: Revisiting and Revitalizing Proxy Neighborhood Component Analysiscited by 107
- 2014Word Representations via Gaussian Embeddingcited by 96
- 2017Smart Mining for Deep Metric Learningcited by 96
- 2019Ranked List Loss for Deep Metric Learningcited by 77
- 2021Learning Probabilistic Ordinal Embeddings for Uncertainty-Aware Regressioncited by 58
- 2018Attention-based Ensemble for Deep Metric Learningcited by 56
- 2019Hardness-Aware Deep Metric Learningcited by 55
- 2019Point Cloud Instance Segmentation using Probabilistic Embeddingscited by 52
- 2019Learning to Cluster Faces on an Affinity Graphcited by 50
- 2019View-Invariant Probabilistic Embedding for Human Posecited by 47
- 2016Hard-Aware Deeply Cascaded Embeddingcited by 44
- 2019MIC: Mining Interclass Characteristics for Improved Metric Learningcited by 41
- 2020DiVA: Diverse Visual Feature Aggregation for Deep Metric Learningcited by 40
- 2019Divide and Conquer the Embedding Space for Metric Learningcited by 39
- 2015Efficient Non-parametric Estimation of Multiple Embeddings per Word in Vector Spacecited by 35
- 2022Non-isotropy Regularization for Proxy-based Deep Metric Learningcited by 33
- 2019Signal-to-Noise Ratio: A Robust Distance Metric for Deep Metric Learningcited by 32
- 2021Towards Interpretable Deep Metric Learning with Structural Matchingcited by 30
- 2019A Theoretically Sound Upper Bound on the Triplet Loss for Improving the Efficiency of Deep Distance Metric Learningcited by 25
50 most cited of 56 All 56 (JSON)
Built on by
Not cited yet.