Professional Documents
Culture Documents
F. Akhlaghian Tab
K. Nasri
K. Mollazade
Department of Computer
Engineering
University of Kurdistan
Sanandaj, Iran
kiamnasri@gmail.com
m
o
c
.
e
t
i
S
b
a
l
t
a
M
I.
INTRODUCTION
II.
A.
Grain Samples
Five Iranian rice varieties namely, Fajr, Hashemi, Mahali,
Gerde, and Domsiah were taken up for classification. The bulk
samples were prepared by pouring one kg of rice kernels into a
large plastic bag and shaking it to mix the grain thoroughly.
The rice kernel was then slowly poured into a dish until it was
completely filled. The excess rice was gently shaken off the
dish so that the top level of grain was almost horizontal and
matched up to the rim of the dish. This process was repeated
300 times for each rice variety. Thus, a total of 1500 images of
bulk samples were acquired (300 images per each rice
1833
MatlabSite.com
B.
Imaging Device
A CCD colour camera (model No.C-2000 Olympus) was
used to acquire the images. Camera was mounted on a black
box which was equipped with a uniform lighting system. The
distance between the camera and bulk samples was 20cm.
C.
m
o
c
.
e
t
i
S
b
a
l
t
a
M
1)
Gray level Co-occurrence matrix (GLCM) Method
Gray level co-occurrence matrix is one of the mostly used
statistical texture analysis method in which texture feature is
extracted by some statistical approaches from co-occurrence
matrix , p(k,l)[2]. The use of the co-occurrence matrix is based
on the hypotheses that the same gray level configuration is
repeated in texture. This pattern will vary more by fine
textures than by coarse textures. The co-occurrence matrix
p ,d (i, j ) counts the co-occurrence of pixels with gray values
p (k , l ) =
p(k , l )
R
max( pij )
Figure 1.
(i j)
i =1 j =1
1834
MatlabSite.com
pij
Mean
k
i i ( pij )
i =0 j =0
k
j j ( pij )
i =0 j =0
m
o
c
.
e
t
i
S
b
a
l
t
a
M
k
CS = ((i i ) + ( j j )) 3 pij
Figure 2. The direction of pixel pairs and the distance d between the
pixel pairs used to construct the gray level co-occurrence matrix. (a)
illustration of direction and distance d in image of pixel pairs(x1,y2) and
(x2, y2); (b)-(e) four examples at direction 0,45,90, and 135 ,
respectively[11].
(i j )
pij
Uniformity(Energy)
ij
i =1 j =1
pij
1+ | i j |
i =1 j =1
Dissimilarity
k
i =0 j =0
pij | i j |
i =0 j = 0
Feature selection
As stated in the previous section, 44 features were totally
extracted from the bulk samples of rice images. Of course,
these sets of features contain redundant, noisy or even
irrelevant information for classification purposes. To optimize
the number of features that contributed significantly to the
classification, standard sequential forward algorithm was
implemented using the 1-nearest neighbour error as the
selection criterion[12]. The selection algorithm reduced the
features to nearly optimum set of 10 features, which were
finally used to build the classifier.
E.
i =1 j =1
CP = ((i i ) + ( j j )) 4 pij
D.
i =1 j =1
i =0 j =0
1835
MatlabSite.com
Table 1.
f ( x) = sign[ wT . ( x) + b]
where the input vector x is mapped into a feature space by a
kernel function (x ) , and w and b are the classifier
parameters. Determining the classifier from the SVM theory is
equivalent to solving the following optimization problem
min
w ,b ,
Rice Variety
Fajr
Neda
Hashemi
Mahali
Gerde
All varieties
l
1 T
W .W + C i
2
i =1
Subject to
yi [w . ( xi ) + b] 1 i
T
where
i is
i 0,
Table 2.
i = 1,...,l
Rice Variaty
Fajr
Neda
Hashemi
Mahali
Gerde
All Variety
f ( x) = sgn( y i i .K ( x.xi ) + b)
Classification
accuracy
31.11
34.44
25.78
22.22
77.78
38.27
Classification
accuracy
88.89
91.11
94.44
93.33
100
93.55
m
o
c
.
e
t
i
S
b
a
l
t
a
M
i =1
That
k ( xi , x j ) = ( xi ). ( x j )
IV.
REFERENCES
k ( x, y) = exp( || x y || 2 /(2 2 ))
III.
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
1836
MatlabSite.com
[10]
[11]
[12]
[13]
m
o
c
.
e
t
i
S
b
a
l
t
a
M
1837
MatlabSite.com