Beruflich Dokumente
Kultur Dokumente
Segmentation
Sahebgoud H Karaddi1 , Dr. P. AshokBabu2 ,Rama Krishna Reddy3
TRAINING/LEARNING PHASE
TESTING/REOGNATION PHASE
IMAGE
SEGMENTATION
II. IMAGE SEGMENTATION
Image segmentation is process of dividing the image into FEATURE
EXTRACTION
multiple objectives.or image segmentation is the process of
KNOWLE
partitioning a digital image into multiple segments(sets of ANN CLASSIFIER
DGE
BASED
pixels also known as super pixels).The goal of segmentation
is to simplify and enhance the the representation of an image
NORMAL ABNORMAL
into something that is more meaningful and easier to analyze.
[7] Different types of segmentation techniques are shown in Fig. 2: Proposed Methodology
table I
0 0 0 1 2
A. Practical Applications of Image segmentation 1 1 0 1 1
4 2 1
• content-based image retrieval 2 2 1 0 0 1
P = 16 2 3 2
• machine vision 1 1 0 2 0
0 2 0
• medical imaging (locate tumors and other pathologies 0 1 0 2 0
measure tissues volume surgery planning) 0 0 1 0 1
• object detection where an entry Pi j is a count of the number of times
• recognition tasks that F = (x, y) = i and F (x + 1, y + 1) = j. For
• traffic control systems example, the first entry comes from the fact that 4 times
. a 0 appears below and to the right of another 0.The factor
1/16 is because there are 16 pairs entering into this matrix,
so this normalizes the matrix entries to be estimates of the
III. G RAY- LEVEL C O - OCCURANCE M ATRIX (GLCM) co-occurrence probabilities.For statistical confidence in the
A statistical approach that can well describe second-order estimation of the joint probability distribution, the matrix must
statistics of a texture image is a co-occurrence matrix. Gray contain a reasonably large average occupancy level. Achieved
level co-occurrence matrix (GLCM) was firstly introduced by either by (a) restricting the number of amplitude quantization
Haralick. A co-occurrence occurrence matrix, also referred levels (causes loss of accuracy for low-amplitude texture),
to as a co , also referred to as a cooccurrence occurrence or (b) using large measurement window. (causes errors if
distribution distribution, is defined over an , is defined over texture changes over the large window). Typical compromise:
an image to be the distribution of to be the distribution of 16 gray levels and window size of 30 or 50 pixels on each
co-occurring values at a occurring values at a given offset side. Now we can analyze P: maximum probability entry
given offset Or Represents the distance and angular spatial element difference moment of order k. Using GLCM we an
Represents the distance and angular spatial relationship over find Texture features which are shown in table II.
an image sub relationship over an image sub-region of specific
region of specific size. IV. PROPOSED METHODOLOGY
The GLCM is created from a gray-scale image. The GLCM
is calculates how often a pixel The GLCM is calculates how The method used for detection and classify the brain tumor
often a pixel with gray with gray-level (grayscale intensity is shown in Figure 2. This paper shows the new approach to
or level (grayscale intensity or Tone) value i occurs either detect and classify the MRI images by adaptive segmentation
horizontally, vertically, or diagonally to adjacent pixels verti- method like Otsu-region based method. And to classify the
cally, or diagonally to adjacent pixels with the value j .In our MRI images into different types of tumors.After segmentation
proposed system MRI image can be decomposed into patterns texture features are calculated by using GLCM in different
with regular textures. So we should be able to represent these directions (i,e. 00 ,450 , 900 and 1350 ). Then using artificial
regular texture regions by using co-occurrence matrices. To do neural networks(Back-propagation and Probabilistic neural
so, we utilize the co-occurrence matrices in angles of 00 ,450 , networks). The necessary steps of method is as fallows:
900 and 1350 [6], [10]. The example for the GLCM is shown • Image segmentation using image processing techniques
below.Consider the image (below left). If we use the position (Otsu-region based method) perform for the input image.
operator 1 pixel to the right and 1 pixel down then we get the • Texture Features extraction using GLCM Matrix in dif-
gray-level co-occurrence matrix (below right) ferent Direction (i.e. at 00 ,450 , 900 and 1350 ).
TABLE I: Image Segmentation Techniques
Techniques Description Advantage Disadvantage
Thresholding a threshold value to turn a
simplest mainly depends on peaks
ex:histogram based gray-scale image into a binary image
Region based partitioning images into homogeneous
immune to noise requires more time and memory
ex:region growing regions
clustering[8], [9] finding members of clusters is
dividing homogeneous clusters more useful for real problems
ex:k-means, fuzzy c-means difficult
considers the gradient magnitude of
Watershed transformation detect boundaries continuously complex calculation
an image as a topographic surface
PDE method works on Partial Differential equations fastest method more clculations
achieved by simple agglamerative
Compression method works on coding length of data more time
clustering method
Edge detection objects will have good contrast
works on discontinuity of edges not suitable for many edges
Ex: canny edge method between them
find segmentation which is optimal
Variational less optimization problems complex
with respect to specific energy
Model based based on structures of interest fast and easy finding particular location
works on the region and thresholding/ some images will not detect
Otsu-region based simple and finds accurate location
histogram of the image in this technique
TABLE II: Computation of Texture features (ASM) or energy, contrast, inverse difference moment (IDM)
−1
NP or homogeneity, dissimilarity, entropy, maximum probability
ENERGY F1 = P 2 (i, j)
i,j=0 and inverse for each type of MRI image that was trained for
NP −1 the neural network is shown in table II.
CONTRAST F2 = P (i, j) ∗ |i, j|2
i,j=0
NP −1
P (i,j)
HOMOGENITY F3 = 1+(i−j)2
B. Testing/Recognition Phase
i,j=0
NP −1 The second stage is recognition/testing phase. To test un-
DISSIMILARITY F4 = P (i, j) ∗ |(i, j)|
i,j=0
known MRI image sample and classify, two steps are per-
NP −1 formed, the first one is segmented the image and calculate
ENTROPY F5 = P (i, j) ∗ [−lnP (i, j)]
i,j=0 the GLCM for each input MRI image. The obtained GLCM
is used to extract features depending on equations. The sec-
MAXIMUM PROBABILITY F6 = maxi,j P (i, j)
−1
NP
ond step is train the above features with the desired values
P (i,j)
INVERSE F3 = (i−j)2
of neural networks to determine the MRI image belong to
i,j=0
which grade of astrocytoma type of brain tumor[5]. The taken
decision is made by back-propagation neural network (BPN)
• Train a neural network on different image samples for based classifier and probabilistic neural network (PNN) based
certain class. classifier.
• Test unknown image sample by calculate the texture
features by GLCM and used a neural network to detect V. I MAGE SEGMANTION B Y OTSU - REGION BASED
it[8],[11]. M ETHOD
The proposed method consists of two phases: The Otsu-method is named by Nobuyuki Otsu in 1979 is
• Training/Learning Phase
used to automatically clustering based image thresholding. In
• Testing/Recognation Phase
this paper, the image segmentation is done by Otsu-method
and region based method to locate and detect the tumor in
MRI image of patient. So, it can collectively called as Otsu-
A. Training/Learning Phase region based method of segmentation. Firstly segmentation is
In Learning/Training Phase the ANN is trained for recogni- done by Otsu-method and the process as fallows:The algorithm
tion of different Astrocytoma types of brain cancer. The known assumes that the image contains two classes of pixels follow-
MRI images are first processed through segmentation using ing bi-modal histogram (foreground pixels and background
pre-processing and various image processing steps such as pixels), it then calculates the optimum threshold separating
Histogram Equalization, Thresholding, and morphological op- the two classes so that their intra-class variance is minimal,
eration etc. and then textural features are extracted using Gray or equivalently, so that their inter-class variance is maximal.
Level Co-occurrence Matrix. The features extracted are used in Consequently, Otsu’s method is roughly a one-dimensional,
the Knowledge Base which helps in successful classification of discrete analog of Fisher’s Discriminant Analysis. Otsu’s
unknown Images. These features are normalized in the range method is also directly related to the Jenks optimization
-1 to 1 and given as an input to Back Propagation Neural Net- method. Where q1 and q2 are define the estimates of class
work (BPN) Based Classifier. In case of Probabilistic Neural probabilities as
t
Network these features are directly given as an input to PNN X
q1 (t) = P (i) (1)
based classifier. The features such as angular second moment
i=1
L
X
q2 (t) = P (i) (2)
i=t+1
L
X P (i)
σ22 (t) = [i − µ22 (t)]2 (4)
i=t+1
q2 (t)
L
X iP (i)
µ2 (t) = (6)
q (t) Fig. 3: Layers of Back-propagation Neuaral network
i=t+1 2
5 6 7 8
23 24 25 26
9 10 11 12
27 28 29 30
13 14 15 16
31 32 33 34
17 18
35 36 37 38
Fig. 5: Brain MRI Images With Tumor
R EFERENCES [7] Shweta Jain, Shubha Mishra. ANN Approach Based On Back Prop-
[1] S.N.Deepa and B.Aruna Devi, Artificial Neural Networks design for agation Network and Probabilistic Neural Network to Classify Brain
Classification of Brain Tumour, @2012 IEEE. Cancer, International Journal of Innovative Technology and Exploring
[2] Arpita Das and Mahua Bhattacharya, A Study on Prognosis of Brain Engineering (IJITEE) ISSN: 2278-3075, Volume-3, Issue-3, August
Tumors Using Fuzzy Logic and Genetic Algorithm Based Techniques, 2013.
@2009 IEEE. [8] Lalit P. Bhaiya1 , Virendra Kumar Verma2. Classification of MRI Brain
[3] Simon Haykin,”Neural networks and learning machines” ,@1999 PEAR- Images Using Neural Network. Lalit P. Bhaiya, Virendra Kumar Verma /
SON Publications. International Journal of Engineering Research and Applications (IJERA)
[4] DeSieno, D., 1988. Adding a conscience to competitive learning, ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 5, September- October
Proceeding of IEEE the Second International Conference on Neural 2012, pp.751-756.
networks(ICNN88) 1: 117- 124. [9] K.Madhukar1, V.Rajesh2. MRI Brain Image Classification Using Ma-
[5] Madhusudhanareddy P, Dr. I. SantiPrabha. Novel Approach in Brain chine Learning Approach And Tumor Detection Using Clustering Tech-
Tumor Classification Using Artificial Neural Networks, International nique. IJRRECS/October 2013/Volume-1/Issue-6/1374-1380 40.
Journal of Engineering Research and Applications (IJERA) Vol. 3, Issue [10] . Mohanaiah, P. Sathyanarayana and L. GuruKumar, ”Image Texture
4, Jul-Aug 2013. Feature Extraction Using GLCM Approach,International journal of
[6] Naveena H S, Shreedhara K S, Mohamed Rafi,”Detection and Classifi- scientific and research publications,Vol. 3, Issue 5, May 2013.
cation of Brain Tumor using BPN and PNN Artificial Neural Network [11] Jayashri Joshi and Mrs.A.C.Phadke, Feature Extraction and Texture
Algorithms”,IJCSMC, Vol. 4, Issue. 4, April 2015, pg.782 789 Classification in MRI, IJCCT, Vol. 2 Issue 2, 3, 4, 2010.
Fig. 7: Image Segmentation Process
22 30