Dual Principal Component Pursuit: Probability Analysis and Efficient Algorithms

by   Zhihui Zhu, et al.
Johns Hopkins University
ShanghaiTech University

Recent methods for learning a linear subspace from data corrupted by outliers are based on convex ℓ_1 and nuclear norm optimization and require the dimension of the subspace and the number of outliers to be sufficiently small. In sharp contrast, the recently proposed Dual Principal Component Pursuit (DPCP) method can provably handle subspaces of high dimension by solving a non-convex ℓ_1 optimization problem on the sphere. However, its geometric analysis is based on quantities that are difficult to interpret and are not amenable to statistical analysis. In this paper we provide a refined geometric analysis and a new statistical analysis that show that DPCP can tolerate as many outliers as the square of the number of inliers, thus improving upon other provably correct robust PCA methods. We also propose a scalable Projected Sub-Gradient Method method (DPCP-PSGM) for solving the DPCP problem and show it admits linear convergence even though the underlying optimization problem is non-convex and non-smooth. Experiments on road plane detection from 3D point cloud data demonstrate that DPCP-PSGM can be more efficient than the traditional RANSAC algorithm, which is one of the most popular methods for such computer vision applications.


page 11

page 36

page 37

page 41


Dual Principal Component Pursuit

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

Hyperplane Clustering Via Dual Principal Component Pursuit

We extend the theoretical analysis of a recently proposed single subspac...

Boosting RANSAC via Dual Principal Component Pursuit

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

Robust Subspace System Identification via Weighted Nuclear Norm Optimization

Subspace identification is a classical and very well studied problem in ...

Efficient Algorithms for High-Dimensional Convex Subspace Optimization via Strict Complementarity

We consider optimization problems in which the goal is find a k-dimensio...

Pseudo-Bayesian Robust PCA: Algorithms and Analyses

Commonly used in computer vision and other applications, robust PCA repr...

Please sign up or login with your details

Forgot password? Click here to reset