<!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>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bruno do Nascimento Teixeira</string-name>
          <email>bruno.texeira@dcc.ufmg.br</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Universidade Fedederal de Minas Gerais Belo Horizonte</institution>
          ,
          <country country="BR">Brazil</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <fpage>16</fpage>
      <lpage>17</lpage>
      <abstract>
        <p>This paper describes the team MTM participation in Violent Scenes Detection (VSD) task of the MediaEval 2014 campaign. We propose an approach to the problem of detecting violence, which is based on probabilistic graphical models using Mel-frequency cepstral coefficients (MFCCs) as audio feature. In our approach, we employ Dynamic Bayesian Networks (DBNs) to represent a violent scene as an dynamic system.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        The goal of the Violent Scenes Detection (VSD) task of the
MediaEval 2014 benchmarking campaign is to detect violence in
movies [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. This year the organizers of the VSD task released two
datasets: (i) a set of 31 Hollywood movies, where 24 are used for
training and 7 for the testing (our focus); (ii) Youtube set, composed
of 86 violent and non-violent videos. Violence is defined as "one
would not let an 8 years old child see in a movie because it
contains physical violence". A model based on the variable-duration
hidden Markov model is proposed to detect complex events using
latent variables in Internet videos [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The authors of [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] propose
an audio-visual approach to video genre classification using
content descriptors that exploit audio, color, temporal, and contour
information and demonstrated good results over other existing
approaches by using a combination of these descriptors in genre
classification. In [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], temporal structure of broadcast tennis video is
recovered from HMMs. This trained HMM is used to analyze the
temporal interleaving shots.
      </p>
      <p>We propose to model video based on temporal structure and
principle of causality using Dynamic Bayesian Networks (DBN).</p>
    </sec>
    <sec id="sec-2">
      <title>METHOD</title>
      <p>For this year’s benchmark, we have developed an acoustic
system based on temporal data (MFCC vector). The main idea behind
this approach is to represent a violent scene as a dynamic system.</p>
    </sec>
    <sec id="sec-3">
      <title>Dynamic Bayesian Network</title>
      <p>
        A DBN (see Figure 1) is a state-space model of random variable
Vt [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]:
      </p>
      <p>Vt = (Ut; Xt; Yt);
(1)
where Ut represents the hidden, Xt the input and Yt the output
variable. A pair (B1; B2) defines a DBN, where B1 and B2 are
Ui 2
Xi 2</p>
      <p>Ui 1
Xi 1</p>
      <p>Ui
Xi</p>
      <p>Ui+1
Xi+1
BNs. The two-slice temporal Bayes net B2 (DBN unrolled for 2
slices), defines P (VtjVt 1):</p>
      <p>P (VtjVt 1) =</p>
      <p>N
Y P (VitjP a(Vit));
i=1
where P a(Vit) are the parents in the net. Next, our acoustic feature
detector is described.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>Acoustic Feature Detector</title>
      <p>Our audio concept detector is based on MFCCs. The audio
signal is segmented into acoustic frames with overlapping.
Acoustic frames are used to group samples using a window with fixed
length. We split the audio signal into frames of 40ms length, with
20ms overlap, and apply a Hamming window to each frame. The
Hamming function is given by:
w(n) = 0:54
0:46 cos(
2 n
N
1
):</p>
      <p>For each audio frame, 12 MFCCs (range 133Hz-6855Hz) and
their first and second derivates are computed to build an acoustic
vector yj :</p>
      <p>yj = (y1j ; y2j ; :::; y3j6):
2.3</p>
    </sec>
    <sec id="sec-5">
      <title>Bag of Audio Words representation</title>
      <p>After the feature extraction, a way of representing audio is
through a feature vector model using Bag of Audio Words (BoAW).
In this representation, each vector has the size of the vocabulary,
where each vocabulary word represents a position vector. The ith
vector value for a n audio segment equals the number of
occurrences of that word i in the audio segment.
(2)
(3)
(4)</p>
      <sec id="sec-5-1">
        <title>Mean Average Precision (MAP)</title>
        <p>0.0000
0.0429
0.1875
0.1018
0.0480
0.1974
0.1201
run #1 DBN</p>
      </sec>
      <sec id="sec-5-2">
        <title>Mean Mean</title>
        <p>Average Average
Precision Precision
2014 at 100
(MAP2014) (MAP@100)</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>SUBMITTED RUNS</title>
      <p>For each run, a naive DBN is trained using two different
observed vectors Yt: (i) acoustic vector yj , and (i) BoAW byj with
128 audio words (see Figure 2). The likelihood of a model M ,
P (y1:T jM ), is used to assign a sequence y1:T to non-violent or
violent label as follows:</p>
      <p>M (y1:T ) = arg max P (y1:T jM )P (M ):</p>
      <p>M
(5)</p>
      <p>
        The Bayes Net Toolbox for Matlab (BNT) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] is used to train the
dynamic networks.
#1 (MFCC-DBN)
#2 (MFCC-BoAW-DBN)
9.51 %
16.51 %
2.04 %
2.64 %
      </p>
    </sec>
    <sec id="sec-7">
      <title>RESULTS AND DISCUSSION</title>
      <p>2). We investigated the results and came to the presumption that
BoAW removes noisy observations,while reducing the number of
observations per segment. It might be related with the observation
"grouping" when the BoAW is computed for the temporal segment
(see Figure 2). Thus, BoAW removes data noise and builds a
better representation for a scene (model observation). However, the
results are still very poor. We suppose it could be due to features,
only MFCCs seems not capable of distinguishing all violence and
non-violence segments and generalize the violence concept.
Further work directions relies in capture the causality in violence
segments using different structures and other feature modalities
(feature selection).
5.
6.</p>
    </sec>
    <sec id="sec-8">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work was supported in part by two grants from CAPES and
CNPq.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>B.</given-names>
            <surname>Ionescu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Seyerlehner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rasche</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Vertan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Lambert</surname>
          </string-name>
          .
          <article-title>Video genre categorization and representation using audio-visual information</article-title>
          .
          <source>Journal of Electronic Imaging</source>
          ,
          <volume>21</volume>
          (
          <issue>2</issue>
          ):
          <fpage>023017</fpage>
          -1-
          <fpage>023017</fpage>
          -17,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kijak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Oisel</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Gros</surname>
          </string-name>
          .
          <article-title>Temporal structure analysis of broadcast tennis video using hidden markov models</article-title>
          . In
          <string-name>
            <surname>M. M. Yeung</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Lienhart</surname>
          </string-name>
          , and C.-S. Li, editors,
          <source>Storage and Retrieval for Media Databases</source>
          , volume
          <volume>5021</volume>
          <source>of SPIE Proceedings</source>
          , pages
          <fpage>289</fpage>
          -
          <lpage>299</lpage>
          . SPIE,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>K.</given-names>
            <surname>Murphy</surname>
          </string-name>
          .
          <article-title>Dynamic Bayesian Networks: Representation, Inference and Learning</article-title>
          .
          <source>PhD thesis</source>
          , UC Berkeley, Computer Science Division,
          <year>July 2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K. P.</given-names>
            <surname>Murphy</surname>
          </string-name>
          .
          <article-title>The bayes net toolbox for matlab</article-title>
          .
          <source>Computing Science and Statistics</source>
          ,
          <volume>33</volume>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sjöberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ionescu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Quang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schedl</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Demarty. The MediaEval 2014 Affect Task</surname>
          </string-name>
          <article-title>: Violent Scenes Detection</article-title>
          . In MediaEval 2014 Workshop, Barcelona, Spain, October
          <volume>16</volume>
          -17
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>K.</given-names>
            <surname>Tang</surname>
          </string-name>
          .
          <article-title>Learning latent temporal structure for complex event detection</article-title>
          .
          <source>In Proceedings of the 2012 IEEE Conference on Computer Vision</source>
          and Pattern Recognition,
          <source>CVPR '12</source>
          , pages
          <fpage>1250</fpage>
          -
          <lpage>1257</lpage>
          , Washington, DC, USA,
          <year>2012</year>
          . IEEE Computer Society.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>