Point set registration based on multi-object metrics

Pablo Barrios, M. Adams
{"title":"Point set registration based on multi-object metrics","authors":"Pablo Barrios, M. Adams","doi":"10.1109/ICCAIS.2017.8217584","DOIUrl":null,"url":null,"abstract":"In robotics and computer vision, point set registration is necessary in many tasks, for example in estimating the motion of a sensor/sensors between subsequent scans containing point/feature sets. Currently, the Iterated Closest Point (ICP) method and its variants have been presented as possible solutions to this problem. However most of these methods lack robustness when random spatial and detection errors are present. This is because ICP methods typically use an L2 metric as part of their optimization criteria, which is unable to penalize cardinality errors. Therefore, this article presents a registration technique based on the multi-object Optimal Sub-Pattern Assignment (OSPA) and Cardinalized Optimal Linear Assignment (COLA) metrics, which penalize data differences based on both cardinality and spatial errors. This allows scan registration to take place in the presence of both inter-scan translation and orientation as well as detection errors.","PeriodicalId":410094,"journal":{"name":"2017 International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Control, Automation and Information Sciences (ICCAIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAIS.2017.8217584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In robotics and computer vision, point set registration is necessary in many tasks, for example in estimating the motion of a sensor/sensors between subsequent scans containing point/feature sets. Currently, the Iterated Closest Point (ICP) method and its variants have been presented as possible solutions to this problem. However most of these methods lack robustness when random spatial and detection errors are present. This is because ICP methods typically use an L2 metric as part of their optimization criteria, which is unable to penalize cardinality errors. Therefore, this article presents a registration technique based on the multi-object Optimal Sub-Pattern Assignment (OSPA) and Cardinalized Optimal Linear Assignment (COLA) metrics, which penalize data differences based on both cardinality and spatial errors. This allows scan registration to take place in the presence of both inter-scan translation and orientation as well as detection errors.
基于多目标度量的点集配准
在机器人和计算机视觉中,点集配准在许多任务中是必要的,例如在估计传感器/传感器在包含点/特征集的后续扫描之间的运动。目前,迭代最近点(ICP)方法及其变体已被提出作为该问题的可能解决方案。然而,当存在随机空间误差和检测误差时,这些方法大多缺乏鲁棒性。这是因为ICP方法通常使用L2度量作为其优化标准的一部分,这无法惩罚基数错误。因此,本文提出了一种基于多目标最优子模式分配(OSPA)和基数化最优线性分配(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学术官方微信