Low-rank representation based discriminative projection for robust feature extraction

The low-rank representation (LRR) was presented recently and showed effective and robust for subspace segmentation. This paper presents a LRR-based discriminative projection method (LRR-DP) for robust feature extraction, by virtue of the underlying low-rank structure of data represesntation revealed by LRR. LRR-DP seeks a linear transformation such that in the transformed space, the between-class scatter (i.e. the distance between a sample and its between-class representation prototype) is as large as possible and simultaneously, the combination of the within-class scatter (i.e. the distance between a sample and its within-class representation prototype) and the scatter of noises is as small as possible. Our experiments were done using the Yale, Extended Yale B, AR face image databases and the PolyU palmprint database, and the results show that LRR-DP is always better than or comparable to other state-of-the-art methods.

[1]  David J. Kriegman,et al.  Acquiring linear subspaces for face recognition under variable lighting , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  René Vidal,et al.  A closed form solution to robust subspace estimation and clustering , 2011, CVPR 2011.

[3]  Feiping Nie,et al.  Multi-Subspace Representation and Discovery , 2011, ECML/PKDD.

[4]  Ran He,et al.  Robust Discriminant Analysis Based on Nonparametric Maximum Entropy , 2009, ACML.

[5]  Xiaoyang Tan,et al.  Pattern Recognition , 2016, Communications in Computer and Information Science.

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

[7]  Jieping Ye,et al.  Multi-Task Feature Learning Via Efficient l2, 1-Norm Minimization , 2009, UAI.

[8]  Emmanuel J. Candès,et al.  Matrix Completion With Noise , 2009, Proceedings of the IEEE.

[9]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[10]  Feiping Nie,et al.  Neighborhood MinMax Projections , 2007, IJCAI.

[11]  Wei-Shi Zheng,et al.  Principal Component Analysis Based on Nonparametric Maximum Entropy , 2010 .

[12]  A. Martínez,et al.  The AR face databasae , 1998 .

[13]  Ran He,et al.  Principal component analysis based on non-parametric maximum entropy , 2010, Neurocomputing.

[14]  René Vidal,et al.  Sparse subspace clustering , 2009, CVPR.

[15]  Tieniu Tan,et al.  Recovery of corrupted low-rank matrices via half-quadratic based nonconvex minimization , 2011, CVPR 2011.

[16]  G. Sapiro,et al.  A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography. , 2013, Journal of structural biology.

[17]  David Zhang Palmprint Authentication , 2004, International Series on Biometrics.

[18]  Loong Fah Cheong,et al.  Robust Low-Rank Subspace Segmentation with Semidefinite Guarantees , 2010, 2010 IEEE International Conference on Data Mining Workshops.

[19]  Emmanuel J. Candès,et al.  A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..

[20]  Yuxiao Hu,et al.  Face recognition using Laplacianfaces , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[22]  John Wright,et al.  Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization , 2009, NIPS.

[23]  Aleix M. Martinez,et al.  The AR face database , 1998 .

[24]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

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

[26]  Yong Yu,et al.  Robust Subspace Segmentation by Low-Rank Representation , 2010, ICML.

[27]  Tieniu Tan,et al.  l2, 1 Regularized correntropy for robust feature selection , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[28]  Gene H. Golub,et al.  Matrix computations , 1983 .

[29]  David J. Kriegman,et al.  From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[30]  Feiping Nie,et al.  Learning an Orthogonal and Smooth Subspace for Image Classification , 2009, IEEE Signal Processing Letters.