Low-rank representation with graph regularization for subspace clustering
Authors:
- 23 September 2015
- journal article
- research article
- Published by Springer Nature in Soft Computing
- Vol. 21 (6) , 1569-1581
Abstract
No abstract availableKeywords
Funding Information
- Scientific Research Fund of Sichuan Provincial Education Department (13ZB0154)
This publication has 36 references indexed in Scilit:
- Robust principal component analysis?Journal of the ACM, 2011
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse RepresentationIEEE Transactions on Signal Processing, 2006
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Subspace clustering for high dimensional dataACM SIGKDD Explorations Newsletter, 2004
- 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
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998
- Random sample consensusCommunications of the ACM, 1981
- Algorithm AS 136: A K-Means Clustering AlgorithmJournal of the Royal Statistical Society Series C: Applied Statistics, 1979