<!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 MLPBOON Predicting Media Interestingness System for MediaEval 2016</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jayneel Parekh</string-name>
          <email>jayneelparekh@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sanjeel Parekh</string-name>
          <email>sanjeelparekh@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Indian Institute of Technology</institution>
          ,
          <addr-line>Bombay</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Technicolor</institution>
          ,
          <addr-line>Cesson Sévigné</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <fpage>20</fpage>
      <lpage>21</lpage>
      <abstract>
        <p>This paper describes the system developed by team MLPBOON for MediaEval 2016 Predicting Media Interestingness Image Subtask. After experimenting with various features and classi ers on the development dataset, our nal system involves use of CNN features (fc7 layer of AlexNet) for the input representation and logistic regression as the classi er. For the proposed method, the MAP for the best run reaches a value of 0.229.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        The MediaEval 2016 Predicting Media Interestingness Task
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] requires to automatically select images and/or video
segments which are considered to be the most interesting for a
common viewer. We will be focusing on solving the image
interestingness subtask which involves automatically
identifying images from a given set of key-frames extracted from a
certain movie that the viewers report to be interesting. We
will only use the visual content and no additional metadata.
      </p>
      <p>
        The solution should essentially involve encoding into
features many generic factors that are taken into account by
humans while judging interestingness of an image [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
However, there is an intrinsic di culty this task presents which
makes it extremely challenging to have reliable datasets and
features - subjectivity [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. One can observe the high level of
subjectivity by realizing that a given image could be labeled
as highly interesting or non-interesting depending upon the
parts of the world in which it is surveyed. Even though
current methods of annotating datasets tend to reduce [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] this
factor but none can eliminate it.
      </p>
      <p>
        Therefore, while taking into account subjectivity, we wish
to determine features good for satisfactorily solving the task.
In this context, several e orts have been made to understand
factors that a ect, or cues that contribute to interestingness
of an image, even at an individual level. Katti et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
attempt to understand the e ect of human cognition and
perception in interestingness. Work by Gygli et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] shows
how interestingness is related to features capturing
unusualness, aesthetics and general preferences such as GIST, SIFT,
Color Histograms etc. Further, [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] tries to learn attributes
that can be used to predict interestingness at an individual
level. Moreover, recent advances in application of neural
networks to tasks in image processing and computer vision
makes use of convolutional neural network [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] based features
very promising [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>Our approach was inspired by the following line of thought:
if the right set of features are identi ed then any simple
classi er should produce good results. Thus, we decided upon
the proposed system after experimenting with di erent
feature sets.
2.</p>
    </sec>
    <sec id="sec-2">
      <title>SYSTEM DESCRIPTION</title>
      <p>We have opted for a more traditional machine learning
pipeline involving - feature selection &amp; preprocessing,
training of classi cation model and then the predictions.</p>
      <p>Given the training data feature matrix X 2 RN F
consisting of N examples, each described by a F -dimensional
vector, we rst standardize it and apply principal
component analysis (PCA) to reduce its dimensionality. The
transformed feature matrix Z = (zi)i 2 RN M is used to
experiment with various classi ers. Here M depends on the
number of top eigenvalues we wish to consider.</p>
      <p>
        After preliminary testing (discussed in section 3), we
decided to move ahead with logistic regression as our classi er.
Logistic regression minimizes the following cost function [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
i=1
      </p>
      <p>N
Cost (w) = C X log(1 + e yiwT zi ) + 1 wT w;
2
where w denotes the weight vector, C &gt; 0 denotes penalty
parameter, zi denotes feature vector for the ith instance of
training data, while yi denotes its label (0 if non-interesting
and 1 if interesting). Note that a column of ones is appended
to Z to include the hyperplane intercept as a coe cient of
w. Now given a test data instance t, its label y is assigned
according to equation (2).
(1)
(2)
y =
(1; if wT t</p>
      <p>0
0; otherwise
After experimenting with various descriptors (as discussed
later in Section 3.1), we use CNN features extracted from
fc7 layer of the AlexNet as our input feature representation
for building X. In the following section we discuss our
experimental results obtained by varying di erent parameters
of the above stated system.
3.</p>
    </sec>
    <sec id="sec-3">
      <title>EXPERIMENTAL VALIDATION</title>
      <p>
        The training dataset consised of 5054 images extracted
from 52 movie trailers, while the test data consisted of 2342
images extracted from 26 movie trailers. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] gives complete
information about the preparation of the dataset. WEKA
and scikit-learn [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] were used to implement and test various
con gurations.
3.1
      </p>
    </sec>
    <sec id="sec-4">
      <title>Results and Discussion</title>
      <p>The run submission results are given in Table 1. The table
gives the mean average precision (MAP) - the o cial metric,
precision and recall on the interesting images of di erent
runs corresponding to the respective penalty parameter and
number of transformed features retained after PCA. The
general strategy for the run submissions was to rst decide
and x the number of PCA features and subsequently tune
C for best MAP on development data.</p>
      <p>As observed, C decreases with increasing PCA features.
This trend can be possibly explained as a way to avoid
overtting. The 5th run gives the best MAP, however, the MAP
for all the runs seems comparable. This points towards the
utility of dimensionality reduction which signi cantly
reduces the redundancy without a ecting the results much.
It was observed that 400 and 780 transformed features
capture about 95% and 98% variance of the data, respectively.
The di erence between MAP on development and test data
for all the runs was very small and lied between 0.01-0.03.
The maximum MAP on development data was 0.24 with 1st
run's system con guration.</p>
      <p>
        System Design Decisions
We experimented with the following features provided by the
task [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]: CNN (fc7 and prob layers of AlexNet), GIST and
Color Histogram (HSV space) features [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and trained their
di erent combinations on various machine learning
classiers like SVM, Decision Trees, Logistic Regression with
4fold or 5-fold cross-validation when experimenting on the
development data. In this section we give a rationale for
selected features and classi er in the proposed system.
      </p>
      <p>Features: The results on the development data using
the GIST (512 dimensional feature vector) and
ColorHistogram (128 dimensional feature vector) features were not
very positive over any classi er. The use of CNN features</p>
      <p>No. of features
780
700
700
400
2016
(4096-dimensional fc7 &amp; 1000-dimensional prob layers) did
show signi cant improvements with fc7 features in particular
performing better over the prob features. We also observed
that combination of CNN features with GIST and
ColorHistogram features gave similar performance to the case when
we use just CNN features. Hence we went forward with
using just CNN features, in particular from fc7 layer.</p>
      <p>
        Classi er: After selecting CNN features we experimented
with various classi ers with di erent parameters.
Specifically, we tried (1) SVM with linear, polynomial and rbf
kernels (2) ridge regression classi er (3) stochastic
gradient descent classi er with hinge, log, modi ed-huber and
squared-hinge loss functions (4) logistic regression [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and
(5) random trees (WEKA). In general, it was found that
logistic regression performed better than the other classi ers
with its MAP being greater than 0.2 on training data. The
performance of SVM was reasonable with the prob features
but it did not show any signi cant improvements with the
fc7 features. It particularly did not perform well with the
rbf kernel. Hence we went ahead with logistic regression.
4.
      </p>
    </sec>
    <sec id="sec-5">
      <title>CONCLUSIONS</title>
      <p>In summary, we have presented a system for
interestingness prediction in images. Despite its simplicity, we obtain
reasonable mean average precision values with the maximum
being 0.229. From an analysis of the system's development
history we think that selection of features was more
important than the selection of the classi er. We believe it would
be useful to identify and incorporate high level features
describing image composition and object expressivity such as
facial expressions. Moreover, to analyze the issue of
subjectivity, it would be interesting to check inter-annotator
agreement over test images.
5.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>C.-H. Demarty</surname>
            , M. Sjoberg,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Ionescu</surname>
            , T.-T. Do,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>N. Q.</given-names>
          </string-name>
          <string-name>
            <surname>Duong</surname>
            , and
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Lefebvre</surname>
          </string-name>
          .
          <article-title>Mediaeval 2016 predicting media interestingness task</article-title>
          .
          <source>In Proc. of the MediaEval 2016 Workshop</source>
          , Hilversum, Netherlands, Oct.
          <volume>20</volume>
          -
          <fpage>21</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. M.</given-names>
            <surname>Hospedales</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gong</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yao</surname>
          </string-name>
          .
          <article-title>Interestingness prediction by robust learning to rank</article-title>
          .
          <source>In European Conference on Computer Vision</source>
          , pages
          <volume>488</volume>
          {
          <fpage>503</fpage>
          . Springer,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Gygli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Grabner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Riemenschneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Nater</surname>
          </string-name>
          , and
          <string-name>
            <surname>L. Van Gool.</surname>
          </string-name>
          <article-title>The interestingness of images</article-title>
          .
          <source>In Proceedings of the IEEE International Conference on Computer Vision</source>
          , pages
          <volume>1633</volume>
          {
          <fpage>1640</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.-G.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Rui</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.-F.</given-names>
            <surname>Chang</surname>
          </string-name>
          .
          <article-title>Super fast event recognition in internet videos</article-title>
          .
          <source>IEEE Transactions on Multimedia</source>
          , vol.
          <volume>177</volume>
          (
          <issue>8</issue>
          ):1{
          <fpage>13</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Katti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Y.</given-names>
            <surname>Bin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. T.</given-names>
            <surname>Seng</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Kankanhalli</surname>
          </string-name>
          .
          <article-title>Interestingness discrimination in images.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Khosla</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Das Sarma</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>R.</given-names>
            <surname>Hamid</surname>
          </string-name>
          .
          <article-title>What makes an image popular</article-title>
          ?
          <source>In Proceedings of the 23rd international conference on World wide web</source>
          , pages
          <volume>867</volume>
          {
          <fpage>876</fpage>
          . ACM,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Duchesnay</surname>
          </string-name>
          .
          <article-title>Scikit-learn: Machine learning in Python</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>12</volume>
          :
          <fpage>2825</fpage>
          {
          <fpage>2830</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Soleymani</surname>
          </string-name>
          .
          <article-title>The quest for visual interest</article-title>
          .
          <source>In Proceedings of the 23rd ACM international conference on Multimedia</source>
          , pages
          <volume>919</volume>
          {
          <fpage>922</fpage>
          . ACM,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>H.-F.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.-L.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.-J.</given-names>
            <surname>Lin</surname>
          </string-name>
          .
          <article-title>Dual coordinate descent methods for logistic regression and maximum entropy models</article-title>
          .
          <source>Machine Learning</source>
          ,
          <volume>85</volume>
          (
          <issue>1-2</issue>
          ):
          <volume>41</volume>
          {
          <fpage>75</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>