2014 IEEE Students' Conference on Electrical, Electronics and Computer Science

MRI Brain Cancer Classification Using Support

Vector Machine

Hari Babu Nandpuru Dr. S. S. Salankar Prof. V. R. Bora

Electronics & Communication Electronics & Telecommunication Electronics & Telecommunication
Engineering Engineering Engineering
GHRAET, RTMN University GHRCE, Autonomous Institute GHRCE, Autonomous Institute
Nagpur, India Nagpur, India Nagpur, India
n haribabu@yahoo.com
_ suresh.salankar@gmail.com vibha.bora@raisoni.net

Abstract-This research paper proposes an intelligent
classification technique to recognize normal and abnormal MRI
brain image. Medical image like ECG, MRI and CT-scan images
are important way to diagnose disease of human being efficiently.
The manual analysis of tumor based on visual inspection by
radiologist/physician is the conventional method, which may lead
to wrong classification when a large number of MRIs are to be
analyzed. To avoid the human error, an automated intelligent
classification system is proposed which caters the need for
classification of image. One of the major causes of death among
people is Brain tumor. The chances of survival can be increased
if the tumor is detected correctly at its early stage. Magnetic
resonance imaging (MRI) technique is used for the study of the
human brain. In this research work, classification techniques
based on Support Vector Machines (SVM) are proposed and
applied to brain image classification. In this paper feature
extraction from MRI Images will be carried out by gray scale,
symmetrical and texture features. The main objective of this
paper is to give an excellent outcome (i.e. higher accuracy rate
and lower error rate) of MRI brain cancer classification using
SVM.
Index Terms- Classification, MRI, SVM, PCA, Skull masking.
I. INTRODUCTION
Automated and efficient diagnosis of medical images is
very important. Computer and Information Technology are
very much useful in medical image processing, medical
analysis and classification. More often Medical images are
usually obtained by X-rays and MRI MRI is essential tool in
.
the clinical and surgical environment due to superior soft tissue
differentiation, high spatial resolution, contrast and it does not
use any harmful ionizing radiation which may affect patients.
Cancer develops in a part of the body when cells begin to grow
out abnormally. Radiologists examine MRI Images based on
visual interpretation to identify the presence of tumor. There
might be a possibility when large volwne of MRI to be
analyzed then there is a possibility of wrong diagnosis by
radiologists because sensitivity of the human eye decreases
with escalating nwnber of cases, predominantly when only a
small nwnber of slices are affected. Hence there is a need for
efficient automated systems for analysis and classification of
medical images. The MRI image may contain both normal and
abnormal image.
The methodology (Fig. 1) includes following modules:
Image preprocessing, Features extraction, Feature reduction
Training and Classification/Testing.
Image preprocessing is used to improve the quality of
images. Medical images are corrupted by different type of
noises like Rician noise etc. It is very important to have good
quality of images for accurate observations for the given
application. Median filter is simple to understand. It preserves
brightness differences resulting in minimal blurring of
regional boundaries. It also preserves the positions of
boundaries in an image, making this method useful for visual
examination and measurement.
Feature extraction refers to various quantitative
measurement of medical images typically used for decision
making regarding the pathology of a structure or tissue. In
image processing, feature extraction is a special form of
dimensionality diminution. When the input data to an
algorithm is too large to be processed and it is assumed to be
disgracefully unnecessary then the input data will be
transformed into a compact representation set of features.
Transforming the input data set into the set of features is
called feature extraction. If the extracted features are
cautiously selected, it is expected that the features set will
extract the important information from the input data in order
to perform the desired task using this reduced representation
instead of the full size input.
Principle Component Analysis(PCA) [4] is used to reduce
the dimensionality of data i.e. reduced features. Martinez and
Kak showed that if training sets are small comparing to feature
dimension, PCA can outperform LDA [13].
The reduced features are submitted to a support vector
machine for training and testing. Therefore this method will
decrease the computation time and complexity.
Classifiers such as SVM, K-Nearest Neighbor (KNN),
Artificial Neural Network (ANN), Probabilistic Neural
Network(PNN), Hidden Markov Model (HMM), etc. are used
for various applications such as hand written digit
identification, object identification, speaker identification, face
identification, text classification and for medical applications.
Each of the classification schemes previously mentioned has
its own unique properties and associated strengths and
problems. In KNN, the major limitation is that it uses all
features in distance computationally intensive, mainly when

978-1-4799-2526-1/14/$31.00 ©2014 IEEE

the size of training set increases. Beside this, the accuracy of
k- nearest neighbor classification is severely degraded by the
presence of noisy or not related features, mainly when the
number of attributes grows. In PNN, limitations is that it is
slower than multilayer perceptron networks at classifYing new
cases and it requires more memory space to store the model.
ANN, it performs better than other than other classification
method with high dimensional features and contradictory data.
But the high computing cost which consumes high CPU and
physical memory usage is the main disadvantage of ANN.
Bayesian approach outstanding with its simplicity and low
computational cost in both the training and classifYing stage
and it has been widely implemented in various types of
domains and applications. But this generative method has
been reported to be less accurate than the discriminative
methods such as SVM. SVM has shown to be more accurate
than other classification approaches [14].
The classification process is divided into two parts i.e. the
training and the testing part. Firstly, in the training part known
data are given to the classifier for training. Secondly, in the
testing part, unknown data are given to the classifier and the
classification is performed after training part. The accuracy rate
and error rate of the classification depends on the efficiency of
the training.
11. METHODOLOGY
Training Part Testing Part
MRIIMAGE MRIlMAGE
TRAINING TESTING
DATABASE DATABASE
DATABASE
STOP
Fig. I Methodology System
SCEECS 2014
The methodology used to classifY MRI image of human
brain is shown in Fig. 1. This method uses the steps of
preprocessing, feature extraction, feature reduction, training,
storing the database and testing. Initially MRI images are
given as input to the classifiers for training, then the features
of new MRI images are given as input, based on the training,
trained classifier classifY it efficiently. It performs better than
other classification method with high dimensional features and
contradictory data. But the high computing cost which
consumes high CPU and physical memory usage is the main
disadvantage of ANN. Bayesian approach outstanding with its
simplicity and low computational cost in both the training and
classifYing stage and it has been widely implemented in
various types of domains and applications. But this generative
method has been reported to be less accurate than the
discriminative methods such as SVM. SVM has shown to be
more accurate than other classification approaches.
A. MRllmage
MRI is one of the helpful methods and a safe modality for
medical diagnosis. The most important advantage of the MRI
is its ability to provide good contrast between various organs
and tissues. With its dependence on the more biologically
variable parameters, proton density (PD), longitudinal
relaxation time (Tl) and transverse relaxation time (T2)
variable image contrast can be achieved using different pulse
sequences and changing the imaging parameters. There are
three types of images PD, Tl and T2 are formed and their
signal intensities relate to specific tissue characteristics.
Images are taken in any one of the three orientations: axial
(neck to head), coronal(front to back) and sagital(ear to ear).
Fig. 2 Normal Brain Fig. 3 Abnormal Brain
MRI brain image is a RGB image. This image is first
converted into gray scale image. Gray scale image is also
known as an intensity image. Array of class pixel values
specifY intensity values. For single and double arrays, values
range from [0, 1]. For uint8, values range from [0,255]. For
uintl6, values range from [0, 65535]. For intl6, values range
from [-32768, 32767]. Intensity or brightness of an image as
two dimensional continuous function F(x, y) where (x, y)
denotes the spatial coordinates when only the brightness of
light is considered.

