Robust Dense Matching Using Local and Global Geometric Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

Robust Dense Matching Using Local and Global Geometric Constraints

Résumé

A new robust dense matching algorithm is introduced. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed with the best first strategy to dense matching. Next, the matching map is regularised by using the local geometric constraints encoded by planar affine applications and by using the global geometric constraint encoded by the fundamental matrix. Two most distinctive features are a match propagation strategy developed by analogy to region growing and a successive regularisation by local and global geometric constraints. The algorithm is efficient, robust and can cope with wide disparity. The algorithm is demonstrated on many real image pairs, and applications on image interpolation and a creation of novel views are also presented.
Fichier principal
Vignette du fichier
Icpr00.pdf (395.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00590140 , version 1 (03-05-2011)

Identifiants

Citer

Maxime Lhuillier, Long Quan. Robust Dense Matching Using Local and Global Geometric Constraints. 15th International Conference on Pattern Recognition (ICPR '00), Sep 2000, Barcelona, Spain. pp.968--972, ⟨10.1109/ICPR.2000.905620⟩. ⟨inria-00590140⟩
114 Consultations
663 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More