Asosiy kontentga oʻtish
Preprint

An Error-Matching Exclusion Method for Accelerating Visual SLAM

Shaojie ZhangSchool of Artificial Intelligence and Computer Science , Jiangnan University , 1800 Li Lake Avenue , wuxi , 214122 , Jiangsu , PR ChinaYinghui WangEngineering Research Center of Intelligent Technology for Healthcare , Ministry of Education , 1800 Li Lake Avenue , wuxi , 214122 , Jiangsu , PR ChinaJiaxing MaSchool of Artificial Intelligence and Computer Science , Jiangnan University , 1800 Li Lake Avenue , wuxi , 214122 , Jiangsu , PR ChinaLi, WeiSchool of Artificial Intelligence and Computer Science , Jiangnan University , 1800 Li Lake Avenue , wuxi , 214122 , Jiangsu , PR ChinaYang, JinlongSchool of Artificial Intelligence and Computer Science , Jiangnan University , 1800 Li Lake Avenue , wuxi , 214122 , Jiangsu , PR ChinaYan, TaoSchool of Artificial Intelligence and Computer Science , Jiangnan University , 1800 Li Lake Avenue , wuxi , 214122 , Jiangsu , PR ChinaWang, YukaiEngineering Research Center of Intelligent Technology for Healthcare , Ministry of Education , 1800 Li Lake Avenue , wuxi , 214122 , Jiangsu , PR ChinaLiangyi HuangSchool of Computing and Augmented Intelligence , Arizona State University , 1151 S Forest Ave , Tempe , 8528 , AZ , U.SMingfeng WangDepartment of Mechanical and Aerospace Engineering , Brunel University , Kingston Lane , London , UB8 3PH , Middlesex , U.KAtadjanov, Ibragim R.Tashkent University of Information Technologies named after al-Khwarizmi , 108 Amir Temur Avenue , Tashkent , 100084 , , Uzbekistan
2024en
ABI

Annotatsiya

In Visual SLAM, achieving accurate feature matching consumes a significant amount of time, severely impacting the real-time performance of the system. This paper proposes an accelerated method for Visual SLAM by integrating GMS (Grid-based Motion Statistics) with RANSAC (Random Sample Consensus) for the removal of mismatched features. The approach first utilizes the GMS algorithm to estimate the quantity of matched pairs within the neighborhood and ranks the matches based on their confidence. Subsequently, the Random Sample Consensus (RANSAC) algorithm is employed to further eliminate mismatched features. To address the time-consuming issue of randomly selecting all matched pairs, this method transforms it into the problem of prioritizing sample selection from high-confidence matches. This enables the iterative solution of the optimal model. Experimental results demonstrate that the proposed method achieves a comparable accuracy to the original GMS-RANSAC while reducing the average runtime by 24.13% on the KITTI, TUM desk, and TUM doll datasets.

Hali tarjima qilinmagan

Identifikatorlar

Iqtiboslar va manbalar

0 ta iqtibos0 ta foydalanilgan manba