Efficient and Robust Line-based Registration Algorithm for Robot Perception Under Large-scale Structural Scenes

Guang Chen, Yinlong Liu, Jinhu Dong, Lijun Zhang, Haotian Liu, Bo Zhang, Alois Knoll
{"title":"Efficient and Robust Line-based Registration Algorithm for Robot Perception Under Large-scale Structural Scenes","authors":"Guang Chen, Yinlong Liu, Jinhu Dong, Lijun Zhang, Haotian Liu, Bo Zhang, Alois Knoll","doi":"10.1109/ICARM52023.2021.9536185","DOIUrl":null,"url":null,"abstract":"Point cloud registration is a classical problem in advanced robot perception. Despite having been widely studied, the registration of large-scale point clouds still remains challenging in terms of both efficiency and accuracy. In this paper, aiming at the registration in large-scale structural scenes that contains numerous line-features, we propose a line-based efficient and robust registration algorithm for robot perception. Concretely, we first extract lines from point clouds and use the line-features to perform the registration, which decreases the scale of algorithm’s input and decouples the rotation and the translation sub-problems. Consequently, it reduces the complexity of registration problem. We then solve the rotation and translation sub-problems using the branch-and-bound algorithm, which ensures the accuracy and robustness of registration. In translation sub-problem, we propose two strategies to adapt to the registration problem in different scenes, the one is universal algorithm, the other is decoupled algorithm. Extensive experiments are performed on both synthetic and real-world data to demonstrate the advantages of our method.","PeriodicalId":367307,"journal":{"name":"2021 6th IEEE International Conference on Advanced Robotics and Mechatronics (ICARM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 6th IEEE International Conference on Advanced Robotics and Mechatronics (ICARM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARM52023.2021.9536185","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Point cloud registration is a classical problem in advanced robot perception. Despite having been widely studied, the registration of large-scale point clouds still remains challenging in terms of both efficiency and accuracy. In this paper, aiming at the registration in large-scale structural scenes that contains numerous line-features, we propose a line-based efficient and robust registration algorithm for robot perception. Concretely, we first extract lines from point clouds and use the line-features to perform the registration, which decreases the scale of algorithm’s input and decouples the rotation and the translation sub-problems. Consequently, it reduces the complexity of registration problem. We then solve the rotation and translation sub-problems using the branch-and-bound algorithm, which ensures the accuracy and robustness of registration. In translation sub-problem, we propose two strategies to adapt to the registration problem in different scenes, the one is universal algorithm, the other is decoupled algorithm. Extensive experiments are performed on both synthetic and real-world data to demonstrate the advantages of our method.
大规模结构场景下机器人感知的高效鲁棒行配准算法
点云配准是高级机器人感知中的一个经典问题。大尺度点云的配准虽然得到了广泛的研究,但在效率和精度方面仍然存在一定的挑战。本文针对包含大量线特征的大型结构场景的配准问题,提出了一种基于线的高效鲁棒的机器人感知配准算法。具体而言,我们首先从点云中提取直线,并利用直线特征进行配准,从而减小了算法输入的规模,解耦了旋转和平移子问题。从而降低了配准问题的复杂性。然后利用分支定界算法求解旋转和平移子问题,保证了配准的准确性和鲁棒性。在翻译子问题中,我们提出了两种策略来适应不同场景下的配准问题,即通用算法和解耦算法。广泛的实验进行了合成和现实世界的数据,以证明我们的方法的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信