# A Robust Method for Speech Emotion Recognition Based on Infinite Student’st-Mixture Model

Authors: Xinran Zhang; Huawei Tao; Cheng Zha; Xinzhou Xu; Li Zhao
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

Speech emotion classification method, proposed in this paper, is based on Student’st-mixture model with infinite component number (iSMM) and can directly conduct effective recognition for various kinds of speech emotion samples. Compared with the traditional GMM (Gaussian mixture model), speech emotion model based on Student’s t-mixture can effectively handle speech sample outliers that exist in the emotion feature space. Moreover, t-mixture model could keep robust to atypical emotion test data. In allusion to the high data complexity caused by high-dimensional space and the problem of insufficient training samples, a global latent space is joined to emotion model. Such an approach makes the number of components divided infinite and forms an iSMM emotion model, which can automatically determine the best number of components with lower complexity to complete various kinds of emotion characteristics data classification. Conducted over one spontaneous (FAU Aibo Emotion Corpus) and two acting (DES and EMO-DB) universal speech emotion databases which have high-dimensional feature samples and diversiform data distributions, the iSMM maintains better recognition performance than the comparisons. Thus, the effectiveness and generalization to the high-dimensional data and the outliers are verified. Hereby, the iSMM emotion model is verified as a robust method with the validity and generalization to outliers and high-dimensional emotion characters.


---

## Body

## 1. Introduction

In naturalistic human-computer interaction (HCI), speech emotion recognition (SER) is becoming increasingly important in various applications. In the literature, the studies on speech emotion recognition may be categorized into the following: (a) the searching for robust speech emotion features, (b) the study on emotion classification models (Gaussian mixture model (GMM) [1] and regression are adopted, resp., for discrete emotion model and continual dimensional model [2–4]), (c) the study towards naturalistic emotional behavior, and (d) the approaches that consider the complex environment factors, for example, context dependent [5], cross-language, and gender dependent speech emotion recognition [6].On account of simple structures and easy implementation, classifier models with Gaussian kernel are commonly used in speech emotion recognition. However, the division performance in space of Gaussian kernel largely depends on the characterization of characters in the training samples themselves. If a certain proportion of outliers (singular points) arise in the actual emotion feature samples, it may lead to the surge in number of divisory components, which would seriously affect the recognition performance. Moreover, in previous research on emotion models [7–9], the model component numbers usually need to be gained through a plenty of training on data. Then, when the underfitting of emotion characteristics leads to mismatching between test samples and training samples, the model component number division will be affected, which results in the performance degradation of classifiers. To solve the above problems, this paper introduced feature classification method of speech emotion based on Student’s t-mixture model with infinite component numbers (iSMM). First of all, based on nonparametric Bayesian statistical distribution [10], Student’s t-distribution emotion model is set up for high-dimensional space modeling of speech emotion features, while according to the appropriate numbers of components characteristics classification proceeds effectively. Then, the iSMM models are based on normal distributions [11]. Compared to other models, their unique “long-tail” structures make them more robust when handling outliers in speech emotion features and monitoring data with underfitting sample spaces. At last, profiting from latent variables with the hybrid model distributions, the iSMM emotion model in this paper can automatically determine the best composition numbers to conduct the optimal partition of feature space. Meanwhile, outliers in various kinds of speech emotion characters can be effectively dealt with and the problem of model size selection could be solved simultaneously.In order to verify our proposed method, we adopt three different databases in two different languages: Danish and German. The cross-language speech emotion recognition is still a challenge. Although the emotion expression has a universal character in different nations and cultures, the acoustic features are greatly impacted by different languages. Hence, some of the emotion recognition algorithms may achieve good result in one language while having poor performance in another one.The remainder of this paper is organized as follows. Section2 gives the introduction of Student’s t-mixture model. Section 3 provides the detailed establishment of emotion model based on the iSMM. Section 4 gives the experimental results on different databases and different languages. Finally, the conclusion is given in Section 5.


## 2. Speech Emotion Feature Classifiers Based on Statistical Models

FA (factor analysis) is a statistical model to process high-dimensional observed data of speech emotion. FA consists of low-dimensional latent factors, generally, used for dimensionality reduction of local offline data, such as GMM. The combination of a series of factor analyses can form finite local MFA (mixture factor analysis). However, during the process of MFA applied, standardization may usually lead to distribution errors on several factor components, which can further result in the decline of performance with the presence of underfitting data and outliers. The common solution is adopting an independent dimensionality reduction strategy instead of MFA, such as LDA (Linear Discriminant Analysis) and PCA (Principal Component Analysis). However, not only does this increase the complexity of the classification scheme, but processing the singular values or outliers of speech emotion features is also very difficult.As shown in Figure1, Student’s t-distribution is introduced to replace the MFA in normal distribution, constructing the finite Student’s t-distribution mixture model (SMM) [12]. Specifically, the degree of freedom is integrated into Student’s t-distribution as a new parameter, bringing the model distribution a “long tail.” So, to outliers and atypical feature data, emotion model could keep robust.Figure 1
Statistical models for emotion data space.In allusion to speech emotion classifiers based on distribution models, the finite mixture model is applied to assess observed emotion sample data. The density expression of a finite mixture model is formed as(1)
δ
x
∣
ϑ
=
∑
g
=
1
G
τ
g
δ
g
x
∣
θ
g
,where τ
g
>
0 and the mixture probability ∑
g
=
1
G
τ
g
=
1 is satisfied. ϑ
=
τ
1
,
…
,
τ
G
,
θ
1
,
…
,
θ
G is the vector of parameters while δ
g
x
∣
θ
g is the density of gth component in the model. In the former research of setting up emotion models for SER [9, 13], multivariate Gaussian distributions are often used in the analytical formula of classifiers to express the component densities, which is shown in Figure 2(a). However, recent studies have consciously focused on mixture models based on non-Gaussian frameworks which were used for classification or clustering in high-dimensional data for SER or other fields [14–17].Figure 2
Plot of fitting multicomponent GMM and iSMM to the emotion feature corpus.
(a)
Component demarcation with GMM
(b)
Component demarcation with iSMMBeing similar to Gaussian distribution and Skew-t distribution [18], Student’s t-distribution is quite suitable for classifying high-dimensional data or clustering. The AECM (alternating expectation-conditional maximization) algorithm [19] is often used to estimate the model parameters. Meanwhile, the BIC (Bayesian information criterion) [20] may be introduced to determine the types of model.


## 3. Establishment of the Emotion Model Based on iSMM

In some cases such as exorbitant dimension of observed data (usually in the spontaneous speech emotion databases) or oversize number of components needed to be demarcated in the emotion feature spaces, the parameters of the SMM may be hard to control, thereby leading to the performance degradation of classifiers. Under this motivation, in this work, an infinite mixture countable number of components are introduced, constructing the iSMM model.As shown in Figure2(b), for each component, expectations of mean are denoted by “○” and expectations of covariance are represented as the shaded ellipse. So the iSMM propels monitoring data to match the model, rather than aiming at reducing the complexity through adjusting the structure of the models themselves.


### 3.1. The Emotion Model Based on Student’st-Distribution

The distribution of the emotional samples in the feature space could be described by multiple superposed Student’st-functions. Theoretically, iSMM model may fit arbitrary density distribution function, as long as there are enough mixed Student’s t-components. In our research, iSMM is applied to modeling various emotions. In detail, each emotion category corresponds to an iSMM and is judged through the maximum a posteriori probability criterion. Here, x
j is the j
t
h utterance sample and c
k represents the emotion category where k
=
1
,
…
,
K. Then, the maximum a posteriori probability is(2)
P
c
k
∣
x
j
=
P
x
j
c
k
P
c
k
P
x
j
.In (2), P
c
k
x
j is obtained through each iSMM model. For a given statement sample, the probability of feature vector is a constant. Assume that each emotion possesses equal probability; p
k is the probability of the k
t
h emotion class:(3)
p
k
=
P
y
∣
Y
k
,where y is the acoustic feature vector of corresponding speech utterance and Y
k is the feature distribution model which can be formulated by Student’s t-mixture model with iSMM. Hence, identification of samples can be judged by(4)
c
k
=
arg
max
⁡
p
k
,where c
k stands for the emotion class label in the emotion model.Infinite Student’st-factor mixture distribution, in this paper, is introduced to structure the emotion classification model. Suppose that the number of infinite substructures in a model is countable, and then, according to the Dirichlet process, the mixture model suitable for emotion feature database could be obtained.p-dimensional emotion characteristics data y
n
n
=
1
,
…
,
N can be described as(5)
y
n
=
A
u
n
i
+
e
n
i
,
with prob.
π
i
.Among them, the probability of feature data sample is set as π
i
i
=
1
,
…
,
I, where ∑
1
I
π
i
=
1 and I is the number of the mixture compositions divided in the emotion feature space. The corresponding q-dimensional (q
<
p) factor u
n
i is distributed independently t
u
n
i
∣
ξ
i
,
Ω
i
,
v
i, where v
i is called degrees of freedom, parameter ξ
i is q-dimensional vector, and Ω
i is a q
×
q positive definite symmetric matrix, which represent the mean and variance of the ith emotion component in low-dimensional feature subspaces. Furthermore, e
n
i represents component error of the emotion features, which obeys independent distribution t
e
n
i
∣
0
,
D
,
v
i, where D is a diagonal matrix and A is a p
×
q matrix shared by all divided emotion components. Therefore it is defined as the common emotion factor loading matrix. The t-distributions t
u
n
i
∣
ξ
i
,
Ω
i
,
v
i and t
e
n
i
∣
0
,
D
,
v
i can be regarded as average normal scale distributions N
u
n
i
∣
ξ
i
,
Ω
i
/
w
n
i and N
e
n
i
∣
0
,
D
/
w
n
i with the precision scalar w
n
i Gamma distributions; that is,(6)
t
u
n
i
∣
ξ
i
,
Ω
i
,
v
i
=
∫
N
u
n
i
∣
ξ
i
,
Ω
i
w
n
i
G
w
n
i
∣
v
i
2
,
v
i
2
d
w
n
i
,
t
e
n
i
∣
0
,
D
,
v
i
=
∫
N
e
n
i
∣
0
,
D
w
n
i
G
w
n
i
∣
v
i
2
,
v
i
2
d
w
n
i
.Here, data space model based on t-distribution of speech emotion features could be gained, where the parameter set of emotion model, Θ, contains the parameters ξ
i, Ω
i,  v
i
i
=
1
,
…
,
I, A, D, and π
i
i
=
1
,
…
,
I
-
1.


### 3.2. Probabilistic Distribution Modeling of Emotion Features

Because the topic of SER this paper discussed belongs to supervised machine learning, in order to accomplish the mission of emotion classification, the focus on the posterior distribution of stochastic variables of the emotion feature parameters is unnecessary while the research about the emotion characteristics datay
n
′ for testing holds the main part in our work.For this purpose, the distribution of emotion characteristics data tested is evaluated asP
y
n
′
∣
Y. According to the principle of the Bayesian framework, it is known that the distribution above can be obtained through the calculation of marginal likelihood about P
y
n
′
∣
Θ and posterior distribution P
Y
k
∣
Θ, as the following formula:(7)
log
⁡
p
y
n
′
∣
Y
=
log
⁡
∫
d
Θ
p
y
n
′
∣
Θ
p
Θ
∣
Y
≈
log
⁡
∫
d
C
q
C
∫
d
A
q
A
∫
d
ξ
d
Λ
q
ξ
,
Λ
∑
i
=
1
T
p
z
n
i
∣
π
i
C
p
y
n
′
∣
z
n
i
,
A
,
ξ
i
,
Λ
i
,
D
,
v
i
,where the evaluation on posterior distribution of emotion samples is obtained from training data of each type of emotions. In formula (7), q
C, q
A, and q
ξ
i
,
Λ
i and parameters D and v are gotten from inference prediction of corresponding emotion categories in the infinite Student’s t-distribution.Furthermore, through applying step “E’’ in expectation-maximization (EM) algorithm [21] to the test data y
n
′, the posterior probability of latent variables z
n, which is derivation from emotion characteristics, could be obtained. The iSMM which is composed of several latent weights could approximate the real distribution of samples by the Student’s t-model. The estimate of iSMM model includes three parameters: the mixed weight of latent weight, the mean μ, and variance ∑ of each t-distribution function. Hereby, the weight of latent variables z
n is(8)
a
z
n
=
1
N
∑
n
N
P
z
n
∣
y
n
,
Θ
.The recursive formula of mean and variance is(9)
μ
z
n
=
∑
n
N
y
n
P
z
n
∣
y
n
,
Θ
∑
n
N
P
z
n
∣
y
n
,
Θ
,
(10)
∑
z
n
=
∑
n
N
P
z
n
∣
y
n
,
Θ
y
n
-
μ
z
n
y
n
-
μ
z
n
T
∑
n
N
P
z
n
∣
y
n
,
Θ
,
(11)
P
z
n
∣
y
n
,
Θ
=
a
z
n
P
z
n
y
n
∣
θ
z
n
∑
k
=
1
K
a
k
P
k
y
∣
θ
k
,where P
z
n
y
∣
θ and P
k
y
∣
θ are both Student’s t-distribution.At last, the forecast distributiony
n
′ of characteristic in each type of emotions can be calculated according to the analyses above.


### 3.3. Evaluation: Decision Function of SER Based on Student’st-Distribution

In speech emotion classification, labelc
k represents a category of K emotions in data sample set Y, where Y
=
y
1
,
…
,
y
N is the sample set of emotion features, in which y
n
n
=
1
,
…
,
N is p-dimensional emotion data and category number k belongs to feature samples of speech for training. During the process of testing, each emotion data tested adopts the “E’’ step of EM algorithm to be derived. At the same time, each prediction distribution of features is calculated in emotion categories: P
y
n
′
Y
k. Based on formula (4), the criterion of speech emotion model can be obtained by Student’s t-distribution as(12)
c
k
=
arg
max
k
=
0
K
⁡
F
Y
k
,
y
n
;
Θ
,where emotion feature vector y
n satisfying 1
≤
n
≤
N is extracted from the frame of each speech on the database in use.Based on the judgment criteria (12) and the conditional distribution log
⁡
P
y
n
′
Y, the emotion model can be established by Student’s t-distribution, and the decision function for feature recognition could be inferred as follows:(13)
c
k
=
arg
⁡
max
K
k
=
1
⁡
F
Y
k
,
y
n
′
;
Θ
=
arg
⁡
max
K
k
=
1
⁡
log
⁡
P
Θ
y
n
′
∣
Y
k
=
arg
⁡
max
K
k
=
1
⁡
log
⁡
∫
d
Θ
P
y
n
′
∣
Θ
P
Θ
∣
Y
.At the beginning of test on emotion model with Student’st-distribution, step “E’’ for deriving model parameters is carried out on each test data y
n
′. Meanwhile, according to formula (11), the forecast distributions of each emotion category are calculated as P
y
n
′
∣
Y
1
,
…
,
P
y
n
′
∣
Y
K. Consequently obtained by formula (13), the emotion category c
k, which possesses the maximum prediction distribution, is the recognition results of emotion feature data tested.


### 3.4. Analysis on High-Dimensional Feature Space of Speech Emotion Based on iSMM

The emotion model, where variable and observed data is one-to-one correspondence, benefits from Bayesian criterion and the average field theory to obtain the relevant posterior distribution, which can be implemented to determine the model structure for emotion feature classification. For the reason of nonparametric Bayesian statistics principle, the iSMM adjusts component numbers on the basis of the distribution model established.After the evaluation of decision function for SER accomplished, further analysis on the probability distributions of parameters in the emotion model is necessary. High-dimensional emotion feature samples generated by the iSMM model areY
=
y
1
,
…
,
y
N. The iSMM is formed through joining an accompanying countable infinite number of components to the SMM, where the infinite dimensional latent stochastic variables z
n introduced are one-to-one correspondence with emotional features data y
n for experiment. The constraint conditions of the latent emotion feature elements in z
n are z
n
∈
0,1 and ∑
i
z
n
=
1. In Student’s t-distribution, because y
n is the mixed component of emotion features stemming from the i
t
h partition on the sample space, thus the specific feature element here satisfies z
n
=
1 and other elements are all 0. Therefore, the entirety latent variables space of features could be set as Z
=
z
1
,
…
,
z
n. According to formula (3), the marginal distribution of Z conforms to the mixture probabilistic π
=
π
1
,
…
,
π
∞, which is given as(14)
P
Z
∣
π
=
∏
n
=
1
N
∏
i
=
1
∞
π
i
z
n
i
.Then, based on the principle of nonparametric Bayesian statistics, π could be obtained by the stick-breaking [22] method.With respect to the data spacey
n
′ of emotion features tested, in which it is assumed that samples are obeying identically independent distribution, the decision function can be represented as(15)
F
Y
k
,
y
n
′
;
Θ
=
log
⁡
P
Θ
y
n
′
∣
Y
k
=
log
⁡
q
u
∣
z
,
w
=
∏
n
=
1
N
∏
i
=
1
T
N
u
n
i
∣
μ
~
u
n
i
,
∑
~
u
n
i
w
n
i
z
n
i
,where the hyperparameters μ
~
u
n
i and ∑
~
u
n
i are inferred through the estimation of latent variable z
n by the convergence criterion standard [23]. The relationship between the variables in the iSMM emotion model is shown in Figure 3.Figure 3
Probabilistic graphical model representation of the iSMM emotion model. Circles represent stochastic variables, and arrows describe conditional dependence between these variables.According to the emotion model based on infinite Student’st-distribution, in the feature space, the calculation of the posterior distribution P
Θ
Y is essential. Therefore, the boundary likelihood probability of emotion feature space partitioned is necessary to be analyzed:(16)
P
Y
=
∫
P
Y
,
Θ
d
Θ
.In detail, because there are interactions between multiple stochastic variables inP
Θ
∣
Y, therefore, according to the method which is in accordance with the Kullback-Leibler (K-L) divergence theory described in previous research [24, 25], an arbitrary distribution q
Θ is introduced to estimate the actual posterior distribution P
Θ
∣
Y. On the premise of this assumption, the calculation of the boundary likelihood function of feature data in the emotion model could be realized by applying Student’s t-distribution:(17)
log
⁡
P
Y
=
J
q
+
K
L
q
∥
p
=
∫
d
Θ
q
Θ
log
⁡
P
Y
,
Θ
q
Θ
+
K
L
q
∥
p
,where K
L
q
∥
p is defined for estimating the K-L divergence between the posterior distribution q
Θ and the actual posterior distribution P
Θ
∣
Y [8]. In the above equation, for the K-L divergence is negative, J
q is the lower bound of log
⁡
P
Y. According to the mean field approximation principle [26], the estimation of the lower bound J
q can be determined. Accordingly, predicted parameters of the emotion features in q
Θ could be calculated.Therefore, the emotion model could automatically determine the best number of components with lower complexity to complete various kinds of emotion characteristics data classification.


## 3.1. The Emotion Model Based on Student’st-Distribution

The distribution of the emotional samples in the feature space could be described by multiple superposed Student’st-functions. Theoretically, iSMM model may fit arbitrary density distribution function, as long as there are enough mixed Student’s t-components. In our research, iSMM is applied to modeling various emotions. In detail, each emotion category corresponds to an iSMM and is judged through the maximum a posteriori probability criterion. Here, x
j is the j
t
h utterance sample and c
k represents the emotion category where k
=
1
,
…
,
K. Then, the maximum a posteriori probability is(2)
P
c
k
∣
x
j
=
P
x
j
c
k
P
c
k
P
x
j
.In (2), P
c
k
x
j is obtained through each iSMM model. For a given statement sample, the probability of feature vector is a constant. Assume that each emotion possesses equal probability; p
k is the probability of the k
t
h emotion class:(3)
p
k
=
P
y
∣
Y
k
,where y is the acoustic feature vector of corresponding speech utterance and Y
k is the feature distribution model which can be formulated by Student’s t-mixture model with iSMM. Hence, identification of samples can be judged by(4)
c
k
=
arg
max
⁡
p
k
,where c
k stands for the emotion class label in the emotion model.Infinite Student’st-factor mixture distribution, in this paper, is introduced to structure the emotion classification model. Suppose that the number of infinite substructures in a model is countable, and then, according to the Dirichlet process, the mixture model suitable for emotion feature database could be obtained.p-dimensional emotion characteristics data y
n
n
=
1
,
…
,
N can be described as(5)
y
n
=
A
u
n
i
+
e
n
i
,
with prob.
π
i
.Among them, the probability of feature data sample is set as π
i
i
=
1
,
…
,
I, where ∑
1
I
π
i
=
1 and I is the number of the mixture compositions divided in the emotion feature space. The corresponding q-dimensional (q
<
p) factor u
n
i is distributed independently t
u
n
i
∣
ξ
i
,
Ω
i
,
v
i, where v
i is called degrees of freedom, parameter ξ
i is q-dimensional vector, and Ω
i is a q
×
q positive definite symmetric matrix, which represent the mean and variance of the ith emotion component in low-dimensional feature subspaces. Furthermore, e
n
i represents component error of the emotion features, which obeys independent distribution t
e
n
i
∣
0
,
D
,
v
i, where D is a diagonal matrix and A is a p
×
q matrix shared by all divided emotion components. Therefore it is defined as the common emotion factor loading matrix. The t-distributions t
u
n
i
∣
ξ
i
,
Ω
i
,
v
i and t
e
n
i
∣
0
,
D
,
v
i can be regarded as average normal scale distributions N
u
n
i
∣
ξ
i
,
Ω
i
/
w
n
i and N
e
n
i
∣
0
,
D
/
w
n
i with the precision scalar w
n
i Gamma distributions; that is,(6)
t
u
n
i
∣
ξ
i
,
Ω
i
,
v
i
=
∫
N
u
n
i
∣
ξ
i
,
Ω
i
w
n
i
G
w
n
i
∣
v
i
2
,
v
i
2
d
w
n
i
,
t
e
n
i
∣
0
,
D
,
v
i
=
∫
N
e
n
i
∣
0
,
D
w
n
i
G
w
n
i
∣
v
i
2
,
v
i
2
d
w
n
i
.Here, data space model based on t-distribution of speech emotion features could be gained, where the parameter set of emotion model, Θ, contains the parameters ξ
i, Ω
i,  v
i
i
=
1
,
…
,
I, A, D, and π
i
i
=
1
,
…
,
I
-
1.


## 3.2. Probabilistic Distribution Modeling of Emotion Features

Because the topic of SER this paper discussed belongs to supervised machine learning, in order to accomplish the mission of emotion classification, the focus on the posterior distribution of stochastic variables of the emotion feature parameters is unnecessary while the research about the emotion characteristics datay
n
′ for testing holds the main part in our work.For this purpose, the distribution of emotion characteristics data tested is evaluated asP
y
n
′
∣
Y. According to the principle of the Bayesian framework, it is known that the distribution above can be obtained through the calculation of marginal likelihood about P
y
n
′
∣
Θ and posterior distribution P
Y
k
∣
Θ, as the following formula:(7)
log
⁡
p
y
n
′
∣
Y
=
log
⁡
∫
d
Θ
p
y
n
′
∣
Θ
p
Θ
∣
Y
≈
log
⁡
∫
d
C
q
C
∫
d
A
q
A
∫
d
ξ
d
Λ
q
ξ
,
Λ
∑
i
=
1
T
p
z
n
i
∣
π
i
C
p
y
n
′
∣
z
n
i
,
A
,
ξ
i
,
Λ
i
,
D
,
v
i
,where the evaluation on posterior distribution of emotion samples is obtained from training data of each type of emotions. In formula (7), q
C, q
A, and q
ξ
i
,
Λ
i and parameters D and v are gotten from inference prediction of corresponding emotion categories in the infinite Student’s t-distribution.Furthermore, through applying step “E’’ in expectation-maximization (EM) algorithm [21] to the test data y
n
′, the posterior probability of latent variables z
n, which is derivation from emotion characteristics, could be obtained. The iSMM which is composed of several latent weights could approximate the real distribution of samples by the Student’s t-model. The estimate of iSMM model includes three parameters: the mixed weight of latent weight, the mean μ, and variance ∑ of each t-distribution function. Hereby, the weight of latent variables z
n is(8)
a
z
n
=
1
N
∑
n
N
P
z
n
∣
y
n
,
Θ
.The recursive formula of mean and variance is(9)
μ
z
n
=
∑
n
N
y
n
P
z
n
∣
y
n
,
Θ
∑
n
N
P
z
n
∣
y
n
,
Θ
,
(10)
∑
z
n
=
∑
n
N
P
z
n
∣
y
n
,
Θ
y
n
-
μ
z
n
y
n
-
μ
z
n
T
∑
n
N
P
z
n
∣
y
n
,
Θ
,
(11)
P
z
n
∣
y
n
,
Θ
=
a
z
n
P
z
n
y
n
∣
θ
z
n
∑
k
=
1
K
a
k
P
k
y
∣
θ
k
,where P
z
n
y
∣
θ and P
k
y
∣
θ are both Student’s t-distribution.At last, the forecast distributiony
n
′ of characteristic in each type of emotions can be calculated according to the analyses above.


## 3.3. Evaluation: Decision Function of SER Based on Student’st-Distribution

In speech emotion classification, labelc
k represents a category of K emotions in data sample set Y, where Y
=
y
1
,
…
,
y
N is the sample set of emotion features, in which y
n
n
=
1
,
…
,
N is p-dimensional emotion data and category number k belongs to feature samples of speech for training. During the process of testing, each emotion data tested adopts the “E’’ step of EM algorithm to be derived. At the same time, each prediction distribution of features is calculated in emotion categories: P
y
n
′
Y
k. Based on formula (4), the criterion of speech emotion model can be obtained by Student’s t-distribution as(12)
c
k
=
arg
max
k
=
0
K
⁡
F
Y
k
,
y
n
;
Θ
,where emotion feature vector y
n satisfying 1
≤
n
≤
N is extracted from the frame of each speech on the database in use.Based on the judgment criteria (12) and the conditional distribution log
⁡
P
y
n
′
Y, the emotion model can be established by Student’s t-distribution, and the decision function for feature recognition could be inferred as follows:(13)
c
k
=
arg
⁡
max
K
k
=
1
⁡
F
Y
k
,
y
n
′
;
Θ
=
arg
⁡
max
K
k
=
1
⁡
log
⁡
P
Θ
y
n
′
∣
Y
k
=
arg
⁡
max
K
k
=
1
⁡
log
⁡
∫
d
Θ
P
y
n
′
∣
Θ
P
Θ
∣
Y
.At the beginning of test on emotion model with Student’st-distribution, step “E’’ for deriving model parameters is carried out on each test data y
n
′. Meanwhile, according to formula (11), the forecast distributions of each emotion category are calculated as P
y
n
′
∣
Y
1
,
…
,
P
y
n
′
∣
Y
K. Consequently obtained by formula (13), the emotion category c
k, which possesses the maximum prediction distribution, is the recognition results of emotion feature data tested.


## 3.4. Analysis on High-Dimensional Feature Space of Speech Emotion Based on iSMM

The emotion model, where variable and observed data is one-to-one correspondence, benefits from Bayesian criterion and the average field theory to obtain the relevant posterior distribution, which can be implemented to determine the model structure for emotion feature classification. For the reason of nonparametric Bayesian statistics principle, the iSMM adjusts component numbers on the basis of the distribution model established.After the evaluation of decision function for SER accomplished, further analysis on the probability distributions of parameters in the emotion model is necessary. High-dimensional emotion feature samples generated by the iSMM model areY
=
y
1
,
…
,
y
N. The iSMM is formed through joining an accompanying countable infinite number of components to the SMM, where the infinite dimensional latent stochastic variables z
n introduced are one-to-one correspondence with emotional features data y
n for experiment. The constraint conditions of the latent emotion feature elements in z
n are z
n
∈
0,1 and ∑
i
z
n
=
1. In Student’s t-distribution, because y
n is the mixed component of emotion features stemming from the i
t
h partition on the sample space, thus the specific feature element here satisfies z
n
=
1 and other elements are all 0. Therefore, the entirety latent variables space of features could be set as Z
=
z
1
,
…
,
z
n. According to formula (3), the marginal distribution of Z conforms to the mixture probabilistic π
=
π
1
,
…
,
π
∞, which is given as(14)
P
Z
∣
π
=
∏
n
=
1
N
∏
i
=
1
∞
π
i
z
n
i
.Then, based on the principle of nonparametric Bayesian statistics, π could be obtained by the stick-breaking [22] method.With respect to the data spacey
n
′ of emotion features tested, in which it is assumed that samples are obeying identically independent distribution, the decision function can be represented as(15)
F
Y
k
,
y
n
′
;
Θ
=
log
⁡
P
Θ
y
n
′
∣
Y
k
=
log
⁡
q
u
∣
z
,
w
=
∏
n
=
1
N
∏
i
=
1
T
N
u
n
i
∣
μ
~
u
n
i
,
∑
~
u
n
i
w
n
i
z
n
i
,where the hyperparameters μ
~
u
n
i and ∑
~
u
n
i are inferred through the estimation of latent variable z
n by the convergence criterion standard [23]. The relationship between the variables in the iSMM emotion model is shown in Figure 3.Figure 3
Probabilistic graphical model representation of the iSMM emotion model. Circles represent stochastic variables, and arrows describe conditional dependence between these variables.According to the emotion model based on infinite Student’st-distribution, in the feature space, the calculation of the posterior distribution P
Θ
Y is essential. Therefore, the boundary likelihood probability of emotion feature space partitioned is necessary to be analyzed:(16)
P
Y
=
∫
P
Y
,
Θ
d
Θ
.In detail, because there are interactions between multiple stochastic variables inP
Θ
∣
Y, therefore, according to the method which is in accordance with the Kullback-Leibler (K-L) divergence theory described in previous research [24, 25], an arbitrary distribution q
Θ is introduced to estimate the actual posterior distribution P
Θ
∣
Y. On the premise of this assumption, the calculation of the boundary likelihood function of feature data in the emotion model could be realized by applying Student’s t-distribution:(17)
log
⁡
P
Y
=
J
q
+
K
L
q
∥
p
=
∫
d
Θ
q
Θ
log
⁡
P
Y
,
Θ
q
Θ
+
K
L
q
∥
p
,where K
L
q
∥
p is defined for estimating the K-L divergence between the posterior distribution q
Θ and the actual posterior distribution P
Θ
∣
Y [8]. In the above equation, for the K-L divergence is negative, J
q is the lower bound of log
⁡
P
Y. According to the mean field approximation principle [26], the estimation of the lower bound J
q can be determined. Accordingly, predicted parameters of the emotion features in q
Θ could be calculated.Therefore, the emotion model could automatically determine the best number of components with lower complexity to complete various kinds of emotion characteristics data classification.


## 4. Experimental Results

### 4.1. Experimental Settings

In the experiment, we conducted three international general speech databases using the iSMM emotion model for SER. In the previous related research [27–29], the EMO-DB and Danish emotional speech (DES) are databases based on speech performance; the utterances included are obtained from the speakers under pressure of simulation and performance. These two databases are chosen to test the performance of the iSMM model in dealing with different amount of data and speech categories. Aibo database is composed of spontaneous speech, belonging to the natural speech emotion. We conduct Aibo in the experiment to evaluate the recognition performance of the iSMM emotion model on imparity properties of speech emotion samples.We adopted the OpenEAR toolkit [30] to extract numerous low-level descriptors (LLD) including the delta and double-delta functions and achieved 1,582 dimensional features in total. After applying the LLD description criterion, the mapping static feature vectors could be obtained including original signal, the signal energy, pitch, timbre, frequency, and MFCCs. Particularly, the focus in our work is the performance of the iSMM emotion model proposed, which is applied to the SER, rather than research on the optimization algorithm about selecting features. Accordingly, any promotion in recognition performance could be given the credit to the emotion model proposed.In this experiment, a set ofN
=
1582  p-dimensional speech feature data from various corpus set y
n is generated by the SMM [12], whose true underlying group structure is known: the number of components I is the number of emotion classes (5 or 7) and the dimension of factors q is 2. In each observed data y
n
=
y
1
n
T
,
y
2
n
T
T, y
1
n represents p
=
10 dimensional subvector containing the latent stochastic variables z
n, while y
2
n is a p
2-dimensional subvector of test variables with p
2
=
p
-
p
1. Each observed data is obtained by both SMM and iSMM by substitution into formulas in Section 3:(18)
y
n
=
A
1
T
,
A
2
T
T
u
n
i
+
e
n
i
with prob.
π
i
.p
1
×
p submatrix A
1, the common factor loading matrix, is(19)
A
1
T
=
0.5
-
0.9
0.3
0.6
0.2
-
0.7
0
0
0
0
0
0
0
0.8
-
0.7
0.5
0.6
-
0.4
0.3
-
0.5
,and all elements of p
2
×
q submatrix A
2 related to the singularities are zero. Assume that I
=
5; then the mixing proportion vector is π
=
0.15
0.2
0.3
0.15
0.2. The mean vectors of u
n
i are given by ξ
1
=
0
5
T, ξ
2
=
-
5
0
T, ξ
3
=
0
0
T, ξ
4
=
5
0
T, and ξ
5
=
0
-
5
T and their covariance matrices are specified as(20)
Ω
1
=
0.1
0
0
0.5
,
Ω
2
=
0.5
0
0
0.1
,
Ω
3
=
1
0.9
0.9
1
,
Ω
4
=
0.5
0
0
0.1
,
Ω
5
=
0.1
0
0
0.5
.The degrees of freedom are v
1
=
v
2
=
v
4
=
v
5
=
5 and v
3
=
3. The covariance matrix D of e
n
i is a diagonal matrix, whose diagonal elements are specified to be 0.2.


### 4.2. Experimental Analysis on Acting Corpus Using iSMM

We conduct SER on the three general databases using four emotion models: iSMM, SMM, GMM, andKNN (K-nearest neighbor) [31], respectively. The Berlin database, also known as EMO-DB, contains utterances spoken in German. EMO-DB is acquired, respectively, from phonetic performance of five male and female actors, including seven kinds of emotion data: anger, disgust, fear, sadness, boredom, neutral, and happiness. There are a total of 800 utterances in EMO-DB. In the literature [9], 20 respondents are invited to conduct actual test of the 494 utterances. Then, the results show that, in EMO-DB, the natural intelligible utterances reach 60% and accurate selection of emotion is above 80%. DES database is collected from 341 utterances within 5 kinds of emotion: anger, happiness, neutral, sadness, and surprise.We analyze the results reflected in Figure4, which demonstrates the normalized confusion matrix of SER experiment using the iSMM on the EMO-DB database. Compared with the improved GMM in literature [9], the iSMM proposed in our research has great improvement on SER performance. Specifically, the recognition rates of “angry’’ and “disgust’’ emotion are close to 100%. For the reason of Student’s t-distribution, when dealing with EMO-DB, such database with deficiency speech samples conducts the EM algorithm to test emotion data y
n
′ for latent variables z
n of emotional features. Thus, the prediction distribution of emotion features in each category could be deduced as p
y
n
′
∣
Y
k; as a result, influences of unstable recognition performance caused by underfitting feature space can be weakened.Figure 4
Confusion matrix between seven emotions of the EMO-DB using the iSMM model.However, analyzing the error result of “fear’’ and “boredom” emotions, which are almost classified to “calm’’ and “sad,’’ it is shown that the correlations of emotion feature between them are relatively high. It should be noted that there are two types of errors: false positive and false negative. In our experiments, recognition accuracy is the ratio of correct judgment:(21)
A
c
=
1
-
F
P
,where A
c represents the accuracy and F
P is the false positive. Here, the inaccuracy consists of leakage probabilistic and false drop rate.Figure5 reveals the result of SER on the Danish database by the iSMM emotion model. DES is the speech emotion database comparatively difficult to be recognized; on this account, experimental results show decline of the emotion recognition performance compared to Berlin database overall. In particular, the recognition rates of “fear’’ and “happy’’ are less than 80%. It is worth mentioning that, in most cases, some key dimensions of emotion feature in the speech emotion database possess the main information of their categories. Compared to many other dimensions, the necessity of their existence is much higher. Profiting from the unique “long-tail” structures, Student’s t-distribution, compared with the GMM emotion model, is able to select the key dimensions with high feature information for component partition. Hence, under similar conditions, the SER method proposed in our work achieves obvious improvement of performance compared with the literature [32] which uses 3DEC hierarchical classifier.Figure 5
Confusion matrix between five emotions of the DES using the iSMM model.


### 4.3. Analysis of Contrast Experiment between iSMM and GMM on the Aibo Database

The Aibo speech database (Batliner et al., 2008 [33]; Steidl, 2009 [34]) was gathered from children accompanying pet robot Aibo developed by SONY. Then, ten kinds of emotion classes contained in the recordings, through machine learning, are mapped into the four categories: anger, emphatic, neutral, and positive, while the other samples are divided into to the fifth classes: rest. Thereafter, through the recognition test to nonspecific person by Björn et al. in 2009, the Aibo database is collated as the recent corpus: Interspeech 2009 emotion challenge [35].This section focuses on the effect of the iSMM algorithm on emotion recognition from spontaneous speech database. It is revealed by Figure6 that, compared with the acting speech databases, the recognition rates on the Aibo present striking descent.Figure 6
Confusion matrix between five emotions of the Aibo using the iSMM model.Analytically, due to strong continuous correlation between emotional categories in spontaneous speech databases, there exists a considerable amount of outliers and singular values leading to classified errors during the process of component demarcations by emotion models. These errors are more frequent in describing the categories of feature data, peculiarly, when conducting Gaussian distribution with equal means and variances. Benefiting from the long-tail structure of Student’st-distribution, the iSMM possesses more robustness to the atypical observation data (outliers). Thus, compared to other models, the iSMM has distinct superiority of SER performance on spontaneous speech emotion samples.Regarding the emotion feature samples of the spontaneous database Aibo, the data distribution of space is discrete and there is lack of the training samples leading to underfitting, since the speech material is evoked. Therefore, this condition brings the emotion models a certain extent of difficulties with component partition. The analysis of Figure7 shows that accuracies of correct classification on Aibo using the GMM model keep a considerable low level, especially on the two emotions: “positive’’ and “rest’’ are even lower than 30%. The iSMM, by contrast, possesses comprehensive advantages in SER. Particularly, on the three emotions: “emphatic’’, “anger,” and “rest’’, there is a significant improvement. Since there is a given mass of emotion features with high redundancy distributing in the spontaneous database, in the process of component spaces partitioned, the GMM model conducts classification based on the principle of mean square error, which may result in the large redundancy of the singular points. In contrast, as the analysis above, the ability to deal with outliers brings Student’s t-distribution favorable fitness to emotion features of the spontaneous speech. These aspects make the iSMM model keep a relatively good performance and robustness on the Aibo database.Figure 7
Comparison of SER accuracy between the iSMM and GMM classifiers on five emotions of the Aibo.


### 4.4. Integrated Analysis on Various Databases Using the Four Emotion Models

The results of recognition experiment on EOM-DB in German and DES in Danish show that the iSMM model maintains good robustness for different language speech emotion databases. In the iSMM emotion model, each forecast distribution of component in emotion categoryp
y
n
′
∣
Y
k is a subset of the distribution of the initial component. Through the stick-breaking principle in the time domain, the number of infinite components on observed data can be inferred. Whereas the numbers of components in the GMM or KNN emotion models are changeless, as a result, the speech feature data may be overfitting.As shown in Table1, the iSMM holds higher average recognition rates on all databases than its comparison group. The recognition experiment results using GMM and KNN are almost flat, while SMM also has a significant advantage in comparison to them. Given this difference, we found that the iSMM and SMM approaches described here, which achieve better results than GMM and KNN, profit from the prediction distribution of emotion categories: P
y
n
′
∣
Y
k. This inference of component partition in EM algorithm can effectively handle singular values and outliers. Therefore, in Student’s t-distribution, the degradation of recognition performance caused by outliers’ partition could be reduced. Furthermore, compared to SMM, iSMM due to the introduction of the infinite number of components has better adaptability to the high-dimensional and underfitting emotion feature data.Table 1
Average accuracy (%) of correct classification on the testing data set of the three databases using four emotion models.
Database
Emotion model
iSMM
SMM
GMM
KNN
EMO-DB
86.9
85.4
82.7
81.2
DES
75.0
70.9
58.4
60.9
Aibo
42.8
38.2
30.8
31.4In further analysis, we can see that iSMM reaches the recognition rates of 86.9% and 75.0% on German database EMO-DB and Danish database DES, respectively. This means that our method is not significantly dependent on the language type. The variance in features caused by language differences can be modeled universally using infinite Student’st-distribution, which is an important character compared with GMM and other algorithms. Accordingly, we can see that the GMM method achieves a good recognition rate of 82.7% in EMO-DB, while giving a low recognition rate of 58.4% in the Danish database. These results show the iSMM’s advantage in cross-language modeling. The relatively low recognition rates on Aibo database are mainly caused by naturalistic speech data, rather than the language factor.According to the former description in Sections2 and 3, we can obtain the total number of free parameters in iSMM, which is (
2
I
-
1
)
+
p
+
q
×
p
+
q
+
0.5
×
I
×
q
×
q
+
1
-
q
2. In the FA + GMM, this number is (
2
I
-
1
)
+
2
×
p
×
I
+
I
×
q
×
p
-
0.5
×
I
×
q
×
q
-
1, while, in the SMM with common factor loading matrix, it is (
2
I
-
1
)
+
p
×
I
+
q
×
p
-
0.5
×
q
×
q
-
1
+
1
+
I
×
p
-
1. Therefore, in most cases, the iSMM has the smallest number of free parameters. When p is large and/or I is not small, the iSMM is a more feasible tool for modeling high-dimensional data.As shown in Table2, the time consumption experimental results are obtained by training features from the “anger” emotion containing 128 utterances on EMO-DB. It is obvious that the models based on Student’s t-distribution achieve less time consumption than GMM and KNN. Particularly, the proposed iSMM obtains the optimal result. Moreover, the estimated means ξ
i, covariance Λ
i, and degrees of freedom v
i in the iSMM can be used to visualize the distributions of the factors in a low-dimensional latent space, enabling this approach to perform clustering or classification in the latent space.Table 2
Time consumption (MS) of training features of “anger” emotion on EMO-DB using four models.
Time consumption of training
Emotion model
iSMM
SMM
GMM
KNN
335
562
3798
3976It is worth mentioning that the independence of speaker, the independence of text, the number of emotional categories for classification, and the size of the database will all affect the actual recognition performance of the emotion mode. This paper puts forward a solution for SER on underfitting samples. Subsequently, the iSMM emotion model possessing good robustness is provided. However, as revealed in the experiments on the Aibo database, at present, by using the emotion models, the SER accuracy ratings on the spontaneous database are considerably low. Moreover, not only does the promotion of comprehensive recognition performance depend on the classifiers, but the optimization of selection on speech features also plays an important role.


## 4.1. Experimental Settings

In the experiment, we conducted three international general speech databases using the iSMM emotion model for SER. In the previous related research [27–29], the EMO-DB and Danish emotional speech (DES) are databases based on speech performance; the utterances included are obtained from the speakers under pressure of simulation and performance. These two databases are chosen to test the performance of the iSMM model in dealing with different amount of data and speech categories. Aibo database is composed of spontaneous speech, belonging to the natural speech emotion. We conduct Aibo in the experiment to evaluate the recognition performance of the iSMM emotion model on imparity properties of speech emotion samples.We adopted the OpenEAR toolkit [30] to extract numerous low-level descriptors (LLD) including the delta and double-delta functions and achieved 1,582 dimensional features in total. After applying the LLD description criterion, the mapping static feature vectors could be obtained including original signal, the signal energy, pitch, timbre, frequency, and MFCCs. Particularly, the focus in our work is the performance of the iSMM emotion model proposed, which is applied to the SER, rather than research on the optimization algorithm about selecting features. Accordingly, any promotion in recognition performance could be given the credit to the emotion model proposed.In this experiment, a set ofN
=
1582  p-dimensional speech feature data from various corpus set y
n is generated by the SMM [12], whose true underlying group structure is known: the number of components I is the number of emotion classes (5 or 7) and the dimension of factors q is 2. In each observed data y
n
=
y
1
n
T
,
y
2
n
T
T, y
1
n represents p
=
10 dimensional subvector containing the latent stochastic variables z
n, while y
2
n is a p
2-dimensional subvector of test variables with p
2
=
p
-
p
1. Each observed data is obtained by both SMM and iSMM by substitution into formulas in Section 3:(18)
y
n
=
A
1
T
,
A
2
T
T
u
n
i
+
e
n
i
with prob.
π
i
.p
1
×
p submatrix A
1, the common factor loading matrix, is(19)
A
1
T
=
0.5
-
0.9
0.3
0.6
0.2
-
0.7
0
0
0
0
0
0
0
0.8
-
0.7
0.5
0.6
-
0.4
0.3
-
0.5
,and all elements of p
2
×
q submatrix A
2 related to the singularities are zero. Assume that I
=
5; then the mixing proportion vector is π
=
0.15
0.2
0.3
0.15
0.2. The mean vectors of u
n
i are given by ξ
1
=
0
5
T, ξ
2
=
-
5
0
T, ξ
3
=
0
0
T, ξ
4
=
5
0
T, and ξ
5
=
0
-
5
T and their covariance matrices are specified as(20)
Ω
1
=
0.1
0
0
0.5
,
Ω
2
=
0.5
0
0
0.1
,
Ω
3
=
1
0.9
0.9
1
,
Ω
4
=
0.5
0
0
0.1
,
Ω
5
=
0.1
0
0
0.5
.The degrees of freedom are v
1
=
v
2
=
v
4
=
v
5
=
5 and v
3
=
3. The covariance matrix D of e
n
i is a diagonal matrix, whose diagonal elements are specified to be 0.2.


## 4.2. Experimental Analysis on Acting Corpus Using iSMM

We conduct SER on the three general databases using four emotion models: iSMM, SMM, GMM, andKNN (K-nearest neighbor) [31], respectively. The Berlin database, also known as EMO-DB, contains utterances spoken in German. EMO-DB is acquired, respectively, from phonetic performance of five male and female actors, including seven kinds of emotion data: anger, disgust, fear, sadness, boredom, neutral, and happiness. There are a total of 800 utterances in EMO-DB. In the literature [9], 20 respondents are invited to conduct actual test of the 494 utterances. Then, the results show that, in EMO-DB, the natural intelligible utterances reach 60% and accurate selection of emotion is above 80%. DES database is collected from 341 utterances within 5 kinds of emotion: anger, happiness, neutral, sadness, and surprise.We analyze the results reflected in Figure4, which demonstrates the normalized confusion matrix of SER experiment using the iSMM on the EMO-DB database. Compared with the improved GMM in literature [9], the iSMM proposed in our research has great improvement on SER performance. Specifically, the recognition rates of “angry’’ and “disgust’’ emotion are close to 100%. For the reason of Student’s t-distribution, when dealing with EMO-DB, such database with deficiency speech samples conducts the EM algorithm to test emotion data y
n
′ for latent variables z
n of emotional features. Thus, the prediction distribution of emotion features in each category could be deduced as p
y
n
′
∣
Y
k; as a result, influences of unstable recognition performance caused by underfitting feature space can be weakened.Figure 4
Confusion matrix between seven emotions of the EMO-DB using the iSMM model.However, analyzing the error result of “fear’’ and “boredom” emotions, which are almost classified to “calm’’ and “sad,’’ it is shown that the correlations of emotion feature between them are relatively high. It should be noted that there are two types of errors: false positive and false negative. In our experiments, recognition accuracy is the ratio of correct judgment:(21)
A
c
=
1
-
F
P
,where A
c represents the accuracy and F
P is the false positive. Here, the inaccuracy consists of leakage probabilistic and false drop rate.Figure5 reveals the result of SER on the Danish database by the iSMM emotion model. DES is the speech emotion database comparatively difficult to be recognized; on this account, experimental results show decline of the emotion recognition performance compared to Berlin database overall. In particular, the recognition rates of “fear’’ and “happy’’ are less than 80%. It is worth mentioning that, in most cases, some key dimensions of emotion feature in the speech emotion database possess the main information of their categories. Compared to many other dimensions, the necessity of their existence is much higher. Profiting from the unique “long-tail” structures, Student’s t-distribution, compared with the GMM emotion model, is able to select the key dimensions with high feature information for component partition. Hence, under similar conditions, the SER method proposed in our work achieves obvious improvement of performance compared with the literature [32] which uses 3DEC hierarchical classifier.Figure 5
Confusion matrix between five emotions of the DES using the iSMM model.


## 4.3. Analysis of Contrast Experiment between iSMM and GMM on the Aibo Database

The Aibo speech database (Batliner et al., 2008 [33]; Steidl, 2009 [34]) was gathered from children accompanying pet robot Aibo developed by SONY. Then, ten kinds of emotion classes contained in the recordings, through machine learning, are mapped into the four categories: anger, emphatic, neutral, and positive, while the other samples are divided into to the fifth classes: rest. Thereafter, through the recognition test to nonspecific person by Björn et al. in 2009, the Aibo database is collated as the recent corpus: Interspeech 2009 emotion challenge [35].This section focuses on the effect of the iSMM algorithm on emotion recognition from spontaneous speech database. It is revealed by Figure6 that, compared with the acting speech databases, the recognition rates on the Aibo present striking descent.Figure 6
Confusion matrix between five emotions of the Aibo using the iSMM model.Analytically, due to strong continuous correlation between emotional categories in spontaneous speech databases, there exists a considerable amount of outliers and singular values leading to classified errors during the process of component demarcations by emotion models. These errors are more frequent in describing the categories of feature data, peculiarly, when conducting Gaussian distribution with equal means and variances. Benefiting from the long-tail structure of Student’st-distribution, the iSMM possesses more robustness to the atypical observation data (outliers). Thus, compared to other models, the iSMM has distinct superiority of SER performance on spontaneous speech emotion samples.Regarding the emotion feature samples of the spontaneous database Aibo, the data distribution of space is discrete and there is lack of the training samples leading to underfitting, since the speech material is evoked. Therefore, this condition brings the emotion models a certain extent of difficulties with component partition. The analysis of Figure7 shows that accuracies of correct classification on Aibo using the GMM model keep a considerable low level, especially on the two emotions: “positive’’ and “rest’’ are even lower than 30%. The iSMM, by contrast, possesses comprehensive advantages in SER. Particularly, on the three emotions: “emphatic’’, “anger,” and “rest’’, there is a significant improvement. Since there is a given mass of emotion features with high redundancy distributing in the spontaneous database, in the process of component spaces partitioned, the GMM model conducts classification based on the principle of mean square error, which may result in the large redundancy of the singular points. In contrast, as the analysis above, the ability to deal with outliers brings Student’s t-distribution favorable fitness to emotion features of the spontaneous speech. These aspects make the iSMM model keep a relatively good performance and robustness on the Aibo database.Figure 7
Comparison of SER accuracy between the iSMM and GMM classifiers on five emotions of the Aibo.


## 4.4. Integrated Analysis on Various Databases Using the Four Emotion Models

The results of recognition experiment on EOM-DB in German and DES in Danish show that the iSMM model maintains good robustness for different language speech emotion databases. In the iSMM emotion model, each forecast distribution of component in emotion categoryp
y
n
′
∣
Y
k is a subset of the distribution of the initial component. Through the stick-breaking principle in the time domain, the number of infinite components on observed data can be inferred. Whereas the numbers of components in the GMM or KNN emotion models are changeless, as a result, the speech feature data may be overfitting.As shown in Table1, the iSMM holds higher average recognition rates on all databases than its comparison group. The recognition experiment results using GMM and KNN are almost flat, while SMM also has a significant advantage in comparison to them. Given this difference, we found that the iSMM and SMM approaches described here, which achieve better results than GMM and KNN, profit from the prediction distribution of emotion categories: P
y
n
′
∣
Y
k. This inference of component partition in EM algorithm can effectively handle singular values and outliers. Therefore, in Student’s t-distribution, the degradation of recognition performance caused by outliers’ partition could be reduced. Furthermore, compared to SMM, iSMM due to the introduction of the infinite number of components has better adaptability to the high-dimensional and underfitting emotion feature data.Table 1
Average accuracy (%) of correct classification on the testing data set of the three databases using four emotion models.
Database
Emotion model
iSMM
SMM
GMM
KNN
EMO-DB
86.9
85.4
82.7
81.2
DES
75.0
70.9
58.4
60.9
Aibo
42.8
38.2
30.8
31.4In further analysis, we can see that iSMM reaches the recognition rates of 86.9% and 75.0% on German database EMO-DB and Danish database DES, respectively. This means that our method is not significantly dependent on the language type. The variance in features caused by language differences can be modeled universally using infinite Student’st-distribution, which is an important character compared with GMM and other algorithms. Accordingly, we can see that the GMM method achieves a good recognition rate of 82.7% in EMO-DB, while giving a low recognition rate of 58.4% in the Danish database. These results show the iSMM’s advantage in cross-language modeling. The relatively low recognition rates on Aibo database are mainly caused by naturalistic speech data, rather than the language factor.According to the former description in Sections2 and 3, we can obtain the total number of free parameters in iSMM, which is (
2
I
-
1
)
+
p
+
q
×
p
+
q
+
0.5
×
I
×
q
×
q
+
1
-
q
2. In the FA + GMM, this number is (
2
I
-
1
)
+
2
×
p
×
I
+
I
×
q
×
p
-
0.5
×
I
×
q
×
q
-
1, while, in the SMM with common factor loading matrix, it is (
2
I
-
1
)
+
p
×
I
+
q
×
p
-
0.5
×
q
×
q
-
1
+
1
+
I
×
p
-
1. Therefore, in most cases, the iSMM has the smallest number of free parameters. When p is large and/or I is not small, the iSMM is a more feasible tool for modeling high-dimensional data.As shown in Table2, the time consumption experimental results are obtained by training features from the “anger” emotion containing 128 utterances on EMO-DB. It is obvious that the models based on Student’s t-distribution achieve less time consumption than GMM and KNN. Particularly, the proposed iSMM obtains the optimal result. Moreover, the estimated means ξ
i, covariance Λ
i, and degrees of freedom v
i in the iSMM can be used to visualize the distributions of the factors in a low-dimensional latent space, enabling this approach to perform clustering or classification in the latent space.Table 2
Time consumption (MS) of training features of “anger” emotion on EMO-DB using four models.
Time consumption of training
Emotion model
iSMM
SMM
GMM
KNN
335
562
3798
3976It is worth mentioning that the independence of speaker, the independence of text, the number of emotional categories for classification, and the size of the database will all affect the actual recognition performance of the emotion mode. This paper puts forward a solution for SER on underfitting samples. Subsequently, the iSMM emotion model possessing good robustness is provided. However, as revealed in the experiments on the Aibo database, at present, by using the emotion models, the SER accuracy ratings on the spontaneous database are considerably low. Moreover, not only does the promotion of comprehensive recognition performance depend on the classifiers, but the optimization of selection on speech features also plays an important role.


## 5. Conclusions

The mixture model based on Student’st-distribution proposed in this paper, when conducted to speech emotion recognition, can process the outliers of feature samples by the “long-tail’’ distribution structure. Furthermore, to reduce the dependence of emotion model on the training samples, in our research, an infinite number of components are introduced constituting the iSMM emotion model. Given this solution, the emotion model, by the possibility of automatic partition of components on the feature space, realizes the self-adaptation to various database samples.Emotion expression is related to many factors, such as personality, context, gender, age, and culture. These factors may create various problems for the speech emotion recognition. Emotions in speech are expressed and interpreted according to different circumstances by humans (e.g., context dependent, personality specific, and gender dependent), which may be the key to bring speech emotion recognition to the real world applications. As a result, the further research will focus on how to obtain a more appropriate combination of the extractor of emotion feature and the classifier.



---

*Source: 475810-2015-10-07.xml*