<!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>Xueliang Yan⋆</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wei Wu⋆</string-name>
          <email>cswuwei@imu.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Guanglai Gao⋆⋆</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Qianqian Lu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>College of Computer Science Inner Mongolia University 010021</institution>
          <addr-line>Hohhot</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Inner Mongolia University have participated the Visual concept detection, annotation, and retrieval using Flickr photos task of ImageCLEF for the first time in 2012. We have conducted experiments and submitted results for both the Concept Annotation and the Conceptbased Retrieval subtasks. This paper describes the methods we have adopted and the analysis of the results for the two subtasks. We focus our attention mainly on the user's tag since we believe that user annotation provides strong semantic information which can be used to accurately determine the presence or absence of each concept and the relevance level between the images and queries. For the Concept Annotation subtask, we use only a simple statistical method that scores the confidence of the presence of each concept by the maximum conditional probability of the concept between the different given tags. For the Concept-based Retrieval task, we adopted the language modeling approach which has been widely used in text information retrieval field. Official evaluations show that the performance of our method is competitive. We rank in the middle of the pack for the Concept Annotation subtask with the best run's MiAP equal 0.2441. For the Concept-based Retrieval subtask, we rank at the top with the best run's MnAP equal 0.0933. Beside the main submissions, we also submit two visual runs, although no very good, with the MiAP for Concept Annotation is 0.0819 and the MnAP for Concept Retrieval is 0.0045. As a whole, the results confirm that although the methods we have adopted are simple, the performances we have achieved are satisfied.</p>
      </abstract>
      <kwd-group>
        <kwd>Concept Annotation</kwd>
        <kwd>Concept Retrieval</kwd>
        <kwd>User Tags</kwd>
        <kwd>Wiki Expansion</kwd>
        <kwd>Maximum Conditional Probability</kwd>
        <kwd>Language Modeling</kwd>
        <kwd>Bagof-Visual Words</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>In this paper we will describe the approaches we have adopted to accomplish
the “Visual concept detection, annotation, and retrieval using Flickr photos”
task for ImageCLEF 2012. We have participated both the Concept Annotation
subtask and the Concept-based Retrieval subtask and submitted 15 runs in total.
The official evaluation shows that we rank in the middle pack in the Concept
Annotation subtask and get the highest rank in the Concept-based Retrieval
subtask[1]. We base our methods mainly on User Tags, both for the Concept
Annotation and for the Concept-based Retrieval subtask. The main reason for
choosing User Tag as feature is that we believe that users generally annotate
an image with the words that have strong relationships to its meaning. This
semantic information can then be used to determine the contents of the image
accurately. In all, we used statistical methods to address both the two subtasks.
For the annotation subtask, we use the training set to estimate a conditional
probability distribution and use the probability of the most supportive tag as
the confidence of the presence of a concept in an image. For the retrieval subtask,
we construct language models for the tags of each image and take the probability
of the query being generated by the tags model as ranking score. Beside the main
methods, we also test some visual feature based method.</p>
      <p>The rest of the paper is organized as follows: in section 2 we firstly discuss the
method we have used to accomplish the Concept Annotation subtask, including
the experiments and the results achieved. Then in section 3, we similarly discuss
the method for Concept Retrieval, again, experiments and result analysis are
included. Finally, we conclude our work and shed lights on the future work in
section 4 and 5 respectively.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Concept-based Annotation</title>
      <sec id="sec-2-1">
        <title>User Tag based Method for Annotation</title>
        <p>
          We have adopted a very simple statistical method for the Concept-based
Annotation subtask here. That is: we just calculate the conditional probability of
the presence of the concept given the tags of the image and then taking the
maximum probability among the different tags as the confidence. This can be
shown by (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ):
        </p>
        <p>Conf idence(C) = max P (C|T ag) ,</p>
        <p>
          T ag
(
          <xref ref-type="bibr" rid="ref1">1</xref>
          )
where C denotes the concept being considered; Conf idence(C) is the confidence
of the presence of concept C.
        </p>
        <p>The flowchart of our Tag-based Concept Annotation system is illustrated in
Fig. 1.</p>
        <p>We use the training set which has been released by CLEF organization to
estimate the conditional probability distribution. Since the number of tags for each
image is relatively small (6.34 on average according to our statistics), we think
that it’s reasonable to expand them first[2]. We use the Official INEX 09
collection[3] which contains about 2640000 articles to perform User Tag expansion. 1
More specifically, we first use the tags for each image as query and the INEX
1 http://www.mpi-inf.mpg.de/departments/d5/software/inex/</p>
        <p>Training Set
