<!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>CUNI at MediaEval 2013 Search and Hyperlinking Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Petra Galušcˇ áková</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pavel Pecina</string-name>
          <email>pecina@ufal.mff.cuni.cz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Charles University in Prague Faculty of Mathematics and Physics Institute of Formal and Applied Linguistics Prague</institution>
          ,
          <country country="CZ">Czech Republic</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <fpage>18</fpage>
      <lpage>19</lpage>
      <abstract>
        <p>We describe our approach to the Search Subtask of the Search and Hyperlinking Task at MediaEval 2013. We experiment with various methods for segmentation of the recordings into shorter segments which are then used in a standard retrieval setup to search for relevant passages. We use regular segmentation into equilong segments and experiment with machine-learning based segmentation expanding our approach to Similar Segments in Social Spech Task [4].</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        The main focus of the Search and Hyperlinking Task is
to enable users to nd information relevant to the
submitted query in a collection of audio-visual recordings (Search
Subtask) and to nd more segments similar to the retrieved
ones to enable easier navigation in the collection
(Hyperlinking Subtask). The collection consists of TV programmes
provided by BBC. The video recordings, audio track,
metadata, synopsis, cast, detected shots, detected faces, visual
concepts, subtitles and two automatic (ASR) transcripts {
provided by LIMSI [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and LIUM [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] are available. For the
Search Subtask, 4 training and 50 test queries are available.
More details of the task and the data collection can be found
in the task description [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>APPROACH DESCRIPTION</title>
      <p>We participated only in the Search Subtask of the Search
and Hyperlinking task. In our approach, we divided the
recordings into shorter segments and applied the Terrier IR
system1 to search for relevant passages within the
recordings. As we searched in the set of the known-boundary
segments, we were able to determine the beginnings and ends
of the retrieved segments.</p>
      <p>As the training set only consists of four queries, we
collected other 30 queries and used the whole set consisting
of 34 queries for training. We randomly selected recordings
from the collection, identi ed short passages somehow
interesting to us in these recordings, and formulated the queries
to search for those passages. We formulated the queries to
imitate the formulation of the original given queries (e.g. \how
to prepare Vietnamese spring rolls", \Thomas Tallis
signature", and \a di erence between a hare and a rabbit").</p>
      <p>
        We applied the Hiemstra Language Model with the
parameter set to 0.35 as it achieved good results in our
experiments in the Search and Hyperlinking Task in 2012 [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
Based on the same results, we decided to apply Porter
stemming, implicit set of stopwords, and removal of the
overlapping segments from the retrieved results.
      </p>
      <p>We also employed metadata information (title, source,
variant, description, service name, episode name, and short
episode synopsis) and synopsis, which improved the results
on the training data. We simply concatenated each segment
(in all recordings) with the metadata information available
for the corresponding recording. We also tried to use the
cast information, but it slightly decreased the results.</p>
      <p>Segmentation of the recordings is realized in two ways:
regular segmentation and segmentation based on machine
learning (ML).
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Regular segmentation</title>
      <p>
        The regular segmentation achieved good results in last
year's experiments [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], so we decided to apply it in this year's
experiments as well. The regular segmentation divides the
recordings into 50-seconds-long passages. The shift (and
overlap) between the adjacent passages is 25 seconds. We
use the same segment length and shift as we use in the
Similar Segments in Social Speech task [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] to be able to compare
the results of both tasks. Moreover, according to the
previous experiments, this length and the shift should achieve
good results.
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Machine-learning segmentation</title>
      <p>
        The ML-based segmentation is adopted from our
experiments conducted for the Similar Segments in Social Speech
Task [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. It employs classi cation trees to identify segment
beginnings and segment ends. The utilized features include
cue words and cue tags, letter cases, length of the silence
before the word, division given in transcripts, and the
output of the TextTiling algorithm [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The cue words mainly
consist of words which stand frequently at the boundaries.
We identi ed them based on the human transcripts of the
recordings in the Similar Segments in Social Speech Task.
      </p>
      <p>As the training set of the Search Subtask is very small
(even after the additional training data is included), we
dement in Social Speech Task to segment the transcripts in the
Search and Hyperlinking Task. However, this approach did
not bring any positive results and needs to be investigated
in more depth.</p>
    </sec>
    <sec id="sec-5">
      <title>ACKNOWLEDGMENTS</title>
      <p>This research is supported by the Charles University Grant
Agency (GA UK n. 920913) and the Czech Science
Foundation (grant n. P103/12/G084).
cided to use the model trained on the Similar Segments in
Social Speech Task.</p>
      <p>We at rst identi ed all possible beginnings of the
segments and all possible ends of the segments, both tuned
for high F-measure. Then, for each possible beginning, we
identi ed the segment end (from the set of possible segment
ends) which lay closest to 50.111 seconds (which is the
average segment length in the Similar Segments in Social Speech
Task) from the beginning.</p>
      <p>This approach (when the model is trained on a di erent
data set) enables us to examine the possibility of creating
a universal model for ML-based segmentation. However, it
also carries potential problems. The sets of the cue words
collected on the student dialogues may di er from the cue
words used in TV programmes, and the silence between the
words in dialogues may have di erent distribution as the
silence between words in the TV programmes.</p>
    </sec>
    <sec id="sec-6">
      <title>RESULTS</title>
      <p>
        The Search Subtask is evaluated using Mean Reciprocal
Rank (MRR), mean Generalized Average Precision (mGAP),
and Mean Average Segment Precision (MASP). Details about
these measures can be found in the task description [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The
utilized MRR score considers only points retrieved closer
than 60 seconds from the beginning of the segment as
correctly retrieved. Therefore, we also utilize the MRR measure
in a standard way [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] on full documents, without the window
limiting the longest distance between the segment beginning
and retrieved beginning { the MRR-Full measure. This
measure indicates the quality of the retrieval of the whole
recording, the precision of the retrieval of the relevant segment is
not taken into account.
      </p>
      <p>Our results for the Search Subtask are presented in the
Table 1. The highest result is achieved on the subtitles, using
the regular segmentation and employing metadata and
synopsis. The subtitles, unsurprisingly, outperform both ASR
transcripts in all measures; the LIUM transcripts
outperform LIMSI transcripts in all measures, except the MASP
score for the regular segmentation if the metadata are
employed. The ML-based segmentation is applied on the LIUM
transcripts only, and it did not improve the results.</p>
    </sec>
    <sec id="sec-7">
      <title>CONCLUSIONS</title>
      <p>In our approach to the Search Subtask, we employed
regular segmentation into 50 seconds long passages on three
transcripts. The highest score was achieved on the subtitles.
The utilization of metadata slightly improved the results in
all applied measures.</p>
      <p>We also proposed another solution which interlinks this
task and our solution used in the Similar Segment in
Social Speech Task and use models trained in the Similar
Seg5.
6.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Aly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. J.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Nadeem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Guinaudeau</surname>
          </string-name>
          , G. Gravier,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sebillot</surname>
          </string-name>
          , T. de Nies, P. Debevere, R. V. de Walle, P. Galuscakova,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pecina</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          .
          <article-title>Multimedia information seeking through search and hyperlinking</article-title>
          .
          <source>In Proc. of ICMR</source>
          , pages
          <volume>287</volume>
          {
          <fpage>294</fpage>
          , Dallas, Texas, USA,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Aly</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          .
          <article-title>The Search and Hyperlinking Task at MediaEval 2013</article-title>
          . In MediaEval 2013 Workshop, Barcelona, Spain,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>Galuscakova</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Pecina</surname>
          </string-name>
          . CUNI at
          <article-title>MediaEval 2012 Search and Hyperlinking Task</article-title>
          .
          <source>In Working Notes Proceedings of the MediaEval 2012 Workshop</source>
          , volume
          <volume>927</volume>
          of Workshop Proceeding, Pisa, Italy,
          <year>2012</year>
          . CEUR Workshop Proceedings.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>P.</given-names>
            <surname>Galuscakova</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Pecina</surname>
          </string-name>
          . CUNI at
          <article-title>MediaEval 2013 Similar Segments in Social Speech Task</article-title>
          . In MediaEval 2013 Workshop, Barcelona, Spain,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.-L.</given-names>
            <surname>Gauvain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lamel</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Adda. The LIMSI Broadcast</surname>
          </string-name>
          <article-title>News transcription system</article-title>
          .
          <source>Speech Communication</source>
          ,
          <volume>37</volume>
          (
          <issue>1-2</issue>
          ):
          <volume>89</volume>
          {
          <fpage>108</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Hearst</surname>
          </string-name>
          .
          <article-title>TextTiling: Segmenting Text into Multi-paragraph Subtopic Passages</article-title>
          .
          <source>Computational Linguistics</source>
          ,
          <volume>23</volume>
          (
          <issue>1</issue>
          ):
          <volume>33</volume>
          {
          <fpage>64</fpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>H.</given-names>
            <surname>Schwenk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Lambert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Barrault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Servan</surname>
          </string-name>
          ,
          <string-name>
            <surname>H.</surname>
          </string-name>
          <article-title>A i, S. Abdul-Rauf, and</article-title>
          K. Shah.
          <article-title>LIUM's SMT machine translation systems for WMT 2011</article-title>
          .
          <source>In Proceedings of the Sixth Workshop on Statistical Machine Translation, WMT '11</source>
          , pages
          <fpage>464</fpage>
          {
          <fpage>469</fpage>
          ,
          <string-name>
            <surname>Edinburgh</surname>
          </string-name>
          , UK,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Voorhees</surname>
          </string-name>
          .
          <source>The TREC-8 Question Answering Track Report. In Proceedings of TREC-8</source>
          , pages
          <fpage>77</fpage>
          {
          <fpage>82</fpage>
          ,
          <string-name>
            <surname>Gaithersburg</surname>
            ,
            <given-names>MD</given-names>
          </string-name>
          , USA,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>