OTFace: Hard Samples Guided Optimal Transport Loss for Deep Face Representation
Not on the map. Why?
Abstract (arXiv)
Face representation in the wild is extremely hard due to the large scale face variations. To this end, some deep convolutional neural networks (CNNs) have been developed to learn discriminative feature by designing properly margin-based losses, which perform well on easy samples but fail on hard samples. Based on this, some methods mainly adjust the weights of hard samples in training stage to improve the feature discrimination. However, these methods overlook the feature distribution property which may lead to better results since the miss-classified hard samples may be corrected by using the distribution metric. This paper proposes the hard samples guided optimal transport (OT) loss for deep face representation, OTFace for short. OTFace aims to enhance the performance of hard samples by introducing the feature distribution discrepancy while maintain the performance on easy samples. Specifically, we embrace triplet scheme to indicate hard sample groups in one mini-batch during training. OT is then used to characterize the distribution differences of features from the high level convolutional layer. Finally, we integrate the margin-based-softmax (e.g. ArcFace or AM-Softmax) and OT to guide deep CNN learning. Extensive experiments are conducted on several benchmark databases. The quantitative results demonstrate the advantages of the proposed OTFace over state-of-the-art methods.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 74 references that are in the map. First posted on arXiv 28 Mar 2022.
Builds on
27 of 74 references.
References · 27
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2014Going Deeper with Convolutionscited by 4,231
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018CosFace: Large Margin Cosine Loss for Deep Face Recognitioncited by 968
- 2017SphereFace: Deep Hypersphere Embedding for Face Recognitioncited by 733
- 2016Training Region-based Object Detectors with Online Hard Example Miningcited by 577
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2021MagFace: A Universal Representation for Face Recognition and Quality Assessmentcited by 332
- 2020CurricularFace: Adaptive Curriculum Learning Loss for Deep Face Recognitioncited by 320
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
15 more
- 2016Large-Margin Softmax Loss for Convolutional Neural Networkscited by 296
- 2018Additive Margin Softmax for Face Verificationcited by 275
- 2017Cross-Age LFW: A Database for Studying Cross-Age Face Recognition in Unconstrained Environmentscited by 258
- 2015The MegaFace Benchmark: 1 Million Faces for Recognition at Scalecited by 199
- 2018MobileFaceNets: Efficient CNNs for Accurate Real-Time Face Verification on Mobile Devicescited by 180
- 2019Probabilistic Face Embeddingscited by 171
- 2014Deep Learning Face Representation by Joint Identification-Verificationcited by 162
- 2019AdaCos: Adaptively Scaling Cosine Logits for Effectively Learning Deep Face Representationscited by 83
- 2015DeepID3: Face Recognition with Very Deep Neural Networkscited by 62
- 2019Mis-classified Vector Guided Softmax Loss for Face Recognitioncited by 60
- 2021Towards Interpretable Deep Metric Learning with Structural Matchingcited by 30
- 2016Wasserstein Discriminant Analysiscited by 25
- 2017Noisy Softmax: Improving the Generalization Ability of DCNN via Postponing the Early Softmax Saturationcited by 21
- 2021DeepFace-EMD: Re-ranking Using Patch-wise Earth Mover's Distance Improves Out-Of-Distribution Face Identificationcited by 20
- 2014Nuclear Norm based Matrix Regression with Applications to Face Recognition with Occlusion and Illumination Changescited by 19
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.