From a theoretical point of view, Hidden Markov Models (HMMs) and Dynamic Bayesian Networks (DBNs) are similar, still in practice they pose different challenges and perform in a different manner. In this study we present a comparative analysis of the two spatial-temporal classification methods: HMMs and DBNs applied to the Facial Action Units (AUs) recognition problem. The Facial Action Coding System (FACS) developed by Ekman and Friesen decomposes the face into 46 AUs, each AU being related to the contraction of one or more specific facial muscles. FACS proved its applicability to facial behavior modeling, enabling the recognition of an extensive palette of facial expressions. Even though a lot has been published on this theme, it is still difficult to draw a conclusion regarding the best methodology to follow, as there is no common basis for comparison and sometimes no argument is given why a certain classification method was chosen. Therefore, our main contributions reside in discussing and comparing the relative performance of the two proposed classifiers (HMMs vs. DBNs) and also of different Region of Interest (ROI) selections proposed by us and different optical flow estimation methods. We can consider our automatic system towards AUs classification an important step in the facial expression recognition process, given that even one emotion can be expressed in different ways, fact that suggests the complexity of the analyzed problem. The experiments were performed on the Cohn-Kanade database and showed that under the same conditions regarding initialization, labeling, and sampling, both classification methods produced similar results, achieving the same recognition rate of 89% for the classification of facial AUs. Still, by enabling non-fixed sampling and using HTK, HMMs rendered a better performance of 93% suggesting that they are better suited for the special task of AUs recognition.
Recently Hidden Markov Models (HMMs) and Stochastic grammar models have been extensively employed in various fields like computational biology, speech recognition, gesture recognition and text processing with the problems being modelled using classical probability measures. Fuzzy measure is an extension to the classical measure theory with promising applications in various areas. Some generalized HMMs have been developed with fuzzy measures for the speech recognition problem. The well known algorithms used for HMMs are thereby shown to execute faster. In this article, we discuss the classical and fuzzy measure formulation of HMMs, followed by applications in speech recognition using fuzzy measures. We also indicate the possible scope for their application to Bioinformatics.