Color Image Segmentation Technique Using “ Natural Grouping ” of Pixels

This paper focuses on the problem Image Segmentation which aims at sub dividing a given image into its constituent objects. Here an unsupervised method for color image segmentation is proposed where we first perform a Minimum Spanning Tree (MST) based “natural grouping” of the image pixels to find out the clusters of the pixels having RGB values within a certain range present in the image. Then the pixels nearest to the centers of those clusters are found out and marked as the seeds. They are then used for region growing based image segmentation purpose. After that a region merging based segmentation method having a suitable threshold is performed to eliminate the effect of over segmentation that may still persist after the region growing method. This proposed method is unsupervised as it does not require any prior information about the number of regions present in a given image. The experimental results show that the proposed method can find homogeneous regions present in a given image efficiently.

[1]  Shao-Yi Chien,et al.  Fast image segmentation based on K-Means clustering with histograms in HSV color space , 2008, 2008 IEEE 10th Workshop on Multimedia Signal Processing.

[2]  V. K. Banga,et al.  Color Image Segmentation Using Soft Computing , .

[3]  M. Ashtiyani,et al.  MRI Segmentation Using Fuzzy C-means Clustering Algorithm Basis Neural Network , 2008, 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications.

[4]  Yanling Li,et al.  Robust Image Segmentation Algorithm Using Fuzzy Clustering Based on Kernel-Induced Distance Measure , 2008, 2008 International Conference on Computer Science and Software Engineering.

[5]  Heng-Da Cheng,et al.  Fuzzy homogeneity approach to multilevel thresholding , 1998, IEEE Trans. Image Process..

[6]  Frank Y. Shih,et al.  Automatic seeded region growing for color image segmentation , 2005, Image Vis. Comput..

[7]  Rolf Adams,et al.  Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Jing Li Wang,et al.  Color image segmentation: advances and prospects , 2001, Pattern Recognit..

[9]  Harvey J. Greenberg.  Greedy Algorithms for Minimum Spanning Tree , 1998 .

[10]  Frank Nielsen,et al.  Statistical region merging , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Hichem Frigui,et al.  Clustering by competitive agglomeration , 1997, Pattern Recognit..

[12]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

[13]  atherine,et al.  Finding the number of clusters in a data set : An information theoretic approach C , 2003 .

[14]  Nirmalya Chowdhury,et al.  Finding the Natural Grouping in a Data Set Using MST of the Data Set , 2005, IICAI.

[15]  C. A. Murthy,et al.  Minimal spanning tree based clustering technique: Relationship with Bayes Classifier , 1997, Pattern Recognit..

[16]  Paul F. Whelan,et al.  Color image segmentation using a spatial k-means clustering algorithm , 2006 .

[17]  Jianping Fan,et al.  Automatic image segmentation by integrating color-edge extraction and seeded region growing , 2001, IEEE Trans. Image Process..

[18]  Sankar K. Pal,et al.  A review on image segmentation techniques , 1993, Pattern Recognit..

[19]  M. Hamidi,et al.  CLPSO-based Fuzzy Color Image Segmentation , 2007, NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society.