Skip to main content
SpringerLink
Log in

Fast Adaptive Support-Weight Stereo Matching Algorithm

  • Research article
  • Published:
Transactions of Tianjin University Aims and scope Submit manuscript

Abstract

Adaptive support-weight (ASW) stereo matching algorithm is widely used in the field of three-dimensional (3D) reconstruction owing to its relatively high matching accuracy. However, since all the weight coefficients need to be calculated in the whole disparity range for each pixel, the algorithm is extremely time-consuming. To solve this problem, a fast ASW algorithm is proposed using twice aggregation. First, a novel weight coefficient which adapts cosine function to satisfy the weight distribution discipline is proposed to accomplish the first cost aggregation. Then, the disparity range is divided into several sub-ranges and local optimal disparities are selected from each of them. For each pixel, only the ASW at the location of local optimal disparities is calculated, and thus, the complexity of the algorithm is greatly reduced. Experimental results show that the proposed algorithm can reduce the amount of calculation by 70% and improve the matching accuracy by 6% for the 15 images on Middlebury Website on average.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Tombari F, Gori F, Stefano LD (2011) Evaluation of stereo algorithms for 3D object recognition. 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops) 990–997

  2. Scharstein D, Szeliski R (2002) A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int J Comput Vis 47:7–42

    Article  MATH  Google Scholar 

  3. Kolmogorov V, Zabih R (2001) Computing visual correspondence with occlusions using graph cuts. Eighth IEEE Int Conf Comput Vis 2:508–515

    Article  Google Scholar 

  4. Banno A, Ikeuchi K (2011) Disparity map refinement and 3D surface smoothing via directed anisotropic diffusion. Comput Vis Image Underst 115:611–619

    Article  Google Scholar 

  5. Wang ZF, Zheng ZG (2008) A region based stereo matching algorithm using cooperative optimization. IEEE Conference on Computer Vision and Pattern Recognition CVPR 1–8

  6. Chen DM, Ardabilian M, Chen LM (2015) A fast trilateral filter based adaptive support weight method for stereo matching. IEEE Trans Circuits Syst Video Technol 25:730–743

    Article  Google Scholar 

  7. Yang QX (2015) Stereo matching using tree filtering. IEEE Trans Pattern Anal Mach Intell 37:834–846

    Article  Google Scholar 

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

  9. He KM, Sun J, Tang XO (2013) Guided image filtering. IEEE Trans Pattern Anal Mach Intell 35:1397–1409

    Article  Google Scholar 

  10. Zhang K, Lu JB, Lafruit G (2009) Crossed-based local stereo matching using orthogonal integral images. IEEE Trans Circuits Syst Video Technol 19:1073–1079

    Article  Google Scholar 

  11. Cigla C, Alatan AA (2011) Efficient edge-preserving stereo matching. IEEE International Conference on Computer Vision Workshops 696–699

  12. Yoon KJ, Kweon IS (2006) Adaptive support-weight approach for correspondence search. IEEE Trans Pattern Anal Mach Intell 28:650–656

    Article  Google Scholar 

  13. Sun X, Mei X, Jiao SH et al (2011) Stereo matching with reliable disparity propagation. International Conference on 3D Image, Modelling, Processing, Visualization and Transmission (3DIMPVT) 132–139

  14. Li H, Zhang XG, Sun Z (2015) A line-based adaptive-weight matching algorithm using loopy belief propagation. Math Probl Eng 2015:297392

    Google Scholar 

  15. Middlebury stereo Evaluation-Version 3. http://vision.middlebury.edu/stereo/eval3/

  16. Tan P, Monasse P (2014) Stereo disparity through cost aggregation with guided filter. Image Process Line 4:252–275

    Article  Google Scholar 

  17. Mattoccia S, Giardino S, Gambini A (2009) Accurate and efficient cost aggregation strategy for stereo correspondence based on approximated joint bilateral filtering. Asian Conference on Computer Vision 371–380

  18. Zhang K, Li JY, Li YJ et al. (2012) Binary stereo matching. 21st International Conference on Pattern Recognition (ICPR) 356–359

Download references

Acknowledgements

This study was supported by the National Science Foundation of China (No. 61271326).

Author information

Authors and Affiliations

  1. School of Electrical and Information Engineering, Tianjin University, Tianjin, 300072, China

    Kai He, Yunfeng Ge, Rui Zhen & Jiaxing Yan

Authors
  1. Kai He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yunfeng Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rui Zhen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jiaxing Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kai He.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

He, K., Ge, Y., Zhen, R. et al. Fast Adaptive Support-Weight Stereo Matching Algorithm. Trans. Tianjin Univ. 23, 295–300 (2017). https://doi.org/10.1007/s12209-017-0034-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12209-017-0034-5

Keywords

Search

Navigation