Advertisement

Certain Object Segmentation Based on AdaBoost Learning and Nodes Aggregation Iterative Graph-Cuts

  • Dongfeng Han
  • Wenhui Li
  • Xiaosuo Lu
  • Yi Wang
  • Xiaoqiang Zou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4069)

Abstract

In this paper, a fast automatic segmentation algorithm based on AdaBoost learning and iterative Graph-Cuts are shown. AdaBoost learning method is introduced for automatically finding the approximate location of certain object. Then an iterative Graph-Cuts method is used to model the segmentation problem. We call our algorithm as AdaBoost Aggregation Iterative Graph-Cuts (AAIGC). Compared to previous methods based on Graph-Cuts, our method is automatic. Once certain object is trained, our algorithm can cut it out from an image containing the certain object. The segmentation process is reliably computed automatically no additional users’ efforts are required. Experiments are given and the outputs are encouraging.

Keywords

Image Segmentation Gaussian Mixture Model Segmentation Result Weak Classifier Object Segmentation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Mortensen, E.N., Barrett, W.A.: Interactive segmentation with intelligent scissors. Graphical Models and Image Processing 60(5), 349–384 (1998)MATHCrossRefGoogle Scholar
  3. 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. 4.
    Rother, C., Blake, A., Kolmogorov, V.: Grabcut-interactive foreground extraction using iterated graph cuts. In: Proceedings of ACM SIGGRAPH (2004)Google Scholar
  5. 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. 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. 7.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. PAMI 22(8), 888–905 (2000)Google Scholar
  8. 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. 9.
    Lienhart, R., Maydt, J.: An Extended Set of Haar-like Features for Rapid Object Detection. In: IEEE ICIP 2002, September 2002, vol. 1, pp. 900–903 (2002)Google Scholar
  10. 10.
    Li, Y., Sun, J., Tang, C.K., Shum, H.Y.: Lazy snapping. In: Proc. of ACM SIGGRAPH, pp. 303–308 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dongfeng Han
    • 1
  • Wenhui Li
    • 1
  • Xiaosuo Lu
    • 1
  • Yi Wang
    • 1
  • Xiaoqiang Zou
    • 2
  1. 1.College of Computer Science and Technology, Key Laboratory of Symbol, Computation and Knowledge Engineering of the Ministry of EducationJilin UniversityChangchunP.R. China
  2. 2.College of TransportationJilin UniversityChangchunP.R. China

Personalised recommendations