2016
Subspace Clustering With Priors via Sparse Quadratically Constrained Quadratic Programming
CVPR 2016poster
This paper considers the problem of recovering a subspace arrangement from noisy samples, potentially corrupted with outliers. Our main result shows that this problem can be formulated as a convex semi-definite optimization problem subject to an additional rank constrain that involves only a very…