<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Siamese Neural Network with Modi ed Distance Loss For Transfer Learning in Speech Emotion Recognition</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kexin Feng</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Theodora Chaspari</string-name>
          <email>chasparig@tamu.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Speech</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>HUman Bio-Behavioral Signals (HUBBS) Lab Department of Computer Science and Engineering Texas A&amp;M University</institution>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Transfer learning</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Automatic emotion recognition plays a signi cant role in the process of human computer interaction and the design of Internet of Things (IOT) technologies. Yet, a common problem in emotion recognition systems lies in the scarcity of reliable labels. By modelling pairwise di erences between samples of interest, a Siamese network can help to mitigate this challenge since it requires fewer samples than traditional deep learning methods. In this paper, we propose a distance loss, which can be applied on the Siamese network ne-tuning, by optimizing the model based on the relevant distance between same and di erent class pairs. Our system uses samples from the source data to pre-train the weights of proposed Siamese neural network, which are ne-tuned based on the target data. We present an emotion recognition task that uses speech, since it is one of the most ubiquitous and frequently used biobehavioral signals. Our target data comes from the RAVDESS dataset, while the CREMA-D and eNTERFACE'05 are used as source data, respectively. Our results indicate that the proposed distance loss is able to greatly bene t the ne-tuning process of Siamese network. Also, the selection of source data has more e ect on the Siamese network performance compared to the number of frozen layers. These suggest the great potential of applying the Siamese network and modelling pairwise di erences in the eld of transfer learning for automatic emotion recognition.</p>
      </abstract>
      <kwd-group>
        <kwd>Emotion recognition tuning Siamese neural network</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        FineAutomatic emotion recognition refers to identifying emotions using various
humanrelated signals such as facial expression, physiological signals, and speech [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. It
can potentially bene t with many applications related to human computer
interaction, health informatics, or even the design of smart cities and communities.
Among these signals, speech data is largely explored due to its relatively higher
availability and ease of collection. Acquiring reliable annotation for such large
amounts of audio clips can be extremely hard to obtain, providing a signi cant
impediment for the reliable training of emotion recognition systems.
      </p>
      <p>
        A great number of machine learning approaches have been proposed to
address this challenge, and transfer learning was shown to be one of the most
promising directions. Transfer learning methods such as ne-tuning [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] make use
of a well-trained model on another emotion dataset. Also, progressive neural
networks (PNN) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which are less forgetful when applied to target, have been
proposed and obtained good performance in leveraging knowledge between
various conditions. However, these methods might be less e ective when there are
very limited number of data in target domain, preventing adequate training of
the corresponding machine learning models.
      </p>
      <p>
        Modelling the pairwise di erences between samples of interest (e.g., through
Siamese networks [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]) could be a potential solution to address small amounts of
labelled target data in various applications. In this paper, we propose the use
of Siamese network structure for the task of transfer learning in speech emotion
recognition, trained using the ne-tuning method, and further optimized using
a distance loss that incorporates relative distance among pairs. A publicly
available dataset, RAVDESS [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], was used as target data due to its relatively small
number of speakers and sample size. Two other emotional datasets,
CREMAD [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and eNTERFACE'05 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], are used as source data to compare the in
uence of di erent source domains. Our results indicate that the selection of source
data can have a signi cant impact on the Siamese network ne-tuning, and our
distance loss can signi cantly bene t the Siamese network ne-tuning process,
which yields an improvement of up to 7% compared to ne-tuning the Siamese
network without the proposed distance loss.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Previous Work</title>
      <p>
        The Siamese network is a type of neural network which takes a pair of data
samples as an input, and decides whether the corresponding samples belong
to the same or di erent classes. This network structure was rst introduced by
Bromley et al. for the task of signature veri cation by comparing whether the two
signatures are from the same person [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In Siamese network, each data sample
in a pair is the input to the network, then the network outputs an extracted
feature vector. The l2-norm between the two extracted feature vectors is further
calculated based on the two extracted features. If the l2-norm distance is less
than a certain threshold point, the model will decide the samples in this pair are
from the same class, otherwise the samples belong to di erent classes.
      </p>
      <p>
        Researchers further optimized the initially proposed structure of the Siamese
network by considering the data distribution within the classes of interest [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
Instead of calculating the l2-norm, the l1-norm vector was calculated, and was
followed by fully connected layers with sigmoid activation to allow the model
learn the relations between distance and classes.
      </p>
      <p>
        The Siamese network has been applied to emotion-related tasks with a
promising performance [
        <xref ref-type="bibr" rid="ref12 ref6 ref8">8, 6, 12</xref>
        ]. However, to the best of our knowledge, this is the rst
time the Siamese network was applied and further optimized for emotion-related
transfer learning task.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Data Description</title>
      <p>
        The target data comes from the RAVDESS dataset [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], which includes 47
minutes of audio from 24 actors, and each audio sample is further labeled by 247
annotators. The source data comes from two di erent publicly available datasets:
the eNTERFACE'05 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and CREMA-D [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The eNTERFACE'05 contains 45
minutes of data from 42 participants, who were asked to express their emotions
in scripted sentences after listening to speci c stories. The CREMA-D dataset
contains 165 minutes of audio data from 91 actors, who were asked to perform
until they get approved by a director and each audio clip is further labeled by
human annotators.
      </p>
      <p>
        Speech samples depicting four common emotions (anger, happiness, sadness,
and fear) across all datasets were selected and processed using openSMILE
toolkit [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. A 64-dimensional feature set, part of the INTERSPEECH'09 emotion
challenge feature set [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], is extracted from each audio segment which includes
the mean and standard deviations of speech intensity, zero-crossing rate, voice
probability, fundamental frequency, and the rst 12 Mel-frequency cepstral
coe cient (MFCC). The rst order derivative of each of these features is also
computed.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Methodology</title>
      <p>In this section, we plan to discuss our three baseline methods: in-domain training,
out of domain training, and Siamese network ne-tuning. Then we will introduce
the proposed distance loss, and how this loss is applied for the Siamese network.
All the methods are based on an optimized Siamese network structure, which
contains 64, 32, and 16 nodes with ReLU activation for the rst three feature
extractor layers, followed by a 16-node decision-based layer. During the training
process, the cross entropy loss is calculated and used to update the weights of
the model. After the Siamese network is trained, the test data will be compared
with all the available labeled target data, and a nal classi cation decision will
be generated based on the similarity of log-sum with each class. The unweighted
average recall (UAR) will be used to evaluate the performance for each method.
4.1</p>
      <p>Baseline
In order to assess whether the proposed loss will bene t the knowledge transfer
e ciency when limited data sample is available, we proposed three baseline
methods. The rst baseline performs an out-of-domain training (OODT). A
Siamese network is trained on all the source data, and tested on the target
dataset without any adaptation. For this baseline, the data samples from the</p>
      <p>Data sample 1</p>
      <p>Input layer</p>
      <p>Cross Entropy</p>
      <p>Loss
Distance</p>
      <p>Loss</p>
      <p>Hidden layer
Data sample 2</p>
      <p>Input layer</p>
      <p>Hidden layer</p>
      <p>Feature
extractor out</p>
      <p>Feature
extractor out</p>
      <p>Feature
vector 1
Feature
vector 2</p>
      <p>L1-norm</p>
      <p>Decision
making layer</p>
      <p>Same or
different pair
source are used to determine the nal classes, since no labeled target data is
available.</p>
      <p>The second baseline is an in-domain training (IDT), which is trained
using su cient amount of target data. A leave-one-subject-out (LOSO)
crossvalidation is performed. More speci cally, samples from a given speaker are used
for testing, and all other data are used for training of the Siamese network. This
process is repeated until all the speakers have been used for testing. This baseline
serves as an upper limit of potential knowledge transfer.</p>
      <p>The third baseline is the traditional ne-tuning method in the eld of
transfer learning, to further assess the bene t provided by our proposed distance
loss. The models trained in OODT are used for ne-tuning. One random data
sample for each emotion from random 2 speakers are selected as labeled data.
As a result, a total number of 8 samples (2 speakers 4 emotions 1
sample/emotion/speaker) are used for ne-tuning process and the remaining data
are used as testing set. This process is repeated 10 times to increase the
robustness of the results. A di erent number of frozen layers (none, rst layer, or rst
two layers), as well as the di erent number of speakers in target data (2, 4, : : :
, 18, 20) are tested to evaluate in detail the knowledge transfer e ciency.
Inspired by the fact that the traditional ne-tuning method fails to e ciently
leverage the knowledge when limited target data is available, we designed a
distance loss to maximize the distance di erence between pairs from the same
class and pairs from the di erent class. Let Xs be the set of s pairs with the
same class in a batch, and Xd is the set of d pairs with the di erent class. Let
gW(x) be the function parameterized by the weights W of the Siamese network
that performs the transformation between the original input x and the extracted
feature vector. The parameter W is learned by minimizing the average relative
distance between pairs Xs of the same class and maximizing the distance between
pairs Xd of di erent classes:</p>
      <p>As indicated in the previous description, this loss is only applied to the
feature extraction layers at the end of a batch in the Siamese network
netuning process to minimize the possible in uence to the decision making process
(Figure 1). Besides this loss, the other part for this method remains the same
compared to the ne-tuning baseline method.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Results</title>
      <p>In an e ort to discuss the domain di erence between the di erent speech
emotion datasets, we rst examine the unweighted average recall (UAR) for four
emotion classi cation task on OODT baseline. This yields a 32.8% UAR on the
RAVDESS dataset when using eNTERFACE'05 as source and 29.3% when using
CREMA-D as source. We then examines the upper limit of classi cation
performance using the proposed feature and model structure, and obtained a UAR at
50.0% with in-domain training.</p>
      <p>The ne-tuning of the Siamese neural network without the proposed loss
is used to illustrated the knowledge transfer e ciency. This approach resulted
in a minor improvement when using eNTERFACE'05 as source data at 32.9%,
and a relatively large improvement when using CREMA-D as source data at
37.8%. We nally added our proposed distance loss in the ne-tuning process,
and obtained a signi cant improvement of 39.9% using eNTERFACE'05 and
43.3% using CREMA-D. A comparison of the performance of di erent methods
can be found at Table 1. Our results also indicate that compared with di erent
number of frozen layers, di erent source data may has a more important role for
Siamese network ne-tuning (Figure 2).
6</p>
    </sec>
    <sec id="sec-6">
      <title>Discussion</title>
      <p>Our results indicate that including 3-5 speakers in the Siamese NN ne-tuning
with modi ed loss may result in the best trade-o between performance and the
number of data samples used for training. This can be potentially explained by
the fact that this number of speakers might not be enough to capture the
distribution of the target dataset. Performance is degraded when including a smaller
number of speakers in the target data. Also, if the data distribution includes a
lot of variability, Siamese NN with modi ed loss will be greatly restricted, since
pairwise di erences are less likely to express the class information.</p>
      <p>
        There has not been a lot of research relevant to few-shot emotion
recognition with speech signals, where data from only a few number of speakers is
included in the target data. The most comparable results are from Gideon et
al., in which the proposed approach with progressive neural networks achieved a
limited improvement (around 3%) compared to traditional ne-tuning ([
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]). Our
proposed distance loss is able to bring a relative larger improvement at about 7%
compared to ne-tuning, without signi cant increase in the computational cost.
Even though Siamese NN ne-tuning with modi ed loss still fails to outperform
the in-domain training, it shows great potential. We will attempt to modify the
proposed methodology and explore whether it can reach in-domain performance
as part of our future work.
7
      </p>
    </sec>
    <sec id="sec-7">
      <title>Conclusions</title>
      <p>We propose a distance loss which is based on the relative distance between same
and di erent class pairs. Such loss can increase the upper limit and increase
knowledge transfer e ciency when very limited target data is available. Our
results also indicate that the selection of source data plays a more important
role than the number of frozen layers. Findings of this work can be applied
on other tasks using Siamese network, ne-tuning, or few-shot learning. The
application of distance between di erent emotion classes can be a fundamental
step in understanding the di erence between emotion categories.</p>
      <p>As part of our future work, we plan to explore the usage of pairs in addressing
the domain mismatch, and mitigate the in uence of di erent source data in the
process of knowledge transfer. We will further perform the multi-source transfer
learning by using pairwise information to select proper source data from each
dataset. Finally, we plan to understand the distance between di erent emotions
with the help of the pairing information.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Badshah</surname>
            ,
            <given-names>A.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ahmad</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rahim</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baik</surname>
            ,
            <given-names>S.W.</given-names>
          </string-name>
          :
          <article-title>Speech emotion recognition from spectrograms with deep convolutional neural network</article-title>
          .
          <source>In: 2017 international conference on platform technology and service (PlatCon)</source>
          . pp.
          <volume>1</volume>
          {
          <issue>5</issue>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bromley</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guyon</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , LeCun,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Sa</given-names>
            ckinger, E.,
            <surname>Shah</surname>
          </string-name>
          , R.:
          <article-title>Signature veri cation using a" siamese" time delay neural network</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <volume>737</volume>
          {
          <issue>744</issue>
          (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cao</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cooper</surname>
            ,
            <given-names>D.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keutmann</surname>
            ,
            <given-names>M.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gur</surname>
            ,
            <given-names>R.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nenkova</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verma</surname>
          </string-name>
          , R.:
          <article-title>Crema-d: Crowd-sourced emotional multimodal actors dataset</article-title>
          .
          <source>IEEE transactions on a ective computing</source>
          <volume>5</volume>
          (
          <issue>4</issue>
          ),
          <volume>377</volume>
          {
          <fpage>390</fpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Eyben</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , Wollmer,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Schuller</surname>
          </string-name>
          ,
          <string-name>
            <surname>B.</surname>
          </string-name>
          :
          <article-title>Opensmile: the munich versatile and fast open-source audio feature extractor</article-title>
          .
          <source>In: Proceedings of the 18th ACM international conference on Multimedia</source>
          . pp.
          <volume>1459</volume>
          {
          <fpage>1462</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Gideon</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khorram</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aldeneh</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimitriadis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Provost</surname>
            ,
            <given-names>E.M.</given-names>
          </string-name>
          :
          <article-title>Progressive neural networks for transfer learning in emotion recognition</article-title>
          .
          <source>arXiv preprint arXiv:1706.03256</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lian</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , et al.:
          <article-title>Speech emotion recognition from variablelength inputs with triplet loss function</article-title>
          .
          <source>In: Interspeech</source>
          . pp.
          <volume>3673</volume>
          {
          <issue>3677</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Koch</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zemel</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salakhutdinov</surname>
          </string-name>
          , R.:
          <article-title>Siamese neural networks for one-shot image recognition</article-title>
          .
          <source>In: ICML deep learning workshop</source>
          . vol.
          <volume>2</volume>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lian</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Speech emotion recognition via contrastive loss under siamese networks</article-title>
          .
          <source>In: Proceedings of the Joint Workshop of the 4th Workshop on A ective Social Multimedia Computing</source>
          and
          <article-title>rst Multi-Modal A ective Computing of Large-Scale Multimedia Data</article-title>
          . pp.
          <volume>21</volume>
          {
          <fpage>26</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Livingstone</surname>
            ,
            <given-names>S.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peck</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Russo</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <article-title>Ravdess: The ryerson audio-visual database of emotional speech and song</article-title>
          .
          <source>In: 22nd Annual Meeting of the Canadian Society for Brain, Behaviour and Cognitive Science (CSBBCS)</source>
          . pp.
          <volume>1459</volume>
          {
          <issue>1462</issue>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kotsia</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Macq</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pitas</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>The enterface'05 audio-visual emotion database</article-title>
          .
          <source>In: 22nd International Conference on Data Engineering Workshops (ICDEW'06)</source>
          . pp.
          <volume>8</volume>
          {
          <issue>8</issue>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Picard</surname>
            ,
            <given-names>R.W.:</given-names>
          </string-name>
          <article-title>A ective computing</article-title>
          . MIT press (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Sabri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurita</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Facial expression intensity estimation using siamese and triplet networks</article-title>
          .
          <source>Neurocomputing</source>
          <volume>313</volume>
          ,
          <issue>143</issue>
          {
          <fpage>154</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Schuller</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steidl</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Batliner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The interspeech 2009 emotion challenge</article-title>
          .
          <source>In: Tenth Annual Conference of the International Speech Communication Association</source>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>