<!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>UTwente does Rich Speech Retrieval at MediaEval 2011</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Robin Aly</string-name>
          <email>r.aly@ewi.utwente.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thijs Verschoor</string-name>
          <email>t.verschoor@ewi.utwente.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roeland Ordelman</string-name>
          <email>ordelman@ewi.utwente.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University Twente P.</institution>
          <addr-line>O. Box 217, 7500AE Enschede</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2011</year>
      </pub-date>
      <fpage>1</fpage>
      <lpage>2</lpage>
      <abstract>
        <p>This paper describes the participation of the University of Twente team at the Rich Text Retrieval Task of the Media Eval Benchmark Initiative 2011. The goal of the task is to find entry points of relevant parts of videos to reduce the browsing effort of searchers. This is our first participation, therefore our main focus is to create a baseline system which can be improved in the future. We experiment with different evidence sources (ASR and meta data) together with a basic score combination function. We also experiment with different entry points relative to the segments found by the contained evidence.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>When searching in videos, it is especially important to
return an entry point where the relevant part for a searcher
begins. The reason is that videos can be multiple hours
long, and unlike our ability to quickly scan text for relevant
parts, scanning a video is much more time consuming. In
this paper, we describe the methods we used for the
participation in the Rich Text Retrieval Task of the Media Eval
Benchmark Initiative 2011 [2].</p>
      <p>This paper is structured as follows: Section 2 describes the
evidences we considered to calculate the likelihood for the
relevance of a segment, the combination of those evidences,
and the alternative entry points. Section 3 details the
experiments we undertook to evaluate our approach. Section 4
concludes this paper.</p>
    </sec>
    <sec id="sec-2">
      <title>SEARCHING AND ENTRY POINT SELEC</title>
    </sec>
    <sec id="sec-3">
      <title>TION</title>
      <p>In this section, we describe the methods we used to search
for segments in videos which are likely to contain relevant
information, and given one such segment, how to determine
the entry point into the video presented to the user.</p>
    </sec>
    <sec id="sec-4">
      <title>Evidence</title>
      <p>We used the following types of evidence to identify
suitable entry points. First, we used the meta data which was
provided on a video level. Second, we used transcripts from
provided automatic speech recognition. The transcripts are
divided into speech segments which the recognition system
believed to originate from a speaker. Since the returned
speech segments were relatively short, we also considered
speaker turns, the transcripts of all consecutive speech
segments of the same speaker, as an alternative evidence (we
always used either speech segments or speaker turns).
Finally, words in a speech segment also influence the likelihood
that an entry point can be found in the remaining speech
segments [5], therefore we also considered the transcript for
the whole document as evidence.</p>
      <p>For each of the three evidence sources, meta data, speech
or speaker turn segments, and the transcript of the whole
document, we create a ranking using two standard retrieval
models, see Section 3. We refer to scores for the speech
segment or the speaker turn as sbase because we determine
the entry point relative to these segments. To the scores on
the meta data, we refer to by smeta, and to the score on the
transcript for the whole video as sdoc. Therefore, while sbase
can be be used to find entry points, smeta and sdoc provide
general evidence about the relevance of a video and could
be combined with sbase to promote segments within a video
with many relevant entry points.
2.2</p>
    </sec>
    <sec id="sec-5">
      <title>Combination Methods</title>
      <p>There are good reasons for the combination of the above
scores. For example, an important query word might be said
only in neighboring segments of the segment close to the
ideal entry point. Furthermore, the language of the searcher
and the speaker in the video might be different, and different
sources, such as the available meta data can be useful to
enrich the findings. Therefore, it is desirable to combine the
findings from all evidence sources. For our first participation
in this task, we choose a heuristic-based approach, on which
we plan to improve in future work: because scores between
evidences are not comparable, we scale the scores for each
evidence to the interval [0 : 1], see [3]. We combine the
evidence scores linearly. The final ranking function is defined
as the following:</p>
      <p>sbase
max(sbase)
+λ2</p>
      <p>
        sdoc
max(sdoc)
+(1−λ1−λ2)
sd = λ1
with
smeta
max(smeta)
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
0 ≤ λ1, λ2 ≤ 1, and λ1 + λ2 ≤ 1
where sd is the final document score, sbase the previously
described base score, λ1 is the influence of the base score on the
ranking, sdoc is the score for the transcript of the
corresponding document, λ2 is the influence of the document transcript
on the ranking, and smeta is the score for the available meta
data for the corresponding document. Note that, if a video
or segment does not appear in a ranking we assume a score
of zero. The combination method in Equation 1 results in
a ranking of either speech segments or speaker turns. From
this information, we then select the entry point.
2.3
      </p>
    </sec>
    <sec id="sec-6">
      <title>Entry Point Selection</title>
      <p>The ranking based on Equation 1 provides a ranking of
intervals where suitable entry points could be. However,
they do not necessarily need to be the beginning of this
segment. Here, we investigate the following four entry points
(EP) relative to the found speech or speaker turn segment:
1. the beginning of the retrieved speech segment (SS),
2. the beginning of the retrieved speaker turn (ST),
3. the beginning of the shot that contains the beginning
of the segment (SHOT),
4. the time of the key frame of the latter shot, which is
usually close to the middle of the shot (KF).</p>
    </sec>
    <sec id="sec-7">
      <title>EXPERIMENTS</title>
      <p>In this section, we describe the runs we performed to
evaluate the evidence sources, parameter settings of the
combination method in Equation 1, and methods to select an entry
point based on obtained ranking.</p>
      <p>For the experiments, we used the search engine
PFTijah [1]. We used two different retrieval models (RM): the
language models (LM) by the author of the engine, and
the okapi retrieval model (BM25), see [4]. We considered
the two different versions of the automatic speech
recognition (ASR) output from 2010 and 2011, referred to by this
number, which both provided a segmentation into speech
segments, and inferred speaker turns therefrom. For the
retrieval function in Equation 1, we performed a grid search
with a step-size of 0.1 for the parameters λ1 and λ2. In the
performance figures below, we used either only the segment
evidence (λ1 = 1.0) or the best performing combination of
the grid search on the development dataset. We performed
our evaluation using the three prescribed window sizes of 10,
30 and 60 seconds and a granularity factor of 10 according
to [2], but only report results of window size 60 because of
space requirements.</p>
      <p>Submitted runs.</p>
      <p>
        In the following we list the results of our official runs:
No
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
      </p>
      <p>RM
BM25
BM25
BM25
BM25
BM25</p>
      <p>
        Run (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) was our baseline run. From the difference between
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) : (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) as well as (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) : (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) we see that combination of
evindence sources decreases the performance. Because this
is counter intuitive, we plan to investigate the reason for
this in future work. Note that the weight of the segment
is lower than the document transcript and the meta data.
This suggests, that it is more important to first rank the
video and only later the entry point. The version of the
ASR transcripts (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) : (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) also performed rather different.
Finally, the differences (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) : (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) and (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) : (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) suggest that
speaker segments are better entry points than shots.
      </p>
    </sec>
    <sec id="sec-8">
      <title>CONCLUSIONS</title>
      <p>This paper described a basic approach to combine
evidence to find segments in a video which might contain
relevant information to a user’s query. The ranking function
for segments linearly combined a normalized score of the
evidence found for each segment by a text retrieval model
together with evidence found in the transcript of the whole
video and its meta data. Relative to a found segment, we
investigated different alternatives for the entry point returned
to the user. Among a large set of combinations, we found
that the entry point alternative is the most influential.
Overall, using the BM25 retrieval model together with the
beginning of shot which contained the start of the found segments
as an entry point produced the strongest performance. The
performance produced by our system was low compared to
other systems, which we plan to investigate in the future.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hiemstra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Rode</surname>
          </string-name>
          , T. van Os,
          <string-name>
            <surname>Roel</surname>
            , and
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Flokstra</surname>
          </string-name>
          .
          <article-title>Pftijah: text search in an xml database system</article-title>
          .
          <source>In Proceedings of the 2nd International Workshop on Open Source Information Retrieval (OSIR)</source>
          , Seattle, WA, USA, pages
          <fpage>12</fpage>
          -
          <lpage>17</lpage>
          . Ecole Nationale Sup´erieure des Mines de Saint-Etienne,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Kofler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Schmiedeke</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Jones</surname>
          </string-name>
          .
          <article-title>Overview of MediaEval 2011 Rich Speech Retrieval Task and Genre Tagging Task</article-title>
          . In MediaEval 2011 Workshop, Pisa, Italy, September 1-2
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J. H.</given-names>
            <surname>Lee</surname>
          </string-name>
          .
          <article-title>Analyses of multiple evidence combination</article-title>
          .
          <source>In Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          ,
          <source>SIGIR '97</source>
          , pages
          <fpage>267</fpage>
          -
          <lpage>276</lpage>
          , New York, NY, USA,
          <year>1997</year>
          .
          <source>ACM. ISBN 0-89791-836-3</source>
          . doi:
          <volume>10</volume>
          .1145/258525.258587.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Walker</surname>
          </string-name>
          .
          <article-title>Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval</article-title>
          .
          <source>In SIGIR '94: Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          , pages
          <fpage>232</fpage>
          -
          <lpage>241</lpage>
          , New York, NY, USA,
          <year>1994</year>
          . SpringerVerlag New York, Inc. ISBN 0-387-19889-X.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T.</given-names>
            <surname>Westerveld</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. C. van Gemert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cornacchia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hiemstra</surname>
          </string-name>
          , and
          <string-name>
            <surname>A. P. de Vries</surname>
          </string-name>
          .
          <article-title>An integrated approach to text and image retrieval the lowlands team at TRECVid 2005</article-title>
          .
          <source>In Proceedings of the 3rd TRECVid Workshop</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>