Sciweavers

Share
IJCV
2002

A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming

8 years 10 months ago
A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost functions are compared. The algorithm achieves a tremendous gain in speed and memory requirements by implementing it hierarchically. The images are downsampled an optimal number of times and the disparity map of a lower level is used as 'offset' disparity map at a higher level. An important contribution consists of the complexity analysis of the algorithm. It is shown that this complexity is independent of the disparityrange. This result is also used to determine the optimal number of downsample levels. This speed gain results in the ability to use more complex (compute intensive) cost functions that deliver high quality disparity maps. Another advantage of this algorithm is that cost functions can be chosen independent of the optimisation algorithm. The algorithm in this paper is symmetric, i.e. exact...
G. Van Meerbergen, Maarten Vergauwen, Marc Pollefe
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where IJCV
Authors G. Van Meerbergen, Maarten Vergauwen, Marc Pollefeys, Luc J. Van Gool
Comments (0)
books