An Improved K-means Algorithm for Brain MRI Image Segmentation

For the problem of low accuracy by the traditional K-means clustering algorithm to segment noised brain magnetic resonance imaging (MRI) images. This paper proposed an improved K-means algorithm. The traditional K-means algorithm only considers the brain image gray value itself, ignoring the relationship between pixels. Due to the characteristics of brain MRI image adjacent pixels most likely belonging to the same class, this paper adopts average value of small neighborhood of each image pixel and image gray value to compose a new sample point, in order to reduce the impact of noise on the clustering accuracy. Experimental results show that the improved K-means algorithm can effectively improve the segmentation accuracy of the noised brain MRI image.