Skip to main content

Automatic Segmentation Based on AdaBoost Learning and Graph-Cuts

  • Conference paper
Image Analysis and Recognition (ICIAR 2006)

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

Included in the following conference series:

Abstract

An automatic segmentation algorithm based on AdaBoost learning and iterative Graph-Cuts are shown in this paper. In order to find the approximate location of the object, AdaBoost learning method is used to automatically find the object by the trained classifier. Some details on AdaBoost are described. Then the nodes aggregation method and the iterative Graph-Cuts method are used to model the automatic segmentation problem. Compared to previous methods based on Graph-Cuts, our method is automatic. This is a main feature of the proposed algorithm. Experiments and comparisons show the efficiency of the proposed method.

This work has been supported by NSFC Project 60573182, 69883004 and 50338030.

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

References

  1. Reese, L.: Intelligent Paint: Region-Based Interactive Image Segmentation. Master’s thesis. Department of Computer Science, Brigham Young University, Provo, UT (1999)

    Google Scholar 

  2. Mortensen, E.N., Barrett, W.A.: Interactive segmentation with intelligent scissors. Graphical Models and Image Processing 60(5), 349–384 (1998)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  4. Rother, C., Blake, A., Kolmogorov, V.: Grabcut-interactive foreground extraction using iterated graph cuts. In: Proceedings of ACM SIGGRAPH (2004)

    Google Scholar 

  5. Comanicu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. IEEE Trans. Pattern Anal. Machine Intell. (May 2002)

    Google Scholar 

  6. Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 731–737 (1997)

    Google Scholar 

  7. Shi, J., Malik, J.: Normalized cuts and image segmentation. PAMI 22(8), 888–905 (2000)

    Google Scholar 

  8. Viola, P., Jones, M.: Rapid object detection using a boosted cascade of simple features. In: Proc. CVPR, vol. 1, pp. 511–518 (2001)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, D., Li, W., Lu, X., Wang, T., Wang, Y. (2006). Automatic Segmentation Based on AdaBoost Learning and Graph-Cuts. In: Campilho, A., Kamel, M.S. (eds) Image Analysis and Recognition. ICIAR 2006. Lecture Notes in Computer Science, vol 4141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11867586_21

Download citation

  • DOI: https://doi.org/10.1007/11867586_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44891-4

  • Online ISBN: 978-3-540-44893-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics