
In the eye’s region, the AUs 1, 2, 4 represent the
intensity’s variation from low to raised brows. In
terms of distance, D2 replaces these three AUs. The
AUs 41, 42, 43 or 45 represent the intensity’s
variation from slightly drooped to closed eyes. In
terms of distance, D1 replaces these three AUs.
2.2 Belief Theory
Initially introduced by (A. Dempster, 1967) and
(Shafer, 1976), and enriched by (P. Smets, 1994), the
belief theory considers a frame of discernment Ω =
{E1, ...,EN} of N exhaustive and exclusive
hypotheses characterizing some situations. This
means that the solution of the considered problem is
unique and that it is obligatorily one of the
hypotheses of Ω. This approach takes into account
the uncertainty of the input information and allows
an explicit modeling of the doubt between several
hypotheses, for example the different intensities of
expressions. It requires the definition of a Basic
Belief Assignment (BBA) that assigns an elementary
piece of evidence m(A) to every proposition A of the
power set 2
Ω
. The function m is defined as:
m :2
Ω
→ [0, 1]
A → m(A), ∑ m(A) = 1,
A ⊆ Ω
(1)
In our application, the assumption Ei_min
corresponds to the minimum or low expression
intensity of expression i; Ei_moy corresponds to the
medium intensity and Ei_max corresponds to the
maximum or high intensity. 2
Ω
corresponds to single
expression intensities or to combinations of
expression intensities, that is 2
Ω
= {Ei_min, Ei_moy,
Ei_max ,(Ei_min∪Ei_moy), (Ei_moy∪Ei_max),…},
and A is one of its elements. In that definition, any
kind of expression Ei can be considered.
2.3 Definition of Symbolic States
We associate a state variable Vi (1≤ i ≤ 4) to each
characteristic distance Di in order to convert the
numerical value of the distance to a symbolic state.
The analysis of each variable shows that Vi can take
three possible states, Ω’ = {min, moy, max};
2
Ω’
={min, moy, max, minUmoy, moyUmax} where
minUmoy states the doubt between min and moy,
moyUmax states the doubt between moy and max.
We assume that impossible symbols (for example
minUmax) are removed from 2
Ω’
.
2.4 Modeling Process
The modeling process aims at computing the state of
every distance Di and at associating a piece of
evidence. To carry out this conversion, we define a
model for each distance using the states of 2
Ω'
(Figure 4).
Figure 4: Proposed model.
One model is defined for each characteristic
distance independently of the facial expression. If
the calculated distance increase , we consider the
right half part of the model from i to p thresholds,
and if the calculated distance decrease, we consider
the left half part of the model with from a to h
thresholds like on figures 5,6 and 7. For each value
of Di, the sum of the pieces of evidence of the
states of Di is equal to 1.
m
Di
: 2
Ω
'→ [0 ,1 ]
V
i
→ m
Di
(V
i
)
(2)
The piece of evidence m
Di
(V
i
) is obtained by the
function depicted in Figure 4.
2.5 Definition of Thresholds
Thresholds {a,b,…. P} of each model state are
defined by statistical analysis on
(Hammal_Caplier) Database. The database
contains 21 subjects, it has been divided into a
learning set called HCE
L
and a test set called HCE
. The learning set is then divided into expressive
frames noted HCE
Le
and neutral frames HCE
Ln
.
The minimum threshold a is averaged out over the
minimum values of the characteristic distances
from the HCE
Le
database. Similarly, the maximal
threshold p is obtained from the maximum values.
The middle thresholds h and i are defined
respectively as the mean of minimum and
maximum of the characteristic distances from the
HCE
Ln
. The threshold b is the median of the
characteristic distances values for facial images
assigned to the higher state min, g is the median of
the characteristic distances values for facial images
assigned to the lower state S. The intermediate
threshold d is computed as the mean of the
difference between the limit thresholds a and h
divided by three (according to the supposition in
section 2.1) augmented by the value of the
threshold a. Likewise the threshold e is computed
as the mean of the difference between the limit
thresholds a and h divided by three reduced by the
value of the threshold h. The thresholds c and f are
VISAPP 2008 - International Conference on Computer Vision Theory and Applications
454