Skip to main content

Parallel Stereo Matching Based on Edge-Aware Filter

  • Conference paper
Intelligent Robotics and Applications

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

  • 3522 Accesses

Abstract

This paper presents a novel parallel stereo matching algorithm based on edge-aware filter with good performance in accuracy and speed. The initial matching cost is built with census transform and sobel operator. Then the aggregated cost is computed by rolling guidance filter and guided filter. The final disparity is computed by rolling guidance filter and weighted median filter. The key idea is to eliminate the influence of small scale structures when computing weights in aggregation step and post-processing step. The proposed method ranks 17th on Middlebury benchmark and the results cost 52.5ms on one GPU and 33.8ms on two GPUs.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision 47(1–3), 7–42 (2002)

    Article  Google Scholar 

  2. Yoon, K.J., Kweon, I.S.: Locally adaptive support-weight approach for visual correspondence search. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005, vol. 2, pp. 924−931. IEEE (2005)

    Google Scholar 

  3. Yoon, K.J., Kweon, I.S.: Adaptive support-weight approach for correspondence search. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(4), 650–656 (2006)

    Article  Google Scholar 

  4. Hosni, A., Bleyer, M., Gelautz, M., et al.: Local stereo matching using geodesic support weights. In: 16th IEEE International Conference on Image Processing (ICIP), pp. 2093−2096. IEEE (2009)

    Google Scholar 

  5. Mattoccia, S., Giardino, S., Gambini, A.: Accurate and efficient cost aggregation strategy for stereo correspondence based on approximated joint bilateral filtering. In: Zha, H., Taniguchi, R.-i., Maybank, S. (eds.) ACCV 2009, Part II. LNCS, vol. 5995, pp. 371–380. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. He, K., Sun, J., Tang, X.: Guided image filtering. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part I. LNCS, vol. 6311, pp. 1–14. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. He, K., Sun, J., Tang, X.: Guided image filtering. IEEE Transactions on Pattern Analysis and Machine Intelligence 35(6), 1397–1409 (2013)

    Article  Google Scholar 

  8. Rhemann, C., Hosni, A., Bleyer, M., et al.: Fast cost-volume filtering for visual correspondence and beyond. In: 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3017−3024. IEEE (2011)

    Google Scholar 

  9. Hosni, A., Rhemann, C., Bleyer, M., et al.: Fast cost-volume filtering for visual correspondence and beyond. IEEE Transactions on Pattern Analysis and Machine Intelligence 35(2), 504–511 (2013)

    Article  Google Scholar 

  10. Pham, C.C., Jeon, J.W.: Domain transformation-based efficient cost aggregation for local stereo matching. IEEE Transactions on Circuits and Systems for Video Technology 23(7), 1119–1130 (2013)

    Article  Google Scholar 

  11. Zhang, Q., Shen, X., Xu, L., Jia, J.: Rolling guidance filter. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014, Part III. LNCS, vol. 8691, pp. 815–830. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  12. Ma, Z., He, K., Wei, Y., et al.: Constant time weighted median filtering for stereo matching and beyond. In: 2013 IEEE International Conference on Computer Vision (ICCV), pp. 49−56. IEEE (2013)

    Google Scholar 

  13. Zabih, R., Woodfill, J.: Non-parametric local transforms for computing visual correspondence. In: Eklundh, J.-O. (ed.) ECCV 1994. LNCS, vol. 801, pp. 151–158. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  14. Crow, F.C.: Summed-area tables for texture mapping. ACM SIGGRAPH Computer Graphics 18(3), 207–212 (1984)

    Article  Google Scholar 

  15. Harris, M., Sengupta, S., Owens, J.D.: Parallel prefix sum (scan) with CUDA. GPU Gems 3(39), 851–876 (2007)

    Google Scholar 

  16. Li, J.: High performance edge-preserving filter on GPU. NVIDIA GTC (2015)

    Google Scholar 

  17. Bilgic, B., Horn, B.K.P., Masaki, I.: Efficient integral image computation on the GPU. In: 2010 IEEE Intelligent Vehicles Symposium (IV), pp. 528−533. IEEE (2010)

    Google Scholar 

  18. http://vision.middlebury.edu/stereo

  19. NVIDIA C Programming Guide Version 7.0

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fan Bu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Bu, F., Fan, C. (2015). Parallel Stereo Matching Based on Edge-Aware Filter. In: Liu, H., Kubota, N., Zhu, X., Dillmann, R. (eds) Intelligent Robotics and Applications. Lecture Notes in Computer Science(), vol 9246. Springer, Cham. https://doi.org/10.1007/978-3-319-22873-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22873-0_27

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22872-3

  • Online ISBN: 978-3-319-22873-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics