A New Approach to Image Segmentation for Brain Tumor detection using Pillar K-means Algorithm

This paper presents a new approach to image segmentation using Pillar K-means algorithm. This segmentation method includes a new mechanism for grouping the elements of high resolution images in order to improve accuracy and reduce the computation time. The system uses K-means for image segmentation optimized by the algorithm after Pillar. The Pillar algorithm considers the placement of pillars should be located as far from each other to resist the pressure distribution of a roof, as same as the number of centroids between the data distribution. This algorithm is able to optimize the K-means clustering for image segmentation in the aspects of accuracy and computation time. This algorithm distributes all initial centroids according to the maximum cumulative distance metric. This paper evaluates the proposed approach for image segmentation by comparing with K-means clustering algorithm and Gaussian mixture model and the participation of RGB, HSV, HSL and CIELAB color spaces. Experimental results clarify the effectiveness of our approach to improve the segmentation quality and accuracy aspects of computing time.

[1]  James Ze Wang,et al.  SIMPLIcity: Semantics-Sensitive Integrated Matching for Picture LIbraries , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Samir Saoudi,et al.  Stochastic K-means algorithm for vector quantization , 2001, Pattern Recognit. Lett..

[3]  James Ze Wang,et al.  SIMPLIcity: Semantics-Sensitive Integrated Matching for Picture LIbraries , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Bo Wang,et al.  Partial likelihood for estimation of multi-class posterior probabilities , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[5]  Yunhe Pan,et al.  Using Hybrid Knowledge Engineering and Image Processing in Color Virtual Restoration of Ancient Murals , 2003, IEEE Trans. Knowl. Data Eng..

[6]  Michael Werman,et al.  Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping, and Image Database Organization , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Cor J. Veenman,et al.  A Maximum Variance Cluster Algorithm , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Siddheswar Ray,et al.  Determination of Number of Clusters in K-Means Clustering and Application in Colour Image Segmentation , 2000 .

[9]  Atsushi Kasao,et al.  4) K-Means Algorithm Using Texture Directionality for Natural Image Segmentation([マルチメディア情報処理研究会映像表現研究会ネットワ-ク映像メディア研究会画像情報システム研究会]合同) , 1998 .

[10]  Almerico Murli,et al.  The Wiener filter and regularization methods for image restoration problems , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[11]  Jitendra Malik,et al.  Blobworld: Image Segmentation Using Expectation-Maximization and Its Application to Image Querying , 2002, IEEE Trans. Pattern Anal. Mach. Intell..