PSO-COLA: A Robust Solution for Correspondence-Free Point Set Registration

Pablo Barrios, Vicente Guzman, M. Adams
{"title":"PSO-COLA: A Robust Solution for Correspondence-Free Point Set Registration","authors":"Pablo Barrios, Vicente Guzman, M. Adams","doi":"10.1109/ICCAIS56082.2022.9990114","DOIUrl":null,"url":null,"abstract":"In 3D reconstruction and robotics, point cloud registration is a critical component of many tasks including the estimation of sensor motion. The Iterated Closest Point (ICP) algorithm and its variants were initially used to solve such problems. However ICP based methods often fail to converge to the correct solution in the presence of detection as well as spatial errors. This is because ICP methods typically use an L2 metric as part of their optimization criteria, which is unable to penalize cardinality errors. This article therefore presents a registration technique based on the multi-object Cardinalized Optimal Linear Assignment (COLA) metric, which penalizes both detection and spatial errors. This allows robust scan registration to take place in the presence of both unknown inter-scan translation and orientation as well as point cloud detection errors. The resulting Particle Swarm Optimization (PSO)-COLA registration algorithm is shown to outperform state of the art local and global point cloud registration algorithms in the presence of data outliers and spatial uncertainty.","PeriodicalId":273404,"journal":{"name":"2022 11th International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 11th International Conference on Control, Automation and Information Sciences (ICCAIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAIS56082.2022.9990114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In 3D reconstruction and robotics, point cloud registration is a critical component of many tasks including the estimation of sensor motion. The Iterated Closest Point (ICP) algorithm and its variants were initially used to solve such problems. However ICP based methods often fail to converge to the correct solution in the presence of detection as well as spatial errors. This is because ICP methods typically use an L2 metric as part of their optimization criteria, which is unable to penalize cardinality errors. This article therefore presents a registration technique based on the multi-object Cardinalized Optimal Linear Assignment (COLA) metric, which penalizes both detection and spatial errors. This allows robust scan registration to take place in the presence of both unknown inter-scan translation and orientation as well as point cloud detection errors. The resulting Particle Swarm Optimization (PSO)-COLA registration algorithm is shown to outperform state of the art local and global point cloud registration algorithms in the presence of data outliers and spatial uncertainty.
PSO-COLA:一种无对应点集配准的鲁棒解决方案
在三维重建和机器人技术中,点云配准是包括传感器运动估计在内的许多任务的关键组成部分。迭代最近点(ICP)算法及其变体最初用于解决这类问题。然而,基于ICP的方法在存在检测和空间误差的情况下往往不能收敛到正确的解。这是因为ICP方法通常使用L2度量作为其优化标准的一部分,这无法惩罚基数错误。因此,本文提出了一种基于多对象基数化最优线性分配(COLA)度量的配准技术,该技术可以惩罚检测和空间错误。这允许在未知的扫描间转换和方向以及点云检测错误存在的情况下进行稳健的扫描配准。结果表明,粒子群优化(PSO)-COLA配准算法在存在数据异常值和空间不确定性的情况下优于当前最先进的局部和全局点云配准算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信