Skip to main content

Accurate and Efficient Cost Aggregation Strategy for Stereo Correspondence Based on Approximated Joint Bilateral Filtering

  • Conference paper
Computer Vision – ACCV 2009 (ACCV 2009)

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

Included in the following conference series:

Abstract

Recent local state-of-the-art stereo algorithms based on variable cost aggregation strategies allow for inferring disparity maps comparable to those yielded by algorithms based on global optimization schemes. Unfortunately, thought these results are excellent, they are obtained at the expense of high computational requirements that are comparable or even higher than those required by global approaches. In this paper, we propose a cost aggregation strategy based on joint bilateral filtering and incremental calculation schemes that allow for efficient and accurate inference of disparity maps. Experimental comparison with state-of-the-art techniques shows the effectiveness of our proposal.

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

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. Ansar, A., Castano, A., Matthies, L.: Enhanced real-time stereo using bilateral filtering. In: 3DPVT 2004, pp. 455–462 (2004)

    Google Scholar 

  2. Brown, M.Z., Burschka, D., Hager, G.D.: Advances in computational stereo. IEEE Trans. Pattern Anal. Mach. Intell. 25(8), 993–1008 (2003)

    Article  Google Scholar 

  3. Gerrits, M., Bekaert, P.: Local stereo matching with segmentation-based outlier rejection. In: Proc. CRV 2006, p. 66 (2006)

    Google Scholar 

  4. Gong, M., Yang, R.G., Liang, W., Gong, M.W.: A performance study on different cost aggregation approaches used in real-time stereo matching. Int. Journal Computer Vision 75(2), 283–296 (2007)

    Article  Google Scholar 

  5. Kang, S.B., Szeliski, R., Chai, J.: Handling occlusions in dense multi-view stereo. In: Proc. CVPR 2001, pp. 103–110 (2001)

    Google Scholar 

  6. Mattoccia, S., Tombari, F., Di Stefano, L.: Stereo vision enabling precise border localization within a scanline optimization framework. In: Yagi, Y., Kang, S.B., Kweon, I.S., Zha, H. (eds.) ACCV 2007, Part II. LNCS, vol. 4844, pp. 517–527. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Paris, S., Durand, F.: A fast approximation of the bilateral filter using a signal processing approach. Int. Journal Computer Vision 81(1), 24–52 (2009)

    Article  Google Scholar 

  8. Porikli, F.M.: Constant time o(1) bilateral filtering. In: CVPR 2008, pp. 1–8 (2008)

    Google Scholar 

  9. Scharstein, D., Szeliski, R.: http://vision.middlebury.edu/stereo/

  10. Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. Journal Computer Vision 47(1/2/3), 7–42 (2002)

    Article  MATH  Google Scholar 

  11. Tomasi, C., Manduchi, R.: Bilateral filtering for gray and color images. In: ICCV 1998, pp. 839–846 (1998)

    Google Scholar 

  12. Tombari, F., Mattoccia, S., Di Stefano, L.: Segmentation-based adaptive support for accurate stereo correspondence. In: Mery, D., Rueda, L. (eds.) PSIVT 2007. LNCS, vol. 4872, pp. 427–438. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Tombari, F., Mattoccia, S., Di Stefano, L., Addimanda, E.: Classification and evaluation of cost aggregation methods for stereo correspondence, www.vision.deis.unibo.it/spe/SPEHome.aspx

  14. Tombari, F., Mattoccia, S., Di Stefano, L., Addimanda, E.: Classification and evaluation of cost aggregation methods for stereo correspondence. In: CVPR 2008, pp. 1–8 (2008)

    Google Scholar 

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

    Google Scholar 

  16. Viola, P., Jones, M.J.: Robust real-time face detection. Int. Journal of Computer Vision 57(2), 137–154 (2004)

    Article  Google Scholar 

  17. Wang, L., Liao, M., Gong, M., Yang, R., Nister, D.: High-quality real-time stereo using adaptive cost aggregation and dynamic programming. In: Proc. 3DPVT 2006, pp. 798–805 (2006)

    Google Scholar 

  18. Yang, Q., Wang, L., Yang, R., Stewénius, H., Nistér, D.: Stereo matching with color-weighted correlation, hierarchical belief propagation and occlusion handling. IEEE Trans. on Pattern Analysis and Machine Intelligence 31(3), 492–504 (2009)

    Article  Google Scholar 

  19. Yoon, K.J., Kweon, I.S.: Adaptive support-weight approach for correspondence search. IEEE Trans. PAMI 28(4), 650–656 (2006)

    Google Scholar 

  20. Yoon, K.J., Kweon, I.S.: Stereo matching with symmetric cost functions. In: Proc. CVPR 2006, vol. 2, pp. 2371–2377 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mattoccia, S., Giardino, S., Gambini, A. (2010). Accurate and Efficient Cost Aggregation Strategy for Stereo Correspondence Based on Approximated Joint Bilateral Filtering. In: Zha, H., Taniguchi, Ri., Maybank, S. (eds) Computer Vision – ACCV 2009. ACCV 2009. Lecture Notes in Computer Science, vol 5995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12304-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12304-7_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12303-0

  • Online ISBN: 978-3-642-12304-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics