International Conference on Digital Image Processing

An Image SegmentationA lgorithm SegmentationA Based on F uzzy C -Means Clustering uzzyC -Means
Xin-bo ZHANG College of Information and Electronic Engineering,ZheJiang Gongshang University Hangzhou,zhejiang,china Li JIANG College of Information and Electronic Engineering ,ZheJiang Gongshang University Hangzhou,zhejiang,china jl321123@163.com
lots of work have been done, there is still no a general segmentation algorithm to and a impersonality criterion estimate the

Abstract
Image segmentation algorithm based on fuzzy cmeans clustering is an important algorithm in the image segmentation field. It has been used widely. However, it is not successfully to segment the noise image because the algorithm disregards of special constraint information. It only considers the gray information. Therefore , we proposed a weighed fcm algorithm based on gaussian kernel function for image segmentation . The original euclidean distance is replaced by a kernel-induced distance in the algorithm . Then, a bound term is added to the objective function to compensate the influence of the spatial information. The experimental results illustrate that the proposed method is more effective to image segmentation.

segmentation. According to concretely instances, many segmentation algorithms have been put forward. Among them, image segmentation algorithm field[10] [12]. based It on fuzzy c-means could retain much is an more important algorithm in the image segmentation information from the original image than hard segmentation methods . Fuzzy c-means clustering algorithm is a representative clustering algorithm . However, FCM algorithm can't realiz e feature optimiz ation of the sample dates. Meanwhile, with the original FCM algorithm, we can't get satisfactory results because of the influence of the noise. Document[2][4][7][9] put forward a FCM algorithm based on kernel density function. The original euclidean distance is replaced by a kernel-induced distance in the algorithm . This new algorithm can effectively analyz e many data structures such as non-hyperspherical structure, mix ed structure composed of heterogeneous cluster prototypes , and data with noise and so on . In this paper, using kernel function instead of euclidean distance, considering spatial information, initializ ing weight and increasing constraint item, we proposed a weighed fcm algorithm based on gaussian kernel function for image segmentation . The proposed method can
22

Key words: fuzzy c-means; gaussian kernel

function; weighted; image segmentation

1. Introduction
Image segmentation algorithm is a crucial step

in the image processes and analysis. It plays a

vital role in many fields such as computer vision, pattern recognition and medical image processing. The goal of segmentation is to Although ,

separate an image into some regions of feature and to pick up the interesting objects.
978-0-7695-3565-4/09 $25.00 2009 IEEE DOI 10.1109/ICDIP.2009.15

fully consider the influence of the noise. By it the target can be ex tracted from the background effectively in noisy images.

In the literature [4], the author brought forward a fuzzy c-means clustering algorithm based on kernel density function. The Euclidean distance in the standar d FCM algorithm was replaced by kernel model. The objective function [3][5][9]was:

2. Kernel density function[2]

Solving random variable distribution density function by given sample sets is one of the basic problem in probability statistics. The methords of solving this problem include parameter estimation and non-parameter estimation. People presume that the random date sets obey specific distribution among every possible class in

C N 2 m Jm = u ij ( x j ) ( v i ) i=1 j =1
Where

(3)

{x , j = 1,2,..., N } was a set of image

j

gray. C was the number of classification. was the menbership of cluster . center. degree
i

ij

th object in the

i th

parameter estimation. However, experiences and theories show that this presumption disagrees with actual physial models. And these methods can't always achieve satisfactory results. Due to the above defects, people brought forward the kernel density estimation, one kind of the nonparameter estimations. We can map the datas from highdimensional space to low-dimensional space by kernel density estimation. That realiz ed feature optimiz ation. That is to say, a set of sample date as (

{v , i = 1,2,..., C}
m
of degree. classification

was clustering

was weighted coefficient of the It controlled the fuzzy .According

ij

menbership

to

the

lagrange multiplier rule,

and

v were:
i
2

ij

( x j ) (v i )
c

1 m

k=1

( x j ) (vk )
m ij j

1 m

x , i = 1,2,..., N
i

could

be

ex pressed

(u

j =1 N

x ).
i

(.)is a nonlinear mapping function.

) x (u )
m ij j =1

(4)

A kernel in the feature space can be represented as a function K below:

While using GRBF, k ( x , x ) 2

= 1,then:

k ( xi , x j ) = ( ( xi ), ( x j ))
is G aussian kernel [11]. radial basis function

(1)

The commonl y-used kernel function in literature (GRBF)

(x)(v) =k(x,x)+k(v,v) j i j j i i
2 (x,v)=2(1k(x,v)) k j i j i
C N m J m = 2 uij (1 k( xj ,vi)) i =1 j =1
(5) And,obtained by substituting (5) into (3)and(4):

k ( xi , x j ) = exp(

xi x j
2
2

(2)

(6)

In the formula, is the width of the GRBF.

3. Fuzzy c-means clustering algorithm based on kernel density function

(x , v )] u = [1 k (x , v )]
[1 k
j i ij c j k k =1

1 1 m 1 1 m

(7)

23

 1 C N [1 k xj , vi ]1m (1 k (x , v )) J m' = 2 c 1 j i i = 1 j = 1 [1 k , ]1m xj vk k =1

by using the original image and its smoothed image, the target and background can be more easily distinguished than in a 1D histogram. So the implement method of initializing weight

N C [1 k xj , vi ] (1 k(xj ,vi)) =2 m 1 c j = 1i = 1 [1 k , ]1m xj vk k =1

C

( ) ( ) )
1 1m

m 1m

by using 2D histogram is:

Using 33 or 55 template to smoothing

N [1 k xj ,vi ] = 2 i=1 1 m j =1 c 1 m [1 k xj ,vk ] k=1

f ( m, n ) , we get the
Then

smoothed image array

g ( m, n) .
( s , t) ,
is a point

initializing a binary

Substituting

in the upper ex pression for

C

k:
(8)

s, t = 0,1,..., L 1. And every (s, t)

N ' J m = 2 [1 k j = 1 k =1

(x , v )]
j k

1 1 m

1m

on plane S T . Let the number of occurrence of

In this case, the objective function relates to the gaussian kernel function merely. It not only optimiz e the clustering model, but optimiz e the validity function judging clustering effect.

( s , t ) is
L 1
=0

st

and the following hold the joint probability

s t nst = 1 .Then
=0

L 1

density function is

4. An image segmentation algorithm imagesegmentation based on kernel-weighed fcm kernel-weighed clustering

nitializing 4.1 Initializing weight

st

st

M N

, in another

word, that is the 2D histogram. The diagonal elements of pix el pairs

st

ex press the number of the

( s, s) .

For one image

f (m, n)

, m = 1,..., M ; .

n = 1,..., N .

Its gray level is

. Then the

4.2 The implement segmentation implementsegmentation algorithm

The objective function of KWFCM algorithm as follows:

appearance probability of every gray can be ex pressed:

h = M N , i = 0,1,..., L 1
i

n (i )

and

the following hold:

h = 1 which
i =0 i

L 1

n (i )

C N 2 m J m'' = j uij ( x j ) (vi ) i =1 j =1

According rule, to the lagrange

(9)

represents the number of occurrence of the pix el. i is the gray of the pix el [6]. However, on a 1D gray histogram, the distribution of the target and background is overlapped due to the relativity between a pix el and its neighborhood pix els. So with the method of histogram we can't get satisfactory result. Therefore, image's spatial information can be fully used. For ex ample, building a 2D histogram

multiplier

ij

and

v are:
i

u=
ij

[1k xj , vi ]1m

[1 k(x , v )]
j k k=1

1 1m

24

m j (u ij ) x j j
=1 N

(10)

j (u ij ) j
=1

5. Experiments and results

In order to compare the image segmentation property of the traditional FCM algorithm and the proposed algorithm, we make lots of ex periments on different images and analyz e the results. Ex periment one carries out division on a car license image containing many targets. Figure 1(a) is a primitive image. We make division on it by FCM algorithm, KFCM algorithm and KWFCM algorithm respectively. Figure 1(d). the image divided by KWFCM Ex periment two carries out division on a image of lena.Figure 2(a) is a primitive image. Figure 2(b) and figure 2(c) are the images after division by FCM algorithm and KWFCM algorithm respectively. After diving by FCM algorithm the mirror, pillar and the ribbon on hat can not be distinguished well. Detail parts such Figure 1(a). The primitiv e image as hair and cap ear cannot be distinguished nearly. While these can be distinguished well by KWFCM algorithm. Figure 1(c) . the image div ided by KFCM

Figure 1(b). the image divided by FCM Those from figure 1(b) to figure 1(d) are the images after division. it can Contrasting be seen that the the the the FCM modified Figure 2(a). The primitiv e image ex perimental results,

background after diving includes massive noises and the target is not clear although algorithm background. algorithm neighbourhood performance. can separate However, with the goal from the

which considers the influence of pix els we get good division Figure 2(b). the image after division by FCM algorithm

effect.It has demonstrated the good anti-chirp

25

Applications, Publishing House of XIDIAN

University, Xian, 2004.1. [4] Z hang DQ and Chen SC, Kernel-based fuz zy clustering incorporating spatial constraints for image segmentation, Proceedings of the Second International Conference on Machine Learning and Cybernetics, Xian,2003.11. [5] R. J. Hathway and J. C. Bezdek, Optimiz ation of

Figure 2(c). the image after div ision by KWFCM algorithm

clustering criteria by reformulation,

IEEE

Transactions on Fuz z y System,May 1995, vol. 3, no. 2, pp.241-245. [6] Refael C.Gonz alez and Richard E.Woods, Digital

6. Conclusion
Image segmentation is an important aspect in image processing. The division quality directly effect the high-level image analysis and understanding. That,using FCM algorithm in

Image

proccessing(second edition),

Pearson

Education Asia LimitedAnd Publishing House of Electronics Industyt, 2007.8. [7] M. Girolami, Mercer kernel-based clustering in feature space , IEEE Trans. Neual Networks, May 2002, vol. 13, pp. 780-784. [8] Z hang DQ, Chen SC. Fuz z y clustering using kernel methods. In: Proceedings on of the

image segmentation, can reduce the artificial intervention effectively. It suits the images with uncertainty and fuzziness. Since the tradition FCM algorithm failed to consider the influence of neighbourhood pix els,its anti-noise ability is pretty bad. This paper proposed a weighed fcm algorithm based on gaussian kernel function for image segmentation . This method introduced the influence of neighbourhood pix els and kernel function, initializ ed weight by 2D histogram and perfected the division model.The ex perimental results indicated that the proposed method is quite effective. It has strong robustness to the noise and certain actual meaning.

International

Conference

Controland

Automation, Xiamen,China, June, 2002. [9] Songcan Chen and Daoqiang Z hang, Robust

image segmentation using FCM with spatial constraints based on new kernel-induced distance measure, Systems, Man and Cybernetics, Part B, IEEE Transactions on V olume 34, Issue 4, Aug. 2004 Page(s): 1907 - 1916. [10] Bezdek JC, Hall LO and Clarke LP, Review of MR image segmentation techniques using pattern recognition, MedPhys ,1993, 20:103348. [11]Muller KR and Mika Setal, An introduction to kernel-based learning algorithms, IEEE Trans

Neural Networks , 2001, 12(2):181202.

7. References
[1] Bezdek J C, Pattern Recognition with Fuzzy

[12] Pham DL and Prince JL, An adaptive fuz zyCmeans algorithm for image segmentation in the presence of intensity inhomogeneities, Pattern Recognit Lett , 1999, 20(1):5768.

Objective Function Algorithms, Plenum Press, New

York, 1981. [2] Dao-Qiang Z hang and Song-Can Chen, A novel kernelized fuz zy C-means algorithm with

application in medical image segmentation, Artificial PP. 3750. [3] Xin-bo GAO, Fuzzy Cluster Analysis and its
26

Intelligence

in

Medicine,

2004,