Algorithm 2 CSC for Segmentation |
Input: A set of points lying in a union of N subspaces . Solve the sparse optimization problem by Equation (7). Normalize the columns of . Obtain a similarity graph (matrix) with N nodes representing the data points by Equation (8). Apply spectral clustering to the similarity graph. Output: Segmentation of the data. |