<!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>BOUN-NKU in MediaEval 2017 Emotional Impact of Movies Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nihan Karslioglu</string-name>
          <email>nihan.karslioglu@boun.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yasemin Timar</string-name>
          <email>yasemin.timar@boun.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Albert Ali Salah</string-name>
          <email>salah@boun.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Heysem Kaya</string-name>
          <email>hkaya@nku.edu.tr</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Boğaziçi University</institution>
          ,
          <addr-line>İstanbul</addr-line>
          ,
          <country country="TR">Turkey</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Namık Kemal University</institution>
          ,
          <addr-line>Tekirdağ</addr-line>
          ,
          <country country="TR">Turkey</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <fpage>13</fpage>
      <lpage>15</lpage>
      <abstract>
        <p>In this paper, we present our approach for the Emotional Impact of Movies task of Mediaeval 2017 Challenge, involving multimodal fusion for predicting arousal and valence for movie clips. In our system, we have two pipelines. In the first one, we extracted audio/visual features, and used a combination of PCA, Fisher vector encoding, feature selection, and extreme learning machine classifiers. In the second one, we focused on the classifiers, rather than on feature selection. 1</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 INTRODUCTION</title>
      <p>
        The challenge we tackle in this paper is the prediction of
affective content of video clips, denoted by valence and
arousal scores. We used well-known regression models on the
audio-visual domain for this purpose. The feature sets
extracted by the organizers have been used to form a baseline
system to understand the properties and relations of the most
important features for this task. The description of the task is
provided in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>One of the proposed tasks is the prediction of "fear", which is
represented by a binary value in the ground truth. However,
the sections denoted with fear are rare (only 5%); and this
requires classifiers capable of dealing with class imbalance
(e.g. Gradient Boosting Classifier). We have not worked on this
part of the challenge.</p>
      <p>
        The Emotional Impact of Movies task has been included in the
MediaEval challenges since 2015. Various approaches have
been studied for the problem in terms of features and
regression models in recent years [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Audio features, visual
descriptors and deep learning based features have been
popular among the participants of the 2016 challenge [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2 FIRST APPROACH</title>
      <p>Our first pipeline, given in Fig.1, extracts a number of features,
reduces their dimension with PCA, summarizes them with
Fisher vector encoding, and further applies a feature selection
stage prior to classification.
As audio features, we computed Mel-frequency Cepstral
Coefficients (MFCC 0-12), from 32ms windows (with 50%
overlap). First and second derivatives were added, resulting in
a 39-dimensional feature vector.</p>
      <p>
        We used three types of visual features in addition to these
audio features. The Hue Saturation Histogram (HSH) feature is
a 1023-dimensional histogram of color pixels, in 33 hue and
31 saturation levels. They were sampled from one frame per
second, and frames were resized to 240x320. For the Dense
SIFT feature, the frames were further resized to 120x160, and
Dense SIFT features [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] were extracted at scales {4,6,8}, at 7
pixel intervals and once for every 30 frames of video. Finally,
we used the VGG FC6 feature provided by the organizers,
extracted from a deep neural network trained for image
recognition.
      </p>
      <p>
        After reducing the dimensionality of the features by 50% via
PCA, we encoded them with Fisher vectors (FV) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which
measures how much the features deviate from a background
probability model, in this case a mixture of Gaussians. The
number of clusters were selected as 32 for Dense SIFT and
MFCC, and a single Gaussian was used for HSH and VGG-FC6.
We normalized the feature vectors with signed square root
and L2 normalization.
      </p>
      <p>
        A ranking based feature selection approach was applied using
Random Sample versus Labels Canonical Correlation Analysis
Filter (SLCCA-Rand) method [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The main idea is to apply
CCA between features and target labels, then sort the absolute
value of the projection weights to get a ranking. Features that
sum up to 99% of the total weight for each modality are
selected in this approach.
      </p>
      <p>
        For regression, Extreme Learning Machines (ELM) were
applied for both arousal and valence prediction tasks [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Grid
search is applied to find the best parameters of ELM.
Regularization coefficient was searched from the range of
[0.01,1000] with exponential steps. Radial basis function
(RBF) and linear kernels were tested. The RBF kernel scale
parameter is optimized in the range of [0.01,1000], also with
exponential steps. Pearson Correlation Coefficient (PCC) is
taken as performance measure, and optimized over 5-fold
cross validation on the development partition. Results in
Table 1 are obtained on the test set, for which the ground
truth was sequestered.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3 SECOND APPROACH</title>
      <p>
        Our second approach used audio and visual features
presented by the organizers, without any dimensionality
reduction. Dimensionalities are 1.582 for audio, and 1.271 for
visual features, respectively. Early fusion of the visual features
(except FC6) are fed to Random Forest and support vector
regressors (SVR). Hyper parameters are explored with grid
search. For SVR, the cost and gamma parameters range from
0.001 to 100. For Random Forests, the number of trees range
from 100 to 1000, and the maximum number of features per
tree from 3 to 20. Five train and test folds (balanced according
to duration and fear labels) are defined to ensure that each
movie appears in either in the train set or the test set. The
best regressors were chosen via grid search, and tested on
each fold to evaluate the performance on a subset of the
development set. According to MSE and PCC scores on each
fold, the regressors are trained with the best group. The audio
and visual subsystem scores are fused with simple averaging,
and the scores for a given movie are smoothed with
HoltWinters exponentially weighted moving average method [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
The pipeline is visually presented in Figure 2.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4 RESULTS AND ANALYSIS</title>
      <p>We submitted five runs for the valence/arousal prediction
task. The first run is the average scores of MFCC, HSH, Dense
SIFT and VGG-FC6 subsystems, and obtains our lowest MSE on
the valence task.</p>
      <p>The second run is a linear weighted combination of the
predictions used in the first run. In the third run, while an
average of MFCC and FC6 are computed for valence, the
average of MFCC, HSH and FC6 are computed for arousal. In
the fourth run, linear combination scores of MFCC, Dense SIFT
and FC6 are computed for valence, and linear combination
scores of MFCC, HSH and FC6 are computed for arousal. For
the fifth run, the regression pipelines are selected after grid
search, resulting in four separate SVRs with RBF kernels (with
best scoring hyper parameters from cross-validation). AV
scores of test-set data are fused and smoothed to generate the
run outputs.
When we compare Run1 and Run2 from Table 1, we can say
that combining all features from the first approach with
simple average fusion method is better than combining them
with weighted fusion technique for arousal task but this
situation is opposite for valence in terms of PCC. Comparing
Run1 with Run3 and Run4, Dense Sift is important for better
arousal prediction in PCC metric. Run1 shows that fusing all
features from the first approach with simple averaging
method gives the best MSE result for valence. The best
results are obtained in Run5 for arousal prediction for two
metrics. PCC result of Run5 for valence is also the best result
between the other runs. We also observe that prediction of
arousal is more accurate compared to valence.</p>
      <p>The computation power of our computer is limited in terms
of time and memory. Therefore we plan to choose more
components for higher explained variance for PCA and more
clusters for GMM for the first 4 runs in our future works. In
addition to this, we plan to employ CCA to extract arousal and
valence correlates as mid-level features, so as to optimize PCC
and MSE measures simultaneously.</p>
    </sec>
    <sec id="sec-5">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work is supported by Bogazici University Project BAP
16A01P4 and by the BAGEP Award of the Science Academy.</p>
      <p>Emotional Impact of Movies Task</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Dellandréa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Huigsloot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Baveye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sjöberg</surname>
          </string-name>
          . “
          <source>The MediaEval 2017 Emotional Impact of Movies Task,” Proc. of the MediaEval 2017 Workshop</source>
          , Dublin, Ireland, Sept.
          <fpage>13</fpage>
          -
          <lpage>15</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Baveye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Dellandrea</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chamaret</surname>
          </string-name>
          , L. Chen, “
          <article-title>Deep Learning vs</article-title>
          . Kernel Methods:
          <article-title>Performance for Emotion Prediction in Videos,”</article-title>
          <source>In Humaine Association Conference on Affective Computing and Intelligent Interaction (ACII)</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.</given-names>
            <surname>Dellandrea</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Baveye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sjöberg</surname>
          </string-name>
          , C. Chamaret, “
          <article-title>The Mediaeval 2016 Emotional Impact of Movies Task”</article-title>
          ,
          <source>In MediaEval 2016 Workshop</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bosch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zisserman</surname>
          </string-name>
          and
          <string-name>
            <given-names>X.</given-names>
            <surname>Munoz</surname>
          </string-name>
          , “
          <article-title>Image classification using random forests and ferns,”</article-title>
          <source>In IEEE 11th International Conference on Computer Vision</source>
          , (ICCV
          <year>2007</year>
          ),
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Perronnin</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Dance</surname>
          </string-name>
          , “
          <article-title>Fisher kernels on visual vocabularies for image categorization,”</article-title>
          <source>In IEEE Conference on Computer Vision and Pattern Recognition</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>H.</given-names>
            <surname>Kaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Özkaptan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.A.</given-names>
            <surname>Salah</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Gürgen</surname>
          </string-name>
          , “
          <article-title>Random discriminative projection based feature selection with application to conflict recognition,”</article-title>
          <source>IEEE Signal Processing Letters</source>
          ,
          <volume>22</volume>
          (
          <issue>6</issue>
          ), pp.
          <fpage>671</fpage>
          -
          <lpage>675</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>G.B.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Ding</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , “
          <article-title>Extreme learning machine for regression and multiclass classification”</article-title>
          .
          <source>IEEE Transactions on Systems, Man, and Cybernetics</source>
          ,
          <string-name>
            <surname>Part</surname>
            <given-names>B</given-names>
          </string-name>
          (Cybernetics),
          <volume>42</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>513</fpage>
          -
          <lpage>529</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P. R.</given-names>
            <surname>Winters</surname>
          </string-name>
          ,
          <article-title>"Forecasting Sales by Exponentially Weighted Moving Averages,"</article-title>
          <source>Management Science</source>
          ,
          <volume>6</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>324</fpage>
          -
          <lpage>342</lpage>
          ,
          <year>1960</year>
          . doi:
          <volume>10</volume>
          .1287/mnsc.6.3.324.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>