Skip to Main content Skip to Navigation
Conference papers

Robust Dense Matching Using Local and Global Geometric Constraints

Maxime Lhuillier 1 Long Quan 1
1 MOVI - Modeling, localization, recognition and interpretation in computer vision
GRAVIR - IMAG - Graphisme, Vision et Robotique, Inria Grenoble - Rhône-Alpes, CNRS - Centre National de la Recherche Scientifique : FR71
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00590140
Contributor : Team Perception <>
Submitted on : Tuesday, May 3, 2011 - 9:24:56 AM
Last modification on : Friday, June 26, 2020 - 4:04:03 PM
Document(s) archivé(s) le : Thursday, August 4, 2011 - 2:58:32 AM

Files

Icpr00.pdf
Files produced by the author(s)

Identifiers

Collections

IMAG | CNRS | INRIA | UGA

Citation

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⟩

Share

Metrics

Record views

216

Files downloads

723