Real-Time Stereo Matching Using Orthogonal Reliability-Based Dynamic Programming

  • Authors:
  • Minglun Gong;Yee-Hong Yang

  • Affiliations:
  • Dept. of Math & Comput. Sci., Laurentian Univ., Sudbury, Ont.;-

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

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% ~ 80% of pixels at the rate of 10 ~ 20 frames per second. If needed, the algorithm can be configured for generating full density disparity maps