An image C-mean clustering
algorithm includes the steps of conducting grey transformation on an image to obtain a grey image; freely selecting c different values from 0 to 255 to serve as central values for segmenting the image into c types, wherein in other words, the values of z<(k)>[1], z<(k)>[2]...z<(k)>[c], and k is made equal to 0; dividing grey values g(x,y) (x is equal to 1, 2...M, and y is equal to 1,2...N) of pixels of all different positions in the image into a certain type in the c types one by one according to the
minimum distance principle; if the equation (please see the equation in the formula) works, x is equal to 1,2...M, y is equal to 1,2...N and a value belongs to {1,2...c} exists, judging that g(x,y) belongs to
omega<(k+1)>[l], wherein
omega<(k+1)>[l] (l is equal to 1,2...c) is a cluster, the equation (please see the equation in the specification) represents the distance between g(x,y) and the center z<(k)>[j] of
omega<(k)>[j], the superscript represents the iterative times, and then a new cluster omega<(k+1)>[j] (j is equal to 1,2...c) is generated; calculating the centers of all newly-divided types, wherein in the equation, n<(k+1)>[j] represents the number of
modes contained in the type omega<(k+1)>[j]; ending if z<(k+1)>[j] is equal to omega<(k)>[j] (j is equal to 1,2...c).