The identification of multiple affine subspaces from a set of data is of interest in fields such as system identification, data compression, image processing and signal processing and in the literature referred to as subspace clustering. If the origin of each sample would be known, the problem would be trivially solved by applying principal component analysis to samples originated from the same subspace. Now, not knowing what samples that originates from what subspace, the problem becomes

more »

... erably more difficult. We present a novel convex formulation for subspace clustering. The proposed method takes the shape of a least-squares problem with sum-of-norms regularization over optimization parameter differences, a generalization of the 1-regularization.