Match Propagation for Image-Based Modeling and Rendering

Abstract : 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.
Type de document :
Article dans une revue
IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2002, 24, p. 1140-1146
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00118524
Contributeur : Maxime Lhuillier <>
Soumis le : mardi 5 décembre 2006 - 15:51:41
Dernière modification le : mardi 9 octobre 2018 - 09:44:15
Document(s) archivé(s) le : mardi 6 avril 2010 - 23:50:50

Fichiers

Pami02.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00118524, version 1

Citation

Maxime Lhuillier, Long Quan. Match Propagation for Image-Based Modeling and Rendering. IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2002, 24, p. 1140-1146. 〈hal-00118524〉

Partager

Métriques

Consultations de la notice

351

Téléchargements de fichiers

932