Advertisement

An Experimental Comparison of Stereo Algorithms

  • Richard Szeliski
  • Ramin Zabih
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1883)

Abstract

While many algorithms for computing stereo correspondence have been proposed, there has been very little work on experimentally evaluating algorithm performance, especially using real (rather than synthetic) imagery. In this paper we propose an experimental comparison of several different stereo algorithms. We use real imagery, and explore two different methodologies, with different strengths and weaknesses. Our first methodology is based upon manual computation of dense ground truth. Here we make use of a two stereo pairs: one of these, from the University of Tsukuba, contains mostly fronto-parallel surfaces; while the other, which we built, is a simple scene with a slanted surface. Our second methodology uses the notion of prediction error, which is the ability of a disparity map to predict an (unseen) third image, taken from a known camera position with respect to the input pair. We present results for both correlation-style stereo algorithms and techniques based on global methods such as energy minimization. Our experiments suggest that the two methodologies give qualitatively consistent results. Source images and additional materials, such as the implementations of various algorithms, are available on the web from http://www.research.microsoft.com/~szeliski/stereo.

Keywords

Prediction Error Ground Truth Stereo Match Stereo Algorithm Occlude Pixel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H.H. Baker and T.O. Binford. Depth from edge and intensity based stereo. In IJCAI81, pages 631–636, 1981.Google Scholar
  2. 2.
    Stephen Barnard. Stochastic stereo matching over scale. International Journal of Computer Vision, 3(1):17–32, 1989.CrossRefMathSciNetGoogle Scholar
  3. 3.
    J.L Barron, D.J. Fleet, and S.S. Beauchemin. Performance of optical flow techniques. International Journal of Computer Vision, 12(1):43–77, February 1994.Google Scholar
  4. 4.
    P. N. Belhumeur and D. Mumford. A Bayesian treatment of the stereo correspondence problem using half-occluded regions. In Computer Vision and Pattern Recognition, pages 506–512, Champaign-Urbana, Illinois, 1992.Google Scholar
  5. 5.
    Michael Black and P. Anandan. A framework for the robust estimation of optical flow. In 4th International Conference on Computer Vision, pages 231–236, 1993.Google Scholar
  6. 6.
    Andrew Blake. Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(1):2–12, January 1989.Google Scholar
  7. 7.
    Yuri Boykov, Olga Veksler, and Ramin Zabih. Fast approximate energy minimization via graph cuts. In Seventh International Conference on Computer Vision (ICCV’99), pages 377–384, Kerkyra, Greece, September 1999.Google Scholar
  8. 8.
    Lisa Brown. A survey of image registration techniques. ACM Computing Surveys, 24(4):325–376, December 1992.Google Scholar
  9. 9.
    I. Cox, S. Hingorani, S. Rao, and B. Maggs. A maximum likelihood stereo algorithm. Computer Vision, Graphics and Image Processing, 63(3):542–567, 1996.CrossRefGoogle Scholar
  10. 10.
    U. Dhond and J. Aggarwal. Structure from stereo — a review. IEEE Transactions on Systems, Man and Cybernetics, 19(6), 1989.Google Scholar
  11. 11.
    Davi Geiger and Federico Girosi. Parallel and deterministic algorithms from MRF’s: Surface reconstruction. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(5):401–412, May 1991.Google Scholar
  12. 12.
    S. Geman and D. Geman. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6:721–741, 1984.zbMATHGoogle Scholar
  13. 13.
    Y. C. Hsieh, D. McKeown, and F. P. Perlant. Performance evaluation of scene registration and stereo matching for cartographic feature extraction. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2):214–238, February 1992.Google Scholar
  14. 14.
    S. S. Intille and A. F. Bobick. Disparity-space images and large occlusion stereo. In Proc. Third European Conference on Computer Vision (ECCV’94), volume 1, Stockholm, Sweden, May 1994. Springer-Verlag.Google Scholar
  15. 15.
    H. Ishikawa and D. Geiger. Occlusions, discontinuities, and epipolar lines in stereo. In Fifth European Conference on Computer Vision (ECCV’98), pages 332–248, Freiburg, Germany, June 1998. Springer-Verlag.Google Scholar
  16. 16.
    Y. G. Leclerc, Q.-T. Luong, and P. Fua. Self-consistency: A novel approach to characterizing the accuracy and reliability of point correspondence algorithms. In DARPA Image Understanding Workshop, Monterey, California, November 1998.Google Scholar
  17. 17.
    Peter Rousseeuw and Annick Leroy. Robust Regression and Outlier Detection. New York: Wiley, 1987.zbMATHGoogle Scholar
  18. 18.
    S. Roy and I. J. Cox. A maximum-flow formulation of the n-camera stereo correspondence problem. In Sixth International Conference on Computer Vision (ICCV’98), pages 492–499, Bombay, January 1998.Google Scholar
  19. 19.
    D. Scharstein and R. Szeliski. Stereo matching with nonlinear diffusion. International Journal of Computer Vision, 28(2):155–174, July 1998.Google Scholar
  20. 20.
    R. Szeliski. Prediction error as a quality metric for motion and stereo. In Seventh International Conference on Computer Vision (ICCV’99), pages 781–788, Kerkyra, Greece, September 1999.Google Scholar
  21. 21.
    Olga Veksler. Efficient Graph-based Energy Minimization Methods in Computer Vision. PhD thesis, Cornell University, July 1999.Google Scholar
  22. 22.
    G. Wolberg and T. Pavlidis. Restoration of binary images using stochastic relaxation with annealing. Pattern Recognition Letters, 3:375–388, 1985.CrossRefGoogle Scholar
  23. 23.
    Charles Zitnick and Takeo Kanade. A cooperative algorithm for stereo matching and occlusion detection. Technical Report CMU-RI-TR-99-35, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, October 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Richard Szeliski
    • 1
  • Ramin Zabih
    • 2
  1. 1.Microsoft ResearchRedmond
  2. 2.Cornell UniversityIthaca

Personalised recommendations