Skip to main content
SpringerLink
Log in

A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming

  • Published:
International Journal of Computer Vision Aims and scope Submit manuscript

Abstract

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. exactly the same matches are found if left and right image are swapped. 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Birchfield, S. 1999. Depth and motion discontinuities. Ph.D. Thesis, Department of Electrical Engineering, Stanford University.

  • Birchfield, S. and Tomasi, C. 1998. Apixel dissimilarity measure that is insensitive to image sampling. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(4):401–406.

    Google Scholar 

  • Birchfield, S. and Tomasi, C. 1999. Depth and motion discontinuities. International Journal of Computer Vision, 35(3):269–293.

    Google Scholar 

  • Boykov, Y., Veksler, O., and Zabih, R. 1999. Fast approximate energy minimization via graph cuts. In Proc. Seventh International Conference on Computer Vision, pp. 377–384.

  • Cox, I., Hingorani, S., and Rao, S. 1996. A maximum likelihood stereo algorithm. Computer Vision and Image Understanding, 63(3).

  • Dhond, U. and Aggarwal, J. 1989. Structure from stereo—A review. IEEE Trans. Syst., Man and Cybern., 19:1489–1510.

    Google Scholar 

  • Falkenhagen, L. 1994. Depth estimation from stereoscopic image pairs assuming piecwise continuous surfaces. In Image Processing for Broadcast and Video Production, Y. Paker and S. Wilbur (Eds.). Springer: Great Britain, pp. 115–127.

    Google Scholar 

  • Falkenhagen, L. 1997. Hierarchical block-based disparity estimation considering neighbourhood constraints. In Proceedings International Workshop on SNHC and 3D Imaging, Rhodes, Greece, pp. 115–122.

  • Hartley, R., Gupta, R., and Chang, T. 1992. Stereo from uncalibrated cameras. In Proc. Conference Computer Vision and Pattern Recognition, pp. 761–764.

  • Intille, S.S. and Bobick, A.F. 1994. Disparity-space images and large occlusion stereo. In Proc. Third European Conference Computer Vision, pp. 179–186.

  • Koch, R. 1996. Automatische oberflachenmodellierung starrer dreidimensionaler Objekte aus stereoskopischen Rundum-Ansichten. Ph.D. Thesis, University of Hannover, Germany. Also published as Fortschritte-Berichte VDI, Reihe 10, Nr. 499, VDI Verlag, 1997.

    Google Scholar 

  • Ohta, Y. and Kanade, T. 1985a. Stereo by intra-and inter-scanline search using dynamic programming. IEEE Trans. on Pattern Analysis and Machine Intelligence, 7(2):139–154.

    Google Scholar 

  • Ohta, Y. and Kanade, T. 1985b. Stereo by intra-and inter-scanline search using dynamic programming. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-7(2):139–154.

    Google Scholar 

  • Okutomi, M. and Kanade, T. 1992. Alocally adaptive windowfor signal processing. International Journal of Computer Vision, 7:143–162.

    Google Scholar 

  • Roy, S. and Cox, I. 1998. A maximum-flow formulation of the N-camera stereo correspondence problem. In Proceedings of the International Conference on Computer Vision, Bombay, India, 1998.

Download references

Author information

Authors and Affiliations

  1. ESAT-PSI, K.U. Leuven, B-3001, Leuven, Belgium

    G. Van Meerbergen, M. Vergauwen, M. Pollefeys & L. Van Gool

Authors
  1. G. Van Meerbergen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Vergauwen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Pollefeys
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. L. Van Gool
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Van Meerbergen, G., Vergauwen, M., Pollefeys, M. et al. A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming. International Journal of Computer Vision 47, 275–285 (2002). https://doi.org/10.1023/A:1014562312225

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014562312225

Search

Navigation