Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Multicue Graph Mincut for Image Segmentation

  • Conference paper
Computer Vision – ACCV 2009 (ACCV 2009)

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

Included in the following conference series:

  • 2690 Accesses

Abstract

We propose a general framework to encode various grouping cues for natural image segmentation. We extend the classical Gibbs energy of an MRF to three terms: likelihood energy, coherence energy and separating energy. We encode generative cues in the likelihood and coherence energy to ensure the goodness and feasibility of segmentation, and embed discriminative cues in the separating energy to encourage assigning two pixels with strong separability with different labels. We use a self-validated process to iteratively minimize the global Gibbs energy. Our approach is able to automatically determine the number of segments, and produce a natural hierarchy of coarse-to-fine segmentation. Experiments show that our approach works well for various segmentation problems, and outperforms existing methods in terms of robustness to noise and preservation of soft edges.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Feng, W., Liu, Z.Q.: Region-level image authentication using Bayesian structural content abstraction. IEEE Trans. Image Processing 17(12), 2413–2424 (2008)

    Article  Google Scholar 

  2. Feng, W., Xie, L., Zeng, J., Liu, Z.Q.: Audio-visual human recognition using semi-supervised spectral learning and hidden Markov models. Journal of Visual Languages and Computing 20(3), 188–195 (2009)

    Article  Google Scholar 

  3. Martin, D., Fowlkes, C., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. of ICCV 2001, vol. 2, pp. 416–423 (2001)

    Google Scholar 

  4. Sharon, E., Brandt, A., Basri, R.: Fast multiscale image segmentation. In: Proc. of CVPR 2000, vol. 1, pp. 70–77 (2000)

    Google Scholar 

  5. Yu, S.X.: Segmentation using multiscale cues. In: Proc. of CVPR 2004, vol. 1, pp. 247–254 (2004)

    Google Scholar 

  6. Benezit, F., Cour, T., Shi, J.: Spectral segmentation with multiscale graph decomposition. In: Proc. of CVPR 2005, vol. 2, pp. 1124–1131 (2005)

    Google Scholar 

  7. Malik, J., Belongie, S., Leung, T., Shi, J.: Contour and texture analysis for image segmentation. Intl. Journal of Computer Vision 43(1), 7–27 (2001)

    Article  MATH  Google Scholar 

  8. Martin, D., Fowlkes, C., Malik, J.: Learning to detect natural image boundaries using local brightness, color, and texture cues. IEEE Trans. Pattern Anal. Machine Intell. 26(5), 530–549 (2004)

    Article  Google Scholar 

  9. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intell. 22(8), 888–905 (2000)

    Article  Google Scholar 

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

    Article  Google Scholar 

  11. Li, S.Z.: Markov Random Field Modeling in Computer Vision. Springer, Heidelberg (1995)

    Google Scholar 

  12. Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary & region segmentation of objects in n-d images. In: Proc. of ICCV 2001, pp. 105–112 (2001)

    Google Scholar 

  13. Feng, W., Liu, Z.Q.: Self-validated and spatially coherent clustering with net-structured MRF and graph cuts. In: Proc. of ICPR 2006, vol. 4, pp. 37–40 (2006)

    Google Scholar 

  14. Grady, L., Schwartz, E.: Isoperimetric graph partition for image segmentation. IEEE Trans. Pattern Anal. Machine Intell. 28(3), 469–475 (2006)

    Article  Google Scholar 

  15. Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient graph-based image segmentation. Intl. Journal of Computer Vision 59(2), 167–181 (2004)

    Article  Google Scholar 

  16. Tu, Z., Zhu, S.C.: Image segmentation by data-driven Markov Chain Monte Carlo. IEEE Trans. Pattern Anal. Machine Intell. 24(5), 657–673 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feng, W., Xie, L., Liu, ZQ. (2010). Multicue Graph Mincut for Image Segmentation. In: Zha, H., Taniguchi, Ri., Maybank, S. (eds) Computer Vision – ACCV 2009. ACCV 2009. Lecture Notes in Computer Science, vol 5995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12304-7_67

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12304-7_67

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12303-0

  • Online ISBN: 978-3-642-12304-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics