BMVC 2004, Kingston, 7th-9th Sept, 2004

Fast Stereo Matching by Iterated Dynamic Programming and Quadtree Subregioning
S.C. Leung, B. Appleton (The University of Queensland, Australia) and
C. Sun (CSIRO, Australia)

The application of energy minimisation methods for stereo matching has
been demonstrated to produce high quality disparity maps. However the majority
of these methods are known to be computationally expensive, requiring
minutes or even hours of computation. We propose a fast minimisation
scheme that produces strongly competitive results for significantly reduced
computation, requiring only a few seconds of computation. In this paper, we
present our iterated dynamic programming algorithm along with a quadtree
subregioning process for fast stereo matching.
(pdf article)