Symmetric low-rank representation for subspace clustering
Authors:
- Jie ChenJCJie Chen
- Haixian ZhangHZHaixian Zhang
- Hua MaoHMHua Mao
- Yongsheng SangYSYongsheng Sang
- Zhang YiZYZhang Yi
- 1 January 2016
- journal article
- Published by Elsevier in Neurocomputing
- Vol. 173, 1192-1202
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Basic Research Program of China (2011CB302201)
- National Science Foundation of China (61303015)
This publication has 37 references indexed in Scilit:
- Low rank subspace clustering (LRSC)Pattern Recognition Letters, 2014
- An efficient matrix factorization based low-rank representation for subspace clusteringPattern Recognition, 2013
- A survey on enhanced subspace clusteringData Mining and Knowledge Discovery, 2012
- Robust principal component analysis?Journal of the ACM, 2011
- A tutorial on spectral clusteringStatistics and Computing, 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
- Lambertian reflectance and linear subspacesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2003
- From few to many: illumination cone models for face recognition under variable lighting and poseIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Random sample consensusCommunications of the ACM, 1981