LH2Face: Loss function for Hard High-quality Face

• URL: http://arxiv.org/abs/2506.23555v1
• Date: Mon, 30 Jun 2025 06:59:02 GMT
• Title: LH2Face: Loss function for Hard High-quality Face
• Authors: Fan Xie, Pan Cao,
• Abstract summary: Most face recognition algorithms are based on cosine similarity with softmax classification.<n>A novel loss function is proposed, named Loss function for Hard High-quality Face (LH2Face)<n>Our LH2Face is superior to schemes on hard high-quality face datasets, achieving 49.39% accuracy on the IJB-B dataset.
• Score: 0.7392714450026076
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In current practical face authentication systems, most face recognition (FR) algorithms are based on cosine similarity with softmax classification. Despite its reliable classification performance, this method struggles with hard samples. A popular strategy to improve FR performance is incorporating angular or cosine margins. However, it does not take face quality or recognition hardness into account, simply increasing the margin value and thus causing an overly uniform training strategy. To address this problem, a novel loss function is proposed, named Loss function for Hard High-quality Face (LH2Face). Firstly, a similarity measure based on the von Mises-Fisher (vMF) distribution is stated, specifically focusing on the logarithm of the Probability Density Function (PDF), which represents the distance between a probability distribution and a vector. Then, an adaptive margin-based multi-classification method using softmax, called the Uncertainty-Aware Margin Function, is implemented in the article. Furthermore, proxy-based loss functions are used to apply extra constraints between the proxy and sample to optimize their representation space distribution. Finally, a renderer is constructed that optimizes FR through face reconstruction and vice versa. Our LH2Face is superior to similiar schemes on hard high-quality face datasets, achieving 49.39% accuracy on the IJB-B dataset, which surpasses the second-place method by 2.37%.

Related papers

• PETALface: Parameter Efficient Transfer Learning for Low-resolution Face Recognition [54.642714288448744]
  PETALface is the first work leveraging the powers of PEFT for low resolution face recognition.<n>We introduce two low-rank adaptation modules to the backbone, with weights adjusted based on the input image quality to account for the difference in quality for the gallery and probe images.<n>Experiments demonstrate that the proposed method outperforms full fine-tuning on low-resolution datasets while preserving performance on high-resolution and mixed-quality datasets.
  arXiv  Detail & Related papers  (2024-12-10T18:59:45Z)
• X2-Softmax: Margin Adaptive Loss Function for Face Recognition [6.497884034818003]
  We propose a new angular margin loss named X2-Softmax. X2-Softmax loss has adaptive angular margins, which provide the margin that increases with the angle between different classes growing. We have trained the neural network with X2-Softmax loss on the MS1Mv3 dataset.
  arXiv  Detail & Related papers  (2023-12-08T10:27:47Z)
• 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)
• Blind Face Restoration: Benchmark Datasets and a Baseline Model [63.053331687284064]
  Blind Face Restoration (BFR) aims to construct a high-quality (HQ) face image from its corresponding low-quality (LQ) input. We first synthesize two blind face restoration benchmark datasets called EDFace-Celeb-1M (BFR128) and EDFace-Celeb-150K (BFR512) State-of-the-art methods are benchmarked on them under five settings including blur, noise, low resolution, JPEG compression artifacts, and the combination of them (full degradation)
  arXiv  Detail & Related papers  (2022-06-08T06:34:24Z)
• SFace: Sigmoid-Constrained Hypersphere Loss for Robust Face Recognition [74.13631562652836]
  We propose a novel loss function, named sigmoid-constrained hypersphere loss (SFace) SFace imposes intra-class and inter-class constraints on a hypersphere manifold, which are controlled by two sigmoid gradient re-scale functions respectively. It can make a better balance between decreasing the intra-class distances and preventing overfitting to the label noise, and contributes more robust deep face recognition models.
  arXiv  Detail & Related papers  (2022-05-24T11:54:15Z)
• AdaFace: Quality Adaptive Margin for Face Recognition [56.99208144386127]
  We introduce another aspect of adaptiveness in the loss function, namely the image quality. We propose a new loss function that emphasizes samples of different difficulties based on their image quality. Our method, AdaFace, improves the face recognition performance over the state-of-the-art (SoTA) on four datasets.
  arXiv  Detail & Related papers  (2022-04-03T01:23:41Z)
• Sample and Computation Redistribution for Efficient Face Detection [137.19388513633484]
  Training data sampling and computation distribution strategies are the keys to efficient and accurate face detection. scrfdf34 outperforms the best competitor, TinaFace, by $3.86%$ (AP at hard set) while being more than emph3$times$ faster on GPUs with VGA-resolution images.
  arXiv  Detail & Related papers  (2021-05-10T23:51:14Z)
• Reliable Probabilistic Face Embeddings in the Wild [5.094757968178221]
  Probabilistic Face Embeddings (PFE) can improve face recognition performance in unconstrained scenarios. PFE methods tend to be over-confident in estimating uncertainty and is too slow to apply to large-scale face matching. This paper proposes a regularized probabilistic face embedding method to improve the robustness and speed of PFE.
  arXiv  Detail & Related papers  (2021-02-08T09:27:57Z)
• 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)

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.