基于自适应ORB的视觉机器人导航鲁棒特征匹配

Chao Sun, Nianzu Qiao, Jia Sun
{"title":"基于自适应ORB的视觉机器人导航鲁棒特征匹配","authors":"Chao Sun, Nianzu Qiao, Jia Sun","doi":"10.1109/YAC53711.2021.9486546","DOIUrl":null,"url":null,"abstract":"Feature matching technology is one important part for a vision navigation system to estimate robot pose according to natural landmarks. However, it is difficult for the existing techniques to solve the dilemma between accuracy, and efficiency, as well as the robustness under a complex workspace involving non-uniform illumination and texture-less. To address this issue, this paper proposes a novel feature matching algorithm that is robust, accuracy, and relatively fast in complex workspaces. The main idea of the proposed method is a multi-stage matching module consisting of K Nearest Neighbor, Threshold Filtering, Eigenvector Norm, and Random Sample Consensus (KNN-TF-EN-RANSAC) to eliminate mismatches for retaining the optimal matches. Meanwhile, the proposed matching module is computed on adaptive Oriented fast and Rotated Brief (ORB) features extracted by a variable extraction radius. Finally, extensive experiments demonstrate the robustness, accuracy, and real-time performance of the proposed method.","PeriodicalId":107254,"journal":{"name":"2021 36th Youth Academic Annual Conference of Chinese Association of Automation (YAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Robust Feature Matching Based on Adaptive ORB for Vision-based Robot Navigation\",\"authors\":\"Chao Sun, Nianzu Qiao, Jia Sun\",\"doi\":\"10.1109/YAC53711.2021.9486546\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Feature matching technology is one important part for a vision navigation system to estimate robot pose according to natural landmarks. However, it is difficult for the existing techniques to solve the dilemma between accuracy, and efficiency, as well as the robustness under a complex workspace involving non-uniform illumination and texture-less. To address this issue, this paper proposes a novel feature matching algorithm that is robust, accuracy, and relatively fast in complex workspaces. The main idea of the proposed method is a multi-stage matching module consisting of K Nearest Neighbor, Threshold Filtering, Eigenvector Norm, and Random Sample Consensus (KNN-TF-EN-RANSAC) to eliminate mismatches for retaining the optimal matches. Meanwhile, the proposed matching module is computed on adaptive Oriented fast and Rotated Brief (ORB) features extracted by a variable extraction radius. Finally, extensive experiments demonstrate the robustness, accuracy, and real-time performance of the proposed method.\",\"PeriodicalId\":107254,\"journal\":{\"name\":\"2021 36th Youth Academic Annual Conference of Chinese Association of Automation (YAC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 36th Youth Academic Annual Conference of Chinese Association of Automation (YAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YAC53711.2021.9486546\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 36th Youth Academic Annual Conference of Chinese Association of Automation (YAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YAC53711.2021.9486546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

特征匹配技术是视觉导航系统根据自然地标估计机器人姿态的重要组成部分。然而,现有技术很难解决精度和效率之间的困境,以及在非均匀光照和无纹理的复杂工作空间下的鲁棒性。为了解决这一问题,本文提出了一种新的特征匹配算法,该算法在复杂的工作空间中具有鲁棒性、准确性和相对快速的特点。该方法的主要思想是一个由K近邻、阈值滤波、特征向量范数和随机样本一致性(KNN-TF-EN-RANSAC)组成的多阶段匹配模块,以消除不匹配以保留最优匹配。同时,根据可变提取半径提取的自适应定向快速旋转轮廓(ORB)特征计算匹配模块。最后,大量的实验证明了该方法的鲁棒性、准确性和实时性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust Feature Matching Based on Adaptive ORB for Vision-based Robot Navigation
Feature matching technology is one important part for a vision navigation system to estimate robot pose according to natural landmarks. However, it is difficult for the existing techniques to solve the dilemma between accuracy, and efficiency, as well as the robustness under a complex workspace involving non-uniform illumination and texture-less. To address this issue, this paper proposes a novel feature matching algorithm that is robust, accuracy, and relatively fast in complex workspaces. The main idea of the proposed method is a multi-stage matching module consisting of K Nearest Neighbor, Threshold Filtering, Eigenvector Norm, and Random Sample Consensus (KNN-TF-EN-RANSAC) to eliminate mismatches for retaining the optimal matches. Meanwhile, the proposed matching module is computed on adaptive Oriented fast and Rotated Brief (ORB) features extracted by a variable extraction radius. Finally, extensive experiments demonstrate the robustness, accuracy, and real-time performance of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信