Conditional
Probability
Estimation
Conditional
Probability
Distribution</p>
        <p>Tag1</p>
        <p>Tag2
P(C|Tag1)</p>
        <p>P(C|Tag2)
Lookup the Conditional</p>
        <p>Probability</p>
        <p>MAX
Confidence of Concept C</p>
        <p>Tagn
P(C|Tagn)
corpora as document collection to perform retrieval and then extend the tags
by using the top 15 words among the returned top 200 documents. We test our
annotation approach on the officially released testing set, which contains 10000
images in total. The collections we used for our Tag-basd annotation approach
are listed in Tab. 1.</p>
        <p>We use Indri[4] in the Lemur Toolkit2 to perform retrieval. Indri is a search
engine which has been widely used in the Information Retrieval field. We will
mention it again in the Concept-based Retrieval section (section 3). The
parameters set in Indri for the Tag-based Annotation are listed in Tab. 2.</p>
        <p>The experimental results are summarized in Tab. 3. In Tab. 3,Max CondProb
denotes Maximum Conditional Probability; WE Train Max CondtProb means
Maximum Conditional Probability with tag expansion for Training Set by Wiki
INEX09; WE Train Test Max CondProb is the Maximum Conditional
Probability method with tag expansion for both training and testing set by Wiki
INEX 09; WE Train Test Norm means Maximum Conditional Probability with
tag expansion for both training and testing set by Wiki INEX 09 and scores are
normalized to the range of 0 to 1.</p>
        <p>Comparing the first two results Max CondProb and WE Train Max CondProb
in Tab. 3, we can see that it really reaps the benefit of the Wiki Expansion greatly
(more than 1.0 percent increase for the MiAP matric).</p>
        <sec id="sec-2-1-1">
          <title>2 http://www.lemurproject.org</title>
          <p>The huge drop from the performance of WE Train Max CondProb to that of
WE Train Test Max CondProb indicates that it’s not reasonable to expand the
tags for the images to be annotated. We can explain this as that the expanded
tags are more likely to drift away to the concepts that are not in fact exist in
the given image.</p>
          <p>Intuition tells us that every image should contain some concepts in
general, otherwise it will not be chosen for sharing. This means that even though
the absolute probability of a concept may be low, we should still have great
confidence that the concept is present if it has a relatively higher
probability than the other concepts. This assumption can be confirmed by comparing
WE Train Test Max CondProb to the run with the probability value
normalized across the concepts (WE Train Test Norm Max CondProb). The great
improvement in performance shows that normalization plays an important role in
transforming the conditional probability to the confidence of the concept.
2.2</p>
          <p>Visual Feature based Method for Annotation
Extraction of Visual Features We extracted three features that are mostly
considered in the literatures we found (i.e., Color Histograms,
Fuzzy-Color-andTexture-Histogram (FCTH) and Bag-of-Visual Words).</p>
          <p>Color Histograms are among the most basic approaches and are widely used
in image retrieval. The color space is partitioned and for each partition the pixels
with their color within this range are counted, resulting in a representation
of the relative frequencies of the colors. We use the RGB color space for the
histograms[5]. And we use the Jensen-Shannon divergence (JSD) as shown in
Tij = t(xi, xj) =</p>
          <p>xiT xj
xiT xi + xjT xj − xiT xj
.</p>
          <p>
            We extracted the SIFT local features from harris-laplace region of interest
detection. Each of these features is represented as a Bag-of-Visual Word. The
visual words vocabulary is generated by adopting the K-means clustering
algorithm on the features of the training set, which is implemented in the LIRE
Toolkit3[7]. In our experiment, we take 10000 as the size of the Visual Word
Vocabulary and adopt the same dJSD in (
            <xref ref-type="bibr" rid="ref2">2</xref>
            ) as the distance masure for clusting.
          </p>
          <p>
            The three features described above are then used independently for k-NN
classifier.
(
            <xref ref-type="bibr" rid="ref2">2</xref>
            ) to compute the distance:
          </p>
          <p>′ M "
dJSD(H, H ) = X
m=1</p>
          <p>Hm log
2Hm ′</p>
          <p>′ + Hm log
Hm + Hm</p>
          <p>
            ′
2Hm ′
Hm + Hm
#
,
(
            <xref ref-type="bibr" rid="ref2">2</xref>
            )
where H and H’ are the histograms to be compared.
          </p>
          <p>
            Fuzzy Color and Texture Histogram (FCTH) is appropriate for accurately
retrieving images even in distortion cases such as deformations, noise and
smoothing. FCTH is a low level descriptor that contains both quantized histogram color
and texture information[6]. For the measurement of the distance of this feature
between the images, we use Tanimoto coefficient as shown by (
            <xref ref-type="bibr" rid="ref3">3</xref>
            ):
Classification Firstly, we use visual features mentioned above to build
classifier. We use distance-weighted k-nearest neighbour (k-NN) approach to build our
classifiers[8]. For each concept, we selected some positive images and a number
of negative images. The distances, for feature f , from the test image Ti to each
of the k nearest positive or negative images are determined. Then we computed
the similarity between the test image Ti and Concept C as (
            <xref ref-type="bibr" rid="ref4">4</xref>
            ):
          </p>
          <p>Simf (C, Ti) =</p>
          <p>Pp∈P (distf (Ti, p) + ε)−1
Pn∈N (distf (Ti, n) + ε)−1 + ε
where P and N are the k-nearest positive and negative images for each concept
and satisfy |Q| + |N | = k and ε is a small positive number to avoid division by
zero.</p>
          <p>However, the experiment results on the training set are not very good, so we
submitted only one visual feature based run (Bag-of-Visual Words).</p>
          <p>Tab. 4 lists the official evaluation result of our visual submission, which again
confirms that by now our visual based method is not good.</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>3 http://www.semanticmetadata.net/lire/</title>
          <p>
            (
            <xref ref-type="bibr" rid="ref3">3</xref>
            )
(
            <xref ref-type="bibr" rid="ref4">4</xref>
            )
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Concept Retrieval</title>
      <sec id="sec-3-1">
        <title>Language Models for User Tag Retrieval</title>
        <p>
          Language modeling is a formal probabilistic framework that has been widely
used in the text retrieval field. The language modeling approach to text retrieval
is to model the idea that a document is a good match to a query if the document
model is likely to generate the query[9]. Formally, we want to estimate a model
Md for each document d and rank the documents for a query Q according to the
probability of Q being generated by Md. When further assuming beg-of-words
modeling, we get (
          <xref ref-type="bibr" rid="ref5">5</xref>
          ):
        </p>
        <p>m
log p (Q|Md) = X log p (Qi|Md) .</p>
        <p>
          i=1
