Skip to main content

Stereo Matching Based on CF-EM Joint Algorithm

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

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

Included in the following conference series:

  • 2290 Accesses

Abstract

Cost Filtering (CF) and Energy Minimization (EM) are two main cost aggregation methods in stereo matching. Due to global smoothness assumption, EM methods can get higher matching accuracy. However, they tend to fail in occluded areas, while locally adaptive support-weight CF method can solve it well. This paper proposed a CF-EM joint stereo matching framework on the basis of the proof that CF and EM methods can realize interconversion to each other. In this joint framework, we firstly use CF method with fully connected Markov Random Field (F-MRF) model to yield a more robust unary potential. And then, the output unary potential is used as the input to a standard EM method to compute the final disparity in Local connected MRF (L-MRF) model. Experiments results demonstrate that our method can improve the stereo matching accuracy as the achievement of energy transferring from F-MRF to L-MRF.

This work is supported by the Projects of NSFC (61371191, 61201236), and Research Project of China SARFT (2015-53).

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 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. Mozerov, M.G., van de Weijer, J.: Accurate stereo matching by two-step energy minimization. IEEE Trans. Image Process. 24(3), 1153–1163 (2015)

    Article  MathSciNet  Google Scholar 

  2. Veksler, O.: Stereo correspondence with compact windows via minimum ratio cycle. IEEE Trans. Pattern Anal. Mach. Intell. 24, 1654–1660 (2002)

    Article  Google Scholar 

  3. Xu, Y., Wang, D., Feng, T., Shum, H.-Y.: Stereo computation using radial adaptive windows. In: Proceedings of the 16th International Conference on Pattern Recognition, vol. 3, pp. 595–598 (2002)

    Google Scholar 

  4. 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 (2005)

    Google Scholar 

  5. Altantawy, D., Obbaya, M., Kishk, S.: A fast non-local based stereo matching algorithm using graph cuts. In: 2014 9th International Conference on Computer Engineering & Systems (ICCES), pp. 130–135 (2014)

    Google Scholar 

  6. Yu, T., Lin, R.-S., Super, B., Tang, B.: Efficient message representations for belief propagation. In: IEEE 11th International Conference on Computer Vision, ICCV 2007, pp. 1–8 (2007)

    Google Scholar 

  7. Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1568–1583 (2006)

    Article  Google Scholar 

  8. Veksler, O.: Stereo correspondence by dynamic programming on a tree. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005, vol. 2, pp. 384–390 (2005)

    Google Scholar 

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

    Google Scholar 

  10. Zhao, W., Fu, H., Yang, G., Patra, L.W.: Parallel tree-reweighted message passing architecture. In: 2014 24th International Conference on Field Programmable Logic and Applications (FPL), pp. 1–6 (2014)

    Google Scholar 

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

  12. Shi, C., Wang, G., Pei, X., He, B., Lin, X.: Stereo matching using local plane fitting in confidence-based support window. IEICE Trans. 95-D(2), 699–702 (2012)

    Article  Google Scholar 

  13. Wang, L., Liao, M., Gong, M., Yang, R., Nister, D.: High-quality real-time stereo using adaptive cost aggregation and dynamic programming. In: Third International Symposium on 3D Data Processing, Visualization, and Transmission, pp. 798–805, June 2006

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Long Ye .

Editor information

Editors and Affiliations

Appendix

Appendix

Proof of Lemma 2.1

Proof.

If \( d = d_{p} \), \( \varphi (d,d_{p} ) = 0 \). We have \( \left( {C_{q} (d) + w_{q,p} \varphi (d,d_{p} )} \right) = C_{q} (d_{p} ) \).

If \( d \ne d_{p} \), \( \varphi (d,d_{p} ) = 1 \), thus, \( \left( {C_{q} (d) + w_{q,p} \varphi (d,d_{p} )} \right) = C_{q} (d) + w_{q,p} \).

Therefore, \( m_{q,p}^{1} (d) = \mathop {\hbox{min} }\limits_{{d \in {\mathcal{L}}}} \left\{ {C_{q} (d_{p} )|d = d_{p} ,C_{q} (d) + w_{q,p} |d \ne d_{p} } \right\} \).

When \( C_{q} (d_{p} ) = 1 \), \( C_{q} (d) = 1 \), because \( 0 \le \omega \le 1 \), thus

$$ m_{q,p}^{1} (d) = C_{q} (d_{p} ) . $$
(24)

When \( C_{q} (d_{p} ) = 1 \), \( C_{q} (d) = 0 \), thus,

$$ m_{q,p}^{1} (d) = w_{q,p} C_{q} (d) . $$
(25)

When \( C_{q} (d_{p} ) = 0 \), \( m_{q,p}^{1} (d) = C_{q} (d_{p} ) \). Because \( d = d_{p} \), \( w_{q,p} (d,d_{p} ) = 1 \), thus,

$$ C_{q} (d_{p} ) = w_{p,q} C_{q} (d)\left| {d = d_{p} } \right. $$
(26)

Synthesize (24–26), we can get: \( m_{q,p}^{1} (d) = w_{q,p} (d,d_{p} )C_{q} (d) \), Eq. (11) is proved.

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Li, B., Ye, L., Tie, Y., Zhang, Q. (2016). Stereo Matching Based on CF-EM Joint Algorithm. In: Chen, E., Gong, Y., Tie, Y. (eds) Advances in Multimedia Information Processing - PCM 2016. PCM 2016. Lecture Notes in Computer Science(), vol 9916. Springer, Cham. https://doi.org/10.1007/978-3-319-48890-5_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48890-5_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48889-9

  • Online ISBN: 978-3-319-48890-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics