DeepAI AI Chat
Log In Sign Up

Hyperplane Clustering Via Dual Principal Component Pursuit

by   Manolis C. Tsakiris, et al.
Johns Hopkins University

We extend the theoretical analysis of a recently proposed single subspace learning algorithm, called Dual Principal Component Pursuit (DPCP), to the case where the data are drawn from of a union of hyperplanes. To gain insight into the properties of the ℓ_1 non-convex problem associated with DPCP, we develop a geometric analysis of a closely related continuous optimization problem. Then transferring this analysis to the discrete problem, our results state that as long as the hyperplanes are sufficiently separated, the dominant hyperplane is sufficiently dominant and the points are uniformly distributed inside the associated hyperplanes, then the non-convex DPCP problem has a unique global solution, equal to the normal vector of the dominant hyperplane. This suggests the correctness of a sequential hyperplane learning algorithm based on DPCP. A thorough experimental evaluation reveals that hyperplane learning schemes based on DPCP dramatically improve over the state-of-the-art methods for the case of synthetic data, while are competitive to the state-of-the-art in the case of 3D plane clustering for Kinect data.


page 32

page 33

page 34

page 35

page 39

page 40


Dual Principal Component Pursuit: Probability Analysis and Efficient Algorithms

Recent methods for learning a linear subspace from data corrupted by out...

Dual Principal Component Pursuit

We consider the problem of outlier rejection in single subspace learning...

Boosting RANSAC via Dual Principal Component Pursuit

In this paper, we revisit the problem of local optimization in RANSAC. O...

Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit

The best pair problem aims to find a pair of points that minimize the di...

Frank-Wolfe Optimization for Dominant Set Clustering

We study Frank-Wolfe algorithms – standard, pairwise, and away-steps – f...

Complex and Quaternionic Principal Component Pursuit and Its Application to Audio Separation

Recently, the principal component pursuit has received increasing attent...

Dual Smoothing and Level Set Techniques for Variational Matrix Decomposition

We focus on the robust principal component analysis (RPCA) problem, and ...