You are on page 1of 19

International Journal of Computer Application

Issue 3, Volume 5 (September - October : 2013)


Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Lucrative Brain Oligodendrogliomas Neoplasm


Dissection in Asynchronous MRI via PCM-Fuzzy
Indigenous Framework
R. Arun1,D. Murugan2
1
Research Scholar, Department of Computer Science and
Engineering,Manonmaniam Sundaranar University, Tirunelveli, India.
2

Professor, Department of Computer Science and Engineering,


Manonmaniam Sundaranar University, Tirunelveli, India.

___________________________________________________________________________
Abstract Automatic quantitative of brain tumor MR images voxel volume analysis are
prone to intensity inhomogeneity of magnetic signal, noise level sensitivity, expensive
initialization and inaccurate computational of segmentation. This paper recommends a fast
and robust novel framework for the dissection of neoplasm with minimal user interface
consists of two phases. In the first phase, fusion of level set formulation and Gaussian
mixture model for bias field precision for the local intensity inhomogeneities or asynchronous
Magnetic Resonance imaging (MRI).To this end, precipitously purging the film artifact and
noise distortion through anisotropic filter. In the second phase, fuzzy connectedness
algorithm select seed point involuntarily to estimate tumor size, position and volumetric in
brain structure through threshold and edge point counter matrix parameters and subsequent
fuzzy local image exploits the posterior probability by diminishing an objective energy
function to enact spatial constraint to perform precise segmentation.The insinuated method
has been rigorously corroborated with images assimilated on variety of imaging modalities
with pledging results.
Keywords: Brain tumor segmentation, magnetic resonance imaging (MRI), Bias field
correction, Gaussian mixture model, Level set, Fuzzy connectedness,PCM
___________________________________________________________________________

I.

INTRODUCTION

Since the premature junctures of human history, the brain has been unique of the most
scrutinized segregates of the human anatomy. In an endeavour to stipulate beyond astuteness
imminent this organ, the number of explorations of the brain has been fostering during the
preceding century. Contemporary modus operandi have endorsed cumulative the
acquaintance in the borough of the brain structures and its manoeuvring [11]. The normal
adult human brain innately ponders between 1 and 1.5 kg and has an average volume of 1,600
cm3 [12]. The rudimentary anatomical brain structure can be perceived in Fig. 1.1.This organ
is made of three foremost fragments: the forebrain, midbrain, and hindbrain [11]. Human
brain is the complex organ in our body system and it is divided into forebrain, midbrain and
hindbrain that are filled with nutritional fluid filled ventricles that spread over the medulla
oblongata, pons, cerebellum, thalamus, hypothalamus and other regions. It performs logical
analysis through the cerebral cortex which is a hard layer of neural tissue divided as four lobe
regions.

R S. Publication, rspublicationhouse@gmail.com

Page 53

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Figure 1.1: Brain anatomy in conjunction with all the forebrain lobes
The unique ability of human for recognize future actions by comparison of "good" and "bad"
are induced by frontal lobe whereas parietal lobe performs sensory functions. Similarly, the
temporal lobe also involves in sensory processing like visual memories, develops emotional
feelings and helps to learn multiple language and semantics. Finally, the occipital lobe acts a
guard for the retinal regions. The brain is suspended in cerebrospinal fluid that produced in
the choroid plexus and hence it maintains neutral pressure balance between intracranial skull
and the bloodstream and it provides immunological protections and maintains chemical
stability in the central nervous system [1]. The brain requires high energy source for
metabolism activities that are blood glucose, ketone bodies, fatty acids and it shows brain
consists of rich nutritions content than any other organs in the human body [2].It positive
towards susceptible of various brain related diseases. The Brain tumor is the abnormal growth
of cells that either develop in the CSF or originate from other organs and metastatic to the
brain like lung tumor. The causes of tumors in our body are still unknown and some of the
possibilities include exposing to high penetration ionizing radiation especially continuous
usage of cell phones and heredity concerns based on family history are surmountable towards
brain tumor. The tumor, also called a mass that grows inside the intracranial region of limited
space of the brain and it expansion alters the brain cells causes some symptoms like
headache, vomiting, blurred vision (visual abnormalities) and speech difficulties because of
the damage in the left temporal lobe or motor cortex considered as focal symptoms and leg
cramps based on the grade of tumors.

Fig 1.2 Incidence of all brain tumors per year per 100,000 population based on age for
oligodendrogliomas
R S. Publication, rspublicationhouse@gmail.com

Page 54

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

The brain tumors are classified into four grades based on the intensity and it categories into
Gliomas and non-Gliomas. The Gliomas involving in the supportive or glial cells present in
the White Matter of brain and there many types of glial tumors are astrocytes,
oligodendrocytes, Glioblastomas multiform, brain stem gliomas, and the ependymal cells.
The Non-gliomas occur in other brain parts includes meninges (tissue coverings the brain)
and nerve sheath and the tumors arise from meninges cells are called meningiomas and
tumor starts from nerve sheath are called acoustic neuromas, vestibular schwannomas and
neurilemmomas. The shape of the tumor differs prominently and around 120 types of tumors
are identified. The oligodendrocytes has fried egg shaped cells and astrocytomas has star
shaped cells [3].The Cerebellum, that is discernable at the rearwards of the brain (Fig. 1.1),
incorporated with the pons and the medulla, encompass the hindbrain. The medulla, pons and
midbrain (tectum, tegmentum and substantia nigra) are recurrently insinuated mutually as the
brain stem (Fig. 1.1). These edifices are thereabouts utterly swathed by the cerebellum and
telencephalon, with merely the medulla perceptible as it amalgamates with the spinal cord.
As for the forebrain, it is epitomized by the cerebrum, thalamus, and hypothalamus [11]. The
cerebrum is the copious part of the human brain and is alienated into four detachments called
lobes characteristics within pathological regions (Bullitt et al.,2003). An objective and
reproducible segmentation procedure coupled with vascular analysis would allow us to study
the relation between pathologies and blood vessels and may function as a new diagnostic
measure. The Proposed system flow diagram is shown in Fig.1. Dr. H. B. Kekre et al. have
proposed a vector quantization segmentation technique to identify a cancerous mass from
MRI images. In order to improve the radiologists diagnostic performance, computer-aided
diagnosis (CAD) scheme has been introduced to enhance the recognition of primary
signatures of this disease: masses and micro calcifications. As well, to tackle the class
distinguishability as well as feature space sparseness and solution space intricacy problems in
multivariate image segmentation, a Markov random field (MRF) based multivariate
segmentation algorithm called multivariate iterative region growing using semantics
(MIRGS) has been proposed by Jue Wu et al .In MIRGS, the impact of intra-class variation
and computational cost has been minimized by means of the MRF spatial context model
integrated with adaptive edge penalty and applied to regions. Alirezaie et al., 1997, Ozkan et
al., 1993], and are appealing since they allow the modeling of non-linear dependencies
between the features, and minimize an objective measure of classification per-formance.
However, training ANN models is problematic due to the large amount of parameters to be
tuned and the abundance of local optimums. Classification with Support Vector Ma-chines
(SVM) has recently been explored by two groups for the task of brain tumor segmentation
[Zhang et al., 2004, Garcia and Moreno, 2004], and represent a more appealing approach than
ANN models for the task of binary classification since they have more robust (theoretical and
empiri-cal) generalization properties, achieve a globally optimal solution, and also allow the
modeling of non-linear dependencies in the features [Shawe-Taylor and Cristianini, 2004].
II.

LITERATURE SURVEY

In computer vision, image segmentation is the process of partitioning a digital image into
multiple segments (sets of pixels, also known as super pixels). The goal of segmentation is to
simplify and/or change the representation of an image into something that is more meaningful
and easier to analyze.Image segmentation is typically used to locate objects and boundaries
(lines, curves, etc.) in images. More precisely, image segmentation is the process of assigning
a label to every pixel in an image such that pixels with the same label share certain visual
characteristics. The result of image segmentation is a set of segments that collectively cover
the entire image, or a set of contours extracted from the image. Each of the pixels in a region
R S. Publication, rspublicationhouse@gmail.com

Page 55

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

is similar with respect to any characteristic or computed property, such as color, intensity, or
texture. Adjacent regions are significantly different with respect to the same characteristic (s).
When applied to a stack of images, typically in medical imaging, the resulting contours after
image segmentation can be used to create 3D reconstructions with the help of interpolation
algorithms like Marching cubes. Alternatively, brain MR images can be segmented by using
the Gaussian mixture model (GMM) [16], where the voxel intensities in each target region
are modeled by a Gaussian distribution [17]. The GMM parameters are usually estimated by
maximizing the likelihood of the observed image via the EM algorithm [2]. A major
drawback of the GMM-EM framework is its lack of taking the spatial information and
uncertainty of data into consideration. As a result, it may produce less accurate segmentation
results. To remedy this drawback, Greenspan et al. [18] and Blekas et al. [19] incorporated
the spatial constraints into the GMM. Tran et al. proposed the fuzzy GMM (FGMM) model
to address the uncertainty of data and improve parameter estimation [20]. Zeng et al. [21]
developed the type-2 FGMM (T2-FGMM) model for density modeling and classification.
However, to our knowledge, so far those fuzzy extensions of the GMM-based segmentation
algorithm have not been able to overcome the difficulties caused by the intensity
inhomogeneity. Medical image Segmentation is the process of partitioning an image into
different segments. In medical imaging, these segments often correspond to different tissue
classes, organs, pathologies, or other biologically relevant structures. Medical image
segmentation is made difficult by low contrast, noise, and other imaging ambiguities.
Although there are many computer vision techniques for image segmentation, some have
been adapted specifically for medical image computing. Below is a sampling of techniques
within this field; the implementation relies on the expertise that clinicians can provide. An
algorithm is presented for the fuzzy segmentation of two-dimensional (2-D) and threedimensional (3-D) multispectral magnetic resonance (MR) images that have been corrupted
by intensity inhomogeneities, also known as shading artifacts. The algorithm is an extension
of the 2-D adaptive fuzzy C-means algorithm (2-D AFCM) presented in previous work by the
authors. This algorithm models the intensity inhomogeneities as a gain field that causes
image intensities to smoothly and slowly vary through the image space. An adaptive spatial
fuzzy c-means clustering algorithm is presented in this paper for the segmentation of threedimensional (3-D) magnetic resonance (MR) images. The input images may be corrupted by
noise and intensity nonuniformity (INU) artifact. The proposed algorithm takes into account
the spatial continuity constraints by using a dissimilarity index that allows spatial interactions
between image voxels. The segmentation target therefore is driven by two forces, one
induced by the coherent local intensity and the other by the coherent global intensity, to
ensure the smoothness of the derived optimal bias field and improve the accuracy of the
segmentations. An integration of the proposed algorithm defines an energy function
METHODOLOGY
There Pham and Prince. [8] proposed an adaptive FCM (AFCM) algorithm, which
incorporates a spatial penalty term into the objective function to enable the estimated
membership functions to be spatially smoothed. Ahmed et al. [9] added a neighborhood
averaging term to the objective function, and thus developed the bias-corrected FCM
(BCFCM) algorithm. Liew and Yan. [10] used a B-spline surface to model the bias field and
incorporated the spatial continuity constraints into fuzzy clustering algorithms. Li et al. [6]
proposed an energy-minimization approach to the coherent local intensity clustering (CLIC),
with the aim of achieving tissue classification and bias field correction simultaneously. In this
paper, the Oligodendrogliomas tumor segmentation based on MR images are analyzed. The
Oligodendrogliomas are a type of on gliomas that develop in the oligodendrocytes of the
R S. Publication, rspublicationhouse@gmail.com

Page 56

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

brain. The oligodendrocytes cells in the brain perform supporting function for the neurons. It
insulates the axons that carry electrical impulse by creating the myelin sheath, which
encompassed with lipids and proteins. This brain cells also provide higher intelligence since
it correlated with white matter.

Fig 3.1 MRI Image of the ffected Real Time Oligodendroglioma Brain Tumor Patient
Hence, this enriched environment in the oligodendrocytes cells favors pathology when the
abnormal growth cells affect the white matter and myelin sheath causes oligodendrogliomas
[4], [5]. These tumors are highly prevalent towards adult and estimated that more than 5% of
tumors are oligodendrogliomas than other tumors. The affected patients initially have high
pressure in intracranial regions between the skull and it causes swelling up or edema
formation due to blockage of the blood stream outside the CSF. It results signs of headaches,
seizures, visual problems and behavior changes. Paralysis is the worst side effects followed
by the mood swings when the tumors occur in the frontal lobe. When the tumor develop in
the temporal lobe causes speech disorder and memory loss [6], [7]. The treatments depend on
the tumor size, position and the areas in the brain get affected. Generally, this tumor spreads
or invades the surrounding tissues cause massive damage. The neurosurgeon, neurologist and
oncologist team can able to identify the tumor through the visualization of MRI scans. The
surgery is the only way to eradicate tumor tissues followed by the radiotherapy but the
process is cost effective and time consuming in manual segmentation [8]. The investigations
of these lesions by the CT, MRI, PET scans show accurate identification of tumor based on
the position, shape, size and location. The CT Scans working on the principle of X-rays
which delivers high dose of radiation as it sensitive towards human which increase the
probability of cancer whereas PET Scan or Positron emission tomography ejects gamma rays
emitted indirectly towards human body and it produce powerful images for analysis of
metastatic tumors but it stills expose poor visualization compared with MRI and fMRI.
Fortunately, the MRI not involve in exposing harmful radiation instead it working on the
magnetic field with echo time and helpful for visualize soft tissues, brain cells and bone
cartilage and identify the blood circulation during blockages. But, it is cost effective and it
still unsuitable for investigating accurate orientation of tumors in supervised technique [9].
Hence, automatic segmentation is suggested in this paper for the oligodendrogliomas tumor.

R S. Publication, rspublicationhouse@gmail.com

Page 57

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Fig 3.2 Oligodendroglioma Tumor Image on Various Imaging Technique


(Courtesy to Dr. Frank Gailard from Royal Melbourne for adding oligodendrogliomas tumor
patient case ID 5309 in radiopaedia articles)
Sections show a neoplasm comprised predominantly of small round cells demonstrating a
minimal degree of pleomorphic and frequent pronuclear halos. No mitotic figures are evident.
There is no endothelial proliferation and no necrosis is evident. Toluidine blue-stained plastic
sections of the glutaraldehyde-fixed tissue show no additional findings.
Immunohistochemistry shows that scattered cells are positive for glial fibrillary acidic protein
(GFAP). The lesion shows a uniform distribution of MIB-1 positive cells. No p53-positive
cells were seen. This stereotactic brain biopsy shows histological features of a low-grade
oligodendroglia tumor. Thus, the features are consistent with an oligodendrogliomas and it is
relatively uncommon glial tumors (compared to astrocytomas) and have a predilection for
calcification.The Fig 3.3 shows MRI confirms the abnormality, which is high T2 and
intermediate T1 in signal, will little contrast enhancement. MR perfusion demonstrates
significantly increased CBV( area 'under' the purple curve) compared to the other side.

Fig 3.3 Electrical Signals impacted in the Oligodendrogliomas


WEINNER FILTER
The inverse filtering is a restoration technique for deconvolution, i.e., when the image is
blurred by a known low pass filter, it is possible to recover the image by inverse filtering or
generalized inverse filtering. However, inverse filtering is very sensitive to additive noise.
The approach of reducing one degradation at a time allows us to develop a restoration
algorithm for each type of degradation and simply combine them. The Wiener filtering
executes an optimal tradeoff between inverse filtering and noise smoothing. It removes the
additive noise and inverts the blurring simultaneously. The Wiener filtering is optimal in
R S. Publication, rspublicationhouse@gmail.com

Page 58

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

terms of the mean square error. In other words, it minimizes the overall mean square error in
the process of inverse filtering and noise smoothing. The Wiener filtering is a linear
estimation of the original image. The approach is based on a stochastic framework. The
orthogonality principle implies that the Wiener filter in Fourier domain can be expressed as
follows:
1, 2 (1, 2)
(1, 2) =
[(1, 2)|2 1, 2 + (1, 2)
Where (1, 2) , (1, 2) are respectively power spectra of the original image and
the additive noise, and
is the blurring filter. It is easy to see that the Wiener filter has
two separate part, an inverse filtering part and a noise smoothing part. It not only performs
the deconvolution by inverse filtering (highpass filtering) but also removes the noise with a
compression operation (lowpass filtering). To implement the Wiener filter in practice we
have to estimate the power spectra of the original image and the additive noise. For white
additive noise the power spectrum is equal to the variance of the noise. To estimate the power
spectrum of the original image many methods can be used. A direct estimate is the paradigm
estimate of the power spectrum computed from the observed:
Speryy =1/N[Y(k,l)Y(k,l)*]
Where Y(k,l) is the DFT of the observation. It can be implemented very easily and ignore
about the singularity of the inverse filtering.
The fuzzy k-Means algorithm applied for finding the intra cluster distance though minimizing
the objective function which relevant data point for a set of prototypes:

1 N c
JFCM
2 X 1 i 1

d 2 ( zx, vi)

(1) Here,

x, i

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

2, c) is membership value, it denotes fuzzy membership of data point x belonging to class


I, Vi (i=1, 2,, c) is centroid of each cluster and Zx (x=1,2,.,N) is data set Fuzzy partition
is carried on an iterative optimization of the equation (1) based on [12]:
1) Choose primary centroids Vi (prototypes).
2) Computes the degree of membership of all data set in all the clusters:

1
)(1 / m 1)
( zx, vi)
x, i c
( d 2 ( z1x, vi) )(1 / m 1)

i 1

(d

(2)

3) Compute New centroids V1i:


N

Vi
t

x 1
N

m
x ,i x

x 1

m
x ,i

(3) and update the degree of membership x ,i according to the equation.


R S. Publication, rspublicationhouse@gmail.com

Page 59

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

4) If x ,i < stop, otherwise go to step 3

(4)

2
Where is a termination criterion between 0 and 1, d ( zx, vi)

d 2 ( zx, vi) || zx vi ||2

(5)

Accuracy is a measure which Determines the probability that how many results are accurately
classified.
Sensitivity = TP/(TP + FN)
Specificity = TN/(TN + FP)
Accuracy = (TN+TP)/(TN + TP+FN+FP)

Where, TP stands for True Positive, TN stands for True Negative, FN stands for False
Negative and FP stands for False Positive.Figure.4 shows the competitive charts of
different methods
Iteration count = 1, obj. fcn = 1521.624258
Iteration count = 2, obj. fcn = 1177.575931
Iteration count = 3, obj. fcn = 1175.770214
Iteration count = 4, obj. fcn = 1153.695880

.
Iteration count = 40, obj. fcn = 374.771719
Iteration count = 41, obj. fcn = 374.771713

Fig 3.1 : Illustration of (a) brain MR CORONAL images with obvious intensity
inhomogeneity and low contrast, (b) its region of interest, (c) ground truth, and
segmentation results obtained by using d proposed algorithm,
R S. Publication, rspublicationhouse@gmail.com

Page 60

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Fig 3.2 (A) AXIAL (B) CORONAL (C) SAGGITAL View of the Disentangled Tumor
Image

III.

PCM ANFIS ALGORITHM

Given The FLGMMalgorithm provides an effective way to estimate the intensity


inhomogeneity in brain MR images. The smoothness of the derived estimation of the bias
field is intrinsically ensured by the convolutions with the truncated Gaussian kernel. Fig. 10.
Tanimoto performancemetric of (top)GMsegmentation and (bottom) WM segmentation
obtained by applying seven segmentation algorithms to 20 3-D IBSR brain MR images. As a
result, this model can estimate the bias field during iterations and no extra effort is needed for
smoothing the bias field. With the spatial information, this model can reduce the impact of
noise. Meanwhile, the membership function in our model depends on both the mean and
variance of local Gaussian component, which are spatially varying. In low-contrast areas,
various types of tissues may have similar means, but different variances. Therefore, our
model can distinguish the tissues in low-contrast areas. The FLGMM algorithm is essentially
different from the FGMM [18], [19] whose parameters and objective function are defined
globally without considering the local spatial information. In our algorithm, we use GMM to
describe local data and employ a truncated Gaussian kernel to ensure the smoothness of the
estimated bias field and to constrain the voxels in the neighborhood. The FLGMM algorithm
is also different from the GKFCM algorithms [13][15], which transform all cluster centroids
and data samples into a high-dimensional feature space with an implicit mapping so that a
class of robust non-Euclidean distance measures is introduced. Moreover, the GKFCM
algorithms use the constant means and variances in a globally defined energy. Our algorithm
improves the traditional FCM algorithm by replacing the original Euclidean distance with the
probability density of each voxel, which is based on a newly defined local GMM energy. In
our algorithm, the means and standard deviation of Gaussian kernel are updated iteratively
and varying spatially. Comparing with our previous work MPFCM [12], both the proposed
algorithm (FLGMM) and MPFCM utilized the basic idea from CLIC algorithm [6] to
estimate the bias field. The major differences between FLGMM and MPFCM include the
definition of the distance measure and the construction of local information. First, the
dissimilarity measure used in this paper (FLGMM) was defined based on
localGMMprobability, which means that we used the local GMM probability to measure the
distance between the data points and clustering centroids. MPFCM just utilized the Euclidean
distance as the distance measure.

R S. Publication, rspublicationhouse@gmail.com

Page 61

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Fig 4.1 Process Diagram of the Neural Networks Selection


Consequently, the proposed algorithm in this paper used a second-order statistics (including
the mean and variance) to measure the distance, whereas MPFCM just used a firstorder
statistics. Second, FLGMM assumed that the local image data within each voxels
neighborhood satisfied the GMM, and thus introduced the FLGMM to construct the local
information. MPFCM introduced an adaptive method to compute the weights for the
neighborhood of each pixel in the image. The FLGMM algorithm suffers from manually
setting of two parameters: the standard deviation of the kernel function and neighborhood
radius of the kernel function . The Gaussian kernel influences the bias field estimation and
the smoothness of segmentations. Fig. 11 shows the JS results of the segmentation with
different parameter selections. The original image is obtained from BrainMaps [27]. The left
figure shows the influence of the standard deviation, while the right figure shows the
influence of the radius. The accuracy of segmentations increases with the increasing of and
. When > 5 or > 10, the JS values of GM and WM increase slightly, while the time
consumption would have a significant increase. It is very hard to find the best parameter
setting for the segmentation accuracy. But the larger the radius, the smooth the
segmentations. Considering the segmentation accuracy and the time consumption of the
algorithm, we suggest that 4 7 and 8 15.

R S. Publication, rspublicationhouse@gmail.com

Page 62

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Fig 4.2 Proposed Architecture Diagram for Segmentation of the Oligodendrogliomas


tumor
In our experiments,we set = 4 and = 10 for general MR images. It should be noted that our
algorithm is a bit time consuming, especially when applying to large 3-D image volumes. The
high complexity of our algorithm is largely caused by its iterative nature and repeated bias
field estimation. To evaluate its computational complexity, the proposed algorithm was tested
in 40 2-D and 40 3-D images selected from the BrainWeb dataset [25] and IBSR [28].
List of Modules
1. Bias Field Formulation
2. Fuzzy C-Mean Features
3. Gaussian Mixture Model
4. Bayes rule Modeling
5. Objective Function Minimization
Bias Field Formulation
The bias field in a brain MR image can be modeled as a multiplicative component of an
observed image, as shown in the following:
I = bJ + n
where I is the observed image, J is the true image to be restored, b is an unknown bias field,
and n is the additive zero-mean Gaussian noise. The goal of bias field correction is to
estimate and eliminate the bias field b from the observed image I.Without loss of generality,
the bias field b is assumed to be slowly varying in the entire image domain. Ideally, the
R S. Publication, rspublicationhouse@gmail.com

Page 63

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

intensity J in each tissue should take a specific value vi , reflecting the physical property
being measured, e.g., the proton density in MR images.

Fuzzy C-Mean Features


Let I = {I(k) Rd; 1 k n} be a set of d-dimensional image features. The FCM [22]
partitions this feature set into c clusters based on minimizing the sum of distances from each
feature to every cluster centroid weighted by its corresponding membership. Let the
membership function be U = {ui(k)} Rcn , where ui(k) [0, 1] is the degree of feature I(k)
belonging to cluster i and follows the constraint_c i=1 ui(k) = 1. The quadratic objective
function to be minimized is

where vi is the centroid of cluster i, andm (1,) is the fuzzy coefficient.


Gaussian Mixture Model
The GMM is a weighted sum of c Gaussian density distributions. With the GMM, the
likelihood of the observed data I(k) is as follows:

where i = {pi, i ,i} is the assembly of parameters, and pi is the mixing coefficient of ith
Gaussian component N (I(k)|i ,i) and follows the constraint _c i= pi = 1. The parameters
involved in the GMM are denoted by = {i, i = 1, . . . , c}, and are usually estimated
through maximizing the likelihood of observed data via the EM algorithm, as shown in the
following:

Bayes rule Modeling


Image segmentation aims to partition the image domain into c disjoint regions, such that
= {i}c i=1. For each voxel x, if its neighborhood region is denoted by Ox , {i Ox}c i=1
forms a partition of Ox . We assume the local image data within Ox satisfy the GMM. Let p
(y i Ox |I(y)) be the posterior probability of voxel y belonging to the subregion i Ox
on condition that it has the intensity value I(y). According to the Bayes rule, we have

R S. Publication, rspublicationhouse@gmail.com

Page 64

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

where p(I(y)|y i Ox ) is the probability distribution within the subregion i Ox , p (y


i Ox ) is the prior probability of voxel y belonging to i Ox , and p(I(y)) is the
probability of observing the intensity I(y). Since p(I(y)) does not vary with the class label of
voxel y, we can simplify : the prior probability p (y i Ox ) be denoted by pi(x). Based
on the GMM assumption, p(I(y)|y i Ox ) follows a Gaussian distribution
N(I(y)|i(x),i(x)) with mean i(x) and covariance matrix i(x). Applying natural logarithm to
both sides of this equation, we can estimate the maximum a posteriori probability (MAP)
solution to this segmentation problem by minimizing the following energy function [23]:

Objective Function Minimization


By changing the order of integration, the above objective function can be written as follows:

can be derived analogously to the traditional FCM algorithm using the Lagrange multiplier
method. This iterative algorithm is summarized as follows.
Step 1: Initialization. Initialize the number of clusters, standard deviation, and neighborhood
radius of the truncated Gaussian kernel, cluster centroids, and bias field at each voxel.
Step 2: Updating parameter,Updating membership function

Step 3: Checking the termination condition.


If the distance between the newly obtained cluster centers and old ones is less than a userspecified small threshold , stop the iteration; otherwise, go to step 2.
V. EXPERIMENT RESULT
The programming language used with MATLAB is usually referred to as MATLAB script or
M-script. After becoming familiar with the basic syntax of the M-script, a number of useful
utilities are available to you that allow you to make extended uses of MATLAB. This is to
ensure that the proposed system is not a burden to the company. For feasibility analysis,
some understanding of the major requirements for the system is essential. We compared the
proposed PCM-ANFIS algorithm to state-ofthe- art segmentation algorithms in both synthetic
and clinical brain MR images.
A. Segmentation of Synthetic Images
The images in the middle and bottom rows were corrupted by intensity inhomogeneity. The
intermediate segmentation results obtained by running the proposed algorithm for different
numbers of iterations were shown in the second to fourth columns. In the final segmentation
R S. Publication, rspublicationhouse@gmail.com

Page 65

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

results, objects and background can be clearly differentiated despite of the impact of
lowcontrast and intensity inhomogeneity.
B. Segmentation of Brain MR Images
The second experiment was carried out in 3T- and 7Tweighted clinical brain MR images. Fig.
2 shows three 3Tweighted clinical brain MR images that were used in [5], together with the
estimated bias fields and segmentation results. It is clear from this figure that in spite of the
quite obvious bias field and noise in these images, the proposed algorithm can estimate the
bias field and achieves satisfactory segmentation results. initialize the centroids with kmeans clustering.
C. Segmentation of SAR Images
The segmentation based on fuzzy clustering and then classifying the compared cluster data
based on Neural Networks phenomenon extricate very accurately for satellite images and the
astronomical cluster data for object in the pixel identified are the basic phenomenon of the
HUBBLE space telescope which is the space telescope that was carried into orbit by a Space
Shuttle in 1990 and remains in operation and it has high-resolution imaging device primarily
intended for optical observations. It was built by NASA's Jet Propulsion Laboratory.

Fig 5.1: Scrutinizing on Tumor Patient (set 1)

Fig 5.2: Scrutinizing on Tumor Patient (set 2)


R S. Publication, rspublicationhouse@gmail.com

Page 66

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

Fig 5.3: Oligodendroglioma Proliferate Region Extraction in Voxel

Fig 5.4: Segmentation results for PCM-ANFIS algorithm to 3-D Brain MR Image
VI.

CONCLUSION

6.1 CONCLUSION
In this paper, we assume that the local image within the neighborhood of each voxel follows
the connectedness, and thus propose the PCM combined ANFIS algorithm for brain MR
image segmentation. This algorithm uses a truncated Gaussian kernel function to incorporate
spatial constraints into local GMMs, and employs Weinner Filter for the radiometric
corrections along with the fuzzy membership function to balance the contribution of each
R S. Publication, rspublicationhouse@gmail.com

Page 67

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

GMM to the segmentation process. Our results in both synthetic and clinical images show
that the proposed algorithm can largely overcome the difficulties raised by noise, low
contrast, and bias fields, and is capable of producing more accurate segmentation results than
several state-of-the-art algorithms. However, similar to other FCM- and EM-based
segmentation approaches, the proposed algorithm has a nonconvex objective function,
6.2 FUTURE WORKS ON HOLOGRAPHY
However, this framework for automatic brain tumor and edema segmentation in MR images.
This framework incorporates many of the important ideas proposed in the literature.. I would
like to demonstrate the maximum possibility of Holographic projection collaboration with the
MRI Scan which consists of the three dimensional voxel regions. Holography is a technique
which enables three-dimensional images to be made. It involves the use of a laser,
interference, diffraction, light intensity recording and suitable illumination of the recording.
The image changes as the position and orientation of the viewing system changes in exactly
the same way as if the object were still present, thus making the image appear threedimensional. The holographic recording itself is not an image; it consists of an apparently
random structure of either varying intensity, density or profile. The holographic construction
generally requires laser, laser beam, photographic plate , partly transparent mirror Microsoft
SDK projector and MRI images collection. The computation of the voxel correlation matrices
based on the MRI or fMRI datasets which generally uses pearson formula to calculate the
correlation and convert it to signals with light energy.
REFERENCE
[1] Parent, Andr, and Malcolm B. Carpenter. Carpenter's Human Neuroanatomy. Baltimore:
Williams & Wilkins, 1996.
[2] Prohaska, JOSEPH R. "Functions of trace elements in brain metabolism." Physiological
reviews 67.3 (1987): 858-901.
[3] Vijayakumar B, Ashish Chaturvedi and Muthu kumar K."Effective Classification of
Anaplastic Neoplasm in Huddling Stain Image by Fuzzy Clustering Method." International
Journal of Advanced Scientific and Technical Research, Issue 3 volume 2, March-April 2013
[4] Tkachev, Dmitri, et al. "Oligodendrocyte dysfunction in schizophrenia and bipolar
disorder." The Lancet 362.9386 (2003): 798-805.
[5] Richardson, William D., Nicoletta Kessaris, and Nigel Pringle. "Oligodendrocyte wars."
Nature Reviews Neuroscience 7.1 (2006): 11-18.
[6] Schottenfeld, David, and Joseph F. Fraumeni, eds. Cancer epidemiology and prevention.
Oxford University Press, USA, 2006.
[7] Raghavan, Derek, Martin L. Brecher, David H. Johnson, Neal J. Meropol, Paul L. Moots,
Peter G. Rose, and Ingrid A. Mayer. Textbook of uncommon cancer. Wiley, 2006.
[8] Tonn, Jrg Ch. Neuro-Oncology of CNS Tumors. Berlin: Springer, 2006.
[9] Denecke, T., et al. "Comparison of CT, MRI and FDG-PET in response prediction of
patients with locally advanced rectal cancer after multimodal preoperative therapy: is there a
benefit in using functional imaging?." European radiology 15.8 (2005): 1658-1666.
R S. Publication, rspublicationhouse@gmail.com

Page 68

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

[10] Taphoorn, Martin JB, and Martin Klein. "Cognitive deficits in adult patients with brain
tumours." The Lancet Neurology 3.3 (2004): 159-168.
[11] S. Cohen, M.Z.R.M. DuBois, Rapid and effective correction of RF inhomogene- ity for
high field magnetic resonance imaging, Hum. Brain Mapp. 10 (4) (2000) 204211.
[12] C. Han, C.Y.T.S. Hatsukami, A multi-scale method for automatic correction of intensity
nonuniformity in MR images, J. Magn. Reson. Imag. 13 (3) (2001) 428436.
[13] J. Marroquin, B. Vemuri, S. Botello, An accurate and efficient Bayesian method for
automatic segmentation of brain MRI, IEEE Trans. Med. Imag. 21 (8) (2002) 934945.
[14] A. Liew, H. Yan, An adaptive spatial fuzzy clustering algorithm for 3-D MR image
segmentation, IEEE Trans. Med. Imag. 22 (9) (2003) 10631075.
[15] O. Salvado, C. Hillenbrand, S. Zhang, MR signal inhomogeneity correction for visual
and computerized atherosclerosis lesion assessment, in: 2004 IEEE International Symposium
on Biomedical Imaging, 2004, pp. 11431146.
[16] B. Vijayakumar, Ashish Chaturvedi and K. Muthu Kumar, Brain Tumor in Three
Dimenesional Magnetic Resonance Images and Concavity Analysis, International Journal of
Computer Application, Issue 3, Volume 1 (February 2013),
[17] L. Gupta and T. Sortrakul, AGaussian mixture based image segmentation algorithm,
Pattern Recog., vol. 31, pp. 315325, Mar. 1998.
[18] H. Greenspan, A. Ruf, and J. Goldberger, Constrained Gaussian mixture model
framework for automatic segmentation ofMR brain images, IEEE Trans. Med. Imag., vol.
25, no. 9, pp. 12331245, Sep. 2006.
[19] K. Blekas, A. Likas, N. P. Galatsanos, and I. E. Lagaris, A spatially constrained
mixture model for image segmentation, IEEE Trans. Neural Netw., vol. 16, no. 2, pp. 494
498, Feb. 2005.
[20] D. Tran, T. Le, and M. Wagner, Fuzzy Gaussian mixture models for speaker
recognition, in Proc. Int. Conf. Spoken Language, 1998, pp. 759 762.
[21] J. Zeng, L. Xie, and Z. Liu, Type-2 fuzzy Gaussian mixture, Pattern Recog., vol. 41,
pp. 36363643, Dec. 2008.
[22] J. C. Bezdek, Pattern Recognition With Fuzzy Objective Function Algorithms. Norwell,
MA: Kluwer, 1981.
[23] L. Wang, L. He, A. Mishra, and C. Li, Active contours driven by local Gaussian
distribution fitting energy, Signal Process., vol. 89, pp. 2435 2447, Dec. 2009.
[24] B. Vijayakumar, Ashish Chaturvedi and K. Muthu Kumar, Effective Classification of
Anaplastic Neoplasm in Huddling Stain Image by Fuzzy Clustering Method, International
Journal of Scientific Research, Issue 3 volume 2, March-April 2013,
[25] Vijayakumar, B., and Ashish Chaturvedi. "Automatic Brain Tumors Segmentation of
MR Images using Fluid Vector Flow and Support Vector Machine." Research Journal of
Information Technology 4.
R S. Publication, rspublicationhouse@gmail.com

Page 69

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

[26] Vijayakumar, B., and Ashish Chaturvedi. "Tumor Cut-Segmentation and Classification
of MR Images using Texture Features and Feed Forward Neural Networks." European
Journal of Scientific Research 85.3 (2012): 363-372
[27] Vijayakumar, B., and Ashish Chaturvedi, Idiosyncrasy Dissection and Assorting of
Brain MR Images Instigating Kernel Corroborated Support Vector Machine, Archive Des
Science
[28] Vijayakumar, B., and Ashish Chaturvedi,Abnormality segmentation and classification
of brain MR images using Kernel based Support vector machine, Archive Des
Science,Volume 66,Issue 4.
[29] A. Khademi, A. Venetsanopoulos, and A. Moody, Edge-based PVA estimation in
FLAIR MRI with WML, in Proc. IEEE Eng. Med. Biol. Soc. Conf., 2010, pp. 61146117.
[30] P. H. Kvam and B. Vidakovic, Nonparametric Statistics with Applications to Science
and Engineering. New York: Wiley-Interscience, 2007.

AUTHOR DETAILS
Murugan is an outward Professor in several of the Engineering
Institutions in and around Tamil Nadu and he currently working as
Associate Professor in Manonmaniam Sundaranar University, India
and he immensely dedicated his whole life to developing education
towards engineering students in the Society. He completed his
Bachelor of Engineering academic studies in the Department of
Electronics & Communication Engineering in Government College
of Engineering with high profile knowledge and later, he finished
Master of Engineering in Computer Science & Engineering in
Kalasalingam College of Engineering and fosters his proficiency in
various multidisciplinary fields. He finished his Ph.D. (Computer Science) in Digital Image
Processing from Manonmaniam Sundaranar University, Tirunelveli, India. He is a reviewer
of series of International Serial Journals and become esteemed Life Member in Indian
Society for Technical Education for his outstanding work done in a specified area of
Engineering and Technology. Due to his constant enthusiastic and innovation towards
research, he qualified for Commonwealth Split-site Scholarships, which provided by the
Department for International Development, United Kingdom in 2007.Under his supervision
for Ph.D. in Computer Science, many students doing Ph.D. Degree in Computer Science &
Engineering on the research related to Neural Network, Pattern Recognition and Medical
Image processing. He published his research paper in many International Journals. His
contribution regarding IST ACT peer reviewed international Journal emerging and prospering
paves a new way for research publications. He gauges his research interest in applying
artificial neural networks in various fields like Quantum Physics, Medical Science, Computer
Science and Geo-Science. Currently, he is exploring the fields like Neural Networks, Fuzzy
Logic, Genetic Algorithm, Pattern Recognition, Robotics, Image Processing, Quantum
Physics, Geo-Science, Medical Physics, and Graphical Authentication

R S. Publication, rspublicationhouse@gmail.com

Page 70

International Journal of Computer Application


Issue 3, Volume 5 (September - October : 2013)
Available online on http://www.rspublication.com/ijca/ijca_index.htm
ISSN: 2250-1797

R. Arun completed his Bachelor of Engineering in Bharath Niketan


Engineering College under M.K University. Later, he completed his
Master of Engineering in the Computer Science and Engineering
Department in the M.S University with First Class Qualification. He
is currently doing Doctorate of Philosophy by M.S University. He is
a member of Many Free Membership journals and reputed journals
like BMC Journals, ACI Medical journals, SAGE journals and
Journal of the National Cancer Institute. He has a vision to create a
revolution towards Medical Imaging and delivers his futuristic ideas
in many precious articles and participated in many international
conferences in various states and he published various International Journals related to brain
tumor image Computing. His research interests primarily focus on image processing,
especially in the methods related to biomedical image computing and processing.

R S. Publication, rspublicationhouse@gmail.com

Page 71

You might also like