Real-time stereo matching using orthogonal reliability-based dynamic programming
Department of Math and Computer Science, Laurentian University, Sudbury, ON P3E 2C6 Canada
IEEE transactions on image processing : a publication of the IEEE Signal Processing Society, Vol. 16, No. 3. (March 2007), pp. 879-884.
@article{gong2007real,
title={Real-time stereo matching using orthogonal reliability-based dynamic programming},
author={Gong, M. and Yang, Y.H.},
journal={Image Processing, IEEE Transactions on},
volume={16},
number={3},
pages={879–884},
issn={1057-7149},
year={2007},
publisher={IEEE}
}
A novel algorithm is presented in this paper for estimating reliable stereo matches in real time. Based on the dynamic programming-based technique we previously proposed, the new algorithm can generate semi-dense disparity maps using as few as two dynamic programming passes. The iterative best path tracing process used in traditional dynamic programming is replaced by a local minimum searching process, making the algorithm suitable for parallel execution. Most computations are implemented on programmable graphics hardware, which improves the processing speed and makes real-time estimation possible. The experiments on the four new Middlebury stereo datasets show that, on an ATI Radeon X800 card, the presented algorithm can produce reliable matches for 60% approximately 80% of pixels at the rate of 10 approximately 20 frames per second. If needed, the algorithm can be configured for generating full density disparity maps.
January 8, 2011 by hgpu
