arrow
返回

Robust point cloud registration based on semantic iterative closest point algorithm

delete2025-02-15
delete0
delete
OA
AI
S
Shaoyi Du
T
Tiancheng Shao
C
Canhui Tang
W
Wei Zeng
Z
Zhiqiang Tian *
DOI:10.1016/j.fmre.2024.04.025delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Point cloud registration is a fundamental problem in computer vision, which is extremely challenging for LiDAR point clouds with a lot of noise, outliers, and poor initial position. To deal with these difficulties, this paper proposes a semantic-based iterative closest point algorithm, which utilizes bidirectional distance and correntropy for robust point cloud registration. Firstly, we propose a semantic-guided correspondence establishment strategy that utilizes semantic information to narrow down the search range of correspondences and improve registration accuracy. Secondly, a bidirectional semantic search point matching strategy is introduced to the algorithm, which increases its error correction ability. Thirdly, the maximum correntropy criterion strategy is used to suppress the noise and outliers to further enhance the algorithm in robustness. Experimental results demonstrate the accuracy and robustness of our algorithm compared with other registration methods.
Keyword:
Iterative closest point
Point cloud registration
Semantic information
Bidirectional distance
Maximum correntropy criterion

期刊

Fundamental Research 封面图
Fundamental Research
IF:
6.3
论文数:
1.3K
被引数:
2.6K

机构

Longyan University 封面图
Longyan University
学者数:
1.0K
论文数: 682
被引数: 831
X
xi'an jiaotong university
学者数:
9.3W
论文数: 6.7W
被引数: 75
引用论文

引用论文

err分享
err收藏
err分享
err收藏
New algorithms for 2D and 3D point matching: Pose estimation and correspondence
err1998-08-01
err446
errOAAI
errGold, S; Rangarajan, A; Lu, CP; Pappu, S; Mjolsness, E
err分享
err收藏
Convex hull indexed Gaussian mixture model (CH-GMM) for 3D point set registration
err2016-11-01
err43
errOAAI
errFan, Jingfan; Yang, Jian; Ai, Danni; Xia, Likun; Zhao, Yitian; Gao, Xing; Wang, Yongtian
err分享
err收藏
学者 查看更多内容