mlsanityData to 7 Oct 2026

An Error-Matching Exclusion Method for Accelerating Visual SLAM

arXiv 2402.14345 ↗First posted 22 Feb 2024cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 2 of its 20 references that are in the map. First posted on arXiv 22 Feb 2024.

Builds on

2 of 20 references.

References · 2

  1. 2018DynaSLAM: Tracking, Mapping and Inpainting in Dynamic Scenescited by 130
  2. 2019GCNv2: Efficient Correspondence Prediction for Real-Time SLAMcited by 19

Built on by

Not cited yet.