A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates

03/20/2019
by   Heng Yang, et al.
20

We propose a robust approach for the registration of two sets of 3D points in the presence of a large amount of outliers. Our first contribution is to reformulate the registration problem using a Truncated Least Squares (TLS) cost that makes the estimation insensitive to a large fraction of spurious point-to-point correspondences. The second contribution is a general framework to decouple rotation, translation, and scale estimation, which allows solving in cascade for the three transformations. Since each subproblem (scale, rotation, and translation estimation) is still non-convex and combinatorial in nature, out third contribution is to show that (i) TLS scale and (component-wise) translation estimation can be solved exactly and in polynomial time via an adaptive voting scheme, (ii) TLS rotation estimation can be relaxed to a semidefinite program and the relaxation is tight in practice, even in presence of an extreme amount of outliers. We validate the proposed algorithm, named TEASER (Truncated least squares Estimation And SEmidefinite Relaxation), in standard registration benchmarks showing that the algorithm outperforms RANSAC and robust local optimization techniques, and favorably compares with Branch-and-Bound methods, while being a polynomial-time algorithm. TEASER can tolerate up to 99

READ FULL TEXT

page 1

page 8

page 16

page 17

research
01/21/2020

TEASER: Fast and Certifiable Point Cloud Registration

We propose the first fast and certifiable algorithm for the registration...
research
05/29/2019

A Quaternion-based Certifiably Optimal Solution to the Wahba Problem with Outliers

The Wahba problem, also known as rotation search, seeks to find the best...
research
01/06/2021

On the Tightness of Semidefinite Relaxations for Rotation Estimation

Why is it that semidefinite relaxations have been so successful in numer...
research
03/07/2021

IRON: Invariant-based Highly Robust Point Cloud Registration

In this paper, we present IRON (Invariant-based global Robust estimation...
research
01/26/2023

Semidefinite Relaxations for Robust Multiview Triangulation

We propose the first convex relaxation for multiview triangulation that ...
research
07/18/2022

Symmetrized Robust Procrustes: Constant-Factor Approximation and Exact Recovery

The classical Procrustes problem is to find a rigid motion (orthogonal t...
research
07/29/2020

Outlier-Robust Estimation: Hardness, Minimally-Tuned Algorithms, and Applications

Nonlinear estimation in robotics and vision is typically plagued with ou...

Please sign up or login with your details

Forgot password? Click here to reset