Académique Documents
Professionnel Documents
Culture Documents
AnushaVupputuri, SukadevMeher
H i = I ( f l ( x, y ) = i ), i = 0,.........., n 1 (1)
x, y
1 if _ a _ is _ true
where I ( A) =
0 if _ a _ is _ false
Fig.4. LBP feature histogram
and n is the number of different labels generated by the LBP
operator.
Each image is subdivided into 7 6 regions and each sub
region has uniform LBP range of labeled pixels from 1 to 59
5 6 2 1 1 0
binary pattern: 11011101 which are the corresponding 59 bins for subpart of feature
u2
4 3 4 1 1 decimal value: 221 histogram as shown in Fig. 4.Thus LBP(8,1) is implemented
1 9 3 0 1 1
to obtain feature histogram for comparison.
i, j
I ( x, y )
Euclidean Distance (ED) which is minimum distance I ( x, y ) = 1
(9)
classifier given by equation (5)
(mean(min( , I ( x ', y ') ) ))
D( S , M ) = w (S
i, j
j i Mi ) 2
(5)
2.2 d
Chi Square (CS) statistic dissimilarity measure d
( Si , j M i , j ) 2 1.8d
w2 ( S , M ) = w j (6)
Fig.5.Cropped face from JAFFE database using Face model and Viola
i, j Si , j + M i , j Jones algorithm
D ( S , M ) = w j Si log M i (7)
i, j
Surprise