Efficient RANSAC in 4D Plane Space for Point Cloud Registration

3D registration methods based on point-level information struggle in situations with noise, density variation, large-scale points, and small overlaps, while existing primitive-based methods are usually sensitive to tiny errors in the primitive extraction process. In this paper, we present a reliable and efficient global registration algorithm exploiting the RANdom SAmple Consensus (RANSAC) in the plane space instead of the point space. To improve the inlier ratio in the putative correspondences, we design an inner plane-based descriptor, termed Convex Hull Descriptor (CHD), and an inter plane-based descriptor, termed PLane Feature Histograms (PLFH), which take full advantage of plane contour shape and plane-wise relationship, respectively. Based on those new descriptors, we randomly select corresponding plane pairs to compute candidate transformations, followed by a hypotheses verification step to identify the optimal registration. Extensive tests on large-scale point sets demonstrate the effectiveness of our method, and that it notably improves registration performance compared to state-of-the-art methods in terms of efficiency and accuracy.

Authors

Institutions

Publication Details

Journal
Graphical Models
Published
2025-08-22
DOI
https://doi.org/10.1016/j.gmod.2025.101289
Citations
1
Primary Topic
Robotics and Sensor-Based Localization
Type
article
Field-Weighted Citation Impact
4.99

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient RANSAC in 4D Plane Space for Point Cloud Registration

Jianwei Guo, Zhongqi Wu, Chang Liu, Yuming Zhang et al.
1 citations
Graphical Models
Robotics and Sensor-Based Localization
4.99
article

Efficient RANSAC in 4D Plane Space for Point Cloud Registration

Jianwei Guo, Zhongqi Wu, Chang Liu, Yuming Zhang, Chao Liu
article en
1 citations

Abstract

3D registration methods based on point-level information struggle in situations with noise, density variation, large-scale points, and small overlaps, while existing primitive-based methods are usually sensitive to tiny errors in the primitive extraction process. In this paper, we present a reliable and efficient global registration algorithm exploiting the RANdom SAmple Consensus (RANSAC) in the plane space instead of the point space. To improve the inlier ratio in the putative correspondences, we design an inner plane-based descriptor, termed Convex Hull Descriptor (CHD), and an inter plane-based descriptor, termed PLane Feature Histograms (PLFH), which take full advantage of plane contour shape and plane-wise relationship, respectively. Based on those new descriptors, we randomly select corresponding plane pairs to compute candidate transformations, followed by a hypotheses verification step to identify the optimal registration. Extensive tests on large-scale point sets demonstrate the effectiveness of our method, and that it notably improves registration performance compared to state-of-the-art methods in terms of efficiency and accuracy.

Graphical ModelsVol. 141
Chinese Academy of Sciences (CN), Beijing Normal University (CN), Institute of Automation (CN), Institutes of Science and Development (CN), Nanchang Hangkong University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 5%
Robotics and Sensor-Based Localization
4.99
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Efficient RANSAC in 4D Plane Space for Point Cloud Registration — Jianwei Guo, Zhongqi Wu, et al. · Graphical Models (2025) | TGRS Research Map | TGRS