<!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>Frame-based Evaluation with Deep Features to Predict Emotional Impact of Movies</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Khanh-An C.Quan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vinh-Tiep Nguyen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Minh-Triet Tran</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Information Technology, Vietnam National University-Ho Chi Minh city</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Science, Vietnam National University-Ho Chi Minh city</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>29</fpage>
      <lpage>31</lpage>
      <abstract>
        <p>In this paper, we describe our approach for the Emotional Impact of Movies Task at the MediaEval 2018 Challenge. Specifically, we employ features extracted from ResNet-50 from image frames. Then, a fully connected neural network is used for learning the prediction models. Later, we applied the Window Sliding Technique for post-processing the results. The experimental results show the efectiveness of our approach.</p>
      </abstract>
      <kwd-group>
        <kwd>Figure 1</kwd>
        <kwd>Overview of Frame-based Prediction Models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        Analysing the emotional impact of a video clip to viewers can be
utilized to enhance or control psychological efects of media to
people [
        <xref ref-type="bibr" rid="ref3 ref8">2, 7</xref>
        ], to boost user engagement to media content [
        <xref ref-type="bibr" rid="ref7">6</xref>
        ], or to
generate personalized media content [
        <xref ref-type="bibr" rid="ref6">5</xref>
        ].
      </p>
      <p>
        The MediaEval 2018 Emotional Impact of Movies Task consists
of two subtasks. The first subtask is to predict the score of induced
valence and induced arousal every second along movies. The other
is fear prediction, but we have not worked on it. Both subtasks
are evaluated by Mean Squared Error and Pearson’s Correlation
Coeficient. The dataset used for both is the LIRIS-ACCEDE [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
dataset. Full details of the challenge tasks and database can be
found in [
        <xref ref-type="bibr" rid="ref4">3</xref>
        ].
      </p>
      <p>There are various sources of information that can be exploited
to predict the emotional impact of a movie clip. Although visual
content is an essential source to infer viewers’ emotion, audio and
text are also potential components for this task. Frame-based and
sequence-based approaches can be applied to analyse video frames
to evaluate emotional impact.</p>
      <p>In our method, we follow the frame-based approach to predict
video emotional impact. From the training dataset, we extract deep
features of each frame and train two models to predict valence
and arousal properties of a video frame. Then we apply the two
trained models to evaluate each frame in the test set independently.
Finally, we employ the sliding window technique to smooth the
ifnal results.</p>
    </sec>
    <sec id="sec-2">
      <title>APPROACH</title>
      <p>In this section, we will describe how we approach the
valencearousal prediction subtasks. The proposed method contains four
stages: frame extraction, features extraction, prediction models and
post-processing methods. Our system pipeline is shown in Figure 1
below.
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Frame extraction</title>
      <p>Firstly, we extracted one frame per second of all movies on the
training and test set. For frame extraction, we use fmpeg the framework
and the extract command provided by the organizers to extract
frames.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>Features extraction</title>
      <p>
        For the frame extraction, we use pre-trained 50-layer Residual
Network (ResNet-50) [
        <xref ref-type="bibr" rid="ref5">4</xref>
        ] for ImageNet. The ResNet-50 used as a feature
extractor and 2048-dim features vector are extracted from each
frame of the movies. In our experiments, we used the Keras
ResNet50 pre-trained model on ImageNet dataset and calculate the features
vector from the global average pooling that applied to the output
of the last convolutional layer.
2.3
      </p>
    </sec>
    <sec id="sec-5">
      <title>Prediction models</title>
      <p>We apportion the training set provided by the organizer into
training and validation sets with a ratio of 80:20. An overview of the
prediction models is shown in Figure 2.</p>
      <p>We employ 2-layer fully connected neural network to learn the
emotional models. The models take 2048-dim features vectors
extracted from ResNet-50 as input. We experimented with varying
the number of the nodes for the first and the second layer with
128, 256, 512 and training epochs as 10, 15, 20 . We use Root Mean
Square Propagation (RMSProp) with the learning rate 10−4.
All prediction models are trained separately for valence and arousal.
2.4</p>
    </sec>
    <sec id="sec-6">
      <title>Post-processing</title>
      <p>After get the valence/arousal results, we applied the Average
Window Sliding Technique to smooth out the random noise. We tested
the window size of the algorithm with 3, 5, 7.
3</p>
    </sec>
    <sec id="sec-7">
      <title>RESULTS AND ANALYSIS</title>
      <p>In this section, we will describe in detail the experimental
specification, five runs that we have summitted for the valence-arousal
subtask and the result.
3.1</p>
    </sec>
    <sec id="sec-8">
      <title>Experimental specification</title>
      <p>The experiments are processed on Google Compute Engine with 2
vCPU, 7.5 GB RAM and Nvidia Tesla K80 GPU. The average times
for extracting 93406 frames on the training set about 1 hour, 40
minutes for extracting features by ResNet and 3 minutes for training
each models.
3.2</p>
    </sec>
    <sec id="sec-9">
      <title>Submitted runs</title>
      <p>We tested all trained models with the validation set. After we got
the results of all models on the validation set, we sorted descending
by the mean square error and selected from Top-1 to Top-4 model
to submit. The details of each run are listed below.</p>
      <p>All runs take ResNet-50 features as input. From Run 2 to Run 5,
the results take the Window Sliding Technique with the window
size = 7.</p>
      <p>• Run 1: For both valence and arousal, 2-layer fully
connected neural network with 128 nodes on the first layer,
512 nodes on the second layer trained on 20 epochs.
• Run 2: The same models with Run 1 but we also take the
Window Sliding Technique with the window size = 7 to
smooth out the random noise.
• Run 3: For valence, 2-layer fully connected neural network
with 256 nodes on the first layer, 512 nodes on the second
layer trained on 10 epochs. For arousal, 2-layer fully
connected neural network with 512 nodes on the first layer,
512 nodes on the second layer trained on 15 epochs.
• Run 4: For valence, 2-layer fully connected neural network
with 256 nodes on the first layer, 512 nodes on the second
layer trained on 15 epochs. For arousal, 2-layer fully
connected neural network with 128 nodes on the first layer,
512 nodes on the second layer trained on 10 epochs.
• Run 5: For valence, 2-layer fully connected neural network
with 512 nodes on the first layer, 512 nodes on the second
layer trained on 10 epochs. For arousal, 2-layer fully
connected neural network with 512 nodes on the first layer,
512 nodes on the second layer trained on 10 epochs.
3.3</p>
    </sec>
    <sec id="sec-10">
      <title>Results and Analysis</title>
      <p>We propose a simple method to evaluate the emotional impact, i.e.
valence and arousal properties, of a video frame. We study several
settings of classification modules with 1 to 2 fully connected layers
and diferent numbers of nodes in each layer to select an appropriate
model for each property. Experimental results demonstrate that
although our method is simple, it achieves promising results for
this task. This is the initial step to develop better method to utilize
temporal information of frame sequences, and other media types,
such as audio and text components.</p>
    </sec>
    <sec id="sec-11">
      <title>ACKNOWLEDGMENTS</title>
      <p>We would like to express our appreciation to Multimedia
Communications Laboratory, University of Information Technology,
VNU-HCM, Vietnam, and Software Engineering Laboratory,
University of Science, VNU-HCM, Vietnam.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <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>
          , and
          <string-name>
            <given-names>Liming</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>LIRISACCEDE: A Video Database for Afective Content Analysis</article-title>
          .
          <source>IEEE Transactions on Afective Computing</source>
          <volume>6</volume>
          ,
          <issue>1</issue>
          (
          <string-name>
            <surname>Jan</surname>
          </string-name>
          .-March
          <year>2015</year>
          ),
          <fpage>43</fpage>
          -
          <lpage>55</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>Task name as it appears on htp://multimediaeval</article-title>
          .org/mediaeval2018
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>L.</given-names>
            <surname>Canini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Benini</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Leonardi</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Afective Recommendation of Movies Based on Selected Connotative Features</article-title>
          .
          <source>IEEE Transactions on Circuits and Systems for Video Technology 23, 4 (April</source>
          <year>2013</year>
          ),
          <fpage>636</fpage>
          -
          <lpage>647</lpage>
          . https://doi.org/10.1109/TCSVT.
          <year>2012</year>
          .2211935
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Emmanuel</given-names>
            <surname>Dellandréa</surname>
          </string-name>
          , Huigsloot Martijn, Liming Chen, Yoann Baveye, Zhongzhe Xiao, and
          <string-name>
            <given-names>Mats</given-names>
            <surname>Sjöberg</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>The MediaEval 2018 Emotional Impact of Movies Task</article-title>
          . In MediaEval 2018 Workshop.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Kaiming</given-names>
            <surname>He</surname>
          </string-name>
          , Xiangyu Zhang, Shaoqing Ren, and
          <string-name>
            <given-names>Jian</given-names>
            <surname>Sun</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Deep Residual Learning for Image Recognition</article-title>
          .
          <source>In CVPR. IEEE Computer Society</source>
          ,
          <fpage>770</fpage>
          -
          <lpage>778</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Rajiv</given-names>
            <surname>Ratn</surname>
          </string-name>
          <string-name>
            <surname>Shah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Yi</given-names>
            <surname>Yu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Roger</given-names>
            <surname>Zimmermann</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>ADVISOR: Personalized Video Soundtrack Recommendation by Late Fusion with Heuristic Rankings</article-title>
          .
          <source>In Proceedings of the 22Nd ACM International Conference on Multimedia (MM '14)</source>
          . ACM, New York, NY, USA,
          <fpage>607</fpage>
          -
          <lpage>616</lpage>
          . https://doi.org/10.1145/2647868.2654919
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>K.</given-names>
            <surname>Yadati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Katti</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Kankanhalli</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>CAVVA: Computational Afective Video-in-Video Advertising</article-title>
          .
          <source>IEEE Transactions on Multimedia 16, 1 (Jan</source>
          <year>2014</year>
          ),
          <fpage>15</fpage>
          -
          <lpage>23</lpage>
          . https://doi.org/10.1109/TMM.
          <year>2013</year>
          .2282128
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Sicheng</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Hongxun</given-names>
            <surname>Yao</surname>
          </string-name>
          , Xiaoshuai Sun, Xiaolei Jiang, and
          <string-name>
            <given-names>Pengfei</given-names>
            <surname>Xu</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Flexible Presentation of Videos Based on Afective Content Analysis</article-title>
          .
          <source>In Advances in Multimedia Modeling</source>
          ,
          <string-name>
            <given-names>Shipeng</given-names>
            <surname>Li</surname>
          </string-name>
          , Abdulmotaleb El Saddik, Meng Wang, Tao Mei, Nicu Sebe, Shuicheng Yan, Richang Hong, and Cathal Gurrin (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg,
          <fpage>368</fpage>
          -
          <lpage>379</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>