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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) S. 5204 - 5212
Hauptverfasser: Yongfang Cheng, Yin Wang, Sznaier, Mario, Camps, Octavia
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2016
Schlagworte:
Clustering algorithms
Computational complexity
Image segmentation
Noise measurement
Robustness
Symmetric matrices
ISSN:1063-6919
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 small number of variables. This is established by first reducing the problem to a quadratically constrained quadratic problem and then using its special structure to find conditions guaranteeing that a suitably built convex relaxation is indeed exact. When combined with the standard nuclear norm relaxation for rank, the results above lead to computationally efficient algorithms with optimality guarantees. A salient feature of the proposed approach is its ability to incorporate existing a-priori information about the noise, co-ocurrences, and percentage of outliers. These results are illustrated with several examples.
ISSN:1063-6919
DOI:10.1109/CVPR.2016.562