arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.02619cs.CV
收藏

MODS:一种快速鲁棒的两视图匹配方法

MODS: Fast and Robust Method for Two-View Matching

Czech Technical University in Prague(捷克布拉格技术大学)

Dmytro Mishkin, Jiri Matas, Michal Perdoch

摘要:

提出了一种新的宽基线匹配算法-- MODS算法的实验表明,以解决更广泛的宽基线问题比最先进的,同时几乎一样快的标准匹配简单的问题。通过使用逐渐更耗时的特征检测器和按需生成合成图像来巧妙地处理明显的鲁棒性与速度的权衡,所述合成图像被执行直到获得可靠的几何估计。我们介绍了一种改进的方法,尝试对应选择,适用于和没有视图合成。对标准的第一至第二最近距离规则的修改在没有额外计算成本的情况下将正确匹配的数量增加了5-20%。MODS算法的性能进行了评估,在几个标准的公开数据集,并在一组新的几何挑战性的宽基线问题,是公开的地面真相。实验表明,MODS在鲁棒性和速度方面优于现有技术。此外,MODS在其他类别的困难的两视图问题上表现良好,例如来自不同模态的图像的匹配,具有宽的时间基线或具有显著的照明变化。

英文摘要:

A novel algorithm for wide-baseline matching called MODS - Matching On Demand with view Synthesis - is presented. The MODS algorithm is experimentally shown to solve a broader range of wide-baseline problems than the state of the art while being nearly as fast as standard matchers on simple problems. The apparent robustness vs. speed trade-off is finessed by the use of progressively more time-consuming feature detectors and by on-demand generation of synthesized images that is performed until a reliable estimate of geometry is obtained. We introduce an improved method for tentative correspondence selection, applicable both with and without view synthesis. A modification of the standard first to second nearest distance rule increases the number of correct matches by 5-20% at no additional computational cost. Performance of the MODS algorithm is evaluated on several standard publicly available datasets, and on a new set of geometrically challenging wide baseline problems that is made public together with the ground truth. Experiments show that the MODS outperforms the state-of-the-art in robustness and speed. Moreover, MODS performs well on other classes of difficult two-view problems like matching of images from different modalities, with wide temporal baseline or with significant lighting changes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