Documente Academic
Documente Profesional
Documente Cultură
I.
INTRODUCTION
Jm =
U ijxiCj
i=1 j=1
(1)
U ij
= 1/
k=1
xjCj
xiCk
2
(m 1 )
(2)
(3)
The iteration will stop when below equation(4) is satisfied
max ij
{|Uij(k+1)Uijk|}<TC
(4)
Where TC is a termination criterion and K is the number of
iteration.
The algorithm consists of following steps
Step 1: Initialize the fuzzy partition matrix U= [uij]
Step 2: At k-step, calculate the cenre vector
C(k) =[cij] with u(k) in accordance with equation 3.
Step 3: Update the fuzzy partition matrix u(k), u(k+1) by the
newly calculated uij according to equation 2.
Step 4: If the difference || u(k+1) u(k)|| < TC, then stop the
iteration, otherwise return to step 2.
The resultant segmented image obtained using above
procedure is shown below.
1) Feature Extraction:
a)POI extraction using SIFT:
SIFT provides a set of image features that are not affected by
many of the complication like image scaling and rotation.
SIFT features are also very sensitive to the presence of noise
artifacts in the image. SIFT descriptor is a three dimensional
spatial histogram of the segmented image gradient. The image
gradient at each pixel is a sample of a three dimensional
elementary feature vector formed by the pixel location and the
gradient orientation. Next, the samples are weighted by the
gradient norm and they are accumulated in a 3D histogram.
These histogram forms the SIFT descriptor of the segmented
image.
We uses a set of 16 histogram aligned in a 4x4 grid,
each with eight bins. This results in a feature vector consisting
of 128 elements. SIFT descriptor are computed by using
function in MATLAB R2014a. The output feature vector are
stored in a .mat extension file and used for the further
classification after combining with texture features.
b)Texture feature extraction using GLCM
Four features based on texture are extracted using
Gray Level Co-occurrence Matrix (GLCM) . GLCM is a
tabulation of how often different combination of pixel
brightness values occur in a pixel pair in an image. Each
element (i, j) in GLCM specifies the number of times that the
pixel with value i occurred horizontally adjacent to a pixel
with value j. The resulting matrix was analyzed and based on
the existing information, the feature vectors are formed [19].
The four features are given in Table I.
Table. I. Texture Feature
S.No
1
Feature
CONTRAST
CORRELATI
ON
ENTROPY
ENERGY
Formula
Sensitivity
(6)
TN
Specificity = (TN + FP)
xixj
K (xi, xj) =
2 2
exp
(7)
(5)
Precision =
TP
(TP+ FP)
(8)
TP
(TP+ FN )
Accuracy =
TP+FN
(TP+FP+ FN +TN )
(9)
The obtained result for each image of the testing set are shown
in table II. Our proposed algorithm achieves an average
sensitivity of 99.96%, specificity of 96.6% , precision of
97.71% and accuracy of 99.84%.
Sensitivity
(%)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
99.91
100
100
99.96
99.92
100
100
100
100
100
99.97
99.93
100
100
99.87
99.79
100
100
100
99.95
Specificity
(%)
97.51
98.65
96.90
97.82
97.29
97.11
96.95
96.32
97.51
97.23
96.12
97.42
96.13
96.45
96.89
96.47
97.19
97.00
96.4
95.99
Precision
(%)
Accuracy
(%)
100
100
100
100
93.61
95.78
96.59
100
97.13
96.54
98.45
96.76
97.18
98.54
99.14
93.45
100
95.21
96.87
99.13
99.99
100
100
100
100
100
100
99.25
99.75
99.57
99.89
100
99.29
99.86
100
100
99.47
99.90
100
100
Aver
age
99.96
96.96
97.71
99.84