Skip to main content

A Progressive Edge-Based Stereo Correspondence Method

  • Conference paper
Advances in Visual Computing (ISVC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4841))

Included in the following conference series:

  • 1532 Accesses

Abstract

Local stereo correspondence is usually not satisfactory because neither big window nor small window based methods can accurately match densely-textured and textureless regions at the same time. In this paper, we present a progressive edge-based stereo matching algorithm, in which big window and small window based matches are progressively integrated based on the edges of disparity map of a big window based matching. In addition, an arbitrarily-shaped window based matching is used for the regions where big windows and small windows can not find matches, and a novel optimization method, progressive outlier remover, is used to effectively remove outliers and noise. Empirical results show that our method is comparable to some state-of-the-art stereo correspondence algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sun, J., Zheng, N-N., Shum, H-Y.: Stereo Matching Using Belief Propagation. PAMI 25(7) (2003)

    Google Scholar 

  2. Kolmogorov, V., Zabih, R.: Computing Visual Correspondence with Occlusions using Graph Cuts. ICCV (2001)

    Google Scholar 

  3. Veksler, O.: Fast Variable Window for stereo correspondence Using Integral Images. CVPR (2003)

    Google Scholar 

  4. Kim, J.C., Lee, K.M., Choi, B.T., Lee, S.U.: A Dense Stereo Matching Using Two-Pass Dynamic Programming with Generalized Ground Control Points. CVPR (2005)

    Google Scholar 

  5. Scharstein, D., Szeliski, R.: Stero Matching with Non-linear Diffusion. IJCV 28(2), 155–174 (1998)

    Article  Google Scholar 

  6. Scharstein, D., Szeliski, R.: A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms. IJCV 47(1), 7–42 (2002)

    Article  MATH  Google Scholar 

  7. Canny, J.: A Computational Approach To Edge Detection. PAMI 8, 679–714 (1986)

    Google Scholar 

  8. Middlebury stereo, http://www.middlebury.edu/stereo

  9. Boykov, Y., Veksler, O., Zabih, R.: Fast Approximate Energy Minimization via Graph Cuts. PAMI 23(11) (2001)

    Google Scholar 

  10. Bobick, A.F., Intille, S.S.: Large Occlusion Stereo. IJCV 33(3), 181–200 (1999)

    Article  Google Scholar 

  11. Birchfield, S., Tomasi, C.: Depth Discontinuities by Pixel-to-Pixel Stereo. ICCV  (1998)

    Google Scholar 

  12. Agrawal, M., Davis, L.: Window-Based Discontinuity Preserving Stereo. CVPR  (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

George Bebis Richard Boyle Bahram Parvin Darko Koracin Nikos Paragios Syeda-Mahmood Tanveer Tao Ju Zicheng Liu Sabine Coquillart Carolina Cruz-Neira Torsten Müller Tom Malzbender

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Su, X., Khoshgoftaar, T.M. (2007). A Progressive Edge-Based Stereo Correspondence Method. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2007. Lecture Notes in Computer Science, vol 4841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76858-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76858-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76857-9

  • Online ISBN: 978-3-540-76858-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics