<!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 University of Amsterdam at VideoCLEF 2008</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jiyin He</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Xu Zhang</string-name>
          <email>x.zhang@uva.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wouter Weerkamp</string-name>
          <email>w.weerkamp@uva.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Martha Larson</string-name>
          <email>m.a.larson@uva.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>General Terms</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Measurement, Performance, Experimentation</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ISLA, University of Amsterdam</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Kruislaan 403</institution>
          ,
          <addr-line>1098 SJ Amsterdam</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The University of Amsterdam (UAms) team carried out the Vid2RSS classification task, the primary sub-task of the VideoCLEF track at CLEF 2008. This task involves the assignment of thematic category labels to dual language (Dutch/English) television episode videos. UAms chose to focus on exploiting archival metadata and speech transcripts generated by both the Dutch and English speech recognizers. Exploratory experimentation completed prior to the start of the task on external data motivated choosing a Support Vector Machine (SVM) with a linear kernel as the classifier. As a SVM toolbox to carry out the experiments, the Least Square-SVM (LS-SVM) toolbox was selected. Wikipedia was chosen as the source of the training data because it is multilingual and contains content with broad thematic coverage. The results of the experimentation showed that archival metadata improves performance of classification, but the addition of speech recognition transcripts in one or both languages does not yield performance gains. Although the overall performance of the classifiers was less than satisfactory, adequate performance was achieved in several classes, suggesting that there is concrete potential for future work to achieve performance improvements, especially if more suitable training data could be obtained.</p>
      </abstract>
      <kwd-group>
        <kwd>H</kwd>
        <kwd>3 [Information Storage and Retrieval]</kwd>
        <kwd>H</kwd>
        <kwd>3</kwd>
        <kwd>1 Content Analysis and Indexing</kwd>
        <kwd>H</kwd>
        <kwd>3</kwd>
        <kwd>3 Information Search and Retrieval</kwd>
        <kwd>H</kwd>
        <kwd>3</kwd>
        <kwd>4 Systems and Software</kwd>
        <kwd>H</kwd>
        <kwd>3</kwd>
        <kwd>7 Digital Libraries</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In this paper we describe our participation in the VideoCLEF track of the Cross Language Evaluation
Forum, CLEF.1 The University of Amsterdam (UAms) organized the VideoCLEF 2008 track together with
Dublin City University and also took part in the track as a task participant. The goal of the University
of Amsterdam’s involvement in the VideoCLEF track is to further our understanding of the problem of
providing intelligent access to large audio-visual archives and to spoken audio content on the internet. We
aim to continue refinement of our techniques for classification and retrieval of conversational speech in
a multilingual setting. Such technologies are being developed within the framework of the MultiMatch
project [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Development of and participation in benchmark tests that help to coordinate research progress
across sites are an important part of this framework.
      </p>
      <p>In this year’s VideoCLEF track, the task, called Vid2RSS,2 is classification performed on a video
corpus containing episodes of dual language television programs. The video corpus was provided by the
audio/video archive Netherlands Institute of Sound and Vision,3 in Dutch called Beeld &amp; Geluid. The
videos are predominantly documentaries. Dutch is the main language, which we call the matrix language,
and English, which we call the embedded language, is spoken during interviews. The classification task
is formulated as follows: given a number of thematic categories (Archeology, Architecture, Chemistry,
Dance, Film, History, Music, Paintings, Scientific research and Visual arts), the participants should assign
the right category label or labels to each video. For each category, an topic-based RSS-feed is then created.
A topic-based feed consists of a concatenation of XML items that represent the videos that were assigned
a particular thematic category label. The feed item for a video contains its title and description drawn from
the archival metadata, as well as a hand-picked keyframe. The generation of the RSS-feed is trivial and the
challenge of the task lies with the classification. The data set includes speech recognition transcripts and
archival metadata for each video. Two sets of speech transcripts are provided, one generated by a Dutch
speech recognizer and one by an English speech recognizer. Each recognizer transcribed the entire spoken
content of each video: no separation of content by language was performed. The archival metadata is Dutch
only. A final characteristic of the task is the lack of training data: participants should develop methods of
collecting their own training data for training a classifier.</p>
      <p>In the next section we address the dimensions the Vid2RSS task offers us. Section 3 provides details on
the training data we use and our choice of classifier. These decisions are both based on initial exploratory
experiments. Section 4 describes our experimental set up. Sections 5.1 and 5.2 report on the results
of our approach on different dimensions, and finally we draw some preliminary conclusions and present
discussion in Section 6.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Task dimensions</title>
      <p>Given the task at hand, classifying dual language video based on speech recognition transcripts and
metadata, without training data provided, we identify four dimensions that are worth exploring. These
dimensions are discussed in this section. Since the number of runs in CLEF is limited (to five), we need to chose
a highly restricted number of dimensions for our experiments. As reported below, we ultimately arrive at
the decision to explore only the dimensions metadata and language.</p>
      <p>First we take a step back and look at the four dimensions we identify: (i) classifier, (ii) training data,
(iii) metadata, and (iv) language. The classifier dimension focuses on the choice of classifier and, the
even more detailed decision of the parameter settings of each classifier. This dimension can be expected
to influence the experiments. We did some limited exploratory tests to support ourselves in making our
choice, but in the end we decided that this is not the most interesting aspect of the task and we fix this
dimension. Training data refers to the different sources we can use as training data in this task, how to
collect the data, and what the performance is of different sources. Although this dimension will certainly
have a high impact on performance, we choose to fix this dimension. We note that in order to have an
exact match between the training data and the test data for this task, it would be necessary to be able to
collect training data that consists of speech recognition transcripts from Dutch television documentaries.
Since such data is not available in large quantities, we are faced with the situation that the match of test
and training data will be necessarily approximative. Instead of exploring the variation due to different data
sources, which we expect to be wide, we chose to fix the source of the training data and to devote our
Vid2RSS runs to exploring other issues. In Section 3, we discuss our choices on both the classifier and the
training data dimension.</p>
      <p>The two remaining dimensions are the main focus of our participation this year: metadata and language.
Exploring the metadata dimension involves attempting to understand the impact of using the archival
metadata associated with the video as a source of features for classification. The rationale behind choosing this
2http://ilps.science.UvA.nl/Vid2RSS
3http://www.beeldengeluid.nl
dimension is quite straightforward. Archival metadata is often available with television programs and, if
available, it should be exploited in order to perform classification. Unlike speech recognition transcripts,
metadata is very clean, nearly error-free, nicely structured text. Archival metadata is created by archivists
with the goal of annotating video with high-level semantics and making video retrievable from the archive.
For this reason, the terms contained in archival metadata can be expected to be meaning bearing and reflect
the thematic content of the video. In contrast, the terms contained in the speech recognition transcripts
can be expected to be characteristic of the interviews and discussions contained in the television programs.
Although terms that reflect video topic are with out doubt present, speech transcripts are diluted with
the kinds of vocabulary typical of conversational speech, namely reflecting social convention, expressing
feelings and opinions and drawing connections between entities and concepts not always explicitly
mentioned. We expect that using metadata in the classification process will increase performance. The second
dimension, language, refers to the fact that the the videos contain two languages and that each video is
accompanied by both a Dutch and a English speech transcript. As task participants, we can chose which
transcript to use. As mentioned before, we distinguish between the matrix language (the underlying, main
language of the program) and the embedded language(s). In our case, Dutch is the matrix language, used
to introduce the foreign speakers and to glue the program together, and English is the embedded language.
Using an embedded language might introduce more noise, but it could also add specific information
regarding the topic that is not present in the matrix language transcript. We expect that using both matrix and
embedded language in classifying videos will lead to better results than using only one (matrix) language.</p>
      <p>
        Based on the choices described in this section we end up with five runs based on the different
combinations given the two dimensions. Table 1 lists these five runs and their division over the dimensions.
As mentioned before, we set the choice of classifier as one of the fixed dimensions, we stick to a Support
Vector Machine (SVM) classifier for all our runs. We chose SVM since it has been reported perform well
in general on text classification problems [
        <xref ref-type="bibr" rid="ref2 ref3">3, 2</xref>
        ] and this performance has been demonstrated to transfer to
speech recognition transcripts that contain a significant level of noise [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The results of exploratory
experimentation suggested that the correct choice of a kernel was a linear kernel. These results were consistent
with previous work [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Since our training data and test data are from very different resources, the
generalization ability is more important than fitting the training data very well. We believe that this mismatch
contributes to the fact that the linear kernel out-performed other kernel choices during the exploratory
experimentation phase.
      </p>
    </sec>
    <sec id="sec-3">
      <title>Experiments</title>
      <sec id="sec-3-1">
        <title>Settings</title>
        <p>For the implementation of the SVM classifier, we use the Least Square-SVM (LS-SVM) toolbox. 5 The
LS-SVM is similar to Vapnik’s SVM formulation, but instead of solving the Quadratic Programming (QP)
problem, it solves a set of linear equations.</p>
        <p>As discussed in previous section, we select the training data by performing retrieval in the Wikipedia
collection using the class label as the query. For each class, we collect top 200 relevant Wikipedia pages
as positive examples. Since the task is a multi-class problem, we use the “one-against-all” strategy to
construct the training set, i.e., using the target class as positive example and all the rest of the classes as
negative examples. Therefore, for each class, a classifier is trained.</p>
        <p>For tuning the parameters, we do a grid search with leave-one-out cross-validation on the training data.
In this case, since we are using the linear kernel, the only parameter needs to be estimated is the C which
is used to control the error rate.
4.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Feature selection</title>
        <p>After initial experiments, we decide to perform a feature selection prune away the irrelevant features.
Although in SVM, the model complexity depends on the number of data points, instead of the dimensionality
4http://www.wikipedia.org
5http://www.esat.kuleuven.ac.be/sista/lssvmlab/
measure
micro average precision
micro average recall
micro f-score
macro average precision
macro average recall
macro f-score
of the original dataset, reducing the dimensionality would still speed up the processing time as well as
improving the classification result.</p>
        <p>
          In our experiments, we use the χ2 statistics to select the relevant features for each class. The χ2
approach is not the only method we could have chosen for feature selection, but we take this approach
since it has proven useful in previous work [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Specifically, χ2 feature selection functions as follows: for
each class, we calculate the χ2 value for each term and rank them in decreasing order. The χ2 measures
the degree of dependence (independence) between an observed probability distribution and an expected
distribution. In the context of text classification, it measures the dependency between the observed term
frequency distribution in the training set and its expected frequency distribution across classes. The high
value of χ2 of a term with respect to certain class indicates high dependency between the term and the
class. For our experiments, we heuristically select 80 top features given the χ2 values.
5
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Results and observations</title>
      <p>The results of the official runs submitted by UAms are listed in Table 2. Below, we discuss our observation
for the dimensions metadata and language.
5.1</p>
      <sec id="sec-4-1">
        <title>Impact of metadata</title>
        <p>The first dimension we explore is the impact of metadata on the classification of videos. When data is
evaluated using micro-averaging, the use of archival metdata clearly shows a positive impact on performance
(i.e., cf. uams08m vs. uams08asrd). The classifiers have the tendency to assign their thematic category
labels to too many documents, reflected in the relatively high recall compared to the precision. The
picture is different, when results are evaluated using macro-averaging. Here, results are best when metadata
is combined with speech transcripts. The reason for the difference between macro-averaging and
microaveraging is that macro-averaging can assign disproportionately large weights to thematic categories whose
classifiers perform well, even though these classifiers are relevant to only a small number of videos. For
uams08masrd, the classifiers over-assignment of class labels to videos is concentrated in a smaller number
of classes. This behavior can be desirable or undesirable depending on the application. We would like to
note some of our best performing single classifiers are the “music” classifier and the “history” classifier
for uams08m. The “music” classifier achieves a precision of 0.57 and a recall of 0.36 and the “history”
classifier achieves precision of 0.36 and recall of 0.40. We believe that this relatively high performance is
due to satisfactory match between the vocabulary used by the archivists to create the archival metadata and
the vocabulary used in Wikipedia to describe music. Both with respect to micro-averaging and to
macroaveraging, adding metadata to the speech recognition transcripts improves, or at least does not hurt results
(i.e., compare runs uams08asrd vs. uams08masrd, and uams08asrde vs. uams08masrde). In general, the
results point to the conclusion that archival metadata serves to enhance classification performance.
5.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Impact of speech transcripts from two languages</title>
        <p>The second dimension that we explore is the impact of using both Dutch and English speech recognition
transcripts for classification. Recall that the videos for the task contain two languages: Dutch as matrix
language (the underlying, main language of the show), and English as embedded language. The run using
Dutch speech transcripts alone (uams08asrd) is not improved by the addition of English speech transcripts
(cf. uams08asrde). Nor is the run using Dutch speech transcripts with archival metadata (uams08masrd)
improved by the addition of English speech transcripts (cf. uams08masrde).</p>
        <p>We had anticipated that there would be more useful Dutch features than English features in the data
since more Dutch than English is spoken in the collection. However, we believed that it would be possible
to also exploit information present in the English features. It proved, however, not to be the case that the
speech transcripts of the embedded language improved classification performance.
6</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>In this pilot year of the VideoCLEF track, the University of Amsterdam participated in the Vid2RSS
classification task and explored two dimensions: the use of archival metadata and the use of speech transcripts
from both the matrix and the embedded language in the video. We drew our training data from the Dutch
and the English editions of Wikipeida and used an SVM with a linear kernel to carry out classification.</p>
      <p>The results show that metadata is very useful in classifying videos in topic classes: highest scores on
both macro and micro level are achieved by runs using metadata. Regarding the use of one (matrix) or two
(matrix and embedded) languages in the classification process, we conclude that adding an extra language
does not lead to improved results. Performance of runs using only the matrix language are consistently
higher than using two languages.</p>
      <p>Overall, the results achieved on this task fell short of being satisfactory. However, individual classifiers
in individual runs proved promising (e.g., “music” and “history” in the metadata only run), suggesting that
further development of our methods could be successful in generalizing this performance to more topic
classes. In the future, we would like to examine the classes that performed the poorest in order to ascertain
the reason for their failure. We suspect that the root of the problem lies in the mismatch between the training
data and the test data. However, we will also prioritize the optimization of our feature selection method
and of our parameters settings. Additionally, we would also like to experiment with methods to filter the
speech recognition transcripts and discard those portions where the Dutch recognizer is producing output
while English is being spoken and vice versa. We believe that a more judicious selection of speech-based
features from the transcripts will serve to make them useful to the classification process.
7</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements</title>
      <p>This research was supported by the E.U. IST programme of the 6th FP for RTD under project MultiMATCH
contract IST-033104.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Amato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cigarran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gonzalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J</given-names>
            <surname>Peters</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P</given-names>
            <surname>Savino</surname>
          </string-name>
          . Multimatch - multilingual/multimedia access to cultural
          <source>heritage. Lecture Notes in Computer Science</source>
          ,
          <volume>4675</volume>
          :
          <fpage>505</fpage>
          -
          <lpage>508</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>H.</given-names>
            <surname>Drucker</surname>
          </string-name>
          ,
          <string-name>
            <surname>Donghui Wu</surname>
            , and
            <given-names>V. N.</given-names>
          </string-name>
          <string-name>
            <surname>Vapnik</surname>
          </string-name>
          .
          <article-title>Support vector machines for spam categorization</article-title>
          .
          <source>Neural Networks</source>
          , IEEE Transactions on,
          <volume>10</volume>
          (
          <issue>5</issue>
          ):
          <fpage>1048</fpage>
          -
          <lpage>1054</lpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Thorsten</given-names>
            <surname>Joachims</surname>
          </string-name>
          .
          <article-title>Text categorization with support vector machines: Learning with many relevant features</article-title>
          .
          <source>Machine Learning: ECML-98</source>
          , Volume
          <volume>1398</volume>
          /
          <year>1998</year>
          :
          <fpage>137</fpage>
          -
          <lpage>142</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E.</given-names>
            <surname>Leopold</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kindermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G</given-names>
            <surname>Paass</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Volmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cavet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Larson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Eickeler</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Kastner</surname>
          </string-name>
          .
          <article-title>Integrated classification of audio, video and speech using partitions of low-level features</article-title>
          .
          <source>In Proceedings of the Workshop on Multimedia Discovery and Mining</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Gerhard</given-names>
            <surname>Paass</surname>
          </string-name>
          , Edda Leopold, Martha Larson,
          <article-title>Jo¨rg Kindermann, and Stefan Eickeler. SVM classification using sequences of phonemes and syllables</article-title>
          .
          <source>In PKDD '02: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery</source>
          , pages
          <fpage>373</fpage>
          -
          <lpage>384</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>