{"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}
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.