Skip to content

Nc5-PCS Based Heterogeneous Point Cloud Matching for Roads

Sep 2026 · SAE technical paper series · 0 citations · 14 references

TL;DR

Nc-5PCS first performs approximate scale estimation through concavity-convexity similarity analysis within coarse overlap regions, addressing the inherent scale limitation in 4PCS-based approaches, and outperforming Super-4PCS to provide superior initial alignment for subsequent ICP refinement.

Abstract

Point cloud registration represents a fundamental task in geospatial informatics and 3D computer vision, aiming to align heterogeneous point clouds through rigid transformation estimation. While Super-4PCS serves as an efficient coarse registration method, it exhibits limitations when handling large-scale datasets, planar-distributed point clouds, and scenarios with unknown scale differences. To overcome these challenges, this paper proposes the Nc-5PCS (Neighborhood-constrained 5-Point Congruent Sets) algorithm. Nc-5PCS first performs approximate scale estimation through concavity-convexity similarity analysis within coarse overlap regions, addressing the inherent scale limitation in 4PCS-based approaches. Subsequently, the algorithm employs 3D Harris feature point extraction to significantly reduce data volume while preserving critical geometric characteristics. The core innovation lies in designing a non-coplanar 5-point basis with a corresponding hash-based retrieval mechanism, effectively resolving the feature degradation problem caused by coplanar 4-point bases. Furthermore, normal vector angular constraints are incorporated to enhance consensus evaluation during correspondence selection, substantially improving registration accuracy. Experimental validation demonstrates that Nc-5PCS achieves a point-to-point RMS error of ≤ 0.227 m, outperforming Super-4PCS to provide superior initial alignment for subsequent ICP refinement.

View source

Similar papers

Preprint Sep 2026

PARTE: Plane-Assisted Robust Transformation Estimation for Point Cloud Registration

Global point-cloud registration remains challenging when limited overlap, repetitive geometry, and sensor noise produce correspondence sets dominated by outliers. Planar regions are particularly difficult for conventional point descriptors and are therefore often suppressed or discarded before matching. We present PART...

Abolfazl Babanazari, Carson Cramer, Tyler H. Summers et al. · 0 citations
Open access Oct 2026

Point Cloud Change Detection Based on ROI Similarity

Laser point cloud change detection is susceptible to spatial–structural uncertainties induced by residual registration errors, uneven point cloud density, viewpoint shift and object occlusion, which frequently produce numerous false alarms of spurious changes. To address this issue, this paper proposes an ROI-level 3D...

Wen-Guang Wang, Jin-Shuo Zhao, Chang-Shun Yuan et al. · 0 citations
Open access Sep 2026

Beyond Accuracy: A Computational–Robustness Comparison of Point Cloud Registration Algorithms

The digital documentation of cultural heritage increasingly relies on the fusion of multi-source data to overcome the limitations of individual sensors. This study evaluates the performance of four registration algorithms, Iterative Closest Point (ICP), RANSAC, Fast Global Registration (FGR), and FilterReg, applied to...

Ezequiel Silva Rocha, A. B. Maia, C. D. de Almeida et al. · 0 citations
Open access 2026

A Canopy–Gap Boundary-Based Method for Multiplatform Forest Point Cloud Registration

The integration of LiDAR point clouds acquired from airborne, terrestrial, and mobile platforms can improve the characterization of forest spatial structure. However, robust cross-platform registration remains challenging because of occlusion, viewpoint differences, uneven point density, and the limited repeatability o...

Jian You, Yun-Cheng Deng, Jia Shi et al. · 0 citations
Conference Aug 2026

Efficient Point Cloud Registration via Stratified Sampling and Bidirectional Correspondence Validation

Traditional point cloud registration pipelines based on the Random Sample Consensus (RANSAC) and the Iterative Closest Point (ICP) often suffer from unstable correspondences and excessive computational costs. This paper presents an optimized coarse-to-fine registration framework that explicitly leverages feature salien...

Yi-Xin Ruan, Guo-Liang Liu, Cong-Nan Han et al. · 0 citations
Oct 2026

A generalized Gauss–Helmert framework for point cloud fitting and registration using raw measurements

Three-dimensional (3D) laser scanning technology plays an increasingly critical role in fields such as 3D reality modeling, cultural heritage conservation, and structural health monitoring, relying on accurate point cloud fitting and registration as its essential supporting technologies. However, most registration and...

Bin Wang, Wen-Lei Zhao, Zhi-Sheng Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.