Noisy Dual Principal Component Pursuit
Tianyu Ding · Zhihui Zhu · Tianjiao Ding · Yunchen Yang · Daniel Robinson · Manolis Tsakiris · Rene Vidal

Wed Jun 12th 12:05 -- 12:10 PM @ Room 103

Dual Principal Component Pursuit (DPCP) is a recently proposed non-convex optimization based method for learning subspaces of high relative dimension from noiseless datasets contaminated by as many outliers as the square of the number of inliers. Experimentally, DPCP has proved to be robust to noise and outperform the popular RANSAC on 3D vision tasks such as road plane detection and relative poses estimation from three views. This paper extends the global optimality and convergence theory of DPCP to the case of data corrupted by noise, and further demonstrates its robustness using synthetic and real data.

Author Information

Tianyu Ding (Johns Hopkins University)
Zhihui Zhu (Johns Hopkins University)
Tianjiao Ding (ShanghaiTech University)
Yunchen Yang (ShanghaiTech)
Daniel Robinson (Johns Hopkins University)
Manolis Tsakiris (ShanghaiTech University)
Rene Vidal (Johns Hopkins University, USA)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors