Professional Documents
Culture Documents
BRAIN IMAGES
CN Savithri R Carol Praveen
Department of Electronics and Communication Department of Electronics and Communication
Sri Sairam Engineering College SSM Institute of Engineering and Technology
Chennai, India Dindigul, India
savithri.ece@sairam.edu.in lavanyadevinadarajan@psnacet.edu.in
This research paper includes proposed method in Gray Level Co-occurrence Matrix (GLCM)
second section and conclusion in the third section. computes the frequency of occurrence of a
pair of pixel within a particular distance and
II PROPOSED METHODOLOGY angle [5, 6]. GLCM is capable of calculating
the co-occurrence at angles 00, 450, 900 and
The method proposed for the automated 1350. Fig. 2 shows the GLCM calculated for
classification of the brain tumor is shown in fig 1. As 5 gray level values (0, 1, 2, 3 and 4) for the
shown in the figure the processes involved in the distance [0 1] and angle 450 (for both +450 and
classification are preprocessing, feature extraction, -450). Texture features like energy, entropy,
classification and segmentation. Preprocessing step correlation and contrast are computed from
involves converting the RGB input image into gray the GLCM and their equations are mentioned
scale image and image resizing. The proposed from equation (1) to (4).
algorithm is implemented on brain MRI images with
98 normal images and 155 abnormal images and these
images are available in kaggle.
DATABASE
Feature Fig. 2. GLCM calculated for 5 gray level values with distance [0 1]
Extraction and angle 450
Classifier
(1)
Normal Abnormal
Segmentation
taken into consideration for the further process. Among
the features fed as the input to the PCA, all the texture
(2) features and kurtosis turned out to be the important
features for the classification of the brain MRI images.
(3)
(4
2) Statistical Features
Input feature
Statistical features like skewness, mean, standard vector
deviation, and kurtosis are also computed to make an
analysis of distribution of gray level values and their
equations are mentioned from equations (5) to equation
(8).
Mean calculation
(5)
Compute deviation
(6)
Compute covariance
(7)
B. Principal Component Analysis (PCA) Fig. 3. Steps for the computation of PCA
(11) (14)
(12)
(16)
The performance of the above kernel functions on the Kernel Accu Precis Sensitiv Specific
SVM classification algorithm are analyzed and the best Function racy ion ity ity
performing kernel function will be suggested based on applied on
SVM
Polynomial 92.38 93.28 90.09 91.23
kernel
SVM
Gaussian 94.65 95.01 92.09 91.38
Kernel
SVM
Hyperbolic 93.27 93.9 90.12 92.64
tangent
kernel (a) (b)
SVM
Laplace 91.38 92.07 88.23 87.65
RBF kernel
SVM
Sigmoid 91.5 92.89 89.88 88.56
kernel
SVM
Table 1 depicts the comparison of kernel (c) (d)
functions like polynomial, Gaussian, hyperbolic Fig. 5. (a) and (b) input MRI brain images; (c) and (d) segmented
tumor region
tangent, laplace RBF, sigmoid applied on SVM and the
performance of each kernel is being analyzed by
computing accuracy, sensitivity, precision and III. CONCLUSION
specificity in the classification of brain MRI images An algorithm for the classification of brain
into normal and abnormal images.
MRI images into abnormal and normal is developed by
analyzing the performance of various kernels functions
D. SEGMENTATION
on SVM. Among the various kernels applied, better
Segmentation in image processing is done to results are obtained for Gaussian Kernel SVM. After
identify the region of interest [10]. In the proposed the successful classification of the brain MRI images,
method, tumor region is considered as the region of segmentation is applied on abnormal images and the
interest. The identified tumor region is classified into tumor region is highlighted. The main limitation of the
benign and malignant by extracting the features. In the proposed algorithm is the manual feature extraction. In
proposed algorithm Otsu method are used as the future, the features can be automatically extracted
segmentation algorithms. and i.e., the accuracy of the proposed system may be
improved.
A. OTSU segmentation
REFERENCES
Otsu algorithm computes a threshold which
[1] Xu, F., Wang, X. C., Zhou, M. Q., Wu, Z., & Liu, X. Y. (2010,
will reduce the intra class variance and is interpreted as August). Segmentation algorithm of brain vessel image based on
sum of weighted variance of the two classes SEM statistical mixture model. In 2010 Seventh International
(foreground and background). It is given in (18). Conference on Fuzzy Systems and Knowledge Discovery (Vol. 4,
pp. 1830-1833). IEEE.