Match propagation for image-based modeling and rendering

This paper presents a quasi-dense matching algorithm between images based on the 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 matchi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence Vol. 24; no. 8; pp. 1140 - 1146
Main Authors: Lhuillier, M., Long Quan
Format: Journal Article
Language:English
Published: New York IEEE 01.08.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Subjects:
Algorithms
Computer Science
Computer vision
Computer Vision and Pattern Recognition
Image reconstruction
Intelligence
Interpolation
Layout
Matching
Pattern analysis
Pixel
Reconstruction algorithms
Rendering
Rendering (computer graphics)
Robustness
Stereo vision
Strategy
Tensile stress
Uniqueness
quasi-dense matching
stereo vision
image-based modeling and rendering
occlusions
ISSN:0162-8828, 1939-3539
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a quasi-dense matching algorithm between images based on the 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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0162-8828
1939-3539
DOI:10.1109/TPAMI.2002.1023810