<!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>JRS at Search and Hyperlinking of Television Content Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Werner Bailer</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Austria</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>firstName.lastName}@joanneum.at</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <fpage>16</fpage>
      <lpage>17</lpage>
      <abstract>
        <p>This paper describes the work done by the JRS team for the linking sub-task. We submitted eight pairs of runs: four with di erent textual resources only, two using reranking based on visual similarity, and two using concept detection results. Each of the pairs contains of one run using the anchor segment only, and one using a longer context segment. The results show higher variance between anchors than for the 2013 task, also the di erences between runs using di erent textual resources are more salient. The use of the context does not generally improve results, and visual reranking provides small improvements.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        The MediaEval 2014 Search and Hyperlinking of
Television Content Task addresses the scenario of performing
search in a video collection (search sub-task) and
subsequent exploration of related video segments (hyperlinking
sub-task). This paper describes the work done by the JRS
team for the linking sub-task. Details on the task and the
data set can be found in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>LINKING SUB-TASK</title>
      <p>For the linking sub-task, we combine textual/metadata
similarity and visual similarity. The textual/metadata
similarity is based on matching terms and named entities, and
provides a basic set of result segments. In some runs, visual
similarity based on local descriptors is used for reranking.
In the following, we brie y summarise the approach.</p>
      <p>The textual/metadata based approach uses the automatic
speech recognition (ASR) transcript or subtitles and the
metadata about the broadcast (using title, description and
short synopsis of episodes). All these textual resources are
preprocessed by removing punctuation, normalizing
capitalization and removing stop words and very short words (less
than three characters). We then select a basic set of terms
T = Ta [ Tm, which are the words Ta from the anchor and
Tm from the metadata, that are found in DBpedia1. Some
runs use the results of concept detection, treating the
annotated concepts Tc like terms extracted from the text of
the segment. In this case, the set of terms is de ned as
T = Ta [ Tm [ Tc.
For the ASR transcript or subtitles, we then broaden the
set of terms and select speci c classes. As a rst step, we add
synonyms for the terms in T from WordNet2, obtaining a set
ST . We then select a set of connected entities CT for the
terms in T from FreeBase3. For the subset of terms Tg T ,
which FreeBase identi es as related to a geographic location,
we also add the set of connected geographic entities GTg
from GeoNames4. Thus the set of terms used for matching
is T = T [ ST [ CT [ GTg .</p>
      <p>For matching two segments, we match the terms related
to these segments with di erent weights:
w(t) = wo; t 2 T;
w(t) = wg; t 2 GTg ;
w(t) = ws; t 2 ST [ CT ; with ws &lt; wg &lt; wo:
(1)
For multiple occurrences K in a segment, the weights of
each occurrence decrease, with the total weight de ned as
w(t) = PK
b k=1(1=k)w(t). For a pair of video segments (v1; v2)
the similarity is determined as Pt2T (v1)\T (v2) w(t), with
T (vi) being the extended set of terms of segment vi.</p>
      <p>For initial text-based matching, the videos have been
segmented into segments of equal lengths of 20 seconds. In the
experiments, we cut the lists at a normalized similarity score
of 0.1, keeping at most 500 result items.</p>
      <p>
        For visual matching we use VLAT [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] on SIFT [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]
descriptors extracted from di erence of Gaussians (DoG) interest
points. In order to avoid possible side e ects of interlaced
content, only one eld is used if interlacing artifacts are
detected. Descriptors are extracted from every fth frame
(every tenth eld) and detecting several hundred key points
(limiting to the best 500). We use the VLAT Wise variant
with a dictionary size of 128. Visual matching is applied to
the top results from textual matching (score 0:35, at most
50 result items) and for these items are ranked using only
the scores from visual similarity.
3.
      </p>
    </sec>
    <sec id="sec-3">
      <title>SUBMITTED RUNS</title>
      <p>
        We submitted in total eight pairs of runs, each
containing one using only the exact anchor segment, and one using
the anchor plus context item. This decision is based on the
conclusions from the linking sub-task at MediaEval 2013,
where the use of a longer segment including context signi
cantly improved the results. As no anchor item segment is
2wordnet.princeton.edu
3www.freebase.com
4www.geonames.org
0,5
0,4
0,3
0,2
0,1
0
de ned in the task input data in 2014, we created segments
by adding three minutes before and after anchor, as this was
shown in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] to provide comparable results. All runs produce
xed segments of 20 seconds. Four of the pairs use only text
resources, i.e., the metadata and one of the three types of
ASR transcripts (LIMSI [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], LIUM [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], NST/She eld [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]) or
the subtitles. For the pairs using LIMSI and subtitles, we
additionally generated a version with reranking of the top
results based on visual similarity. Finally, two pairs of runs
used the concept detection results from University of Oxford
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], one in addition to metadata and subtitles and only the
concepts without any textual metadata. We decided to only
use the full set of transcripts for the text only runs, and
not use them in combination with each other feature, as the
results from 2013 showed rather small di erences between
runs using di erent text resources.
      </p>
    </sec>
    <sec id="sec-4">
      <title>RESULTS</title>
      <p>For the runs that use the same method as in 2013 (apart
from necessary changes for parsing metadata) the overall
scores are clearly lower, and the variance of the results is
much higher. This indicates that the anchors used this year
might be more challenging, and more diverse. Using
context segments does only slightly improve results, but the
impact depends very much on the anchor. For example,
for anchor 25 we obtain signi cantly better results when
only using the anchor, while for anchor 47 results are much
better when using the context. There are also clearer
differences between di erent text resources than in 2013, with
manual subtitles clearly providing best results, LIMSI and
NST/She eld have comparable results, and LIUM
resulting in lower results. Using visual reranking provides in most
cases a slight improvement (this is in line with the results
from 2013). Visual concepts alone result in a performance
that is an order of magnitude lower than using text results,
combining them with text slightly lowers the performance
for the anchor only runs, and signi cantly for runs using the
context segment. An overview of the scores of some selected
runs is shown in Figure 1.</p>
    </sec>
    <sec id="sec-5">
      <title>CONCLUSION</title>
      <p>Comparable approaches yield overall lower results than
in 2013, and there is higher variance in the queries. This
includes also the usefulness of context segments for the
anchors. Visual information makes small contributions to the
overall scores, however, visual concepts need to be treated
specially, as their con dence is still low.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>The authors thank Michal Lokaj for his contributions to the
implementation. The research leading to these results has
received funding from the European Union's Seventh
Framework Programme (FP7/2007-2013) under grant agreement
n 610370, \ICoSOLE { Immersive Coverage of Spatially
Outspread Live Events" (http://www.icosole.eu/).
6.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>W.</given-names>
            <surname>Bailer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lokaj</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Stiegler</surname>
          </string-name>
          .
          <article-title>Context in video search: Is close-by good enough when using linking?</article-title>
          <source>In Proc. ICMR</source>
          , Glasgow, UK,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Chat eld and A. Zisserman. VISOR: towards on-the- y large-scale object category retrieval</article-title>
          .
          <source>In Proc. ACCV</source>
          , pages
          <volume>432</volume>
          {
          <fpage>446</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Eskevich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Aly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. N.</given-names>
            <surname>Racca</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ordelman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G. J.F.</given-names>
            <surname>Jones</surname>
          </string-name>
          .
          <article-title>The Search and Hyperlinking Task at MediaEval 2014</article-title>
          . In MediaEval 2014 Workshop, Barcelona,
          <string-name>
            <surname>ES</surname>
          </string-name>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <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="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lanchantin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gales</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Long</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Quinnell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Renals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Saz</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Seigel</surname>
          </string-name>
          .
          <article-title>Automatic transcription of multi-genre media archives</article-title>
          .
          <source>In Proc. SLAM Workshop</source>
          , Marseille,
          <string-name>
            <surname>FR</surname>
          </string-name>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lowe</surname>
          </string-name>
          .
          <article-title>Distinctive image features from scale-invariant keypoints</article-title>
          .
          <source>International Journal of Computer Vision</source>
          ,
          <volume>60</volume>
          (
          <issue>2</issue>
          ):
          <volume>91</volume>
          {
          <fpage>110</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Negrel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Picard</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P. H.</given-names>
            <surname>Gosselin</surname>
          </string-name>
          .
          <article-title>Web-scale image retrieval using compact tensor aggregation of visual descriptors</article-title>
          .
          <source>IEEE MultiMedia</source>
          ,
          <volume>20</volume>
          (
          <issue>3</issue>
          ):
          <fpage>2433</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Rousseau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Deleglise</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Esteve</surname>
          </string-name>
          .
          <article-title>Enhancing the TED-LIUM corpus with selected data for language modeling and more TED talks</article-title>
          .
          <source>In Proc. LREC</source>
          , pages
          <volume>26</volume>
          {
          <fpage>31</fpage>
          , Reykjavik, IS,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>