Skip to main content
SpringerLink
Log in
Book cover

Asian Conference on Computer Vision

ACCV 2010: Computer Vision – ACCV 2010 Workshops pp 82–91Cite as

Shortest Path Based Planar Graph Cuts for Bi-layer Segmentation of Binocular Stereo Video

  • Conference paper

  • 1288 Accesses

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

Abstract

Separating a foreground layer from stereo video in real-time is used in many applications such as live background substitution. Conventional separating models using stereo, contrast or color alone are usually not accurate enough to be satisfactory. Furthermore, the powerful tool of graph cut which is well suited for segmentation is known to be not efficient enough especially for high resolution images. In this paper, we conquer these difficulties by fusing stereo with color and contrast to model the segmentation problem as an minimum cut problem of a planar graph and solving it by a specialized algorithm, parametric shortest paths [8] with a dynamic tree structure, in O(nlogn) time. Experimental results demonstrate the high accuracy and efficiency of the algorithm.

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Acar, U.A., Blelloch, G.E., Harper, R., Vittes, J.L., Woo, S.L.M.: Dynamizing static algorithms, with applications to dynamic trees and history independence. In: Proc. 15th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 531–540 (2004)

    Google Scholar 

  2. Alstrup, S., Holm, J., De Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2), 243–264 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baker, S., Szeliski, R., Anandan, P.: A layered approach to stereo reconstruction. In: Proc. CVPR, Santa Barbara, pp. 434–441 (1998)

    Google Scholar 

  4. Boykov, Y., Jolly, M.-P.: Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In: Proc. Int. Conf. on Computer Vision (2001)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. on PAMI 23(11) (2001)

    Google Scholar 

  7. Criminisi, A., Shotton, J., Blake, A., Torr, P.H.S.: Gaze manipulation for one to one teleconferencing. In: Proc. ICCV (2003)

    Google Scholar 

  8. Erickson, J.: Maximum flows and parametric shortest paths in planar graphs. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (2010)

    Google Scholar 

  9. Geiger, D., Ladendorf, B., Yuille, A.: Occlusions and binocular stereo. Int. J. Computer Vision 14, 211–226 (1995)

    Article  Google Scholar 

  10. Jojic, N., Frey, B.: Learning flexible sprites in video layers. In: Proc. CVPR, Hawaii (2001)

    Google Scholar 

  11. Kolmogorov, V., Criminisi, A., Blake, A., Cross, G., Rother, C.: Probabilistic fusion of stereo with color and contrast for bilayer segmentation. PAMI 28(8) (2006)

    Google Scholar 

  12. Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: Proc. ECCV, Copenhagen, Denmark (2002)

    Google Scholar 

  13. Mortensen, E.N., Barrett, W.A.: Intelligent Scissors for Image Composition. In: Computer Graphics (SIGGRAPH 1995), Los Angeles, California, pp. 191–198 (1995)

    Google Scholar 

  14. Rother, C., Kolmogorov, V., Blake, A.: GrabCut–Interactive foreground extraction using iterated graph cuts. In: Proc. ACM Siggraph (2004)

    Google Scholar 

  15. Rowe, S.M., Blake, A.: Statistical mosaics for tracking. J. Image and Vision Computing 14, 549–564 (1996)

    Article  Google Scholar 

  16. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: JCSS, pp. 362–391 (1981)

    Google Scholar 

  17. Stauffer, C., Grimson, W.E.L.: Adaptive background mixture models for real-time tracking. In: Proc. CVPR, pp. 246–252 (1999)

    Google Scholar 

  18. Tarjan, R.E., Werneck, R.F.: Self-adjusting top trees. In: Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 813–822 (2005)

    Google Scholar 

  19. Torr, P.H.S., Szeliski, R., Anandan, P.: An integrated Baysesian approach to layer extraction from image sequences. PAMI (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Automation, Chinese Academy of Sciences, Beijing, 100190, China

    Xiangsheng Huang

  2. State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering Computing, AMSS, CAS, Beijing, 100190, China

    Lujin Gong

Authors
  1. Xiangsheng Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lujin Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Institute, Christian-Albrechts-University Kiel, Germany, Olshausenstr. 40, 24098, Kiel, Germany

    Reinhard Koch

  2. Institute of Computer Science and Information Engineering, National Ilan University, Shen-Lung Rd. 1, 26047, Yi-Lan, Taiwan R.O.C.

    Fay Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, X., Gong, L. (2011). Shortest Path Based Planar Graph Cuts for Bi-layer Segmentation of Binocular Stereo Video. In: Koch, R., Huang, F. (eds) Computer Vision – ACCV 2010 Workshops. ACCV 2010. Lecture Notes in Computer Science, vol 6469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22819-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22819-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22818-6

  • Online ISBN: 978-3-642-22819-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation