RANSAC Back to SOTA: A Two-Stage Consensus Filtering for Real-Time 3D Registration

IF 4.6 2区 计算机科学 Q2 ROBOTICS IEEE Robotics and Automation Letters Pub Date : 2024-11-19 DOI:10.1109/LRA.2024.3502056
Pengcheng Shi;Shaocheng Yan;Yilin Xiao;Xinyi Liu;Yongjun Zhang;Jiayuan Li
{"title":"RANSAC Back to SOTA: A Two-Stage Consensus Filtering for Real-Time 3D Registration","authors":"Pengcheng Shi;Shaocheng Yan;Yilin Xiao;Xinyi Liu;Yongjun Zhang;Jiayuan Li","doi":"10.1109/LRA.2024.3502056","DOIUrl":null,"url":null,"abstract":"Correspondence-based point cloud registration (PCR) plays a key role in robotics and computer vision. However, challenges like sensor noises, object occlusions, and descriptor limitations inevitably result in numerous outliers. RANSAC family is the most popular outlier removal solution. However, the requisite iterations escalate exponentially with the outlier ratio, rendering it far inferior to existing methods (SC2PCR [Chen et al., 2022], MAC [Zhang et al., 2023], etc.) in terms of accuracy or speed. Thus, we propose a two-stage consensus filtering (TCF) that elevates RANSAC to state-of-the-art (SOTA) speed and accuracy. Firstly, one-point RANSAC obtains a consensus set based on length consistency. Subsequently, two-point RANSAC refines the set via angle consistency. Then, three-point RANSAC computes a coarse pose and removes outliers based on transformed correspondence's distances. Drawing on optimizations from one-point and two-point RANSAC, three-point RANSAC requires only a few iterations. Eventually, an iterative reweighted least squares (IRLS) is applied to yield the optimal pose. Experiments on the large-scale KITTI and ETH datasets demonstrate our method achieves up to three-orders-of-magnitude speedup compared to MAC while maintaining registration accuracy and recall.","PeriodicalId":13241,"journal":{"name":"IEEE Robotics and Automation Letters","volume":"9 12","pages":"11881-11888"},"PeriodicalIF":4.6000,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Robotics and Automation Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10758239/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 0

Abstract

Correspondence-based point cloud registration (PCR) plays a key role in robotics and computer vision. However, challenges like sensor noises, object occlusions, and descriptor limitations inevitably result in numerous outliers. RANSAC family is the most popular outlier removal solution. However, the requisite iterations escalate exponentially with the outlier ratio, rendering it far inferior to existing methods (SC2PCR [Chen et al., 2022], MAC [Zhang et al., 2023], etc.) in terms of accuracy or speed. Thus, we propose a two-stage consensus filtering (TCF) that elevates RANSAC to state-of-the-art (SOTA) speed and accuracy. Firstly, one-point RANSAC obtains a consensus set based on length consistency. Subsequently, two-point RANSAC refines the set via angle consistency. Then, three-point RANSAC computes a coarse pose and removes outliers based on transformed correspondence's distances. Drawing on optimizations from one-point and two-point RANSAC, three-point RANSAC requires only a few iterations. Eventually, an iterative reweighted least squares (IRLS) is applied to yield the optimal pose. Experiments on the large-scale KITTI and ETH datasets demonstrate our method achieves up to three-orders-of-magnitude speedup compared to MAC while maintaining registration accuracy and recall.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于对应关系的点云注册(PCR)在机器人学和计算机视觉领域发挥着关键作用。然而,传感器噪声、物体遮挡和描述符限制等挑战不可避免地会产生大量异常值。RANSAC 系列是最流行的异常值去除解决方案。然而,随着离群值比例的增加,所需的迭代次数也呈指数级上升,因此在准确性和速度上都远远不如现有的方法(SC2PCR [Chen 等人,2022 年]、MAC [Zhang 等人,2023 年]等)。因此,我们提出了一种两阶段共识滤波(TCF)方法,将 RANSAC 的速度和准确性提升到最先进的水平(SOTA)。首先,单点 RANSAC 根据长度一致性获得共识集。随后,两点式 RANSAC 通过角度一致性改进集合。然后,三点 RANSAC 计算粗略姿态,并根据变换后的对应距离去除异常值。借鉴一点式和两点式 RANSAC 的优化,三点式 RANSAC 只需几次迭代。最终,应用迭代加权最小二乘法(IRLS)得出最佳姿态。在大规模 KITTI 和 ETH 数据集上的实验表明,与 MAC 相比,我们的方法在保持注册准确性和召回率的同时,速度提高了三个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Robotics and Automation Letters
IEEE Robotics and Automation Letters Computer Science-Computer Science Applications
CiteScore
9.60
自引率
15.40%
发文量
1428
期刊介绍: The scope of this journal is to publish peer-reviewed articles that provide a timely and concise account of innovative research ideas and application results, reporting significant theoretical findings and application case studies in areas of robotics and automation.
期刊最新文献
Correction To: “Design Models and Performance Analysis for a Novel Shape Memory Alloy-Actuated Wearable Hand Exoskeleton for Rehabilitation” NavTr: Object-Goal Navigation With Learnable Transformer Queries GSFusion: Online RGB-D Mapping Where Gaussian Splatting Meets TSDF Fusion RANSAC Back to SOTA: A Two-Stage Consensus Filtering for Real-Time 3D Registration Sim-to-Real Transfer of Automatic Extinguishing Strategy for Firefighting Robots
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1