DeepAI AI Chat
Log In Sign Up

Boosting RANSAC via Dual Principal Component Pursuit

by   Yunchen Yang, et al.

In this paper, we revisit the problem of local optimization in RANSAC. Once a so-far-the-best model has been found, we refine it via Dual Principal Component Pursuit (DPCP), a robust subspace learning method with strong theoretical support and efficient algorithms. The proposed DPCP-RANSAC has far fewer parameters than existing methods and is scalable. Experiments on estimating two-view homographies, fundamental and essential matrices, and three-view homographic tensors using large-scale datasets show that our approach consistently has higher accuracy than state-of-the-art alternatives.


page 5

page 6

page 7

page 8


Dual Principal Component Pursuit: Probability Analysis and Efficient Algorithms

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

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

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

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

A Batch-Incremental Video Background Estimation Model using Weighted Low-Rank Approximation of Matrices

Principal component pursuit (PCP) is a state-of-the-art approach for bac...

Sketching for Principal Component Regression

Principal component regression (PCR) is a useful method for regularizing...

Linear Tensor Projection Revealing Nonlinearity

Dimensionality reduction is an effective method for learning high-dimens...