Advertisement

A Progressive Scheme for Stereo Matching

  • Zhengyou Zhang
  • Ying Shan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2018)

Abstract

Brute-force dense matching is usually not satisfactory because the same search range is used for the entire image, yielding potentially many false matches. In this paper, we propose a progressive scheme for stereo matching which uses two fundamental concepts: the disparity gradient limit principle and the least commitment strategy. The first states that the disparity should vary smoothly almost everywhere, and the disparity gradient should not exceed a certain limit. The second states that we should first select only the most reliable matches and therefore postpone unreliable decisions until enough confidence is accumulated. Our technique starts with a few reliable point matches obtained automatically via feature correspondence or through user input. New matches are progressively added during an iterative matching process. At each stage, the current reliable matches constrain the search range for their neighbors according to the disparity gradient limit, thereby reducing potential matching ambiguities of those neighbors. Only unambiguous matches are selected and added to the set of reliable matches in accordance with the least commitment strategy. In addition, a correlation match measure that allows rotation of the match template is used to provide a more robust estimate. The entire process is cast within a Bayesian inference framework. Experimental results illustrate the robustness of our proposed dense stereo matching approach.

Keywords

Stereo vision Stereo matching Disparity gradient limit Least commitment Progressive matching Bayesian inference Correlation Image registration 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    N. Ayache and B. Faverjon. Efficient registration of stereo images by matching graph descriptions of edge segments. The International Journal of Computer Vision, 1(2), April 1987.Google Scholar
  2. 2.
    P. Burt and B. Julesz. A gradient limit for binocular fusion. Science, 208:615–617, 1980.CrossRefGoogle Scholar
  3. 3.
    Q. Chen and G. Medioni. A volumetric stereo matching method: Application to image-based modeling. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, volume 1, pages 29–34, Colorado, June 1999. IEEE Computer Society.Google Scholar
  4. 4.
    O. Devillers, S. Meiser, and M. Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Comput. Geom. Theory Appl., 2(2): 55–80, 1992.zbMATHMathSciNetGoogle Scholar
  5. 5.
    Umesh R. Dhond and J.K. Aggarwal. Structure from stereo-a review. IEEE Transactions on Systems, Man, and Cybernetics, 19(6):1489–1510, 1989.CrossRefMathSciNetGoogle Scholar
  6. 6.
    Olivier Faugeras. Three-Dimensional Computer Vision: a Geometric Viewpoint. MIT Press, 1993.Google Scholar
  7. 7.
    Pascal Fua. A parallel stereo algorithm that produces dense depth maps and preserves image features. Machine Vision and Applications, 6(1):35–49, Winter 1993. Available as INRIA research report 1369.CrossRefGoogle Scholar
  8. 8.
    A. Goshtasby, S. H. Gage, and J. F. Bartholic. A two-stage cross correlation approach to template matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(3):374–378, May 1984.CrossRefGoogle Scholar
  9. 9.
    W.E.L. Grimson. Computational experiments with a feature based stereo algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(1): 17–34, 1985.Google Scholar
  10. 10.
    M.J. Hannah. A system for digital stereo image matching. Photogrammetric Engeneering and Remote Sensing, 55(12):1765–1770, December 1989.Google Scholar
  11. 11.
    M. Lhuillier and L. Quan. Image interpolation by joint view triangulation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, volume 2, pages 139–145, Colorado, June 1999. IEEE Computer Society.Google Scholar
  12. 12.
    D. Marr and T. Poggio. Cooperative computation of stereo disparity. Science, 194:283–287, 1976.CrossRefGoogle Scholar
  13. 13.
    Gérard Medioni and Ram Nevatia. Segment-based stereo matching. Computer Vision, Graphics, and Image Processing, 31:2–18, 1985.CrossRefGoogle Scholar
  14. 14.
    S. Pollard, J. Porrill, J. Mayhew, and J. Frisby. Disparity gradient,lipschitz continuity, and computing binocular correspondance. In O.D. Faugeras and G. Giralt, editors, Robotics Research: The Third International Symposium, pages 19–26. MIT Press, 1986.Google Scholar
  15. 15.
    S.B. Pollard, J.E.W. Mayhew, and J.P. Frisby. PMF: a stereo correspondence algorithm using a disparity gradient constraint. Perception, 14:449–470, 1985.CrossRefGoogle Scholar
  16. 16.
    K Prazdny. On the disparity gradient limit for binocular fusion. Perception and Psychophysics, 37(1):81–83, 1985.Google Scholar
  17. 17.
    F. Preparata and M. Shamos. Computational Geometry. Springer-Verlag, New-York, 1985.Google Scholar
  18. 18.
    L. Robert and R. Deriche. Dense depth map reconstruction: A minimization and regularization approach which preserves discontinuities. In Bernard Buxton, editor, Proceedings of the 4th European Conference on Computer Vision, Cambridge, UK, April 1996.Google Scholar
  19. 19.
    S. Russel and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, New Jersey, 1995.Google Scholar
  20. 20.
    D. Scharstein and R. Szeliski. Stereo matching with nonlinear diffusion. The International Journal of Computer Vision, 28(2):155–174, 1998.CrossRefGoogle Scholar
  21. 21.
    D.S. Sivia. Data Analysis: a Bayesian tutorial. Oxford University Press, 1996.Google Scholar
  22. 22.
    D. Weld. An introduction to least commitment planning. AI Magazine, 15(4):27–61, 1994.Google Scholar
  23. 23.
    Z. Zhang, R. Deriche, O. Faugeras, and Q.-T. Luong. A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry. Artificial Intelligence Journal, 78:87–119, October 1995.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Zhengyou Zhang
    • 1
  • Ying Shan
    • 1
  1. 1.Microsoft ResearchOne Microsoft WayRedmondUSA

Personalised recommendations