The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2011 vol.33)
pp: 1561-1576
Ran He , Institute of Automation Chinese Academy of Sciences, Beijing and Dalian University of Technology, Dalian
Wei-Shi Zheng , Queen Mary University of London, London and Sun Yat-sen University, China
Bao-Gang Hu , Institute of Automation Chinese Academy of Sciences, Beijing
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 l^1norm-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.
INDEX TERMS
Information theoretical learning, correntropy, linear least squares, half-quadratic optimization, sparse representation, M-estimator, face recognition, occlusion and corruption.
CITATION
Ran He, Wei-Shi Zheng, Bao-Gang Hu, "Maximum Correntropy Criterion for Robust Face Recognition", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 8, pp. 1561-1576, August 2011, doi:10.1109/TPAMI.2010.220
REFERENCES
[1] M. Turk and A. Pentland, "Eigenfaces for Recognition," J. Cognitive Neurosicence, vol. 3, no. 1, pp. 71-86, 1991.
[2] P.N. Belhumeur, J. Hespanha, and D.J. Kriegman, "Eigenfaces versus Fisherfaces: Recognition Using Class Specific Linear Projection," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 7, pp. 711-720, July 1997.
[3] J. Kim, J. Choi, J. Yi, and M. Turk, "Effective Representation Using ICA for Face Recognition Robust to Local Distortion and Partial Occlusion," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 12, pp. 1977-1981, Dec. 2005.
[4] A. Pentland, B. Moghaddam, and T. Starner, "View-Based and Modular Eigenspaces for Face Recognition," Technical Report 245, 1994.
[5] I. Naseem, R. Togneri, and M. Bennamoun, "Linear Regression for Face Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 32, no. 11, pp. 2106-2112, Nov. 2010.
[6] A. Leonardis and H. Bischof, "Robust Recognition Using Eigenimages," Computer Vision and Image Understanding, vol. 78, no. 1, pp. 99-118, 2000.
[7] A.M. Martinez, "Recognizing Imprecisely Localized, Partially Occluded, and Expression Variant Faces from a Single Sample Per Class," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 6, pp. 748-763, June 2002.
[8] S. Chen, T. Shan, and B.C. Lovell, "Robust Face Recognition in Rotated Eigenspaces," Proc. Int'l Image and Vision Computing New Zealand Conf., 2007.
[9] C.H. Hoi and M.R. Lyu, "Robust Face Recognition Using Minimax Probability Machine," Proc. IEEE Int'l Conf. Multimedia and Expo, pp. 1175-1178, 2004.
[10] S. Fidler, D. Skocaj, and A. Leonardis, "Combining Reconstructive and Discriminative Subspace Methods for Robust Classification and Regression by Subsampling," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 3, pp. 337-350, Mar. 2006.
[11] R.A. Vazquez, H. Sossa, and B.A. Garro, "Low Frequency Response and Random Feature Selection Applied to Face Recognition," Proc. Int'l Conf. Image Analysis and Recognition, 2007.
[12] R.A. Vazquez and H. Sossa, "Associative Memories Applied to Pattern Recognition," Proc. Int'l Conf. Artificial Neural Networks, pp. 111-120, 2008.
[13] F. de la Torre and M.J. Black, "Robust Parameterized Component Analysis: Theory and Applications to 2D Facial Appearance Models," Computer Vision and Image Understanding, vol. 91, pp. 53-71, 2003.
[14] M. Black and A. Jepson, "Eigentracking: Robust Matching and Tracking of Articulated Objects Using a View-Based Representation," Int'l J. Computer Vision, vol. 26, no. 1, pp. 63-84, 1998.
[15] T. Cootes, G. Edwards, and C. Taylor, "Active Appearance Models," Proc. European Conf. Computer Vision, pp. 484-498, 1998.
[16] H. Jia and A.M. Martinez, "Face Recognition with Occlusions in the Training and Testing Sets," Proc. IEEE Int'l Conf. Automatic Face and Gesture Recognition, 2008.
[17] H. Jia and A.M. Martinez, "Support Vector Machines in Face Recognition with Occlusions," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2009.
[18] Z. Zhou, A. Wagner, H. Mobahi, J. Wright, and Y. Ma, "Face Recognition with Contiguous Occlusion Using Markov Random Fields," Proc. IEEE Int'l Conf. Computer Vision, 2009.
[19] K.-H. Jeonga, W. Liu, S. Han, E. Hasanbelliu, and J.C. Principe, "The Correntropy Mace Filter," Pattern Recognition, vol. 42, no. 5, pp. 871-885, 2009.
[20] J. Wright, Y. Ma, J. Mairal, G. Sapiro, T.S. Huang, and S. Yan, "Sparse Representation for Computer Vision and Pattern Recognition," Proc. IEEE, vol. 98, no. 6, pp. 1031-1044, 2010.
[21] E.J. Candes and T. Tao, "Decoding by Linear Programming," IEEE Trans. Information Theory, vol. 51, no. 12, Dec. 2005.
[22] D.L. Donoho, "For Most Large Underdetermined Systems of Linear Equations the Minimal L1-Norm Solution Is Also the Sparsest Solution," Comm. Pure and Applied Math., vol. 59, no. 6, pp. 797-829, 2006.
[23] Y. Bengio, "Learning Deep Architectures for AI," Proc. Foundations and Trends in Machine Learning, 2009.
[24] J. Wright, A.Y. Yang, A. Ganesh, S.S. Sastry, and Y. Ma, "Robust Face Recognition via Sparse Representation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 2, pp. 210-227, Feb. 2009.
[25] X. He, S. Yan, Y. Hu, P. Niyogi, and H.-J. Zhang, "Face Recognition Using Laplacianfaces," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 3, pp. 328-340, Mar. 2005.
[26] J. Wright and Y. Ma, "Dense Error Correction via L1-Minimization," IEEE Trans. Information Theory, vol. 54, no. 7, pp. 3035-3058, July 2008.
[27] W. Liu, P.P. Pokharel, and J.C. Principe, "Correntropy: Properties and Applications in Non-Gaussian Signal Processing," IEEE Trans. Signal Processing, vol. 55, no. 11, pp. 5286-5298, Nov. 2007.
[28] X. Yuan and B.-G. Hu, "Robust Feature Extraction via Information Theoretic Learning," Proc. Int'l Conf. Machine Learning, 2009.
[29] J.C. Principe, D. Xu, and J.W. Fisher, "Information-Theoretic Learning," Unsupervised Adaptive Filtering, Volume 1: Blind-Source Separation, S. Haykin, ed., Wiley, 2000.
[30] D. Xu, "Energy, Entropy, and Information Potential for Neural Computation," PhD dissertation, Univ. of Florida, 1999.
[31] T.M. Cover and J.A. Thomas, Elements of Information Theory, second ed. John Wiley, 2005.
[32] S.Z. Li and J. Lu, "Face Recognition Using Nearest Feature Line Method," IEEE Trans. Neural Network, vol. 10, no. 2, pp. 439-443, Mar. 1999.
[33] J. Laaksonen, "Local Subspace Classifier," Proc. Int'l Conf. Artificial Neural Networks, 1997.
[34] S.Z. Li, "Face Recognition Based on Nearest Linear Combinations," Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, pp. 839-844, 1998.
[35] P. Vincent and Y. Bengio, "K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms," Advances in Neural Information Processing Systems, vol. 14, pp. 985-992, 2001.
[36] J.-T. Chien and C.-C. Wu, "Discriminant Wavelet Faces and Nearest Feature Classifiers for Face Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 12, pp. 1644-1649, Dec. 2002.
[37] J. Ho, M.-H. Yang, J. Lim, K.-C. Lee, and D. Kriegman, "Clustering Appearances of Objects under Varying Illumination Conditions," Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 11-18, 2003.
[38] P.P. Pokharel, W. Liu, and J.C. Principe, "A Low Complexity Robust Detector in Impulsive Noise," Signal Processing, vol. 89, no. 10, pp. 1902-1909, 2009.
[39] I. Santamaria, P.P. Pokharel, and J.C. Principe, "Generalized Correlation Function: Definition,Properties, and Application to Blind Equalization," IEEE Trans. Signal Processing, vol. 54, no. 6, pp. 2187-2197, June 2006.
[40] V. Vapnik, The Nature of Statistical Learning Theory. Springer-Verlag, 1995.
[41] W. Liu, P. Pokharel, and J. Principe, "Error Entropy, Correntropy and M-Estimation," Proc. Workshop Machine Learning for Signal Processing, 2006.
[42] P. Huber, Robust Statistics. Wiley, 1981.
[43] I. Mizera and C. Muller, "Breakdown Points of Cauchy Regression-Scale Estimators," Statistics and Probability Letters, vol. 57, no. 1, pp. 79-89, 2002.
[44] W. Yin, S. Osher, D. Goldfarb, and J. Darbon, "Bregman Iterative Algorithms for L1-Minimization with Applications to Compressed Sensing," SIAM J. Imaging Sciences, vol. 1, no. 1, pp. 143-168, 2008.
[45] S. Yang, H. Zha, S. Zhou, and B.-G. Hu, "Variational Graph Embedding for Globally and Locally Consistent Feature Extraction," Proc. Europe Conf. Machine Learning, pp. 538-553, 2009.
[46] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
[47] L.F. Portugal, J.J. Judice, and L.N. Vicente, "A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Non-Negative Variables," Math. Computation, vol. 63, no. 208, pp. 625-643, 1994.
[48] A.M. Martinez and R. Benavente, "The AR Face Database," technical report, Computer Vision Center, 1998.
[49] A.S. Georghiades, P.N. Belhumeur, and D.J. Kriegman, "From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 6, pp. 643-660, June 2001.
[50] P.J. Phillips, P.J. Flynn, T. Scruggs, K. Bowyer, J. Chang, K. Hoffman, J. Marques, J. Min, and W. Worek, "Overview of the Face Recognition Grand Challenge," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2005.
[51] K.-C. Lee, J. Ho, and D. Kriegman, "Acquiring Linear Subspaces for Face Recognition under Variable Lighting," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 5, pp. 684-698, May 2005.
[52] H. Lee, A. Battle, R. Raina, and A.Y. Ng, "Efficient Sparse Coding Algorithms," Proc. Int'l Conf. Advanced Neural Information Processing Systems, 2006.
[53] E. Candes and J. Romberg L-Magic: Recovery of Sparse Signals via Convex Programming, http://www.acm.caltech.edul1magic/, 2005.
[54] E. Elhamifar, and R. Vidal, "Sparse Subspace Clustering," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 2790-2797, 2009.
[55] D. Yi, R. Liu, R. Chu, Z. Lei, and S.Z. Li, "Face Matching from Near Infrared to Visual Images," Proc. IAPR/IEEE Int'l Conf. Biometrics, 2007.
[56] R. He, B.-G. Hu, and X. Yuan, "Robust Discriminant Analysis Based on Nonparametric Maximum Entropy," Proc. Asian Conf. Machine Learning, 2009.
[57] M. Nikolova and M.K. NG, "Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery," SIAM J. Scientific Computing, vol. 27, no. 3, pp. 937-966, 2005.
[58] K. Huang and S. Aviyente, "Sparse Representation for Signal Classification," Proc. Int'l Conf. Advanced Neural Information Processing Systems, 2006.
[59] G. Peyre, "Sparse Modeling of Textures," J. Math. Imaging and Vision, vol. 34, no. 1, pp. 17-31, 2009.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool