.png){kind=icon}
.png){kind=icon}
Return
Robust face recognition via sparse boosting representation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2016.06.071.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently linear representation provides an effective way for robust face recognition. However, the existing linear representation methods cannot make an adaptive adjustment in responding to the variations on facial image, so the generalization ability of these methods is limited. In this paper, we propose a sparse boosting representation classification (SBRC) for robust face recognition. To improve the effectiveness of representation coding, an error detection machine (EDM) with multiple error detectors (ED) in SBRC, is proposed to detect and remove destroyed features (i.e. pixels) on a testing image. SBRC has three advantages: First, it has good generalization ability, since the EDM can self-adjust the number of ED according to different variations; Second, EDM would boost the sparsity of coding vector; Third, its implementation is simple and efficient as the EDM is based on l(2) - norm. In addition, five popular face image databases including AR database, Extended Yale B database, ORL database, FERET database and LFW database were applied to validate the performance of SBRC. The superiority of SBRC is confirmed by comparing it with the state-of-the-art face recognition methods. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Sparse boosting
Linear representation
Face recognition
And error detection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W