Skip to main content

Interactive Image Segmentation Based on Grow Cut of Two Scale Graphs

  • Conference paper
Advances on Digital Television and Wireless Multimedia Communications

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 331))

Abstract

This paper proposes a novel interactive image segmentation algorithm based on the Grow Cut of two different scale graphs. Firstly, Watershed algorithm based on color information has been used to partition the image into many different regions which will be considered as the cells of Grow Cut, instead of image pixels. Then a segmentation result can be obtained by using Grow Cut on the aforementioned regions. Finally an automatic edge correction can be used on the segmentation result by Grow Cut of pixel-scale graph. Because the number of nodes and edges for the Grow Cut algorithm is reduced by more than fifty times compared to the pixel based method, the running time of our proposed algorithm is much less than the original Grow Cut. The segmentation performance of our proposed is much better than the original Grow Cut. Experimental results on Berkeley image dataset demonstrated the effectiveness of proposed method.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boykov, Y., Kolmogorov, V.: Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In: Proc. of ICCV, pp. 105–112 (2001)

    Google Scholar 

  2. Chan, T.F., Vese, L.A.: Active Contours without Edges. IEEE Trans. on Image Processing 10(2), 266–277 (2001)

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  4. Rother, C., Kolmogorov, V., Blake, A.: GrabCut-interactive foreground extraction using iterated graph cuts. ACM Trans. on Graphics 23(3), 309–314 (2004)

    Article  Google Scholar 

  5. Li, Y., Sun, J., Tang, C.K., Shum, H.: Lazy snapping. In: Proc. of ACM SIGGRAPH, pp. 303–308 (2004)

    Google Scholar 

  6. Vezhnevets, V., Konouchine, V.: “Grow-Cut” - Interactive Multi-Label N-D Image Segmentation. In: Proc. Graphicon, pp. 150–156

    Google Scholar 

  7. Vincent, L., Soille, P.: Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Trans. on PAMI 13(6), 583–598 (1991)

    Article  Google Scholar 

  8. http://search.microsoft.com/en-us/um/cambridge/projects/visionimagevideoediting/segmentation/grabcut.htm

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, X., Chen, J., Fan, H. (2012). Interactive Image Segmentation Based on Grow Cut of Two Scale Graphs. In: Zhang, W., Yang, X., Xu, Z., An, P., Liu, Q., Lu, Y. (eds) Advances on Digital Television and Wireless Multimedia Communications. Communications in Computer and Information Science, vol 331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34595-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34595-1_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34594-4

  • Online ISBN: 978-3-642-34595-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics