Robust Subspace Clustering
Authors:
Preprint
Abstract
Subspace clustering refers to the task of finding a multi-subspace representation that best fits a collection of points taken from a high-dimensional space. This paper introduces an algorithm inspired by sparse subspace clustering (SSC) to cluster noisy data, and develops some novel theory demonstrating its correctness. In particular, the theory uses ideas from geometric functional analysis to show that the algorithm can accurately recover the underlying subspaces under minimal requirements on their orientation, and on the number of samples per subspace. Synthetic as well as real data experiments complement our theoretical study, illustrating our approach and demonstrating its effectiveness.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Subspace clustering of high-dimensional data: a predictive approachData Mining and Knowledge Discovery, 2013
- Hybrid Linear Modeling via Local Best-Fit FlatsInternational Journal of Computer Vision, 2012
- Templates for convex cone problems with applications to sparse signal recoveryMathematical Programming Computation, 2011
- Hyperspectral Image Classification Using Dictionary-Based Sparse RepresentationIEEE Transactions on Geoscience and Remote Sensing, 2011
- Identification of switched linear systems via sparse optimizationAutomatica, 2011
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed SensingIEEE Transactions on Information Theory, 2011
- Stability and Instance Optimality for Gaussian Measurements in Compressed SensingFoundations of Computational Mathematics, 2009
- Spectral Curvature Clustering (SCC)International Journal of Computer Vision, 2008
- A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate2006
- Nearest q-Flat to m PointsJournal of Optimization Theory and Applications, 2000