Gms: Grid-Based Motion Statistics For Fast, Ultra-Robust Feature Correspondence

2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR)(2017)

引用 690|浏览16
暂无评分
摘要
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.
更多
查看译文
关键词
feature matching,video applications,motion smoothness,statistical likelihood,GMS consistently out-performs,smoothness constraints,grid-based motion statistics,ultrarobust matching,ultrarobust feature correspondence
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要