More Information Supervised Probabilistic Deep Face Embedding Learning

• URL: http://arxiv.org/abs/2006.04518v2
• Date: Thu, 11 Jun 2020 02:25:56 GMT
• Title: More Information Supervised Probabilistic Deep Face Embedding Learning
• Authors: Ying Huang, Shangfeng Qiu, Wenwei Zhang, Xianghui Luo, Jinzhuo Wang
• Abstract summary: We analyse margin based softmax loss in probability view. An auto-encoder architecture called Linear-Auto-TS-Encoder(LATSE) is proposed to corroborate this finding.
• Score: 10.52667214402514
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Researches using margin based comparison loss demonstrate the effectiveness of penalizing the distance between face feature and their corresponding class centers. Despite their popularity and excellent performance, they do not explicitly encourage the generic embedding learning for an open set recognition problem. In this paper, we analyse margin based softmax loss in probability view. With this perspective, we propose two general principles: 1) monotonic decreasing and 2) margin probability penalty, for designing new margin loss functions. Unlike methods optimized with single comparison metric, we provide a new perspective to treat open set face recognition as a problem of information transmission. And the generalization capability for face embedding is gained with more clean information. An auto-encoder architecture called Linear-Auto-TS-Encoder(LATSE) is proposed to corroborate this finding. Extensive experiments on several benchmarks demonstrate that LATSE help face embedding to gain more generalization capability and it boosted the single model performance with open training dataset to more than $99\%$ on MegaFace test.

Related papers

• InterFace:Adjustable Angular Margin Inter-class Loss for Deep Face Recognition [7.158500469489626]
  We propose a novel loss function, InterFace, to improve the discriminative power of the model. Our InterFace has advanced the state-of-the-art face recognition performance on five out of thirteen mainstream benchmarks.
  arXiv  Detail & Related papers  (2022-10-05T04:38:29Z)
• SubFace: Learning with Softmax Approximation for Face Recognition [3.262192371833866]
  SubFace is a softmax approximation method that employs the subspace feature to promote the performance of face recognition. Comprehensive experiments conducted on benchmark datasets demonstrate that our method can significantly improve the performance of vanilla CNN baseline.
  arXiv  Detail & Related papers  (2022-08-24T12:31:08Z)
• Learning Towards the Largest Margins [83.7763875464011]
  Loss function should promote the largest possible margins for both classes and samples. Not only does this principled framework offer new perspectives to understand and interpret existing margin-based losses, but it can guide the design of new tools.
  arXiv  Detail & Related papers  (2022-06-23T10:03:03Z)
• Meta Balanced Network for Fair Face Recognition [51.813457201437195]
  We systematically and scientifically study bias from both data and algorithm aspects. We propose a novel meta-learning algorithm, called Meta Balanced Network (MBN), which learns adaptive margins in large margin loss. Extensive experiments show that MBN successfully mitigates bias and learns more balanced performance for people with different skin tones in face recognition.
  arXiv  Detail & Related papers  (2022-05-13T10:25:44Z)
• Federated Learning for Face Recognition with Gradient Correction [52.896286647898386]
  In this work, we introduce a framework, FedGC, to tackle federated learning for face recognition. We show that FedGC constitutes a valid loss function similar to standard softmax.
  arXiv  Detail & Related papers  (2021-12-14T09:19:29Z)
• ElasticFace: Elastic Margin Loss for Deep Face Recognition [6.865656740940772]
  Learning discriminative face features plays a major role in building high-performing face recognition models. Recent state-of-the-art face recognition solutions proposed to incorporate a fixed penalty margin on classification loss function, softmax loss. We propose elastic margin loss (ElasticFace) that allows flexibility in the push for class separability.
  arXiv  Detail & Related papers  (2021-09-20T10:31:50Z)
• Frequency-aware Discriminative Feature Learning Supervised by Single-Center Loss for Face Forgery Detection [89.43987367139724]
  Face forgery detection is raising ever-increasing interest in computer vision. Recent works have reached sound achievements, but there are still unignorable problems. A novel frequency-aware discriminative feature learning framework is proposed in this paper.
  arXiv  Detail & Related papers  (2021-03-16T14:17:17Z)
• Partial FC: Training 10 Million Identities on a Single Machine [23.7030637489807]
  We analyze the optimization goal of softmax-based loss functions and the difficulty of training massive identities. Experiment demonstrates no loss of accuracy when training with only 10% randomly sampled classes for the softmax-based loss functions. We also implement a very efficient distributed sampling algorithm, taking into account model accuracy and training efficiency.
  arXiv  Detail & Related papers  (2020-10-11T11:15:26Z)
• Loss Function Search for Face Recognition [75.79325080027908]
  We develop a reward-guided search method to automatically obtain the best candidate. Experimental results on a variety of face recognition benchmarks have demonstrated the effectiveness of our method.
  arXiv  Detail & Related papers  (2020-07-10T03:40:10Z)
• Few-Shot Open-Set Recognition using Meta-Learning [72.15940446408824]
  The problem of open-set recognition is considered. A new oPen sEt mEta LEaRning (PEELER) algorithm is introduced.
  arXiv  Detail & Related papers  (2020-05-27T23:49:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.