A Comparative Study of Image Segmentation Algorithms

In some applications, such as image recognition or compression, segmentation refers to the process of partitioning a digital image into multiple segments. Image segmentation is typically used to locate objects and boundaries (lines, curves, etc.) in images. Image segmentation is to classify or cluster an image into several parts (regions) according to the feature of image, for example, the pixel value or the frequency response. More precisely, image segmentation is the process of assigning a label to every pixel in an image such that pixels with the same label share certain visual characteristics. The result of image segmentation is a set of segments that collectively cover the entire image, or a set of contours extracted from the image. Several image segmentation algorithms were proposed to segment an image before recognition or compression. Up to now, many image segmentation algorithms exist and be extensively applied in science and daily life. According to their segmentation method, we can approximately categorize them into region-based segmentation, data clustering, and edge-base segmentation. In this paper, we give a study of several popular image segmentation algorithms that are available.

Authors:

• Mehdi Hosseinzadeh
• Parisa Khoshvaght

Keywords:

• Image Segmentation
• hierarchical segmentation
• partitional segmentation
• density estimation.

References:

[1] R. C. Gonzalez and R. E. Woods, Digital Image Processing, 3rd ed.,
Prentice Hall, New Jersey 2008.
[2] W. K. Pratt, Digital Image Processing, 3th ed., John Wiley & Sons, Inc.,
Los Altos, California, 2007.
[3] R. Adams, and L. Bischof, “Seeded region growing,” IEEE Trans.
Pattern Anal. Machine Intel, vol. 16, no. 6, pp. 641-647, June, 1994.
[4] Z. Lin, J. Jin and H. Talbot, “Unseeded region growing for 3D image
segmentation,” ACM International Conference Proceeding Series, vol. 9,
pp. 31-37, 2000.
[5] S. L. Horowitz and T. Pavlidis, “Picture segmentation by a tree traversal
algorithm,” JACM, vol. 23, pp. 368-388, April, 1976.
[6] Y. Deng, and B.S. Manjunath, “Unsupervised segmentation of colortexture
regions in images and video,” IEEE Trans. Pattern Anal.
Machine Intel., vol. 23, no. 8, pp. 800-810, Aug. 2001.
[7] Y. Deng, C. Kenney, M.S. Moore, and B.S. Manjunath, “Peer group
filtering and perceptual color image quantization,” Proc. IEEE Int'l
Symp. Circuits and Systems, vol. 4, pp. 21-24, Jul. 1999.
[8] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis.
New York: John Wiley Sons, 1970.
[9] J. J. Ding, C. J. Kuo, and W. C. Hong, “An efficient image segmentation
technique by fast scanning and adaptive merging,” CVGIP, Aug. 2009.
[10] A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: a review,”
ACM Computing Surveys, vol. 31, issue 3, pp. 264-323, Sep. 1999.
[11] W. B. Frakes and R. Baeza-Yates, Information Retrieval: Data
Structures and Algorithms, Prentice Hall, Upper Saddle River, NJ, 13–
27.
[12] G. Nagy, “State of the art in pattern recognition,” Proc. IEEE, vol. 56,
issue 5, pp. 836–863, May 1968.
[13] A. K. Jain and R.C. Dubes, Algorithms for Clustering Data, Prentice
Hall, 1988.
[14] J. MacQueen, Some methods for classification and analysis of
multivariate observations, In Proceedings of the Fifth Berkeley
Symposium on Mathematical Statistics and Probability, 281–297.
[15] D. Comaniciu and P. Meer, “Mean shift: a robust approach toward
feature space Analysis,” IEEE Trans. Pattern Analysis and Machine
Intelligence, vol. 24, no. 5, pp. 603-619, May 2002.
[16] Y. Cheng, “Mean shift, mode seeking, and clustering,” IEEE Trans.
Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 790-799,
Aug. 1995.
[17] S. C. Pei and J. J. Ding, “The generalized radial Hilbert transform and its
applications to 2-D edge detection (any direction or specified
directions),” ICASSP 2003, vol. 3, pp. 357-360, Apr. 2003.
[18] L. Vincent, P. Soille, “Watersheds in digital spaces: an efficient
algorithm based on immersion simulations,” IEEE Trans. Pattern
Analysis and Machine Intelligence, vol. 13, issue 6, pp. 583-598, Jun.
1991.