<!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>The Munich LSTM-RNN Approach to the MediaEval 2014 “Emotion in Music” Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Eduardo Coutinho</string-name>
          <email>e.coutinho@tum.de</email>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Felix Weninger</string-name>
          <email>weninger@tum.de</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Björn Schuller</string-name>
          <email>schuller@tum.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Klaus R. Scherer</string-name>
          <email>klaus.scherer@unige.ch</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computing, Imperial College London</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Psychology, Ludwig-Maximilians-Universit ̈t München</institution>
          ,
          <addr-line>Munich</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Machine Intelligence &amp; Signal Processing Group, Technische Universität München</institution>
          ,
          <addr-line>Munich</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>School of Music, University of Liverpool</institution>
          ,
          <addr-line>Liverpool</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Swiss Center for Affective Sciences, University of Geneva</institution>
          ,
          <addr-line>Geneva</addr-line>
          ,
          <country country="CH">Switzerland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <fpage>16</fpage>
      <lpage>17</lpage>
      <abstract>
        <p>In this paper we describe TUM's approach for the MediaEval's \Emotion in Music" task. The goal of this task is to automatically estimate the emotions expressed by music (in terms of Arousal and Valence) in a time-continuous fashion. Our system consists of Long-Short Term Memory Recurrent Neural Networks (LSTM-RNN) for dynamic Arousal and Valence regression. We used two di erent sets of acoustic and psychoacoustic features that have been previously proven as e ective for emotion prediction in music and speech. The best model yielded an average Pearson's correlation coe cient of 0.354 (Arousal) and 0.198 (Valence), and an average Root Mean Squared Error of 0.102 (Arousal) and 0.079 (Valence).</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        The MediaEval 2014 \Emotion in Music" task comprises
