Open Access Open Access  Restricted Access Subscription or Fee Access

Image Segmentation Techniques

Anju Rachel Oommen, S. Nathelda Mary Navina

Abstract


Humans are able to easily identify the portion of the image to be segmented or separated. Computers are not that intelligent to recognize the object to be segmented accurately. For easy recognition of the object, various segmentation methods have been identified with which it becomes easy for the computer to identify the object with minimal user input. Grabcut an image segmentation technique is compared using several parameters with other image segmentation techniques. Grabcut needs minimal user interaction which is done by placing a rectangle around the object of interest. Lazy Snapping is an image cut out tool and uses Graph cut method. Intelligent scissors uses gesture motion to segment an object. Geodesic Framework scribble on the image and marks it as foreground and bcackground which is very helpful in the object segmentation.Graph cut method segments an object by drawing a cut on the graph got from the image in which the source corresponds to foreground and sink corresponds to background. All these various techniques are surveyed and compared in this paper.

Keywords


Grabcut, Geodesic framework, Structure Tensor, Graphcut, Multiscale

Full Text:

PDF

References


Shoudong Han, Wenbing Tao, Desheng Wang, Xue-Cheng Tai, and Xianglin Wu, “Image Segmentation Based on GrabCut Framework Integrating Multiscale Nonlinear Structure Tensor.” IEEE transactions on image processing, volume. 18, No 10, October 2009.

Xue Bai and Guillermo Sapiro, “A Geodesic Framework for Fast Interactive Image and Video Segmentation and Matting,” University of Minnesota, Minneapolis, MN 55455, 2007.

Y. Boykov and G. Funka-Lea, “Graph cuts and efficient N-D image segmentation,” Int. J. Comput. Vis., vol. 70, pp. 109–131, 2006.

E. N. Mortensen and W. A. Barrett, “Intelligent scissors for image composition,” in Proc. ACM Siggraph, 1995, pp. 191–198.

Y. Li, J. Sun, C. K. Tang, and H. Y. Shum, “Lazy snapping,” in Proc. SIGGRAPH Conf., 2004, pp. 303–308.

C. Rother, V. Kolmogorov, and A. Blake, “GrabCut: Interactive foreground extraction using iterated graph cuts,” ACM Trans. Graph., vol.23, pp. 309–314, 2004.

Z.Wang and B. Vemuri, “Tensor field segmentation using region based active contour model,” in Proc. ECCV, 2004, pp. 304–315.

P. T. Fletcher and S. Joshi, “Principal geodesic analysis on symmetric spaces: Statistics of diffusion tensors,” in Proc. ECCV Workshops CVAMIA and MMBIA, 2004, pp. 87–98.

G. Wyszecki and W. S. Stiles, Color Science: Concepts and Methods, Quantitative Data and Formulae. New York: Wiley, 1982.

L. G. de, R. Deriche, and C. Alberola-L, “Texture and color segmentation based on the combined use of the structure tensor and the image components,” Signal Process., vol. 88, pp. 776–795, 2008.

C. Sagiv, N. A. Sochen, and Y. Y. Zeevi, “Texture segmentation via a diffusion-segmentation scheme in the gabor feature space,” in Proc. 2nd Int. Workshop Texture Analysis and Synthesis, pp.123–128.

B. G. Kim, J. I. Shim, and D. J. Park, “Fast image segmentation based on multi-resolution analysis and wavelets,” Pattern Recognit. Lett., vol. 24, pp. 2995–3006, 2003.

C. Bouman and B. Liu, “Multiple resolution segmentation of textured images,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 13, pp. 99–113, 1991.

H. Lombaert, Y. Sun, L. Grady, and C. Xu, “A multilevel banded graph cuts method for fast image segmentation,” in Proc. ICCV, 2005.

Y. Boykov and M. P. Jolly, “Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images,” in Proc. ICCV, 2001, pp.105–112.

Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, pp. 1124–1137, 2004.

Z. Wu and R. Leahy, “An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation,” IEEE Trans.Pattern Anal. Mach. Intell., vol. 15, pp. 1101–1113, 1993.

D. H. Ballard and C. M. Brown, Computer Vision. Englewood Cliffs, NJ: Prentice Hall, 1982.

J. T. Tou and R. C. Gonzalez, Pattern Recognition Principles. Reading, MA: Addison-Wesley, 1974.

M. Rousson, T. Brox, R. Deriche, O. I. Projet, and F. Sophia-Antipolis, “Active unsupervised texture segmentation on a diffusion based feature space,” presented at the CVPR Conf., 2003.

Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, pp. 1124–1137, 2004.

Z. Wu and R. Leahy, “An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation,”IEEE Trans,. Pattern Anal. Mach. Intell., vol. 15, pp. 1101–1113,1993.

D. H. Ballard and C. M. Brown, Computer Vision. Englewood Cliffs, NJ: Prentice Hall, 1982.

J. T. Tou and R. C. Gonzalez, Pattern Recognition Principles. Reading, MA: Addison-Wesley, 1974.

M. Rousson, T. Brox, R. Deriche, O. I. Projet, and F. Sophia-Antipolis, “Active unsupervised texture segmentation on a diffusion based featurespace,” presented at the CVPR Conf., 2003.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.