(
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
        </p>
        <p>
          Observed that, in the official image collection, if an image is relevant to a
query, its tags annotated by the user are more likely to occur in the query, we
guess that the Concept Retrieval task can be addressed by building language
models for the image tags and retrieving the images by ranking them according
to the likelihood of generating the query (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ):
        </p>
        <p>m
log p (Q|MImageT ags) = X log p (Qi|MImageT ags) .</p>
        <p>
          i=1
(
          <xref ref-type="bibr" rid="ref6">6</xref>
          )
        </p>
        <p>To test our assumption, we use the Indri Search Engine in the Lemur Toolkit
which we have mentioned in section 2 to perform retrieval. Indri is a search
engine that implements the language modeling approach under the Bayes
Inference Network Framework [10]. The Tag models are smoothed by the Dirichlet
Smoothing[11] method. For each topic, we retrieve 1000 images. A total of 418
stop words from the standard InQuery[12] stoplist are removed from the queries.
Pseudo Relevance Feedback (PRF)[9] is adopted for both Tag Expansion and
Concept Retrieval with fbTerms=15 and fbDocs=200. The detailed parameters
set in Indri for Tag-based Retrieval are listed in Tab. 5.</p>
        <p>In Tab. 6, we list the collections used to perform our Tag-based retrieval
experiments and illustrate the flowchart of our system in Fig. 2.</p>
        <p>In our experiments, we have tested different methods to form the queries for
language modeling based retrieval and the results we have achieved are listed in
Tab. 7 and Tab. 8.</p>
        <p>In Tab. 7, Title means that the queries are formulated by just using the terms
in the &lt;title&gt; field of the topic file queries.xml which has been officially released in
the test set. Image(all 3) denotes that the queries are constructed by using all the
three images’ tags, i.e., the &lt;image&gt; fields in the topic file; Image(first not null)
refers to the query construction method that only the first image’s tags in the
topic file are used. If the first image’s tag set is empty or the tags cannot return
any result, use the next one’s tags, and so forth. Title&amp;Image(all 3) means that
the queries are constructed by combining the title portion and tags associated
with all the three images in the topic file.</p>
        <p>Since the number of tags associated with each image is relatively small (6 on
average according to our statistics), we think it would be helpful to extend the
tags for the images to perform retrieval. We perform the tag expansion similarly
as in section 2 and the results are listed in Tab. 8, where runs with the prefix
WE denote the Wiki expanded version of the corresponding runs.</p>
        <p>Fig. 3 illustrates the comparision of the results in Tab. 7 with that in Tab. 8.
We can see that tag expansion really improve the performance greatly (with
only one exception that for Image(all 3), which decrease about 3 percent on
MnAP matric). We explain this as follows: the tags for the images may not be
so accurate as that in the title field. So the expanded terms may drift away
seriously. But if the title terms is also present, the expanding precess will be
directed by them and the performance will increase finally as shown by the
results of Title&amp;Image(all 3) V.S. WE Title&amp;Image(all 3).</p>
        <p>From Tab. 7 and Tab. 8, we can see that using the title filed as query perform
better than using the tags of the images in the image fields, both for the original
tags and for the Wiki Expanded ones. This means that the title field in the topic
has more strong descriptive ability than the tags of the images. We can also see
that when combining the title part with the image part to form the queries, the
retrieval performance can always be greatly improved. This phenomenon is in</p>
        <p>Wiki Expansion
accordance with our intuition that the more information provided, the better we
can determine the user’s Information Need.</p>
        <p>
          We also have performed experiment to test the combination method at result
level, which is denoted by WE Combine Title&amp;Image(all 3) at Result Level. To
do this, we first generate the ranked Image Lists (WE Title and WE Image(all 3))
by the two methods independently. After normalizing the score for each Image
Im to the same scale (
          <xref ref-type="bibr" rid="ref1">0 − 1</xref>
          ), we re-rank the documents according to equation
(
          <xref ref-type="bibr" rid="ref7">7</xref>
          ) [13]:
scoreT+I(Im) = wT ∗ norm scoreT(Im) + wI ∗ norm scoreI(Im) ,
(
          <xref ref-type="bibr" rid="ref7">7</xref>
          )
where wT and wI are the combination parameters for Title and Image field whose
ratio is 1 : 1 for simplicity in our experiment. More reasonable ratio can be tested
in the future.
        </p>
        <p>Comparing the result to that at query level (WE Title&amp;Image(all 3)), we
can see that they achieve similar performance.</p>
        <p>0.1
0.09
0.08
0.07
0.06
P
nA0.05
M
0.04
0.03
0.02
0.01
0</p>
        <p>Runs without Wiki Expansion</p>
        <p>Runs with Wiki Expansion
Title</p>
        <p>Image(all_3)</p>
        <p>Image(first_not_null)</p>
        <p>
          Title&amp;Image(all_3)
Extraction of Visual Features For visual feature extraction, we take the
same method as that for visual concept annotation. So we omit their description
here to reduce the lenght of the paper. Please refer to section 2 for more detail.
Classification We use the weighted distance from the query images in the topic
file to the image being considered as the ranking score, which can be shown by
(
          <xref ref-type="bibr" rid="ref8">8</xref>
          ):
n
RankingScoref (Q, Ti) = X wj distf (Ti, Qj) ,
j=1
(
          <xref ref-type="bibr" rid="ref8">8</xref>
          )
where Q denotes the query and Ti denotes the test image being considered; Qj
means the jth image that belongs to the &lt;image&gt; field in the queries.xml file for
query Q and n is the totoal number of &lt;image&gt; fields for query Q.
        </p>
        <p>Tab. 9 lists the result of our visual based retrieval submission, which shows
that by now our method does not achieve good performance either.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>In this paper, we described the experiments we have performed for the “Visual
concept detection, annotation, and retrieval using Flickr photos” task in detail.
BoV Retrieval 0.0045 0.0030
0.0064
We based our methods mainly on the Tags annotated by the users since we
believe that there is strong relationship between the user’s tag and the presence
of a concept for annotation and between the user’s tag and the query for retrieval.
Official evaluation show that we achieved satisfied results for the User Tag based
methods. Beside the main submission, we also perform some initial visual feature
based experiments. However, the results we can achieved by now are not very
good.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Future Works</title>
      <p>Since this is the first time we participated the ImageCLEF task, we just did
some initial work. More detailed experiments should be performed in the future.
For example, for the Concept Annotation subtask, we didn’t consider the
relationships between different concepts. In reality, there are correlations between
different concepts, such as the probability of the presence of timeofday day is
usually low given the presence of timeofday night whereas the probability of
view outdoor will be high given the presence of the concept flora tree. For the
Concept-based Retrieval subtask, we just applied the traditional Language
Modeling approach to the tag modeling application but did not take the specific
characteristic of image tags into consideration, like that the terms in the documents
in text retrieval are sufficient in general whereas the amount of tags for each
image are relatively small, even after being expanded. More refined modification
should be made to address these problems. We will do all these works in the
future.</p>
      <p>Acknowledgments. We would like to thank Prof. Jian-Yun Nie of Universit´e
de Montr´eal for his invaluable suggestions.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>S.</given-names>
            <surname>Nowak</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Nagel</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Liebetrau</surname>
          </string-name>
          . J.:
          <article-title>The CLEF 2012 Photo Annotation and Concept-based Retrieval Tasks</article-title>
          .
          <source>In: CLEF 2012 Working Notes</source>
          . Rome (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Carpineto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Romano</surname>
          </string-name>
          , G.:
          <article-title>A Survey of Automatic Query Expansion in Information Retrieval</article-title>
          .
          <source>ACM Computing Surveys(CSUR)</source>
          ,
          <volume>44</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>1</fpage>
          -
          <lpage>50</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Schenkel</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fabian</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Suchanek</surname>
          </string-name>
          , and
          <article-title>Gjergji Kasneci: YAWN: A Semantically Annotated Wikipedia XML Corpus</article-title>
          .
          <source>In: Proceedings of Datenbanksysteme in Business, Technologie and Web (BTW)</source>
          , pp.
          <fpage>277</fpage>
          -
          <lpage>291</lpage>
          .
          <string-name>
            <surname>Aachen</surname>
          </string-name>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Metzler</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strohman</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croft</surname>
          </string-name>
          , W.B.: Indri at TREC 2005:
          <article-title>Terabyte Track</article-title>
          .
          <source>In: 14th Text Retrieval Conference</source>
          , pp.
          <fpage>175</fpage>
          -
          <lpage>180</lpage>
          .
          <string-name>
            <surname>Gaithersburg</surname>
          </string-name>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Deselaers</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keysers</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ney</surname>
          </string-name>
          , H.:
          <article-title>Features for image retrieval: an experimental comparison</article-title>
          .
          <source>Informational Retrieval</source>
          ,
          <volume>11</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>77</fpage>
          -
          <lpage>107</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Chatzichristofis</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Boutalis</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>FCTH: Fuzzy Color and Texture Histogram - A Low Level Feature for Accurate Image Retrieval</article-title>
          .
          <source>In: Proceedings of the Ninth International Workshop on Image Analysis for Multimedia Interactive Services</source>
          , pp.
          <fpage>191</fpage>
          -
          <lpage>196</lpage>
          .
          <string-name>
            <surname>Klagenfurt</surname>
          </string-name>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Mathias</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chatzichristofis</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : Lire:
          <article-title>Lucene Image Retrieval An Extensible Java CBIR Library</article-title>
          .
          <source>In: Proceedings of the 16th ACM International Conference on Multimedia</source>
          , pp.
          <fpage>1085</fpage>
          -
          <lpage>1088</lpage>
          . Vancouver, Canada (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Yavlinsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pickering</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heesch</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,Ru¨ger,
          <string-name>
            <surname>S.:</surname>
          </string-name>
          <article-title>A comparative study of evidence combination strategies</article-title>
          .
          <source>In: Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing</source>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>21</lpage>
          . Montreal, Canada (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raghavan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , and Schu¨tze, H. Introduction to Information Retrieval. Cambridge University Press, Cambridge, UK (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Metzler</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Croft</surname>
          </string-name>
          , W.B.:
          <article-title>Combining the Language Model and Inference Network Approaches to Retrieval</article-title>
          .
          <source>Information Processing and Management</source>
          ,
          <volume>40</volume>
          (
          <issue>5</issue>
          ), pp.
          <fpage>735</fpage>
          -
          <lpage>750</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Zhai</surname>
            ,
            <given-names>C.X.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Lafferty</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A study of smoothing methods for language models applied to information retrieval</article-title>
          .
          <source>ACM Transactions on Information Systems (TOIS)</source>
          ,
          <volume>22</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>179</fpage>
          -
          <lpage>214</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Callan</surname>
            ,
            <given-names>J.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croft</surname>
            ,
            <given-names>W.B.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Harding</surname>
            ,
            <given-names>S.M.:</given-names>
          </string-name>
          <article-title>The inquery retrieval system</article-title>
          .
          <source>In: Proceedings of the Third International Conference on Database and Expert Systems Applications</source>
          , pp.
          <fpage>78</fpage>
          -
          <lpage>83</lpage>
          ,
          <string-name>
            <surname>Spain</surname>
          </string-name>
          (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Croft</surname>
          </string-name>
          , W.B.: Combining Approaches to Information Retrieval.
          <article-title>Advances in Information Retrieval: Recent Research from the Center for Intelligent Information Retrieval</article-title>
          , Croft, W.B. (eds.), pp.
          <fpage>1</fpage>
          -
          <lpage>36</lpage>
          . Kluwer Academic Publishers (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>