Pairwise 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 establishing a robust and discriminative description of elements and the correct matching of corresponding elements. In this letter, we develop a coarse-to-fine registration strategy, which utilizes rotation-invariant features and a new weighted graph matching method for iteratively finding correspondence. In the graph matching method, the similarity of nodes and edges in Euclidean and feature space are formulated to construct the optimization function. The proposed strategy is evaluated using two benchmark datasets and compared with several state-of-the-art methods. Regarding the experimental results, our proposed method can achieve a fine registration with rotation errors of less than 0.2 degrees and translation errors of less than 0.1m.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph MatchingPoint Cloud RegistrationTranslationSimilar Papers 제목 키워드 기반
Register Any Point: Scaling 3D Point Cloud Registration by Flow Matching
Point cloud registration aligns multiple unposed point clouds into a common reference frame and is a core step for 3D reconstruction and robot localization without initial guess. In this work, we cast registration as con…
Point Cloud Registration3D ReconstructionPoint CloudsA Practical Maximum Clique Algorithm for Matching with Pairwise Constraints
A popular paradigm for 3D point cloud registration is by extracting 3D keypoint correspondences, then estimating the registration function from the correspondences using a robust algorithm. However, many existing 3D keyp…
Point Cloud RegistrationMultiway 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-optimizationPREDATOR: Registration of 3D Point Clouds with Low Overlap
We introduce PREDATOR, a model for pairwise point-cloud registration with deep attention to the overlap region. Different from previous work, our model is specifically designed to handle (also) point-cloud pairs with low…
Deep AttentionPoint Cloud RegistrationIterative 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