In this article, we address the problem of face recognition under uncontrolled conditions. The proposed solution is a numerical robust algorithm dealing with face images automatically registered and projected via the linear discriminant analysis (LDA) into a holistic low-dimensional feature space. At the heart of this discriminative system, there are suitable nonconvex parametric mappings based on which a fixed-point technique finds the sparse representation of test images allowing their classification. We theoretically argue that the success achieved in sparsity promoting is due to the sequence of values imposed on a characteristic parameter of the used mapping family. Experiments carried out on several databases (ORL, YaleB, BANCA, FRGC v2.0) show the robustness and the ability of the system for classification purpose. In particular, within the area of sparsity promotion, our recognition system shows very good performance with respect to those achieved by the state-of-the-art norm-based sparse representation classifier (SRC), the recently proposed norm-based collaborative representation classifier (CRC), the LASSO-based sparse decomposition technique, and the weighted sparse representation method (WSRC), which integrates sparsity and data locality structure.

Robust face recognition using sparse representation in LDA space / A. Adamo, G. Grossi, R. Lanzarotti, J. Lin. - In: MACHINE VISION AND APPLICATIONS. - ISSN 0932-8092. - 26:6(2015), pp. 837-847.

Robust face recognition using sparse representation in LDA space

A. Adamo
Primo
;
G. Grossi
Secondo
;
R. Lanzarotti
;
J. Lin
Ultimo
2015

Abstract

In this article, we address the problem of face recognition under uncontrolled conditions. The proposed solution is a numerical robust algorithm dealing with face images automatically registered and projected via the linear discriminant analysis (LDA) into a holistic low-dimensional feature space. At the heart of this discriminative system, there are suitable nonconvex parametric mappings based on which a fixed-point technique finds the sparse representation of test images allowing their classification. We theoretically argue that the success achieved in sparsity promoting is due to the sequence of values imposed on a characteristic parameter of the used mapping family. Experiments carried out on several databases (ORL, YaleB, BANCA, FRGC v2.0) show the robustness and the ability of the system for classification purpose. In particular, within the area of sparsity promotion, our recognition system shows very good performance with respect to those achieved by the state-of-the-art norm-based sparse representation classifier (SRC), the recently proposed norm-based collaborative representation classifier (CRC), the LASSO-based sparse decomposition technique, and the weighted sparse representation method (WSRC), which integrates sparsity and data locality structure.
Face recognition; Fixed-point iteration schema; Nonlinear nonconvex mappings; Sparsity recovery; SRC, CRC, LASSO, WSRC algorithms; Hardware and Architecture; 1707; Software; Computer Science Applications1707 Computer Vision and Pattern Recognition
Settore INF/01 - Informatica
Article (author)
File in questo prodotto:
File Dimensione Formato  
art%3A10.1007%2Fs00138-015-0694-x.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Dimensione 1.07 MB
Formato Adobe PDF
1.07 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/426395
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? 8
social impact