Robust Face Recognition Based on the Wing Loss and the ℓ1 Penalty

In recent years, face recognition under occluded or corrupted conditions has emerged as a prominent research topic. The advancement in sparse sampling techniques based on regression analysis has provided a novel solution to this challenge. Currently, numerous regression-based sparse sampling models have been investigated by researchers to address this problem. However, the recognition accuracy of most existing models deteriorates significantly when handling heavily occluded or severely corrupted facial images. To overcome this limitation, this paper proposes a wing-constrained sparse coding (WCSC) model and its weighted variant (weighted wing-constrained sparse coding, WWCSC) for robust face recognition in complex scenarios. The corresponding minimization problems are solved using the alternating direction method of multipliers (ADMM) algorithm. Extensive experiments are conducted on four benchmark face databases: the Olivetti Research Laboratory (ORL) database, the Yale database, the AR database and the Face Recognition Technology (FERET) database, to evaluate the proposed method’s performance. Comparative results demonstrate that the WWCSC model maintains superior recognition rates even under challenging conditions involving significant occlusion or corruption, highlighting its remarkable robustness in face recognition tasks. This study provides both theoretical and empirical validation for the effectiveness of the proposed approach.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2025-04-24
DOI
https://doi.org/10.3390/electronics14091736
Citations
2
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
2.55
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust Face Recognition Based on the Wing Loss and the ℓ1 Penalty

Yun Yang, Jianwen Xu
2 citations
Electronics
Face and Expression Recognition
2.55
article

Robust Face Recognition Based on the Wing Loss and the ℓ1 Penalty

Yun Yang, Jianwen Xu
article en
2 citations

Abstract

In recent years, face recognition under occluded or corrupted conditions has emerged as a prominent research topic. The advancement in sparse sampling techniques based on regression analysis has provided a novel solution to this challenge. Currently, numerous regression-based sparse sampling models have been investigated by researchers to address this problem. However, the recognition accuracy of most existing models deteriorates significantly when handling heavily occluded or severely corrupted facial images. To overcome this limitation, this paper proposes a wing-constrained sparse coding (WCSC) model and its weighted variant (weighted wing-constrained sparse coding, WWCSC) for robust face recognition in complex scenarios. The corresponding minimization problems are solved using the alternating direction method of multipliers (ADMM) algorithm. Extensive experiments are conducted on four benchmark face databases: the Olivetti Research Laboratory (ORL) database, the Yale database, the AR database and the Face Recognition Technology (FERET) database, to evaluate the proposed method’s performance. Comparative results demonstrate that the WWCSC model maintains superior recognition rates even under challenging conditions involving significant occlusion or corruption, highlighting its remarkable robustness in face recognition tasks. This study provides both theoretical and empirical validation for the effectiveness of the proposed approach.

ElectronicsVol. 14(9)
Chongqing University (CN)
Openalex Percentile: Top 11%
Face and Expression Recognition
2.55
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.