Robust discriminant low-rank representation for subspace clustering

For the low-rank representation-based subspace clustering, the affinity matrix is block diagonal. In this paper, a novel robust discriminant low-rank representation (RDLRR) algorithm is proposed to enhance the block diagonal property to explore the multiple subspace structures of samples. In order to cluster samples into their corresponding subspace and remove outliers, the proposed RDLRR considers both the within-class and the between-class distance during seeking the lowest-rank representation of samples. RDLRR could well indicate the global structure of samples, when the labeling is available. We conduct experiments on several datasets, including the Extended Yale B, AR and Hopkins 155, to show that our approach outperforms all the other state-of-the-art approaches.

[1]  Xiaofeng Wang,et al.  Spectral clustering steered low-rank representation for subspace segmentation , 2016, J. Vis. Commun. Image Represent..

[2]  Jian Yang,et al.  Low-rank representation based discriminative projection for robust feature extraction , 2013, Neurocomputing.

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

[4]  Zhang Yi,et al.  Sparse representation for face recognition by discriminative low-rank matrix recovery , 2014, J. Vis. Commun. Image Represent..

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

[6]  Shuicheng Yan,et al.  Latent Low-Rank Representation for subspace segmentation and feature extraction , 2011, 2011 International Conference on Computer Vision.

[7]  Lai Wei,et al.  Latent space robust subspace segmentation based on low-rank and locality constraints , 2015, Expert Syst. Appl..

[8]  Chao Zhang,et al.  Integrated Low-Rank-Based Discriminative Feature Learning for Recognition , 2016, IEEE Transactions on Neural Networks and Learning Systems.

[9]  David G. Stork,et al.  Pattern Classification , 1973 .

[10]  René Vidal,et al.  Subspace Clustering , 2011, IEEE Signal Processing Magazine.

[11]  Huchuan Lu,et al.  Subspace clustering by Mixture of Gaussian Regression , 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[12]  René Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications , 2012, IEEE transactions on pattern analysis and machine intelligence.

[13]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

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

[15]  Junbin Gao,et al.  Laplacian Regularized Low-Rank Representation and Its Applications , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[17]  Geoffrey E. Hinton,et al.  Visualizing Data using t-SNE , 2008 .

[18]  Zhouchen Lin,et al.  Analysis and Improvement of Low Rank Representation for Subspace segmentation , 2010, ArXiv.

[19]  Larry S. Davis,et al.  Learning Structured Low-Rank Representations for Image Classification , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[20]  Xiaoming Yuan,et al.  Sparse and low-rank matrix decomposition via alternating direction method , 2013 .

[21]  Shuicheng Yan,et al.  Latent Low-Rank Representation , 2014, Low-Rank and Sparse Modeling for Visual Analysis.

[22]  Huawen Liu,et al.  Fisher discrimination based low rank matrix recovery for face recognition , 2014, Pattern Recognit..

[23]  Shuicheng Yan,et al.  Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization , 2014, IEEE Transactions on Image Processing.

[24]  Junbin Gao,et al.  Robust latent low rank representation for subspace clustering , 2014, Neurocomputing.

[25]  Yong Yu,et al.  Robust Recovery of Subspace Structures by Low-Rank Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.