Fig. 4 Gray Scale Image Conversion
B. Filtering
Filtering is the process of removing noise from MRI
images. Medical images are corrupted with different kinds of
noise while image acquisition. In this paper median filter is
used to remove noise from the MRI images.
Fig. 5 Filter Image
C. Skull Masking
Skull masking means the removal of non-brain tissue like
scalp, skull, fat, eyes, neck, etc, from MRI brain image. It helps
to improve the speed and accuracy of diagnostic and predictive
procedures in medical applications. This procedure is also
referred as Brain-Extraction/SkuU-Stripping [2].
Dilation and erosion are two fundamental morphological
operations. An opening is erosion followed by dilation with
the same structuring element:
AoB=(A0B)EBB (1)
Erosion removes pixels on object boundaries in an image as
in Fig. 6. Dilation adds pixels to the boundaries of objects in an
image as in Fig. 7. The number of pixels added or removed
from the objects in an image depends on the size and shape of
the structuring element used to process the image.
Fig. 6 Eroded Image Fig. 7 Dilated Image
SCEECS 2014
Region filling (Fig. 8.) is used to fill in holes inside the
brain region.
Fig. 8 Region Filling
Image enrichment is a very basic image processing task
that defines us to have a better subjective decision over the
images. Power law Transformation [2] (Fig. 9.) is used for
image enrichment. Image enrichment simply means the
transformation an image f into image g using T. The values of
pixels in images f and g are denoted by r and s. As said, the
pixel values r and s are related by the expression,
s = T(r) (2)
Where, T is a transform that maps a pixel value r into a
pixel value s.
.� -.
," .," '
II '
,
�.(.�
Fig. 9 Power law Transform Fig. 10 Skull Masked Image
D. Feature Extraction
Feature extraction calculates features on the basis of which
image can be easily classified as normal or abnormal one. The
feature extraction is the process to represent raw image to
facilitate decision making such as pattern classification.
Features will be extracted from the tumor regions from MRI
images. Feature extraction involves reducing the amount of
data required to describe a large set of data accurately. Features
are used as inputs to classifiers that assign them to the class
that they represent. The intention of feature extraction is to
reduce the original data by measuring positive properties, or
features, that discriminate one input sample from another
sample. Following features are extracted.
• Gray Scale
• Texture
• Symmetrical
 Accordingly, 3 kinds of features are extracted, which tell
the structure information of gray scale, symmetrical and
texture [1]. These features certainly have some redundancy,
but the idea behind this is to find the potential by useful
features.
PCA [4] is a proficient tool to reduce the dimension of a
data set consisting of a large number of interconnected
variables while retaining most of the variations. Reduce
dimension means reduced feature set which is act as an input
to the SVM during training part as well as testing part.

J) Gray Scale features: Gray scale features that extracted Steps to be followed in PCA:
are mean, variance, standard deviation, skewness and kurtosis.
• Compute the mean of the data matrix
• Subtract the mean from each image.
a) Standard Deviation= .Jvar iance

( ) LL(f(x,y)-mean)3
(3) • Compute the covariance matrix.
• Compute the Eigen vectors and values for covariance
1 11/ n
b) Skewness =
var
.
zance 3 (4)
•
matrix.

( )
x=1 y=1 Arrange the Eigen vectors according to the Eigen
values and as per the threshold value.
4
11/ n
4 LL(!(x,y)-mean)
1
•
. Compute the feature matrix (the space that will use it
lance
c) Kurtosis= (5)
var x=1 y=1 to project the testing image on it).

F Classification using Support Vector Machine (SVM)

2) Texture Features: In
this paper, 22 textural features are
extracted from each image. The several Haralick texture SVM algorithm was first developed in 1963 by Vapnik and
descriptors [1] are extracted from each co-occurrence matrices Lerner. SVM [12] is a binary classifier based on supervised
which are computed. Some of the texture features are shown learning which gives better result than other classifiers. SVM
below. classifies between two classes by constructing a hyperplane in
n n high-dimensional feature space which can be used for
a) Entropy=- I Ip(i,j)log(p(i,j)) (6) classification. SVM is a classification algorithm, which is
i=! j=! based on different kernel methods. SVM is classified in two
groups.
n

b) Dissimilarity= I p(i,j)* I (i-j) I (7)

J) Linear SVM: It is the simplest one, in which the training
i,J=!
patterns are linearly separable. A linear function of the form is

c) Jnverse= �
� p. (i,j)
.
given below

i,J=! ( 1- J) 2
(8)
f(x) = wT X + b (13)
n n

d) Energy= I I(p(i,j))2 (9) Such that for each training sample x" the function yields
i=! J=! f(x;} � 0 for Yi = +1, and f(xi) < 0 for y,= -1. In other words,
training samples of two different classes are separated by the
n n
hyperplane f(x) = wT X + b =0, where w is weight vector and
e) Contrast= I I(i,j)2 p(i,j) (10)
normal to hyperplane, b is bias or threshold and x, is the data
i=! J=!
point.
n n

P (i,J.)
1 • •
j) lDM-" " • •
- ft f;t 1 + (i-j)2
(11)
•

; ... - - -
3) Symmetrical feature:
n Maximum 1
- ��: ' - :: ::
- -
, , :: ". Support
I(m,-M)2 margrn 11
I
r
�
I -..,.
'"
, ''
'
�
,
�. Vectors
-"i=!:;.,! '"
t,' �
_

rE
_____
a) Exterior symmetry= (12)
1
n
I. . .
1
E. Principle Component Analysis (PCA) 1 •
1 • Class 1
Optimal
Excessive features used for classification not only
Hyperplane • Class 2
increase computation time but also increase storage memory.
They sometimes make classification more complicated. It is
required to reduce the number of features to overcome the Fig. 1 1 Linear SVM Classification
above mentioned problem.

SCEECS 2014
 For a given trammg set, while there may exist many are used to check the performance of the classifiers.
hyperplane that maximize the separating margin between the
two classes, it is based on the hyperplane that maximizes the Ill. EXPERlMENTAL DISCUSSION
separating margin between the two classes(Fig. 1l.) This methodology (Fig. 1) includes following modules:
In Fig. 11, SVM classification with a hyperplane that Image preprocessing, Features extraction, Feature reduction
minimizes the separating margin between the two classes are Training and Testing. Image preprocessing is used to improve
indicated by data points by black square's and black circle's. the quality of images. Medical images are corrupted by
Support vectors are elements of the training set that lie on the different type of noises like Rician noise etc. It is very
boundary hyperplane of the two classes. important to have good quality of images for accurate
observations for the given application. Median filter is used to
2) Non-Linear SVM' In linear SVM straight line or remove noises while retaining as much as possible the
hyperplane is used to distinguish between two classes. But data important signal features.
sets or data points are separated by drawing a straight line Skull masking is used to remove non-brain tissue like
between two classes is not possible. In a nonlinear SVM scalp, skull, fat, eyes, neck, etc, from MRI brain image. For
classifier, a nonlinear operator is used to map the input pattern skull masking morphological operations such as erosion and
x into a higher dimensional space H. The nonlinear SVM dilation is used. It helps to improve the speed and accuracy of
classifier is defined as diagnostic and predictive procedures in medical applications.
Morphological operation is followed by region filling and
f(x) = WT <I>(x) + b (14) power law transformation for image enrichment.
Feature extraction refers to various quantitative
The data with linear separability may be analyzed with a measurements of medical images typically used for decision
hyperplane, and the linearly non separable data are analyzed making. In this work 28 features are calculated for each
with different kernel functions like higher order polynomials image. In training for 46 images, features have been extracted
and Quadratic. as shown in Fig. 13. Extracted feature set is applied to PCA.
The output of an SVM is a linear combination of the PCA is used to reduce the feature set which is extracted
training examples which are mapped onto a high-dimensional from images. The reduced features are submitted to a support
feature space through the use of kernel functions as in Fig. 12. vector machine for training and testing. Using PCA the feature
set is reduced to 24 out of 28 features per image. Therefore
• this method will decrease the computation time and
0: x � <I>(x) •
complexity.
'. ..-'"..... ..,.,...! •
." ... • The classification process is divided into two parts i.e. the
;/ 0
I \ training and the testing part. Firstly, in the training part known
! 0 '\ • •
•
0 data(i.e. 24 features * 46 images) are given to the classifier for
i
0
\ 0 training. Secondly, in the testing part, unknown data are given
0
• •
to the classifier and the classification is performed after
• \ j
''',.0 0 / training part. The accuracy rate and error rate of the
. ...... , .... " ., ..... . • classification depends on the efficiency of the training.
•

IV. RESULTS AND DISCUSSION

Fig. 12 Non Linear SVM Classification
MRI plays an important role in progressive researches. We
G. Performance measures tested SVM with linear and different kernels (Quadratic and
All classification result could have an error rate and on Polynomial). In the case of using quadratic kernel, the SVM
occasion will either fail to identify an abnormality. It is general has got the highest accuracy rate(TABLE I). MRI Images have
to describe this error rate in terms of true and false positive and been taken into account. About 50 patients MRI brain images
true and false negative as follows have been used to diagnose such as 'Normal', 'Abnormal'
• True Positive (TP): Abnormal brain correctly based on the SVM classification algorithm. First SVM is trained
identified as abnormal.
by using 46 MRI brain image training set. Once the SVM is
trained, the classification accuracy is validated using the testing
• True Negative(TN): Normal brain correctly identified
set.
as normal.
• False Positive (FP): Normal brain incorrectly TABLE I. SVM CLASSIFIER RESULT
identified as abnormal.
• False Negative (FN): Abnormal brain incorrectly Sr. SVM Result
No. Kernel Function Sensitivity Specijicity Accuracy
identified as normal.
I Linear 94.18% 31.25% 74%

J) Sensitivity TP/(TP+FN) *100% =

2 Quadratic 100% 50% 84%
2) Specificity TN/(TN+FP) *100% =

3 Polynomial 97.06% 31.25% 76%

3) Accuracy (TP+TN)/(TP+TN+FP+FN)*100 % =

SCEECS 2014
 rn Fe,ture. <28>:4& double> Name· V,lue Min Max

1 2 3 4 5 6 7 8 9 10 11 12 ;EB <25&x256 uint8> ° 229

1 0,045 0 0,0192 0,0385 0,0711 0,0182 0,0l11 0,0915 0,018& 0,0149 0,0525 0,0569 0,047 . .b C 'AB'

2 0,0099 0,0042 0,0034 0,0455 0,0010 0,0027 0,0489 0,0039 0,0011 0,0150 0,0167 0,012 . b F <48x6 char>
3 2,1074e+08 1.415&e+09 1.025ge+09 2.5817e+07 4,9939.+09 1.3&46e+09 1,8566e+07 1.6897e+09 6.4260e+09 1,0978e+08 1,1601e+08 1,5075e+C FV <46x28 double> ·0,8694 4,1163...

4 8.7096e+09 1.5180.+11 1.156ge+11 5,1676e+08 9.3221.+11 1.0882e+11 3.1918e+08 2,028ge+11 8,5054.+11 3.4212e+09 4.5711e+09 5,2454.+C l11li <28x46 double> ·0,8694 4,1163...
5 0,0995 0,0648 0,0584 0,2134 0,0319 0,0519 0,2211 0,0625 0,0330 0,1227 0,1292 O,11C I <256x256 uint8> ° 241
°

1
6 2,1026 1.4094 1.7492 4.3738 1,2524 1,4828 5,0075 1.3722 1,1892 2.5271 2,6805 2,22\ :2 <256x256 uint8> 201
7 0,0331 0,0159 0,0290 0,0316 0,0106 0,0169 0,1802 0,0173 0,0099 0,0369 0,0493 0,03C {: In <1.ll1ruct>

1�
8 0,9681 0,9&46 0,9376 0,9932 0,9351 0,9503 0,9633 0,9568 0,9196 0,9770 0,9720 0,974 46 46 46
9 0,9681 0,9&46 0,9376 0,9932 0,9351 0,9503 0,9633 0,9568 0,9196 0,9770 0,9720 0,974 1 <1.ll1ruct>
10 52.7295 33.5040 9.7476 1.3935e+03 1.5591 4,6802 1.0622e+03 29,0056 0,8382 118.9461 213.4155 65,46( c 1 1 1
11 9,1189 5,0672 2,0629 107.7579 0,6012 1.5254 90,1792 4,4331 0,4180 17.5155 23.2585 11,051 I <25&x256 double> ° 0.7882
12 0,0311 0,0151 0,0275 o,om 0,0106 0,0167 0,0858 0,0143 0,0099 0,0344 0,0424 0,029 f1 <25&x256 uint8> ° 201
13 0.7084 0,8959 0,6293 0.7868 0,8376 0.7591 0,5840 0,8972 0,8710 0.7094 0,6571 0.712 .b In '46,pn9'
14 0.7233 OJl34 0.7044 0.5759 0,3437 0.5191 1.1285 0.3056 0,2888 0.7466 0,8682 0.719 h 0,0013 0,0013 0,0013

; j:
15 0,9848 0,9926 0,9865 0,9902 0,9947 0,9917 0,9&78 0,9933 0,9951 0,9832 0,9798 0,985 256 256 256
16 0,9846 0,9925 0,98&4 0,9898 0,9947 0,9916 0,9656 0,9931 0,9951 0,9830 0,9795 0,985 i 46 46 46

;
17 0,8372 0,9462 0.7687 0,8851 0,9119 0,8654 0.7556 0,9468 0,9314 0,8388 0,8036 0,84C 256 256 256
18 2,0798 1.3834 1.7253 4,3450 1,2240 1,4542 5,0471 1,3471 1,1611 2,5045 2,6631 2,200 m 256 256 256

J�"
19 2.5294 2,1849 2,4749 2,8&68 2,1691 2.2990 3,2503 2,1727 2,1287 2,&405 2.7012 2.5&2 256 256 256
20 5.4024 4.4263 4,1122 14.&458 3.6742 3.8739 14,5414 4,3220 3.&458 6,8686 6,9784 5,847 <24x46 double> ·3.794", 3.2174",
21 0,6972 OJ016 0,6829 0.5565 OJ363 0,5070 1.0377 0.2921 0.2820 0.7181 0,8294 0,69( <25&x256 double> ° 0,4897
22 0,0331 0,0159 0,0290 0,0316 0,0106 0,0169 0,1802 0,0173 0,0099 0,0369 0,0493 0,03C Iil se <1.ll1rel>
13 0,1396 0,0785 0,1267 0,1019 0,0586 0,0853 0,2722 0.0738 0,0554 0,1510 0,1767 0,134 Iil sel <1.ll1rel>

���
24 ·0.7898 ·0.7687 ·0.7912 ·0,8558 ·0,8m ·0,8211 ·0.7299 ·0,7691 ·0.7990 ·0.7858 ·0,77&4 ·0.797 <1.4& cell>
25 0.7817 0.5690 0,7761 0.7599 0,6174 0.7178 0,8525 0.5634 0.5848 0.7871 0,8172 0.784 <1.4& double> ° 1
26
27
28
0,996&
0,9995
0,9862
0,9983
0,9998
1.6188
0,9970
0,999&
1.l260
0,9976
0,9995
0.3260
0,9988
0,9998
OJ127
0,9981
0,9997
0,0531
0,9914
0,9976
0.7337
0,9984
0,9997
0.3391
0,9989
0,9998
0,0686
0,9962
0,9994
2,6119
0,9954
0,9993
0.7382
0,99(
0,999
3.965
I ec <28x24 double>
3
·1.0000 1.0000
3 3

Fig. 13 Extracted Features

V. CONCLUSIONS Dimension", 53rd International Symposium ELMAR-2011, 14-

16 September 2011, Zadar, Croatia
The work in this research involves using SVM with [7] M. F. B. Othman, N. B. Abdullah, N. F. B. Kamal, "MRI brain
different kernel functions to classify the input which is MRI classification using Support vector machine", IEEE, Centre for
Brain image into normal and abnormal classification. We Artificial Intelligence & Robotics (CAIRO), Universiti
conclude that this research gives more accurate result than the Teknologi Malaysia, 201 L
other research work [5]. For future work, to get better [8] K. Somasundaram, T. Kalaiselvi, "Automatic brain extraction
accuracy rate and less error rate a Hybrid SYM algorithm is to methods for T1 magnetic resonance images using region
be proposed. labeling and morphological operations", ELSEVIER, Computers
in Biology and Medicine 41 (2011) 716-725.
REFERENCES [9] Ahmed kharrat, Karim Gasmi, et.al, "A Hybrid Approach for
Automatic Classification of Brain MRI Using Genetic
[I] Shweta Jain, "Brain Cancer Classification Using GLCM Based
Algorithm and Support Vector Machine", Leonardo Journal of
Feature Extraction in Artificial Neural Network", IJCSET,
Sciences, pp.71-82, 2010.
ISSN: 2229-3345, VoL 4 No. 07 JuI2013.
[10] Lashkari Amir Ehsan "A Neural Network-Based Method for
[2] Janki Naik , Prof Sagar Patel , Tumor Detection and
Brain Abnormality Detection in MR Images Using Zernike
Classification using Decision Tree in Brain MRI, IJEDR, ISSN:
Moments and Geometric Moments", IJCA-10.
2321-9939, 2013.
[11] E. A. El-Dihshan, T, Hosney, A B. M. Salem, "Hybrid
[3] Dr. R J. Ramteke and Khachane Monali Y, "Automatic Medical
intelligence techniques for MRI Brain images classification",
Image Classification and Abnormality Detection Using K­
ELSEVIER, Digital Signal Processing, Volume 20, pp,433-441,
Nearest Neighbor", International Journal of Advanced Computer
2010.
Research, Volume-2 Number-4 Issue-6 December-20l2.
[12] Ali Reza Fallahi, Mohammad Pooyan, Hojat Mohammadnejad,
[4] Y. Zhang and L Wu, "AN MR BRAIN IMAGES CLASSIFIER
"Application of Morphological Operations In Human Brain CT
VIA PRINCIPAL COMPONENT ANALYSIS AND KERNEL
Image With SVM", 978-1-4244-2902-8/091 IEEE.
SUPPORT VECTOR MACHINE", Progress In
[13] AMartinez and A Kak. "PCA versus LDA", IEEE Transactions
Electromagnetics Research, VoL 130, 369,388, 2012 .
on PA and MI, 23:228-233, 200I.
[5] Mohd Fauzi Bin Othman, Noramalina Bt Abdullah, Nurul
[14] Shantanu Godbole, "Inter-class relationships in text
Fazrena Bt Kamal, "MRI BRAIN CLASSIFICATION USING
classification", Ph.D. Thesis, lIT, Bombay, India, 2006.
SUPPORT VECTOR MACHINE", IEEE, 2011.
http://www.it.iitb.ac. inI�shantanulworklthesis.pdf.
[6] Ahmet Mert, Niyazi Kilic, Aydn Akan, "Breast Cancer
Classification by Using Support Vector Machines with Reduced

SCEECS 2014