In this paper, we describe a fast semi-automatic segmentation algorithm. A nodes aggregation method is proposed for improving the running time and a Graph-Cuts method is used to model the segmentation problem. The whole process is interactive. Once the users specify the interest regions by drawing a few lines, the segmentation process is reliably computed automatically no additional users’ efforts are required. It is convenient and efficient in practical applications. Experiments are given and outputs are encouraging.


Image Segmentation IEEE Conf Segmentation Problem Interactive Segmentation Node Aggregation 
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.


  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: Proc. IEEE Conf. Computer Vision, 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.
    Sharon, E., Brandt, A., Basri, R.: Fast multiscale image segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 70–77 (2000)Google Scholar
  9. 9.
    Sharon, E., Brandt, A., Basri, R.: Segmentation and boundary detection using multiscale intensity measurements. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 469–476 (2001)Google Scholar
  10. 10.
    Galun, M., Sharon, E., Basri, R., Brandt, A.: Texture Segmentation by Multiscale Aggregation of Filter Responses and Shape Elements. In: Proc. IEEE Conf. Computer Vision (2003)Google Scholar
  11. 11.
    Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: A Local Search Approximation Algorithm for k-Means Clustering. In: Proceedings of the 18th Annual ACM Symposium on Computational Geometry (2003)Google Scholar
  12. 12.
    Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol. 2134, pp. 359–374. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

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

Personalised recommendations