Nothing Special   »   [go: up one dir, main page]

Skip to main content

SUSAN Window Based Cost Calculation for Fast Stereo Matching

  • Conference paper
Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3802))

Included in the following conference series:

  • 1263 Accesses

Abstract

This paper presents a fast stereo matching algorithm using SUSAN window. The response of SUSAN window is used to calculate the dissimilarity cost. From this dissimilarity cost, an initial match can be found. Then, with this initial match, a dynamic programming algorithm searches for the best path of two scan lines. Since the proposed dissimilarity cost calculation method is very simple, and does not make use of any complicated mathematic formula, its running time is almost as same as SAD in the fixed window. In addition, the proposed matching algorithm only has two control parameters, bright threshold and occlusion penalty, which make it to be easily optimized.

This work was partially supported by the Brain Korea 21 Project and KIPA-Information Technology Research Center.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Smith, S.M., Brady, J.M.: SUSAN–A New Approach to Low Level Image Processing. Int. J. Comput. Vision 23, 45–78 (1997)

    Article  Google Scholar 

  2. Scharstein, D., Szeliski, R.: A Taxonomy and Evaluation of Dense Two-frame Stereo Correspondence Algorithms. Int. J. Comput. Vision 47, 7–42 (2002)

    Article  MATH  Google Scholar 

  3. Brown, M., Burschka, D., Hager, G.: Advances in Computational Stereo. IEEE T Pattern Anal., 993–1008 (2003)

    Google Scholar 

  4. Veksler, O.: Fast variable window for stereo correspondence using integral images. In: CVPR, vol. 1, pp. 556–561 (2003)

    Google Scholar 

  5. Yang, R., Pollefeys, M., Li, S.: Improved Real-Time Stereo on Commodity Graphics Hardware. In: CVPR, pp. 36–44 (2004)

    Google Scholar 

  6. Gong, M., Yang, Y.H.: Near Real-time Reliable Stereo Matching Using Programmable Graphics Hardware. In: CVPR, vol. 1, pp. 924–931 (2005)

    Google Scholar 

  7. Yoon, K.J., Kweon, I.S.: Locally Adaptive Support-Weight Approach for Visual Correspondence Search. In: CVPR, vol. 2, pp. 924–931 (2005)

    Google Scholar 

  8. Forstmann, S., Ohya, J., Kanou, Y., Schmitt, A., Thuering, S.: Real-time stereo by using dynamic programming. In: CVPRW, pp. 29–37 (2004)

    Google Scholar 

  9. Zitnick, L., Kanade, T.: A cooperative algorithm for stereo matching and occlusion detection. IEEE T Pattern Anal. 22, 675–684 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chae, KY., Dong, WP., Jeong, CS. (2005). SUSAN Window Based Cost Calculation for Fast Stereo Matching. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_140

Download citation

  • DOI: https://doi.org/10.1007/11596981_140

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30819-5

  • Online ISBN: 978-3-540-31598-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics