6 (IJCNS) International Journal of Computer and Network Security,

Vol. 2, No. 1, January 2010

An Improved Implementation of Brain Tumor

Detection using Soft Computing
Marcus karnan1 and T.logeswari2
1
Tamilnadu College of Engineering
Coimbatore, India
drmkarnan@gmail.com
2
Research Scholar, Dept of Computer Science
Mother Theresa women’s University
Kodaikkanal, India
saralogu4uin@gmail.com

Abstract: Ant Colony Optimization (ACO) metaheuristic is a
recent population-based approach inspired by the observation of
real ants colony and based upon their collective foraging
behavior. In ACO, solutions of the problem are constructed
within a stochastic iterative process, by adding solution
components to partial solutions. Each individual ant constructs
a part of the solution using an artificial pheromone, which
reflects its experience accumulated while solving the problem,
and heuristic information dependent on the problem. In this
paper, the proposed technique ACO hybrid with Fuzzy and
Hierarchical self organizing Map(HSOM) Hybrid with Fuzzy
describe segmentation consists of two steps. In the first step, the
MRI brain image is Segmented using HSOM Hybrid with Fuzzy
and the second step ACO Hybrid with Fuzzy method to extract
the suspicious region from Background tissue Both techniques
are compared and performance evaluation is evaluated
Keywords: MRI Brain Image analysis, ACO, HSOM, Fuzzy
C-Means.
1. Introduction
Brain tumors are abnormal growths in the brain that can be
either cancerous (malignant) or non cancerous (benign).
The effects on the brain of malignant and benign brain
tumors are very similar and can cause the same types of
problems depending upon the type of tumor and where it is
located in the brain. Each year more than 2Lakhs people in
the United States are diagnosed with a primary or metastatic
brain tumor. Primary brain tumors comprise approximately
40,000 of these diagnoses. Brain tumors are the leading
cause of solid tumor cancer death in children under the age
of 20, now surpassing Acute Lymphoblastic Leukemia
(ALL). They are the second leading cause of cancer death in
male adults ages 20-29 and the fifth leading cause of cancer
death in female adults ages 20-39. Metastatic brain tumors,
cancer that spreads from other parts of the body to the brain,
are the most common types of brain tumors. They occur in
10-15% of people with cancer. Primary brain tumors
generally do not metastasize to other parts of the body.
Although computer-aided Magnetic Resonance
Imaging(MRI) brain image has been studied over the last
two decades, automated interpretation of segmentation still
remains very difficult. Double readings, as carried out, for
example, by two radiologists, usually improve the quality of
diagnostic findings, thus, greatly reducing the probability of
misdiagnosis. On these grounds, adequate computational
tools are expected to be helpful to the radiologist. Thangavel
et al., [12,13] presented a study on methods of various
stages on automatic detection of micro calcification in
digital mammograms. According to those studies it is noted
that the ACO has not been implemented in the field of
mammogram analysis. In this paper, meta-heuristic
algorithms such as ACO are implemented to extract the
suspicious region in the MRI Brain Image. The textural
features can be extracted from the suspicious region to
classify them into benign or malign. two different methods
ACO hybrid with Fuzzy and HSOM Hybrid with Fuzzy is
used for segmentation
2. Segmentation
Segmentation is the initial step for any image analysis.
Segmentation is an important process to extract information
from complex medical images. Segmentation has wide
application in medical field [1,4,10].The main objective of
the image segmentation is to partition an image into
mutually exclusive and exhausted regions such that each
region of interest is spatially contiguous and the pixels
within the region are homogeneous with respect to a
predefined criterion.[15] Widely used homogeneity criteria
include values of intensity, texture, color, range, surface
normal and surface curvatures. During the past many
researchers in the field of medical imaging and soft
computing have made significant survey in the field of
image segmentation [5,9,10]
2.1 Hierarchical Self Organizing Map (HSOM)
Image segmentation techniques can be classified as based on
edge detection, region or surface growing, threshold level,
classifier such as HSOM, and feature vector clustering or
vector quantization. Vector quantization has proved to be a
very effective model for image egmentation process [2].
Siyal et al described a new m method on Fuzzy C-means for
segmentation purpose Multiforme[10]. Murugavalli1 and
Rajamani , A high speed parallel fuzzy c-mean algorithm
for brain tumorsegmentation [11]. Murugavalli1, and
Rajamanil An Improved Implementation of Brain Tumor
Detection Using Segmentation Based on Neuro Fuzzy
Technique Self Organizing Map (SOM) is a member of the
Competition learning Neural network (CLNNs) and thiscan
be the best choice when implementing vector quantization
 (IJCNS) International Journal of Computer and Network Security, 7
using neural network. The importance of SOM for vector
quantization is primarily due to the similarity between the
competitive learning process employed in the SOM and the
vector quantization procedure .The HSOM directly address
the aforesaid shortcomings of the SOM. HSOM is the
combination of self organization and graphic mapping
technique. HSOM combine the idea of regarding the image
segmentation process as one of data abstraction where the
segmented image is the final domain independent
abstraction of the input image.. The neuron with weight
vector most similar to the input is called the Best Matching
Unit (BMU). The weights of the BMU and neurons close to
it in the SOM lattice are adjusted towards the input vector.
The magnitude of the change decreases with time and with
distance from the BMU. The update formula for a neuron
with weight vector Wv(i) is
Wv(i+ 1) = Wi(i+1)=wi(i)+hci(I)*[(x(i)-w(i))] (1)
Here hci is neighborhood function to calculate it
h(i)=h(rc-r1)*a(i)*alpha (2)
Here rc-r1=current neuron-next current neuron
a(i)=sigma 0 * exp(-i/nsm) (3)
Initialize the variable
Sigma=number of neighborhood pixels (8 or 24 or 48 or
80 or 120)
if sliding window size(3*3=8),(5*5=24),(7*7=48),)
(9*9=80),(11*11=120)
Sigma N= Sigma 0 * exp(-i/taul) (4)
Taul= total number of pixels / log(neighborhood number
of pixel)
Similarly find the sigma value for each and every pixel This
process is repeated for each input vector for a (usually large)
number of cycles λ. The network winds up
associating output nodes with groups or patterns in the input
data set. If these patterns can be named, the names can be
attached to the associated nodes in the trained net.
The winning neuron formula is
||x-wc||=maxi{[=x-wi]} (5)
X is a neuron ,wi is the weight vector
2.2 Ant Colony Optimization (ACO)
Ant Colony Optimization (ACO) is a population-based
approach first designed by Marco Dorigo and coworkers,
inspired by the foraging behavior of ant colonies [3].
Individuals ants are simple insects with limited memory and
capable of performing simple actions[6,13]. However, the
collective behavior of ants provides intelligent solutions to
problems such as finding the shortest paths from the nest to
a food source. Ants foraging for food lay down quantities of
a volatile chemical substance named pheromone, marking
their path that it follows. Ants smell pheromone and decide
to follow the path with a high probability and thereby
reinforce it with a further quantity of pheromone. The
probability that an ant chooses a path increases with the
number of ants choosing the path at previous times and with
the strength of the pheromone concentration laid[3,5,16]. In
this work, the labels created from the MRF method and the
posterior energy function values for each pixel are stored in
a solution matrix. The goal of this method is to find out the
optimum label of the image that minimizes the posterior
energy function value. Initially assign the values of number
Vol. 2, No. 1, January 2010
of iterations (N), number of ants (K), initial pheromone
value(T0).
Pheromone Initialization: The initial pheromone value T
0 has been initialized for each ant and a random pixel is
chosen from the image, which has not been selected
previously. To find out the pixels is been selected or not, a
flag value is assigned for each pixel. Initially the flag value
is assigned as 0, once the pixel is selected the flag is
changed to 1. This procedure is followed for all the ants. For
each ant a separate column for pheromone and flag values
are allocated in the solution matrix.
Local Pheromone Update: Update the pheromone values
for all the randomly selected pixels using the following
equation:
T new= (1 – ρ) * Told + ρ * T 0(2) (6)
where Told and T new are the old and new pheromone values,
and ρ is rate of pheromone evaporation parameter in local
pdate, ranges from [0,1] i.e., 0 < ρ < 1. Calculate the
posterior energy function value for all the selected pixels by
the ants from the solution matrix.
Global Pheromone Update: Genetic algorithm [7,8,14] is
used to compare the posterior energy function value for all
the randomly selected pixels from each ant, to select the
minimum value from the set, which is known as ‘Local
Minimum’ (Lmin) or ‘Iterations best’ solution. The
subsequent algorithm implements genetic operators to find
out the local minimum
3. Implementation Of ACO And HSOM With
Fuzzy
Fuzzy C-Means Based on the previous equation,
the first step of the regularized FCM-HSOM algorithm is
the following:
Step 2: Calculate the cluster centers.
C = (N/2)1/2 (7)
Step 3: Compute the Euclidean distances
Dij = CCp – Cn (8)
Step 4: Update the partition matrix
1
U ij = 2 / (m-1)
c
 d ij 
∑  
k=1  d kj 
(9)
(Repeat the step 4)
Until Max[ │Uij(k+1)-Uijk│] <€ is satisfied
Step 5: Calculate the average clustering points.
c c n
Ci = ∑ J i = ∑∑ Uij n dij 2
i =1 i =1 j =1
(10)
Step 6: Compute the adaptive threshold Adaptive threshold
=max (Adaptive threshold, ci ) i=1...n
In the first step ,the algorithm select the initial cluster from
HSOM Clustering algorithm. Then, in later step after
several iteration of the algorithm, the final result converges
to actual cluster center achieved and it is very important for
an FCM algorithm.
8 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 1, January 2010

Table2 shows the result of image segmentation of ACO .In

4. Result And Analysis
Table1 shows the result of image segmentation of HSOM .In
any computer aided analysis ,the execution time is one of
the important parameters of medical image segmentation .In
these result, we have calculated the number of tumor cells of
different neighborhood pixel of 3×3, 5×5, 7×7, 9×9, 11×11
windows. In that 3×3 window
is chosen based on the high contrast than 5×5, 7×7, 9×9,
any computer aided analysis ,the execution time is one of
the important parameters of medical image segmentation .In
these result, we have calculated the number of tumor cells of
different neighborhood pixel of 3×3, 5×5, 7×7, 9×9, 11×11
windows. In that 3×3 window is chosen based on the high
contrast than 5×5, 7×7, 9×9, and 11×11.
Table 2: Adaptive threshold Number of segmented pixel,
Execution time, weight

Value / Value / 3x3 5x5 7x7 9x9 11x11

Neighbor
Neighborhood
hood
pixels 3x3 5x5 7x7 9x9 11x11 pixels
Adaptive 188.338 164.752 161.138 150.749 139.38
Adaptive Threshold 6 4 5 1 62
threshold 184.07 152.09 149.70 141.15 133.22 Number of
Segmente
Number of
d 765 1894 2260 4050 8299
segmented Execution 19.292
Time 40.9446 27.4551 24.8271 24.163 5
pixels 883 3732 4319 7417 12025
Weight 8 40 50 87 122
Execution
time 31.83 33.14 29.50 27.02 28.364
Figure 2 shows the tested segmented image with various
Weight 28.28 51.22 55.05 74.56 93.91 neighborhood pixels .the original image of(256x256).
and 11×11.

Table 1: Adaptive threshold Number of segmented pixel,

Execution time, weight

Figure 1 shows the tested segmented image with various

neighborhood pixels .the original image of (256x256)

Figure 2. Input image (256x256), output 3x3, output 5x5,

output 7x7

Figure 1. input image (256x256), output 3x3, output 5x5,

output 7x7, output 9x9, output 11x11
5. Performance Analysis
 (IJCNS) International Journal of Computer and Network Security, 9
It is very difficult to measure the performance of
enhancement objectively. If the enhanced image can make
observer perceive the region of interest better, then we can
say that the original image has been improved. Here we are
giving input image in that neighborhood pixel of 3×3, 5×5,
7×7, 9×9, 11×11 windows are analyzed. In that 3×3 window
is chosen based on the high contrast than 5×5, 7×7, 9×9,
and 11×11
Figure3 shows the wining neuron for HSOM is 3x3 is 209,
5x5 is 201, 7x7 is 194, 9x9 is 186 and 11x11 is 177. Figure
4 shows the Execution time in HSOM of 3x3 is 13.76 , 5x5
is 14.96 , 7x7 is 15.20, 9x9 is 11.05 and 11x11 is 11.53.
Figure 5 shows the weight vector for HSOM is 3x3 is 14 ,
5x5 is 8 , 7x7 is 15, 9x9 is 23 and 11x11 is 32 .. Figure 6
shows the number of segmented pixel in HSOM of 3x3 is
795, 5x5 is 1073, 7x7 is 1285, 9x9 is 1594and 11x11
is1881. Below the figure shows the performance analysis of
given input image.
Figure 3. relationship between Adaptive threshold and
neighborhood pixels
Figure 4. relationship between execution time and
neighborhood pixels
Vol. 2, No. 1, January 2010
Figure 5. relationship between weight and neighborhood
Pixels
Figure 6. relationship between no of segmented pixel
and neighborhood pixels
In above 3×3, 5×5, 7×7, 9×9, 11×11 windows are analyzed
in that 3×3 window is chosen based on the high contrast
than 5×5, 7×7, 9×9, and 11×11.
6. Conclusion
In this work, a novel approach applied to MRI Brain Image
segmentation based on the combination of HSOM with
fuzzy and Ant Colony System with Fuzzy Algorithm is
Analysised. In that The self-organizing map describes a
mapping from a higher dimensional input space to a lower
dimensional map space. The procedure for placing a vector
from data space onto the map is to find the node with the
closest weight vector to the vector taken from data space and
to assign the map coordinates of this node to our vector. Ant
Colony Optimization (ACO) with Fuzzy Algorithm have
been used to find out the optimum label that minimizes the
Maximizing a Posterior estimate to segment the image. The
ACO search is inspired by the foraging behavior of real
ants. Each ant constructs a solution using the pheromone
information accumulated by the other ants. In each iteration,
local minimum value is selected from the ants’ solution and
the pheromones are updated locally. Fuzzy Algorithm is
used to find out the local minimum. If this value is less than
global minimum, the local minimum is assigned to global
minimum. The pheromone of the ant that generates the
global minimum is updated. At the final iteration global
10
minimum returns the optimum label for image
segmentation. In the above 3×3, 5×5, 7×7, 9×9, 11×11
windows are analyzed the ACO with Fuzzy of 3×3 window
is chosen based on the high contrast than 5×5, 7×7, 9×9,
and 11×11.
ACKNOWLEDGEMENT
The author wishes to thank Doctor Pankaj Metha for his
helpful suggestion on tumor recognition with his knowledge
and experience in medicine area. The MRI Image data
obtained from KMCH Hospital.in Coimbatore
INDIA
References
[1] Aaron Lefohn, Joshua Cates, Ross Whitaker,”Interactive
GPU-Based level sets for 3D Brain Tumor
Segmentation”, April 16, 2003.
[2] Bilbro, G., M. White and W. Snyder, 1987. “Image
segmentation with neurocomputers”, In: R. Eckmiller
and C.van der Malsburg (eds.), NeuralComputers,
NATO AS1 Series, (Springer-Verlag, Berlin, Germany),
41: 7 l-79.
[3] M. Dorigo, V. Maniezzo and A. Colorni. The Ant
System:
Optimization by a Colony of Cooperating Agents. IEEE
Transactions on Systems, Man and Cybernetics-Part B,
1(26):29-41, 1996
[4] M. Dorigo and T. Stuztle, Ant Colony Optimization,
PHI ed, 2005.
[5] J. A. Gamez and J. M. Puerta. Searching for the best
elimination sequence in Bayesian networks by using ant
colony optimization. Pattern Recognition Letters,
23:261- 277, 2002.
[6] Haralick, R.M. and L.G. Shapiro, 1985. “Survey ,image
segmentation techniques”, Computer Vision, Graphics
Image Process, 29: 100-132[9]
[7] M.Karnan and K.Thangavel, Automatic Detection of the
Breast Border and Nipple Position onDigital
Mammograms Using Genetic Algorithm, International
Journal on Computer Methodsand Programs in
Biomedicine (Elsvier). VOL 87, pp.12-20 2007
[8] M.Karnan, R. Sivakumar, M. Almelumangai, K.
Selvanayagi and T. Logeswari,” Hybrid ParticleSwarm
Optimization for Automatically Detect the Breast Border
and Nipple position toIdentify the Suspicious Regions on
Digital Mammograms Based on
ymmetries”,International Journal of Soft Computing 3
(3): 220-223, 2008
[9] Kohonen, T., “Self-Organization and Associative
Memory”, 2nd Edition (Springer-Verlag, Berlin,
Germany, 1988.
[10]sai.C,Manjunath .S, Jagadeesan.R, ”Automated
Segmentation of brain MR Images”,Pergamon, Pattern
Recognition, Vol 28, No 12, March 1995.
[11] S. Murugavalli1 , V. Rajamani,” A high speed parallel
fuzzy c-mean algorithm for brain tumor
segmentation” ,BIME Journal, Volume (06), Issue (1),
Dec., 2006.
(IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 1, January 2010
[12] S. Murugavalli1 , V. Rajamani,” An Improved
Implementation of Brain Tumor Detection Using
Segmentation Based on Neuro Fuzzy Technique”
Journal of Computer Science 3 (11): 841-846, 2007.
[13] K. Thangavel, M. Karnan, R. Siva Kumar, and A. Kaja
Mohideen. Automatic Detection of Microcalcification in
Mammograms-A Review. International Journal on
Graphics Vision and Image Processing, 5(5):31-61, 2005
[14] K.Thangavel, M.Karnan, P.Jaganathan, Pethalakshmi,
R.Siva Kumar and Geetha Ramani, “Ant Colony
Algorithms In Diverse Combinational Optimization
Problems –A Survey,” International Journal on
Automatic Control System and Engineering, vol. 6, no.
1, pp: 7-26, 2005.
[15]K.Thangavel, M.Karnan, R.Siva Kumar and
A.Kajamohideen, “ Segmentation and Classification of
Microcalcification in Mammograms Using the Ant
Colony System,” International Journal on Artificial
Intelligence and Machine Learning, vol. 5, no. 3, pp: 29-
40, 2005.
[16] Y. Ge, Q. C. Meng, C. J. Yan and J. Xu. A Hybrid Ant
Colony Algorithm for Global Optimization of
Continuous Multi-Extreme Functions. Proceedings of the
Third International Conference on Machine Learning
and Cybernetics, Shanghai, 2427-2432, 2004.
Authors Profile
Marcus Karnan received the BE
Degree in Electrical and Electronics
Engineering from Government
College of Technology,Bharathiar
University, India. Received the ME
Degree in Computer Science and
Engineering from Government
College of Engineering,Manonmaniam
Sundaranar University in 2000.
Received the PhD degree in CSE from Gandhigram Rural
University, India in 2007, Currently he is working as Professor,
Department of Computer Science & Engineering Department,
Tamilnadu College of Engineering, India. He has been in teaching
since 1998 and has more than eleven years in industrial and
research experience. His area of interests includes medical image
processing, artificial intelligence, neural network, genetic
algorithm, pattern recognition and fuzzy logic
T.Logeswari received MCA degree
in the year 2006 and Mphil degree
in the year 2007 from Alagappa
university , Karakudi, India. She
has registered Phd In Mother
Terasa Women’s University,
Kodaikanal ,India in the year 2007.
She has 3 year of teaching Experience. She has presented 5
paper in International Conferences and published 2 paper in
International Journals.