Skip to main content
SpringerLink
Log in

Graph Cuts Stereo Matching Based on Patch-Match and Ground Control Points Constraint

  • Conference paper
  • First Online:
Advances in Multimedia Information Processing -- PCM 2015 (PCM 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9315))

Included in the following conference series:

Abstract

Stereo matching methods based on Patch-Match obtain good results on complex texture regions but show poor ability on low texture regions. In this paper, a new method that integrates Patch-Match and graph cuts (GC) is proposed in order to achieve good results in both complex and low texture regions. A label is randomly assigned for each pixel and the label is optimized through propagation process. All these labels constitute a label space for each iteration in GC. Also, a Ground Control Points (GCPs) constraint term is added to the GC to overcome the disadvantages of Patch-Match stereo in low texture regions. The proposed method has the advantage of the spatial propagation of Patch-Match and the global property of GC. The results of experiments are tested on the Middlebury evaluation system and outperform all the other PatchMatch based methods.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Barnes, C., Shechtman, E., Goldman, D.B., Finkelstein, A.: The generalized patchmatch correspondence algorithm. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part III. LNCS, vol. 6313, pp. 29–43. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Besse, F., Rother, C., Fitzgibbon, A., Kautz, J.: PMBP: patchmatch belief propagation for correspondence field estimation. Int. J. Comput. Vis. 110, 1–12 (2013)

    Google Scholar 

  3. Bleyer, M., Rhemann, C., Rother, C.: Patchmatch stereo-stereo matching with slanted support windows. In: BMVC, vol. 11, pp. 1–11 (2011)

    Google Scholar 

  4. Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9), 1124–1137 (2004)

    Article  MATH  Google Scholar 

  5. Heise, P., Klose, S., Jensen, B., Knoll, A.: Pm-huber: Patchmatch with huber regularization for stereo matching. In: IEEE International Conference on Computer Vision (ICCV), pp. 2360–2367. IEEE (2013)

    Google Scholar 

  6. Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: IEEE International Conference on Computer Vision (ICCV), vol. 2, pp. 508–515. IEEE (2001)

    Google Scholar 

  7. Kolmogorov, V., Zabin, R.: What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147–159 (2004)

    Article  Google Scholar 

  8. Lempitsky, V., Rother, C., Blake, A.: Logcut - efficient graph cut optimization for markov random fields. In: International Conference on Computer Vision, pp. 1–8 (2007)

    Google Scholar 

  9. Liu, J., Li, C., Mei, F., Wang, Z.: 3D entity-based stereo matching with ground control points and joint second-order smoothness prior. Vis. Comput. 31, 1–17 (2014)

    Google Scholar 

  10. Lu, J., Yang, H., Min, D., Do, M.N.: Patchmatch filter: efficient edge-aware filtering meets randomized search for fast correspondence field estimation. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1854–1861. IEEE (2013)

    Google Scholar 

  11. Olsson, C., Ulén, J., Boykov, Y.: In defense of 3D-label stereo. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1730–1737. IEEE (2013)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Taniai, T., Matsushita, Y., Naemura, T.: Graph cut based continuous stereo matching using locally shared labels. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1613–1620, June 2014

    Google Scholar 

  14. Wang, L., Yang, R.: Global stereo matching leveraged by sparse ground control points. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3033–3040. IEEE (2011)

    Google Scholar 

  15. Woodford, O., Torr, P., Reid, I., Fitzgibbon, A.: Global stereo reconstruction under second-order smoothness priors. IEEE Trans. Pattern Anal. Mach. Intell. 31(12), 2115–2128 (2009)

    Article  Google Scholar 

  16. Xu, S., Zhang, F., He, X., Shen, X., Zhang, X.: PM-PM: patchmatch with potts model for object segmentation and stereo matching. IEEE Trans. Image Process. 24(7), 2182–2196 (2015)

    Article  MathSciNet  Google Scholar 

  17. Yang, Q.: A non-local cost aggregation method for stereo matching. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1402–1409, June 2012

    Google Scholar 

  18. Yoon, K.J., Kweon, I.S.: Adaptive support-weight approach for correspondence search. IEEE Trans. Pattern Anal. Mach. Intell. 28(4), 650–656 (2006)

    Article  Google Scholar 

Download references

Acknowledgement

This work is supported by the High Technology Development Program of China(863 Program), under Grant No.2011AA01A205, National Significant Science and Technology Projects of China, under Grant No.2013ZX01039001-002-003; by the NSFC project under Grant Nos. U1433112, and 61170253.

Author information

Authors and Affiliations

  1. University of Technology Sydney, Sydney, Australia

    Xiaoshui Huang & Jian Zhang

  2. Graduate School at Shenzhen, Tsinghua University, Shenzhen, China

    Xiaoshui Huang & Chun Yuan

Authors
  1. Xiaoshui Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chun Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jian Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoshui Huang .

Editor information

Editors and Affiliations

  1. Gwangju Institute of Science and Technology, Gwangju, Korea (Republic of)

    Yo-Sung Ho

  2. Chinese Academy of Sciences, Institute of Automation, Beijing, China

    Jitao Sang

  3. KAIST, Daejeon, Korea (Republic of)

    Yong Man Ro

  4. KAIST, Daejeon, Korea (Republic of)

    Junmo Kim

  5. College of Computer Science, Zhejiang University, Hangzhou, China

    Fei Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Huang, X., Yuan, C., Zhang, J. (2015). Graph Cuts Stereo Matching Based on Patch-Match and Ground Control Points Constraint. In: Ho, YS., Sang, J., Ro, Y., Kim, J., Wu, F. (eds) Advances in Multimedia Information Processing -- PCM 2015. PCM 2015. Lecture Notes in Computer Science(), vol 9315. Springer, Cham. https://doi.org/10.1007/978-3-319-24078-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24078-7_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24077-0

  • Online ISBN: 978-3-319-24078-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation