Match Propagation for Image-Based Modeling and Rendering - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Pattern Analysis and Machine Intelligence Année : 2002

Match Propagation for Image-Based Modeling and Rendering

Résumé

This paper presents a quasi-dense matching algorithm between images based on match propagation principle. The algorithm starts from a set of sparse seed matches, then propagates to the neighboring pixels by the best-first strategy, and produces a quasi-dense disparity map. The quasi-dense matching aims at broad modeling and visualization applications which rely heavily on matching information. Our algorithm is robust to initial sparse match outliers due to the best-first strategy; It is efficient in time and space as it is only output sensitive; It handles half-occluded areas because of the simultaneous enforcement of newly introduced discrete 2D gradient disparity limit and the uniqueness constraint. The properties of the algorithm are discussed and empirically demonstrated. The quality of quasi-dense matching are validated through intensive real examples.
Fichier principal
Vignette du fichier
Pami02.pdf (1.02 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00118524 , version 1 (05-12-2006)

Identifiants

  • HAL Id : hal-00118524 , version 1

Citer

Maxime Lhuillier, Long Quan. Match Propagation for Image-Based Modeling and Rendering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 24, p. 1140-1146. ⟨hal-00118524⟩

Collections

PRES_CLERMONT CNRS
506 Consultations
1003 Téléchargements

Partager

Gmail Facebook X LinkedIn More