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 down sampled 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 disparity range. This result is also used to determine the-optimal number of down sample 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. Finally, the algorithm was carefully implemented so that a minimal amount of memory is used. It has proven its efficiency on large images with a high disparity range as well as its quality. Examples are given in this paper.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A hierarchical stereo algorithm using dynamic programming


    Contributors:


    Publication date :

    2001-01-01


    Size :

    783603 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Hierarchical Stereo Algorithm Using Dynamic Programming

    Van Meerbergen, G. / Vergauwen, M. / Pollefeys, M. et al. | British Library Conference Proceedings | 2001


    A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming

    Van Meerbergen, G. / Vergauwen, M. / Pollefeys, M. et al. | British Library Online Contents | 2002


    Dense stereo using pivoted dynamic programming

    Torr, P. H. / Criminisi, A. | British Library Online Contents | 2004


    A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming

    Deng, Y. / Lin, X. | British Library Conference Proceedings | 2006


    Motion Stereo Matching Using a Modified Dynamic Programming

    Mozerov, M. G. / Kober, V. I. / Ovseyevich, I. A. et al. | British Library Online Contents | 2000