two subtasks. The rst subtask (Subtask 1), pertains to
the development of new features to automatically estimate
Arousal and Valence for music excerpts. The second subtask
(Subtask 2), consists of the estimation of Arousal and
Valence scores continuously in time for a second long segments
of the same music excerpts. In both tasks, the development
set consists of 744 instances and the evaluation set
comprises 1000 instances. For more details, please refer to [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
The TUM-MISP team participated only in Subtask 2.
      </p>
    </sec>
    <sec id="sec-2">
      <title>METHODOLOGY</title>
      <p>
        We used two features sets in our experiments. The rst
feature set (FS1) consists of the o cial set of low-level audio
descriptors (LLDs) used in the 2013 INTERSPEECH
Computational Paralinguistics Challenge (ComPareE; see [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] for
full details). It comprises 65 LLDs as well as their rst
order derivates (130 LLDs, in total). LLDs related to voice
were computed using 60 ms long time frames and Gaussian
windows ( = 0:4). LLDs related to all other features were
were calculated using 25 ms long time frames and Hamming
window functions. In both cases, overlapping windows were
used with a step size of 10 ms (17% and 40% overlaps,
respectively). Finally, for the purpose of this work, we also
computed the mean and standard deviation functionals of
each feature over 1 s time windows with 50% overlap (step
size of 0.5 s). This resulted in 260 features extracted at a rate
of 2 Hz. All features were extracted using the open-source
feature extractor openSMILE ([
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]). The second feature set
(FS2) consists of the same features included in FS1, plus
four new features - Sensory Dissonance (SDiss), Roughness
(R), Tempo (T) and Event Density (ED). These features
correspond to two psychoacoustic dimensions consistently
associated with the communication of emotion in music and
speech ([
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]) - Roughness (SDiss and R) and Duration (T and
ED) - which are absent from FS1. The four features were
extracted with the MIR Toolbox [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], using the mirroughness
(SDiss - with Sethares formula; and R - with Vassilakis
algorithm), mirtempo (T) and mireventdensity (ED) functions.
      </p>
      <p>
        As regressors, and given the importance of the temporal
context in emotional responses to music (e.g., [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]), we
considered LSTM-RNN as de ned in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. LSTM networks make use
of special memory blocks, which endow the model with the
capacity of accessing a long-range temporal context and
predicting the outputs based on such information. An LSTM
network is similar to an RNN except that the nonlinear
hidden units are replaced by a special kind of memory blocks.
Each memory block comprises one or more self-connected
memory cells and three multiplicative units { input, output
and forget gates { which provide the cells with analogues of
write, read and reset operations. The multiplicative gates
allow LSTM memory cells to store and access information
over long sequences (and corresponding periods of time).
2.1
      </p>
    </sec>
    <sec id="sec-3">
      <title>Models training</title>
      <p>We used a multi-task learning framework for the joint
learning of Arousal and Valence time-continuous values. A
cross-validation procedure was used in the development phase,
where we created an extra fold to estimate the performance
of our approaches during the development phase. The fold
subdivision followed a modulus based scheme (instance ID
modulus 11). The instances yielding a remainder of 10 were
left out to create a small test set for performance
estimation. On the remaining instances, a 10-fold cross-validation
was performed. We computed 5 trials of the same model
each with randomized initial weights in the range [-0.1,0.1].
Our basic architecture consisted of deep LSTM-RNN with 2
hidden layers. We optimised the number of LSTM blocks in
each hidden layer, as well as the learning rate (a momentum
of 0.9 was used for all tests), and the standard deviation
of the Gaussian noise applied to the input activations (used
to alleviate the e ects of over- tting). An early stopping
strategy was also used to avoid over tting the training data
{ training was stopped after 20 iterations without
improvement of the validation set performance (sum of squared
errors). The instances in the 10 training sets were presented
in random order to the model during training. The input
(acoustic features) and output (emotion features) data were
standardised to zero mean and unit variance on the
correspondent training sets used in each cross-validation fold.</p>
      <p>In four of our ve runs (see next subsection) we
pretrained the rst hidden layer. Our unsupervised pre-training
strategy consisted of de-noising LSTM-RNN auto-encoders.
We rst created a LSTM-RNN with a single hidden layer
trained to predict the input features (y(t) = x(t)). Both the
development and test set instances were used to train the
DAE. In order to avoid over- tting, in each training epoch
and timestep t, we added a noise vector n to x(t), sampled
from a Gaussian distribution with zero mean and variance
n. After determining the auto-encoder weights a second
hidden layer was added. In two of the runs, all of the weights
were trained using the regression targets and keeping the
rst layer weights constant. In the other two, the rst layer
weights were retrained.
2.2</p>
      <p>We submitted ve runs for Subtask 2. All runs consisted
of LSTM-RNNs using two hidden layers in order to attempt
modeling high-level abstractions in the data (Deep
Learning). The speci cs of each run are as follows: Run 1) The
basic architecture was directly trained using the regression
targets and FS1; Run 2) We pre-trained the rst layer, added
a second one, and all weights (with the exception of the rst
layer weights that were kept constant) were trained using
the regression targets and FS1; Run 3) Same as Run 2, but
all weights (including the rst layer weights) were trained
using the regression targets and FS1; Run 4) Same as Run
2, but using FS2; Run 5) Same as Run 3, but using FS2; The
submitted results for each test run consisted of the average
outputs of the ve best models (across all folds and trials)
as estimated using the method described in Section 2.1.</p>
    </sec>
    <sec id="sec-4">
      <title>RESULTS AND EVALUATION</title>
      <p>In Table 1, we report the o cial challenge metrics (r
Pearson's linear correlation coe cient; and RM SE - Root
Mean Squared Error) calculated individually for each
music piece and averaged across all pieces (standard deviations
also shown) of the test set. In short, we observe that Run
4 lead to the best results. Individual two-tailed t-tests
revealed that: a) r(Arousal) was signi cantly higher for Run
4 compared to Run 1, Run 2, Run 5 (p &lt; 0:0001), and
Run 3 (p &lt; 0:01); b) r(V alence) was higher for Run 4
compared to all other runs, but only signi cantly higher than
Run 3 (p &lt; 0:05); c) RM SE(Arousal) was signi cantly
lower for Run 4 compared to all other runs (p &lt; 0:0001);
d) RM SE(V alence) was signi cantly lower for Run 4
compared to all other runs (p &lt; 0:0001) except Run 5.</p>
      <p>Run 4 consisted of a LSTM-RNN with two layers,
including a pre-trained rst layer (with weights kept constant while
training using the regression targets) and FS2 as input. The
optimised architecture consisted of 200 and 5 LSTM blocks
( rst and second layers, respectively), trained with a
learning rate of 10 6 and Gaussian noise with a variance of 0.5
applied to the inputs during development (no noise added
when processing the test set).
RM SE</p>
      <p>Run 1
Run 2
Run 3
Run 4
Run 5
Run 1
Run 2
Run 3
Run 4
Run 5
4.</p>
    </sec>
    <sec id="sec-5">
      <title>CONCLUSIONS</title>
      <p>The LSTM-RNN approaches to the 2014 MediaEval
\Emotion in Music" task all delivered consistent improvements
over the baselines. The results reveal the importance of
ne-tuning the feature set and the deep learning strategy,
which could be attributed to the relatively small training
set.
5.</p>
    </sec>
    <sec id="sec-6">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work was partially supported by the ERC in the
European Community's 7th Framework Program under grant
agreements No. 338164 (Starting Grant iHEARu to Bjorn
Schuller) and 230331 (Advanced Grant PROPEREMO to
Klaus Scherer).
6.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Aljanaki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-H.</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Soleymani</surname>
          </string-name>
          .
          <article-title>Emotion in music task at mediaeval 2014</article-title>
          . In MediaEval 2014 Workshop, Barcelona, Spain, October
          <volume>16</volume>
          -17
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.</given-names>
            <surname>Coutinho</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Dibben</surname>
          </string-name>
          .
          <article-title>Psychoacoustic cues to emotion in speech prosody and music</article-title>
          .
          <source>Cognition &amp; emotion</source>
          ,
          <volume>27</volume>
          (
          <issue>4</issue>
          ):
          <volume>658</volume>
          {
          <fpage>684</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Eyben</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Weninger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gro</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Schuller</surname>
          </string-name>
          .
          <article-title>Recent Developments in openSMILE, the Munich Open-Source Multimedia Feature Extractor</article-title>
          .
          <source>In Proceedings of the 21st ACM International Conference on Multimedia, MM</source>
          <year>2013</year>
          , pages
          <fpage>835</fpage>
          {
          <fpage>838</fpage>
          ,
          <string-name>
            <surname>Barcelona</surname>
          </string-name>
          , Spain,
          <year>October 2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>F. A.</given-names>
            <surname>Gers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Cummins</surname>
          </string-name>
          .
          <article-title>Learning to forget: Continual prediction with lstm</article-title>
          .
          <source>Neural computation</source>
          ,
          <volume>12</volume>
          (
          <issue>10</issue>
          ):
          <volume>2451</volume>
          {
          <fpage>2471</fpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>O.</given-names>
            <surname>Lartillot</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Toiviainen</surname>
          </string-name>
          .
          <article-title>A matlab toolbox for musical feature extraction from audio</article-title>
          .
          <source>In International Conference on Digital Audio E ects</source>
          , pages
          <volume>237</volume>
          {
          <fpage>244</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F.</given-names>
            <surname>Weninger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Eyben</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. W.</given-names>
            <surname>Schuller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mortillaro</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K. R.</given-names>
            <surname>Scherer</surname>
          </string-name>
          .
          <article-title>On the Acoustics of Emotion in Audio: What Speech, Music and Sound have in Common</article-title>
          . Frontiers in Psychology,
          <volume>4</volume>
          (
          <string-name>
            <surname>Article</surname>
            <given-names>ID</given-names>
          </string-name>
          292):
          <volume>1</volume>
          {
          <fpage>12</fpage>
          , May
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>