Efficient Global Point Cloud Registration by Matching Rotation Invariant Features Through Translation Search
Three-dimensional rigid point cloud registration has many applications in computer vision and robotics. Local methods tend to fail, causing global methods to be needed, when the relative transformation is large or the overlap ratio is small. Most existing global methods utilize BnB optimization over the 6D parameter space of SE(3). Such methods are usually very slow because the time complexity of BnB optimization is exponential in the dimensionality of the parameter space. In this paper, we decouple the optimization of translation and rotation, and we propose a fast BnB algorithm to globally optimize the 3D translation parameter first. The optimal rotation is then calculated by utilizing the global optimal translation found by the BnB algorithm. The separate optimization of translation and rotation is realized by using a newly proposed rotation invariant feature. Experiments on challenging data sets demonstrate that the proposed method outperforms state-of-the-art global methods in terms of both speed and accuracy.
Code (0)
등록된 구현이 없습니다.
Tasks
Point Cloud RegistrationTranslationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Fast Rotation Search with Stereographic Projections for 3D Registration
Recently there has been a surge of interest to use branch-and-bound (bnb) optimisation for 3D point cloud registration. While bnb guarantees globally optimal solutions, it is usually too slow to be practical. A fundament…
3D Feature MatchingGeometric MatchingPoint Cloud RegistrationTranslationRIGA: Rotation-Invariant and Globally-Aware Descriptors for Point Cloud Registration
Successful point cloud registration relies on accurate correspondences established upon powerful descriptors. However, existing neural descriptors either leverage a rotation-variant backbone whose performance declines un…
Point Cloud RegistrationPairwise Point Cloud Registration using Graph Matching and Rotation-invariant Features
Registration is a fundamental but critical task in point cloud processing, which usually depends on finding element correspondence from two point clouds. However, the finding of reliable correspondence relies on establis…
Graph MatchingPoint Cloud RegistrationTranslationMultiway Point Cloud Mosaicking with Diffusion and Global Optimization
We introduce a novel framework for multiway point cloud mosaicking (named Wednesday) designed to co-align sets of partially overlapping point clouds -- typically obtained from 3D scanners or moving RGB-D cameras -- i…
Denoisingglobal-optimizationIterative Global Similarity Points : A robust coarse-to-fine integration solution for pairwise 3D point cloud registration
In this paper, we propose a coarse-to-fine integration solution inspired by the classical ICP algorithm, to pairwise 3D point cloud registration with two improvements of hybrid metric spaces (eg, BSC feature and Euclidea…
Point Cloud Registration