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

DeepMatching: Hierarchical Deformable Dense Matching

INRIA(法国国家信息与自动化研究所);Inria Grenoble Rhone-Alpes(法国国家信息与自动化研究所格勒诺布尔-罗讷阿尔卑斯分院);Laboratoire Jean Kuntzmann(让·孔茨曼实验室);CNRS(法国国家科学研究中心);Univ. Grenoble Alpes(格勒诺布尔阿尔卑斯大学)

Jerome Revaud, Philippe Weinzaepfel, Zaid Harchaoui, Cordelia Schmid

英文摘要:

We introduce a novel matching algorithm, called DeepMatching, to compute dense correspondences between images. DeepMatching relies on a hierarchical, multi-layer, correlational architecture designed for matching images and was inspired by deep convolutional approaches. The proposed matching algorithm can handle non-rigid deformations and repetitive textures and efficiently determines dense correspondences in the presence of significant changes between images. We evaluate the performance of DeepMatching, in comparison with state-of-the-art matching algorithms, on the Mikolajczyk (Mikolajczyk et al 2005), the MPI-Sintel (Butler et al 2012) and the Kitti (Geiger et al 2013) datasets. DeepMatching outperforms the state-of-the-art algorithms and shows excellent results in particular for repetitive textures.We also propose a method for estimating optical flow, called DeepFlow, by integrating DeepMatching in the large displacement optical flow (LDOF) approach of Brox and Malik (2011). Compared to existing matching algorithms, additional robustness to large displacements and complex motion is obtained thanks to our matching approach. DeepFlow obtains competitive performance on public benchmarks for optical flow estimation.

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

↑