Subspace Clustering with Priors via Sparse Quadratically Constrained Quadratic Programming

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 sm...

Full description

Bibliographic Details

Published in:	2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) pp. 5204 - 5212
Main Authors:	Yongfang Cheng, Yin Wang, Sznaier, Mario, Camps, Octavia
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2016
Subjects:	Clustering algorithms Computational complexity Image segmentation Noise measurement Robustness Symmetric matrices
ISSN:	1063-6919
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!