GMS: Grid-Based Motion Statistics for Fast, Ultra-Robust Feature Correspondence
2017pp. 2828–2837
Citations Over TimeTop 1% of 2017 papers
Abstract
Incorporating smoothness constraints into feature matching is known to enable ultra-robust matching. However, such formulations are both complex and slow, making them unsuitable for video applications. This paper proposes GMS (Grid-based Motion Statistics), a simple means of encapsulating motion smoothness as the statistical likelihood of a certain number of matches in a region. GMS enables translation of high match numbers into high match quality. This provides a real-time, ultra-robust correspondence system. Evaluation on videos, with low textures, blurs and wide-baselines show GMS consistently out-performs other real-time matchers and can achieve parity with more sophisticated, much slower techniques.
Related Papers
- → A PSO-Neural Network-Based Feature Matching Approach in Data Integration(2015)8 cited
- An Emitter Matching Algorithm with Incomplete Feature Observations(2010)
- → A Brief Introduction of Feature Matching(2008)3 cited
- A STUDY OF THE DYNAMIC DEM MATCHING METHOD(2002)
- → Deep Global and Local Matching Network for Implicit Recommendation(2023)