arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1306.3855cs.CV
收藏

两视图匹配与视图合成的再认识

Two-View Matching with View Synthesis Revisited

Czech Technical University in Prague(布拉格捷克理工大学)

Dmytro Mishkin, Michal Perdoch, Jiri Matas

摘要:

宽基线匹配的问题,重点考虑极端的观点变化。我们介绍了使用仿射协变检测器的视图合成来解决这些问题,并表明与Hessian-Affine或MSER检测器的匹配优于最先进的ASIFT。为了最大限度地减少视图合成所造成的速度损失,我们提出了按需匹配视图合成算法(MODS),该算法使用越来越多的合成图像和更多(耗时)的检测器,直到可靠的几何估计是可能的。我们的实验表明,MODS算法解决的问题超出了国家的最先进的,但在速度上是可比的标准宽基线匹配简单的问题。次要的贡献包括一个改进的方法,尝试对应选择,适用于与和没有视图合成和视图合成设置大大提高MSER鲁棒性模糊和规模的变化,增加其运行时间只有10%。

英文摘要:

Wide-baseline matching focussing on problems with extreme viewpoint change is considered. We introduce the use of view synthesis with affine-covariant detectors to solve such problems and show that matching with the Hessian-Affine or MSER detectors outperforms the state-of-the-art ASIFT. To minimise the loss of speed caused by view synthesis, we propose the Matching On Demand with view Synthesis algorithm (MODS) that uses progressively more synthesized images and more (time-consuming) detectors until reliable estimation of geometry is possible. We show experimentally that the MODS algorithm solves problems beyond the state-of-the-art and yet is comparable in speed to standard wide-baseline matchers on simpler problems. Minor contributions include an improved method for tentative correspondence selection, applicable both with and without view synthesis and a view synthesis setup greatly improving MSER robustness to blur and scale change that increase its running time by 10% only.

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

↑