Parallel 3D ICP Based on Conditionally Constrained Corresponding Points and Applications

Tun-Dong Liu, Fan Zhen Kong, Miao He, X. M. Wu, G. Shao
{"title":"Parallel 3D ICP Based on Conditionally Constrained Corresponding Points and Applications","authors":"Tun-Dong Liu, Fan Zhen Kong, Miao He, X. M. Wu, G. Shao","doi":"10.1109/ICNSC52481.2021.9702130","DOIUrl":null,"url":null,"abstract":"The iterative closest point (ICP) tends to fall into local optimality due to inaccurate initial poses during the registration of the multi-view 3D cloud. Therefore, this paper proposes a parallel ICP algorithm with conditional constraint corresponding points. To achieve a fine registration of the point cloud, the corresponding point set is first filtered by adding the normal and color information. Then the OpenMP is introduced to accelerate the program in parallel for ICP. To verify the effectiveness of our algorithm, in the V-Rep simulation environment, the multi-view point cloud data of the scene is obtained by the RGB-D cameras from different angles point cloud. The results show that our algorithm can fuse the multi-view point cloud, improve the accuracy and real-time performance of ICP. Furthermore, in a large-scale calculation, the average single iteration time is less than 0.1s, and the RMSE (root mean square error) is about 0.1, which meets the need of target recognition and sorting in a three-dimensional industrial scene.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC52481.2021.9702130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The iterative closest point (ICP) tends to fall into local optimality due to inaccurate initial poses during the registration of the multi-view 3D cloud. Therefore, this paper proposes a parallel ICP algorithm with conditional constraint corresponding points. To achieve a fine registration of the point cloud, the corresponding point set is first filtered by adding the normal and color information. Then the OpenMP is introduced to accelerate the program in parallel for ICP. To verify the effectiveness of our algorithm, in the V-Rep simulation environment, the multi-view point cloud data of the scene is obtained by the RGB-D cameras from different angles point cloud. The results show that our algorithm can fuse the multi-view point cloud, improve the accuracy and real-time performance of ICP. Furthermore, in a large-scale calculation, the average single iteration time is less than 0.1s, and the RMSE (root mean square error) is about 0.1, which meets the need of target recognition and sorting in a three-dimensional industrial scene.
基于条件约束对应点的并行三维ICP及其应用
在多视图三维云配准过程中,由于初始姿态不准确,迭代最近点(ICP)容易陷入局部最优。为此,本文提出了一种具有条件约束对应点的并行ICP算法。为了实现点云的精细配准,首先通过添加法向和颜色信息对相应的点集进行过滤。在此基础上,介绍了OpenMP并行加速方案。为了验证算法的有效性,在V-Rep仿真环境下,利用RGB-D摄像机从不同角度的点云获取场景的多视角点云数据。结果表明,该算法能够融合多视点云,提高ICP的精度和实时性。在大规模计算中,平均单次迭代时间小于0.1s, RMSE(均方根误差)约为0.1,满足三维工业场景中目标识别和分类的需要。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信