The Community for Technology Leaders
Green Image
Issue No. 06 - June (2005 vol. 27)
ISSN: 0162-8828
pp: 998-1003
Minglun Gong , Dept. of Math. & Comput. Sci., Laurentian Univ., Sudbury, Ont., Canada
An efficient unambiguous stereo matching technique is presented in this paper. Our main contribution is to introduce a new reliability measure to dynamic programming approaches in general. For stereo vision application, the reliability of a proposed match on a scanline is defined as the cost difference between the globally best disparity assignment that includes the match and the globally best assignment that does not include the match. A reliability-based dynamic programming algorithm is derived accordingly, which can selectively assign disparities to pixels when the corresponding reliabilities exceed a given threshold. The experimental results show that the new approach can produce dense (>70 percent of the unoccluded pixels) and reliable (error rate < 0.5 percent) matches efficiently (<0.2 sec on a 2 GHz P4) for the four Middlebury stereo data sets.
Dynamic programming, Stereo vision, Computational efficiency, Heuristic algorithms, Error analysis, Taxonomy, Cost function, Iterative algorithms, Belief propagation

Minglun Gong and Yee-Hong Yang, "Fast unambiguous stereo matching using reliability-based dynamic programming," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 27, no. 6, pp. 998-1003, .
1110 ms
(Ver 3.3 (11022016))