Aug 2026· The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences· Vol XLIX-B4-2026, pp. 687-693· 0 citations· 8 references
TL;DR
The proposed high-precision point cloud registration method demonstrates good stability and applicability in complex cave heritage scenarios and can provide methodological support for the fusion of multi-source point clouds in the digital preservation of cultural heritage.
Abstract
Abstract. To address the challenges of large initial pose discrepancies in grotto point clouds acquired from multiple sources, complex local geometric structures, significant noise interference, and the tendency of traditional ICP algorithms to fall into local optima, a high-precision point cloud registration method is proposed by integrating feature extraction with the collaborative optimization of coarse and fine registration. This method first performs point cloud preprocessing through voxel downsampling and outlier removal; it then extracts stable feature regions based on normal vector estimation and curvature analysis, and constructs feature representations using FPFH descriptors; building on this, the K-4PCS algorithm is employed to perform coarse registration and obtain optimal initial transformation parameters, followed by fine registration using an improved ICP algorithm combined with KD-tree-based search optimization. The proposed method was validated using the STANFORD DRAGON dataset and the point cloud of the Buddha head statue from Cave 18 of the Yungang Grottoes. The results indicate that the proposed method effectively improves the convergence speed and accuracy of point cloud registration. It demonstrates good stability and applicability in complex cave heritage scenarios and can provide methodological support for the fusion of multi-source point clouds in the digital preservation of cultural heritage.
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.
Lei Liu, Ke-Guang Yu, Xinyi Li et al.· SAE technical paper series· 0 citations
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.· The International Archives o...· 0 citations
While the Iterative Closest Point (ICP) algorithm is widely used for 3D point cloud registration, relying on a fixed distance threshold causes unstable performance and demands extensive manual parameter tuning when aligning complex workpieces. This paper aims to address these limitations by developing an adaptive I...
Fuyuan Tan, Guanghui Liu, Hongyue Yang et al.· Industrial robot· 0 citations
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.· International Conference on...· 0 citations
In complex environments, fast and accurate registration of LiDAR point clouds is crucial for ensuring the safety of robot environmental perception and other LiDAR-based applications. Existing point cloud registration methods typically rely on feature matching to find correspondences between points and use RANSAC to est...
Yi-Jie Chen, Bin Tian, Zeyun Wan et al.· PLoS ONE· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.