Robust Discriminative Nonnegative Patch Alignment for Occluded Face Recognition

Face occlusion is one of the most challenging problems for robust face recognition. Nonnegative matrix factorization (NMF) has been widely used in local feature extraction for computer vision. However, standard NMF is not robust to occlusion. In this paper, we propose a robust discriminative representation learning method under nonnegative patch alignment, which can take account of the geometric structure and discriminative information simultaneously. Specifically, we utilize linear reconstruction coefficients to characterize local geometric structure and maximize the pairwise fisher distance to improve the separability of different classes. The reconstruction errors are measured with weighted distance, and the weights for each pixel are learned adaptively with our proposed update rule. Experimental results on two benchmark datasets demonstrate the learned representation is more discriminative and robust than most of the existing methods in occluded face recognition.

[1]  Stan Z. Li,et al.  Learning spatially localized, parts-based representation , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[2]  Robert P. W. Duin,et al.  Multiclass Linear Dimension Reduction by Weighted Pairwise Fisher Criteria , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[4]  Zhi-Hua Zhou,et al.  Recognizing partially occluded, expression variant faces from single training image per person with SOM and soft k-NN ensemble , 2005, IEEE Transactions on Neural Networks.

[5]  Rainer Stiefelhagen,et al.  Why Is Facial Occlusion a Challenging Problem? , 2009, ICB.

[6]  Alex Pentland,et al.  Face recognition using eigenfaces , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Xuelong Li,et al.  Non-negative graph embedding , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[8]  Chris H. Q. Ding,et al.  Robust nonnegative matrix factorization using L21-norm , 2011, CIKM '11.

[9]  David J. Kriegman,et al.  Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection , 1996, ECCV.

[10]  Xuan Li,et al.  Robust Nonnegative Matrix Factorization via Half-Quadratic Minimization , 2012, 2012 IEEE 12th International Conference on Data Mining.

[11]  Hongjun Jia,et al.  Support Vector Machines in face recognition with occlusions , 2009, CVPR.

[12]  John Shawe-Taylor,et al.  MahNMF: Manhattan Non-negative Matrix Factorization , 2012, ArXiv.

[13]  Jian Yang,et al.  Regularized Robust Coding for Face Recognition , 2012, IEEE Transactions on Image Processing.

[14]  Michael Lindenbaum,et al.  Nonnegative Matrix Factorization with Earth Mover's Distance Metric for Image Analysis , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Feiping Nie,et al.  Robust Manifold Nonnegative Matrix Factorization , 2014, ACM Trans. Knowl. Discov. Data.

[16]  Zhigang Luo,et al.  Non-Negative Patch Alignment Framework , 2011, IEEE Transactions on Neural Networks.

[17]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[18]  Thomas S. Huang,et al.  Graph Regularized Nonnegative Matrix Factorization for Data Representation. , 2011, IEEE transactions on pattern analysis and machine intelligence.