Maximum Correntropy Criterion for Robust Face Recognition
Authors:
Top Cited Papers
- 10 December 2010
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 33 (8) , 1561-1576
Abstract
In this paper, we present a sparse correntropy framework for computing robust sparse representations of face images for recognition. Compared with the state-of-the-art l1norm-based sparse representation classifier (SRC), which assumes that noise also has a sparse representation, our sparse algorithm is developed based on the maximum correntropy criterion, which is much more insensitive to outliers. In order to develop a more tractable and practical approach, we in particular impose nonnegativity constraint on the variables in the maximum correntropy criterion and develop a half-quadratic optimization technique to approximately maximize the objective function in an alternating way so that the complex optimization problem is reduced to learning a sparse representation through a weighted linear least squares problem with nonnegativity constraint at each iteration. Our extensive experiments demonstrate that the proposed method is more robust and efficient in dealing with the occlusion and corruption problems in face recognition as compared to the related state-of-the-art methods. In particular, it shows that the proposed method can improve both recognition accuracy and receiver operator characteristic (ROC) curves, while the computational cost is much lower than the SRC algorithms.Keywords
This publication has 53 references indexed in Scilit:
- Sparse Representation for Computer Vision and Pattern RecognitionProceedings of the IEEE, 2010
- Robust feature extraction via information theoretic learning2009
- The correntropy MACE filterPattern Recognition, 2009
- Learning Deep Architectures for AIFoundations and Trends in Machine Learning, 2009
- Robust Face Recognition via Sparse RepresentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Correntropy: Properties and Applications in Non-Gaussian Signal ProcessingIEEE Transactions on Signal Processing, 2007
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Face recognition using LaplacianfacesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Face recognition using the nearest feature line methodIEEE Transactions on Neural Networks, 1999