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 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.