视觉扫描匹配的自适应迭代最接近SURF,在视觉里程计中的应用

A. Nemra, S. Slimani, M. Bouhamidi, A. Bouchloukh, A. Bazoula
{"title":"视觉扫描匹配的自适应迭代最接近SURF,在视觉里程计中的应用","authors":"A. Nemra, S. Slimani, M. Bouhamidi, A. Bouchloukh, A. Bazoula","doi":"10.1109/ICOSC.2013.6750968","DOIUrl":null,"url":null,"abstract":"Laser scan-matching is frequently used for mobile robot mapping and localization. This paper presents a scan-matching approach, based, instead on visual information from a stereo system. The Speeded Up Robust Feature (SURF) is used together with optimization tools constraints to get high matching precision between the stereo images. Calculating the 3D position of the corresponding points in the world results in a visual scan where each point has a descriptor attached to it. These descriptors can be used to associate scans observed from different positions. Just like in the work with laser based scan matching a map can be defined as a set of reference scans and their corresponding acquisition point. In this paper a robust Visual odometry and 3D reconstruction algorithm based on Adaptive Iterative Closest SURF for scan matching is proposed. This algorithm combine the robustness of SURF to detect and match good features and the accuracy an Adaptive ICP algorithm in which, the 3D point are weighted with their inverse depth to give more importance for near points. The proposed algorithm is validated and compared with two other optimization techniques based on Singular Values Decomposition (SVD) and Quaternion. Experimental results using Pioneer 3AT demonstrate that our algorithm can work robustly in indoor and outdoor environments and produce accurate results in static environments.","PeriodicalId":199135,"journal":{"name":"3rd International Conference on Systems and Control","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Adaptive Iterative Closest SURF for visual scan matching, application to Visual odometry\",\"authors\":\"A. Nemra, S. Slimani, M. Bouhamidi, A. Bouchloukh, A. Bazoula\",\"doi\":\"10.1109/ICOSC.2013.6750968\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Laser scan-matching is frequently used for mobile robot mapping and localization. This paper presents a scan-matching approach, based, instead on visual information from a stereo system. The Speeded Up Robust Feature (SURF) is used together with optimization tools constraints to get high matching precision between the stereo images. Calculating the 3D position of the corresponding points in the world results in a visual scan where each point has a descriptor attached to it. These descriptors can be used to associate scans observed from different positions. Just like in the work with laser based scan matching a map can be defined as a set of reference scans and their corresponding acquisition point. In this paper a robust Visual odometry and 3D reconstruction algorithm based on Adaptive Iterative Closest SURF for scan matching is proposed. This algorithm combine the robustness of SURF to detect and match good features and the accuracy an Adaptive ICP algorithm in which, the 3D point are weighted with their inverse depth to give more importance for near points. The proposed algorithm is validated and compared with two other optimization techniques based on Singular Values Decomposition (SVD) and Quaternion. Experimental results using Pioneer 3AT demonstrate that our algorithm can work robustly in indoor and outdoor environments and produce accurate results in static environments.\",\"PeriodicalId\":199135,\"journal\":{\"name\":\"3rd International Conference on Systems and Control\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"3rd International Conference on Systems and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOSC.2013.6750968\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"3rd International Conference on Systems and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOSC.2013.6750968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

激光扫描匹配是移动机器人测绘和定位的常用方法。本文提出了一种基于立体视觉信息的扫描匹配方法。采用加速鲁棒特征(SURF)和优化工具约束相结合的方法,提高了立体图像的匹配精度。计算世界中相应点的3D位置会产生视觉扫描,其中每个点都附加了一个描述符。这些描述符可用于关联从不同位置观察到的扫描。就像在与激光扫描匹配的工作中一样,地图可以定义为一组参考扫描和它们对应的采集点。本文提出了一种基于自适应迭代最近邻SURF的鲁棒视觉里程测量和三维重建算法。该算法结合了SURF算法对良好特征的鲁棒性和自适应ICP算法的精度,该算法对三维点进行逆深度加权,对近点给予更多的重视。并与基于奇异值分解(SVD)和四元数的优化方法进行了比较。基于Pioneer 3AT的实验结果表明,该算法在室内和室外环境下都能稳定工作,在静态环境下也能产生准确的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Adaptive Iterative Closest SURF for visual scan matching, application to Visual odometry
Laser scan-matching is frequently used for mobile robot mapping and localization. This paper presents a scan-matching approach, based, instead on visual information from a stereo system. The Speeded Up Robust Feature (SURF) is used together with optimization tools constraints to get high matching precision between the stereo images. Calculating the 3D position of the corresponding points in the world results in a visual scan where each point has a descriptor attached to it. These descriptors can be used to associate scans observed from different positions. Just like in the work with laser based scan matching a map can be defined as a set of reference scans and their corresponding acquisition point. In this paper a robust Visual odometry and 3D reconstruction algorithm based on Adaptive Iterative Closest SURF for scan matching is proposed. This algorithm combine the robustness of SURF to detect and match good features and the accuracy an Adaptive ICP algorithm in which, the 3D point are weighted with their inverse depth to give more importance for near points. The proposed algorithm is validated and compared with two other optimization techniques based on Singular Values Decomposition (SVD) and Quaternion. Experimental results using Pioneer 3AT demonstrate that our algorithm can work robustly in indoor and outdoor environments and produce accurate results in static environments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信