DeepMatching: Hierarchical Deformable Dense Matching - LEAR
Pré-Publication, Document De Travail Année : 2015

DeepMatching: Hierarchical Deformable Dense Matching

Résumé

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.
Fichier principal
Vignette du fichier
paper.pdf (9.24 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01148432 , version 1 (04-06-2015)
hal-01148432 , version 2 (08-10-2015)
hal-01148432 , version 3 (31-05-2016)

Identifiants

Citer

Jerome Revaud, Philippe Weinzaepfel, Zaid Harchaoui, Cordelia Schmid. DeepMatching: Hierarchical Deformable Dense Matching. 2015. ⟨hal-01148432v2⟩

Collections

LJK_GI_LEAR
3087 Consultations
9281 Téléchargements

Altmetric

Partager

More