Abstract
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.
This work has been supported by NSFC Project 60573182, 69883004 and 50338030.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Reese, L.: Intelligent Paint: Region-Based Interactive Image Segmentation, Master’s thesis. Department of Computer Science, Brigham Young University, Provo, UT (1999)
Mortensen, E.N., Barrett, W.A.: Interactive segmentation with intelligent scissors. Graphical Models and Image Processing 60(5), 349–384 (1998)
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)
Rother, C., Blake, A., Kolmogorov, V.: Grabcut-interactive foreground extraction using iterated graph cuts. In: Proceedings of ACM SIGGRAPH (2004)
Comanicu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. IEEE Trans. Pattern Anal. Machine Intell. (May 2002)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 731–737 (1997)
Shi, J., Malik, J.: Normalized cuts and image segmentation. PAMI 22(8), 888–905 (2000)
Sharon, E., Brandt, A., Basri, R.: Fast multiscale image segmentation. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 70–77 (2000)
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)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, D., Li, W., Lu, X., Li, L., Wang, Y. (2006). Graph-Based Fast Image Segmentation. In: Yeung, DY., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2006. Lecture Notes in Computer Science, vol 4109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11815921_51
Download citation
DOI: https://doi.org/10.1007/11815921_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37236-3
Online ISBN: 978-3-540-37241-7
eBook Packages: Computer ScienceComputer Science (R0)