arrow
Return

A Point Cloud Registration Method Based on Triangular Mesh Features

delete2026-05-01
delete1
PRE
AI
王
王文光 (Wenguang Wang)
Z
Zhao, Jinshuo
Y
Yuan, Changshun *
王
王华 (Hua Wang)
DOI:10.3390/app16105167delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
To address the issue where conventional initial registration methods combined with the Iterative Closest Point (ICP) algorithm are highly sensitive to initial parameters such as point cloud density and pose-often resulting in degraded accuracy or even misregistration-this paper proposes a Lidar point cloud registration method integrating triangular mesh features. First, Crust Triangulation is employed to construct a triangular mesh from the input point cloud. Then, the keypoint extraction based on triangular meshes, termed KE-TM, is introduced. Subsequently, a Triangle Feature Histogram (TFH) is constructed as the feature descriptor. Based on this, an initial alignment method grounded in triangular meshes, referred to as TM-IA, is developed to achieve coarse registration of point clouds. Finally, the ICP algorithm is applied to refine the alignment. Comparative experiments conducted on incomplete Bunny point clouds demonstrate that the proposed KE-TM maintains a higher keypoint repeatability under reduced point cloud density. The combined TM-IA and ICP registration method can achieve rotation errors within 1 degrees and translation errors within 1 mm under small initial pose deviations, while also maintaining robust performance under larger initial misalignments. Compared with traditional methods, the proposed method significantly reduces sensitivity to initial parameters and improves the accuracy. This method has certain practical significance for the precise alignment of 3D point clouds.
Keywords:
LiDAR
triangular mesh
keypoint extraction
point cloud registration

Journal

A
Applied Sciences-Basel
IF:
2.5
Papers:
7.6K
Citations:
4

Organization

B
beihang university
Scholars:
2.7K
Papers: 836
Citations: 0
Cited Papers

Cited Papers

No cited papers available