Stereo Matching with Reliable Disparity Propagation
In this paper, we propose a novel propagation-based stereo matching algorithm. Starting from an initial disparity map, our algorithm selects highly reliable pixels and propagates their disparities along the scan line to produce dense disparity results. The key idea is to construct a line segment reg...
Saved in:
Published in | 2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission pp. 132 - 139 |
---|---|
Main Authors | , , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.05.2011
|
Subjects | |
Online Access | Get full text |
ISBN | 1612844294 9781612844299 |
ISSN | 1550-6185 |
DOI | 10.1109/3DIMPVT.2011.24 |
Cover
Summary: | In this paper, we propose a novel propagation-based stereo matching algorithm. Starting from an initial disparity map, our algorithm selects highly reliable pixels and propagates their disparities along the scan line to produce dense disparity results. The key idea is to construct a line segment region for each pixel with local color and connectivity constraints. The pixel wise line segments are efficiently used to compute initial disparities, select reliable pixels and determine proper propagation regions. Streaking artifacts are effectively removed in a refinement process. Experimental results demonstrate the performance of the proposed method: it ranks 5th in the Middlebury benchmark, and the results can be computed within a few seconds. |
---|---|
ISBN: | 1612844294 9781612844299 |
ISSN: | 1550-6185 |
DOI: | 10.1109/3DIMPVT.2011.24 |