GMS: Grid-based motion statistics for fast, ultra-robust feature correspondence
Proceedings of the IEEE conference on computer vision and …, 2017•openaccess.thecvf.com
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 …
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 …
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.
openaccess.thecvf.com
Showing the best result for this search. See all results