Graph connectivity in sparse subspace clustering
Sparse Subspace Clustering (SSC) is one of the recent approaches to subspace segmentation. In SSC a graph is constructed whose nodes are the data points and whose edges are inferred from the L1-sparse representation of each point by the others. It has been proved that if the points lie on a mixture of independent subspaces, the graphical structure of each subspace is disconnected from the others. However, the problem of connectivity within each subspace is still unanswered. This is important...[Show more]
|Collections||ANU Research Publications|
|Source:||Graph connectivity in sparse subspace clustering|
|01_Nasihatkon_Graph_connectivity_in_sparse_2011.pdf||1.66 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.