Minimum Potential Energy of Point Cloud for Robust Global Registration

by   Zijie Wu, et al.
The University of Western Australia
Hunan University

In this paper, we propose a novel minimum gravitational potential energy (MPE)-based algorithm for global point set registration. The feature descriptors extraction algorithms have emerged as the standard approach to align point sets in the past few decades. However, the alignment can be challenging to take effect when the point set suffers from raw point data problems such as noises (Gaussian and Uniformly). Different from the most existing point set registration methods which usually extract the descriptors to find correspondences between point sets, our proposed MPE alignment method is able to handle large scale raw data offset without depending on traditional descriptors extraction, whether for the local or global registration methods. We decompose the solution into a global optimal convex approximation and the fast descent process to a local minimum. For the approximation step, the proposed minimum potential energy (MPE) approach consists of two main steps. Firstly, according to the construction of the force traction operator, we could simply compute the position of the potential energy minimum; Secondly, with respect to the finding of the MPE point, we propose a new theory that employs the two flags to observe the status of the registration procedure. The method of fast descent process to the minimum that we employed is the iterative closest point algorithm; it can achieve the global minimum. We demonstrate the performance of the proposed algorithm on synthetic data as well as on real data. The proposed method outperforms the other global methods in terms of both efficiency, accuracy and noise resistance.


page 1

page 3

page 8

page 10

page 11


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

This paper presents a novel randomized algorithm for robust point cloud ...

Exact Point Cloud Downsampling for Fast and Accurate Global Trajectory Optimization

This paper presents a point cloud downsampling algorithm for fast and ac...

HD2Reg: Hierarchical Descriptors and Detectors for Point Cloud Registration

Feature Descriptors and Detectors are two main components of feature-bas...

DH3D: Deep Hierarchical 3D Descriptors for Robust Large-Scale 6DoF Relocalization

For relocalization in large-scale point clouds, we propose the first app...

Evaluation of Robust Point Set Registration Applied to Automotive Doppler Radar

Point set registration is the process of finding the best alignment betw...

Provably Approximated ICP

The goal of the alignment problem is to align a (given) point cloud P = ...

Globally Optimal Registration based on Fast Branch and Bound

The problem of planar registration consists in finding the transformatio...

Please sign up or login with your details

Forgot password? Click here to reset