Académique Documents
Professionnel Documents
Culture Documents
Keywords Abnormalities, Brain tumor, Fuzzy C-means, kmeans, Magnetic Resonance Imaging(MRI), Preprocessing, Thresholding.
I.
INTRODUCTION
130
Pre-processing
Segmentation
using K-means
Approximate
Reasoning
Feature
extraction
II. METHODS
2.1 Pre-processing
According to the need of the next level the pre
processing step convert the image. It performs filtering
of noise and other artifacts in the image and sharpening
the edges in the image. RGB to grey conversion and
Reshaping also takes place here. It includes median
filter for noise removal.
2.2 Segmentation
Segmentation is carried out by advanced K-means
and Fuzzy C-means algorithms.
2.3 Feature extraction and approximate reasoning
The feature extraction is extracting the cluster which
shows the predicted tumor at the FCM (Fuzzy C-means)
output. The extracted cluster is given to the threshold
process. It applies binary mask over the entire image. In
the approximate reasoning step the tumor area is
calculated using the binarization method.
131
Pre-processing
Segmentation
using K-means
&FCM
Feature Extraction
Approximate Reasoning
Tumor Area
Measurement
W (C )
k 1 C ( i ) k C ( j ) k
xi x j N k
k 1
xi m k
C (i) k
(1)
III. DESIGN AND IMPLEMENTATION
C ( i ) arg min x i m k
, i 1, , N
1 k K
each
(2)
Algorithm:
1. Give the no of cluster value as k.
2. Randomly choose the k cluster centers
3. Calculate mean or center of the cluster
4. Calculate the distance between each pixel to each
cluster center
132
INPUT
DATA
GET K VALUE
AND CHOOSE K
RANDOM
CALCULATE THE
MEAN OR CENTER
FOR EACH CLUSTER
CALCULATE
DISTANCE B/W EACH
PIXEL AND CLUSTER
IF PIXEL
CLOSE TO
no
COMPARE TO
NEXT CLUSTER
Yes
MOVE TO SAME
CLUSTER
RE-ESTIMATE THE
CENTER
REPATE
PROCESS
Fig.4 is the MR image given as input to the preprocessing and K-means algorithm. Here 0.02% of salt
and pepper noise is added and that has been removed
using the median filter. The K-mean algorithm clusters
the image according to some characteristics. Figure is
the output for K-Means algorithm with five clusters. At
the fifth cluster the tumor is extracted.
xi
r.c(i)=k
M=
, k=1,.....,k.
(3)
Nk
D(i)=argmin||xi-Mk||2,i=1,...,N
(4)
133
[2]
[3]
[4]
[5]
[6]
[7]
David
Rivest-Henault,
Mohamed
Cheriet,
Unsupervised MRI segmentation of brain tissues
using a local linear model and set,Elsevier, 2011.
[8]
[9]
T.
Logeswari,
M.Karnan,
An
Improved
Implementation of Brain Tumor Detection using
Segmentation
Based on Hierarchical Self
Organizing Map, IEEE, 2010.
[10]
[11]
[12]
[13]
El-Sayed Ahmed El-Dahshan, Tamer Hosny, AbdelBadeeh M.Salem, Hybrid intelligent techniques for
MRI Brain Images classification, Elsevier ltd, 2009.
[14]
[15]
134