SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration without Correspondences

04/06/2019
by   Huu Le, et al.
0

This paper presents a novel randomized algorithm for robust point cloud registration without correspondences. Most existing registration approaches require a set of putative correspondences obtained by extracting invariant descriptors. However, such descriptors could become unreliable in noisy and contaminated settings. In these settings, methods that directly handle input point sets are preferable. Without correspondences, however, conventional randomized techniques require a very large number of samples in order to reach satisfactory solutions. In this paper, we propose a novel approach to address this problem. In particular, our work enables the use of randomized methods for point cloud registration without the need of putative correspondences. By considering point cloud alignment as a special instance of graph matching and employing an efficient semi-definite relaxation, we propose a novel sampling mechanism, in which the size of the sampled subsets can be larger-than-minimal. Our tight relaxation scheme enables fast rejection of the outliers in the sampled sets, resulting in high-quality hypotheses. We conduct extensive experiments to demonstrate that our approach outperforms other state-of-the-art methods. Importantly, our proposed method serves as a generic framework which can be extended to problems with known correspondences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2022

PointCLM: A Contrastive Learning-based Framework for Multi-instance Point Cloud Registration

Multi-instance point cloud registration is the problem of estimating mul...
research
06/11/2020

Minimum Potential Energy of Point Cloud for Robust Global Registration

In this paper, we propose a novel minimum gravitational potential energy...
research
09/27/2017

ANSAC: Adaptive Non-minimal Sample and Consensus

While RANSAC-based methods are robust to incorrect image correspondences...
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 ...
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
05/03/2020

Feature-metric Registration: A Fast Semi-supervised Approach for Robust Point Cloud Registration without Correspondences

We present a fast feature-metric point cloud registration framework, whi...
research
10/04/2020

Mapping of Sparse 3D Data using Alternating Projection

We propose a novel technique to register sparse 3D scans in the absence ...

Please sign up or login with your details

Forgot password? Click here to reset