基于三维点云投影的ICP算法的有效初始猜测确定

Mouna Attia, Y. Slama
{"title":"基于三维点云投影的ICP算法的有效初始猜测确定","authors":"Mouna Attia, Y. Slama","doi":"10.1109/HPCS.2017.122","DOIUrl":null,"url":null,"abstract":"The standard Iterative Closest Point (ICP) algorithm is a robust and efficient rigid registration algorithm for 3D point clouds. Nevertheless, its efficiency notably decreases when applied to a large transformation cases. In order to avoid this drawback and improve its performance, we propose a new 3-step approach based on ICP and point Cloud Projection, called ICP- CP, that both enhances the accuracy in most cases and reduces the execution time. The first step consists in the determination of the best projection plane that preserves the topological structure of the point cloud. In the second, we compute an initial guess using the projected points. As to the third, it performs successive iterations until reaching the best transformation. The novelty of our approach is the use of the projected points that aims to find an adequate initialization for the ICP algorithm to ensure a fast convergence. We achieve a series of experimentations on both benchmarks and real clouds in order to validate our contribution and prove that, in most cases, the proposed algorithm is more accurate and robust than the standard ICP in a variety of situations, namely in case of large translation, large rotation and the both simultaneously.","PeriodicalId":115758,"journal":{"name":"2017 International Conference on High Performance Computing & Simulation (HPCS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Efficient Initial Guess Determination Based on 3D Point Cloud Projection for ICP Algorithms\",\"authors\":\"Mouna Attia, Y. Slama\",\"doi\":\"10.1109/HPCS.2017.122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The standard Iterative Closest Point (ICP) algorithm is a robust and efficient rigid registration algorithm for 3D point clouds. Nevertheless, its efficiency notably decreases when applied to a large transformation cases. In order to avoid this drawback and improve its performance, we propose a new 3-step approach based on ICP and point Cloud Projection, called ICP- CP, that both enhances the accuracy in most cases and reduces the execution time. The first step consists in the determination of the best projection plane that preserves the topological structure of the point cloud. In the second, we compute an initial guess using the projected points. As to the third, it performs successive iterations until reaching the best transformation. The novelty of our approach is the use of the projected points that aims to find an adequate initialization for the ICP algorithm to ensure a fast convergence. We achieve a series of experimentations on both benchmarks and real clouds in order to validate our contribution and prove that, in most cases, the proposed algorithm is more accurate and robust than the standard ICP in a variety of situations, namely in case of large translation, large rotation and the both simultaneously.\",\"PeriodicalId\":115758,\"journal\":{\"name\":\"2017 International Conference on High Performance Computing & Simulation (HPCS)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on High Performance Computing & Simulation (HPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPCS.2017.122\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on High Performance Computing & Simulation (HPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCS.2017.122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

标准迭代最近点(ICP)算法是一种鲁棒、高效的三维点云刚性配准算法。然而,当应用于大型转换案例时,其效率明显降低。为了避免这一缺点并提高其性能,我们提出了一种新的基于ICP和点云投影的三步法,称为ICP- CP,既提高了大多数情况下的准确性,又缩短了执行时间。第一步是确定保留点云拓扑结构的最佳投影平面。在第二步中,我们使用投影点计算一个初始猜测。对于第三种方法,它执行连续的迭代,直到达到最佳的转换。我们的方法的新颖之处在于使用投影点,旨在为ICP算法找到适当的初始化,以确保快速收敛。我们在基准测试和真实云中进行了一系列实验,以验证我们的贡献,并证明在大多数情况下,在各种情况下,即在大平移,大旋转以及两者同时发生的情况下,所提出的算法比标准ICP更准确和鲁棒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Initial Guess Determination Based on 3D Point Cloud Projection for ICP Algorithms
The standard Iterative Closest Point (ICP) algorithm is a robust and efficient rigid registration algorithm for 3D point clouds. Nevertheless, its efficiency notably decreases when applied to a large transformation cases. In order to avoid this drawback and improve its performance, we propose a new 3-step approach based on ICP and point Cloud Projection, called ICP- CP, that both enhances the accuracy in most cases and reduces the execution time. The first step consists in the determination of the best projection plane that preserves the topological structure of the point cloud. In the second, we compute an initial guess using the projected points. As to the third, it performs successive iterations until reaching the best transformation. The novelty of our approach is the use of the projected points that aims to find an adequate initialization for the ICP algorithm to ensure a fast convergence. We achieve a series of experimentations on both benchmarks and real clouds in order to validate our contribution and prove that, in most cases, the proposed algorithm is more accurate and robust than the standard ICP in a variety of situations, namely in case of large translation, large rotation and the both simultaneously.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信