Guaranteed Outlier Removal for Point Cloud Registration with Correspondences

11/28/2017
by   Álvaro Parra Bustos, et al.
0

An established approach for 3D point cloud registration is to estimate the registration function from 3D keypoint correspondences. Typically, a robust technique is required to conduct the estimation, since there are false correspondences or outliers. Current 3D keypoint techniques are much less accurate than their 2D counterparts, thus they tend to produce extremely high outlier rates. A large number of putative correspondences must thus be extracted to ensure that sufficient good correspondences are available. Both factors (high outlier rates, large data sizes) however cause existing robust techniques to require very high computational cost. In this paper, we present a novel preprocessing method called guaranteed outlier removal for point cloud registration. Our method reduces the input to a smaller set, in a way that any rejected correspondence is guaranteed to not exist in the globally optimal solution. The reduction is performed using purely geometric operations which are deterministic and fast. Our method significantly reduces the population of outliers, such that further optimization can be performed quickly. Further, since only true outliers are removed, the globally optimal solution is preserved. On various synthetic and real data experiments, we demonstrate the effectiveness of our preprocessing method. Demo code is available as supplementary material.

READ FULL TEXT

page 5

page 10

page 11

page 12

page 18

page 19

page 20

page 21

research
05/16/2022

A New Outlier Removal Strategy Based on Reliability of Correspondence Graph for Fast Point Cloud Registration

Registration is a basic yet crucial task in point cloud processing. In c...
research
02/05/2019

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints

A popular paradigm for 3D point cloud registration is by extracting 3D k...
research
06/22/2006

Outlier Robust ICP for Minimizing Fractional RMSD

We describe a variation of the iterative closest point (ICP) algorithm f...
research
11/20/2020

CLIPPER: A Graph-Theoretic Framework for Robust Data Association

We present CLIPPER (Consistent LInking, Pruning, and Pairwise Error Rect...
research
11/01/2021

TriVoC: Efficient Voting-based Consensus Maximization for Robust Point Cloud Registration with Extreme Outlier Ratios

Correspondence-based point cloud registration is a cornerstone in roboti...
research
11/01/2022

GMF: General Multimodal Fusion Framework for Correspondence Outlier Rejection

Rejecting correspondence outliers enables to boost the correspondence qu...
research
11/29/2021

Multi-instance Point Cloud Registration by Efficient Correspondence Clustering

We address the problem of estimating the poses of multiple instances of ...

Please sign up or login with your details

Forgot password? Click here to reset