Recognition of facial expressions - Knowledge Based Systems ...

-------------------------
1: struct file
2: {
3: int nsubj;
4: int nscene;
5: FACS facs;
6: char expr[100];
7: float param[50];
8: };
//-------------------------
Listing 10. Data structure to store the information related to one sample
Each Action Unit sequence is handled separately by using a structure that is defined in
Listing 11. It also contains some routines for easily converting from a character structure,
to efficiently copy data from another similar structure and to check for the existence of
some condition.
//-------------------------
1: struct FACS
2: {
3: int n;
4: unsigned char a[30][3];
5: void assign(char*);
6: void copyFrom(FACS&);
7: void show(void);
8: bool Is(int,int);
9: bool containAU(int);
10: };
//-------------------------
Listing 11. The internal structure to handle the AU sequence of one sample
A query is encoded in a structure that is shown in
Listing 12. It can be used for computing the probability of any expression, given the state
of existence/absence of the Aus from the set.
//-------------------------
1: #define MAXQUERYLEN 50
2: struct query
3: {
4: char expr[100];
5: bool swexpr;
6: bool neg_expr;
7: bool neg[MAXQUERYLEN];
8: FACS f[MAXQUERYLEN];
9: int n;
10:
11: query():n(0),swexpr(false),neg_expr(false){};
12: bool add(char*e,bool sw_n=true);
13: void empty(void){n=0;neg_expr=false;swexpr=false;}
14: };
//-------------------------
Listing 12. The structure of a query
- 78 -