<!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>DCU at ImageCLEFPhoto 2008</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Neil O'Hare</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Peter Wilkins</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cathal Gurrin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eamonn Newman</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gareth J.F. Jones</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alan F. Smeaton.</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Centre for Digital Video Processing, Dublin City University</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>DCU participated in the ImageCLEF 2008 photo retrieval task, submitting runs for both the English and Random language annotation conditions. Our approaches used text-based and image-based retrieval approaches to give baseline retrieval runs, with the highest-ranked images from these baseline runs clustered using K-Means clustering of the text annotations. Finally, each cluster was represented by its most relevant image and these images were ranked for the nal submission. For random annotation language runs, we used TextCat1 to identify German annotation documents, which were then translated into English using Systran Version:3.0 Machine Translator. We also compared results from these translated runs with untranslated runs. Our results showed that, as expected, runs that combine image and text outperform text alone and image alone. Our baseline image+text runs (i.e. without clustering) give our best MAP score, and these runs also outperformed the mean and median ImageCLEFPhoto submissions for CR@20. Clustering approaches consistently gave a large improvement in CR@20 over the baseline, unclustered results. Pseudo relevance feedback consistently improved MAP while also consistently decreasing CR@20. We also found that the performance of untranslated random runs was quite close to that of translated random runs for CR@20, indicating that we could achieve similar diversity in our results without translating the documents.</p>
      </abstract>
      <kwd-group>
        <kwd>Content-Based Image Retrieval</kwd>
        <kwd>Data Fusion</kwd>
        <kwd>Clustering</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>For the CLEF2008 ImageCLEF photo retrieval task, our baseline retrieval system DCU used
standard text retrieval, both with and without pseudo relevance feedback, and content-based
image retrieval (CBIR) approaches based on MPEG-7 low level visual features and a combination
of text retrieval and CBIR. K-Means clustering was then run on the outputs from these retrieval
approaches in order to promote a more diverse set of images towards the top of the result list in
1http://odur.let.rug.nl/ vannoord/TextCat/
keeping with this years version of the task, which is to promote diversity in image retrieval. For
cross-language retrieval (i.e. random language runs) we used TextCat to classify documents as
English or German, and then translated German documents to English using Systran. We also
submitted runs based on indexing the random language documents without translating them, to
explore whether it is necessary to translate non-English annotations in order to achieve diversity.</p>
      <p>The remainder of this paper is organised as follows: Section 2 outlines that approaches that we
used for both retrieval and clustering, and details our submitted runs; Section 3 gives our results,
along with some preliminary analysis of them. Section 5 concludes the paper.
2</p>
    </sec>
    <sec id="sec-2">
      <title>System</title>
    </sec>
    <sec id="sec-3">
      <title>Description</title>
      <p>Our approach for the ImageCLEF photo retrieval task this year can be broken down into 3 main
phases, as follows:</p>
      <p>Retrieval. We rst run a text-based and image-based retrieval algorithms to create a
traditional ranked list of images, ordered by relevance to the query.</p>
      <p>Clustering. To improve the diversity of the results, the images towards the top of the result
list are clustered, which will output groups of similar images.</p>
      <sec id="sec-3-1">
        <title>Cluster Representative selection and Final Ranking. The clusters are then ranked</title>
        <p>in order of relevance to the query, and one representative image from each cluster is output
to the nal result list.</p>
        <sec id="sec-3-1-1">
          <title>Each of these is described in more detail below.</title>
          <p>2.1</p>
          <p>Retrieval
Since the topic set for 2008 consists of a subset of 39 of the 60 topics used in ImageCLEFPhoto
2006 and 2007, we used the remaining 21 topics as a training set of topics for system development.
Although we did not have ground truth for these topics for diversity, we did have ground truth
for retrieval, so we could use these topics to guide development of our baseline retrieval systems..
In the following subsections we outline our approaches used for text retrieval, image retrieval and
combined text and image retrieval.
2.1.1</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Text Retrieval</title>
        <p>
          For text retrieval we indexed the following eld from the structured annotation of each photo:
Title, Description, Notes and Location. The location eld was matched to a world gazetteer built
using data from the Geographic Names Information System [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] and the GEOnet Names Server [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
This allows us to automatically expand the location information to Town, State/County, Country,
Continent, instead of just the Town and Country provided. To formulating our queries, we made
use of the title and narr elds from the topics. Since the narr eld often includes information
about non-relevant documents, we parsed the narr eld to remove any sentences containing the
phrase `not relevant'. We perform text retrieval using the BM25 algorithm [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], as implemented
in the Terrier search engine platform [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], using the following parameters: k1 = 1:2; k3 = 8 and
b = 0:75. For runs that use pseudo relevance feedback, we used the diversion from randomness
approach [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], using the top 10 terms from the 3 documents for query expansion.
        </p>
        <p>
          For random annotation language runs, the annotation documents were processed using TextCat
[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], which is an implementation of the text categorization algorithm proposed by Cavnar &amp; Trenkle
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. TextCat uses a n-gram language model approach to language identi cation, i.e. a language
is recognised through the identi cation of distinct n-grams which occur frequently in the language
but seldom or not at all in other languages. After TextCat identi ed all the German sentences in
the set of random language annotation, this content was translated from German to English using
Systran Version:3.0 Machine Translator [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. The set of translations were then merged with the
other items in the dataset (ie the English sentences) and passed to the next stage of our system.
        </p>
        <p>For text retrieval we used 3 language conditions (english, translated random and untranslated
random), each with and without PRF, giving 6 distinct baseline text retrieval runs.</p>
      </sec>
      <sec id="sec-3-3">
        <title>2.1.2 Image Retrieval</title>
        <p>
          For our visual retrieval in ImageCLFEPhoto we make use of six global visual features which are
de ned in the MPEG-7 speci cation [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The following low-level features were used:
Scalable Colour (SC): derived from a colour histogram de ned in the HSV colour space.
It uses a Haar transform coe cient encoding, allowing scalable representation.
Colour Structure (CS): based on colour histograms, represents an image by both the
color distribution (similar to a color histogram) and the local spatial structure of the colour.
Colour Layout (CL): compact descriptor which captures the spatial layout of the
representative colours on a grid superimposed on an image.
        </p>
        <p>Colour Moments (CM): similar to Colour Layout, this descriptor divides an image into
4x4 subimages and for each subimage the mean and the variance on each LUV color space
component is computed.</p>
        <p>Edge Histogram (EH): represents the spatial distribution of edges in an image, edges are
categorized into ve types: vertical, horizontal, 45 degrees diagonal, 135 degrees diagonal
and non directional.</p>
        <p>Homogeneous Texture (HT): provides a quantitative representation using 62 numbers,
consisting of the mean energy and the energy deviation from a set of frequency channels.</p>
        <p>
          To compute an answer for a visual query, we take the topic images and extract from each
their six Query-Terms (i.e. a representation of the image by each of the six features previously
detailed). For each Query-Term we query its associated retrieval expert (i.e. visual index and
ranking function) to produce a ranked list. The ranking metric for each feature is as speci ed
by MPEG-7 and is typically a variation on Euclidian distance. For our experiments we produced
1000 results per Query-Term. Each ranked list is then weighted and the results from all ranked
lists are normalized using MinMax [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], then linearly combined using CombSUM [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
        <p>
          The weighting scheme we used for combination of visual experts is a query-dependant weighting
scheme for expert combination which requires no training data [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. This approach is based on
the observation that, if we were to plot the normalized scores of an expert against that of scores
of other experts used for a particular query, then the expert whose scores exhibited the greatest
initial change correlated with that expert being the best performer for that query. While we
acknowledge this observation is not universal, it has been shown emperically to improve retrieval
performance. This technique was also employed in DCU's participation in ImageCLEFPhoto 2007
[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
        </p>
        <p>For example, if our topic set has three query images, we will extract six features per image,
resulting in the generation of 18 Query-Terms. Each of these is then queried against its respective
retrieval expert to produce 18 ranked lists, then each ranked list is then individually weighted,
using the aforementioned technique and linearly combined through data fusion.
2.1.3</p>
      </sec>
      <sec id="sec-3-4">
        <title>Combination of Image and Text Retrieval</title>
        <p>
          As with the combination of visual features, image and text results are combined by weighting each
ranked list, normalizing the results using MinMax [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] and then linearly combined using CombSUM
[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. Our results on the set of 21 training topics showed that, for the text and image combination,
global weights of 0.7 for text and 0.3 for image outperformed the query-dependant weighting
approach described above for MAP, so we used global weights for combining text results with
image results.
2.2
        </p>
        <p>Clustering
The results of our baseline retrieval, whether text-based, image-based or a combination of the two,
are then clustered to increase the diversity of the results. All of our clustering approaches use text
information exclusively; we do not perform clustering on visual features. Since it was permitted
in this task to inspect the cluster tag from the topic and create higher level cluster types, we
classi ed the cluster tags into 3 categories: `location', `non-location' or `general'. The 39 topics
include 17 unique entries for the cluster tag. After classifying them into 3 categories we use a
di erent subset of the elds from the structured annotation for clustering, as follows:
Location: Topics for which only the location tag is used for clustering, corresponding to
the cluster tags `city', `state', `location', `country', `city national park' and `venue'.
Non-location: Topics for which the location tags is ignored for clustering, corresponding
to the cluster tags `animal', `sport', `bird', `weather condition', `vehicle type', `composition'
and `group composition'.</p>
        <p>General: Topics for which all tags used for retrieval are also used for clustering: `statue',
`venue', `landmark', `volcano' and `tourist attraction'.</p>
        <p>Apart from using a di erent subset of the annotation elds, each cluster type is treated
identically in our subsequent clustering. We also submitted runs that did not classify the cluster tag,
and treated all topics the same.</p>
        <p>
          For clustering, we employ K-Means clustering using the Text Clustering Toolkit, a toolkit for
clustering text documents using a number of standard algorithms [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Using annotation elds
from one of the 3 classes de ned above, we take the top X documents from our baseline retrieval
algorithms and cluster them using K-Means. Rather than choose one single value for X, we varied
this parameter in a number of runs, using values of 50, 100 and 150. We also varied k, the number
of clusters, using 20, 30 and 40 clusters. An additional variant used the the Calinski-Harabasz
index to automatically estimate the optimum number of clusters [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <p>Since we are clustering a small number of documents (ie. 150 or less), the tf-idf weighting
scheme may not have enough documents to calculate reliable inverse document frequency scores.
For this reason, we have used two separate approaches to term normalisation for cluster analysis:
term frequency (tf) and term frequency / inverse document frequency (tf-idf).
2.3</p>
        <p>Cluster Ranking and Cluster Representative Selection
The nal step is to rank all clusters in order of relevance to the query, and then select a
representative image for each cluster to output to the nal ranked list. To rank clusters, we take the
simple approach of using the maximum individual image score within the cluster as the overall
cluster score. We also use the same maximum image as the cluster representative, and our nal
output is k images (i.e. the number of clusters), corresponding to the most relevant image from
each cluster.
2.4</p>
        <p>Description of Submitted Runs
For our submission to ImageCLEFPhoto 2008 we created 13 baseline retrieval runs as follows:
3 language conditions (english, translated and untranslated random) with and without pseudo
relevance feedback for text only baselines; each of these 6 were combined with image retrieval to
give 6 text-image baselines; additionally, we had 1 image-only baseline. These 13 baseline runs
were used as input into clusterin using a number of parameter variations, creating a number of
di erent runs. The parameters were: X, the number of documents to cluster (50, 100 or 150);
k, the number of clusters (20, 30, 40 or automatic using the Calinski-Harabasz index); term
normalisation method (tf or tf-idf); cluster classi cation (classi cation used or classi cation not
used). This gives a total of 48 variations of clustering for each baseline submission. Since we cluster
the image-only baseline using each of the 3 language conditions, meaning we cluster 13 baselines
plus two addition language variants for the image baseline, we have 15x48 = 720 clustered runs
and 13 baseline runs, giving a total of 733 runs submitted.
3</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Results</title>
      <p>Our results are summarised in Table 1, which shows our baseline unclustered results and the best
clustered variation for each baseline. As one would expect our best results are given by combining
text retrieval with image retrieval, with the best MAP of 0.354 and the best P20 of 0.476 given
by the English text and image run using pseudo relevance feedback. The best result for Cluster
Recall at 20 (CR@20) is given by the English text and image with clustering, with a score of 0.552.
The clustered runs perform poorly for MAP, although this is not a surprise since we only rank the
top k for these runs, giving a truncated result list which would be expected to perform poorly on
MAP, which is dependent on the entire ranked list.</p>
      <p>We can see that, while pseudo relevance feedback leads to consistently better retrieval
performance in terms of MAP and P@20, it also decreases diversity. Runs without feedback consistently
perform better for CR@20, and this pattern can be observed both in clustered and unclustered
runs. Combining image and text retrieval also gives a large improvement in diversity: for English
language multimodal clustered runs, for example, the best performance for CR@20 is improved
from 0.514 to 0.552, an improvement of 7% (for unclustered English runs, the improvement is
12%). Since image retrieval and text retrieval naturally retrieve di erent relevant documents, it is
not a surprise that combining them gives a large improvement in CR@20. Combining image and
text retrieval also gives a large improvement in P@20, although it only gives a modest
improvement in MAP. The unclustered English text and image runs also show that it is possible to achieve
good CR@20 score without using clustering: the CR@20 score of 0.455 for this run is 29% above
the mean (0.455 compared with 0.353), without using any clustering. This unclustered run give
our most consistent performance across all evaluation measures, performing above the mean for
MAP, P@20 and CR@20: in fact, all our unclustered English and unclustered translated Random
runs achieve this, and our untranslated random runs beat the mean when combined with image
retrieval.</p>
      <p>Comparing random language runs with English runs, the best random runs perform quite close
to the English runs in terms of diversity, achieving a CR@20 score of 0.536, only 3% below the
best English score. Our untranslated runs also show that, by e ectively discarding 50% of the
documents in the collection (although, for the text and image runs, some of these `discarded'
documents may be recovered if their image score is high enough), we can still maintain a similar
level of diversity, with a score of 0.518 for the clustered run, only 3% below the score achieved
if we translate the annotation documents. It is an open question where this is an e ect of this
particular test collection or whether in real world scenarios there would be a higher correlation
between clusters and document languages.</p>
      <p>As expected, the runs that use image retrieval as the baseline retrieval perform quite poorly,
although the CR@20 scores that they achieve are not very far below the median, and at the
moment it is not possible to compare them to image-only runs from other groups.
4</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>In this paper we presented the approaches we used for the ImageCLEF 2008 Ad-hoc photographic
retrieval task, along with a preliminary analysis of our results. This preliminary analysis showed
that pseudo relevance feedback, while improving performance for standard retrieval measures,
harms performances when it comes to diversity. Combining image with text retrieval gives a large
improvement in diversity even when the improvement in overall retrieval (as measured by MAP)
is modest. Clustering the results of the baseline retrieval algorithms gives a large improvement
in diversity, while unsurprisingly harming overall retrieval performance. For the random language
condition (where half of the documents are in English and half in German) we have shown that it</p>
      <sec id="sec-5-1">
        <title>Language</title>
      </sec>
      <sec id="sec-5-2">
        <title>Translated</title>
      </sec>
      <sec id="sec-5-3">
        <title>Clustered PRF MAP P@20</title>
        <p>Yes
Yes
Yes
Yes
No
No
No
No
Yes
Yes
Yes
Yes
No
No
No
No
Yes
No</p>
      </sec>
      <sec id="sec-5-4">
        <title>Modality (Retrieval)</title>
        <p>Mean
Median
Min
Max
Txt
Txt
Txt</p>
        <p>Txt</p>
        <sec id="sec-5-4-1">
          <title>TxtImg TxtImg TxtImg TxtImg</title>
          <p>Txt
Txt
Txt
Txt
Txt
Txt
Txt
Txt</p>
        </sec>
        <sec id="sec-5-4-2">
          <title>TxtImg TxtImg TxtImg TxtImg</title>
        </sec>
        <sec id="sec-5-4-3">
          <title>TxtImg TxtImg TxtImg TxtImg</title>
          <p>Img
ImgTxt(Img)
ImgTxt(Img)
ImgTxt(Img)
No
No
Yes
Yes
No
No
Yes
Yes
No
No
Yes
Yes
No
No
Yes
Yes
No
No
Yes
Yes
No
No
Yes
Yes
No
Yes
Yes
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
No
No
No</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>[1] http://earth-info.nga.mil/gns/html/index.html.</mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>[2] http://mlg.ucd.ie/content/view/20/.</mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>[3] http://nhd.usgs.gov/gnis.html.</mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>[4] http://odur.let.rug.nl/~vannoord/textcat/.</mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>[5] http://www.systran.co.uk/.</mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Calinski</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Harabasz</surname>
          </string-name>
          .
          <article-title>A dendrite method for cluster analysis</article-title>
          .
          <source>Communications in Statistica</source>
          ,
          <volume>3</volume>
          :1{
          <fpage>27</fpage>
          ,
          <year>1974</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>W. B.</given-names>
            <surname>Cavnar</surname>
          </string-name>
          and
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Trenkle</surname>
          </string-name>
          .
          <article-title>N-Gram-Based Text Categorization</article-title>
          .
          <source>In Proceedings of Third Annual Symposium on Document Analysis and Information Retrieval</source>
          , pages
          <volume>161</volume>
          {
          <fpage>175</fpage>
          ,
          <string-name>
            <surname>Las</surname>
            <given-names>Vegas</given-names>
          </string-name>
          , NV,
          <fpage>11</fpage>
          -
          <lpage>13</lpage>
          April
          <year>1994</year>
          . UNLV Publications/Reprographic.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Edward</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Fox</surname>
            and
            <given-names>Joseph A.</given-names>
          </string-name>
          <string-name>
            <surname>Shaw</surname>
          </string-name>
          .
          <article-title>Combination of Multiple Searches</article-title>
          .
          <source>In Proceedings of the Third Text REtreival Conference (TREC-1994)</source>
          , pages
          <fpage>243</fpage>
          {
          <fpage>252</fpage>
          ,
          <string-name>
            <surname>Gaithersburg</surname>
            ,
            <given-names>MD</given-names>
          </string-name>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Anni</given-names>
            <surname>Jarvelin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Peter</given-names>
            <surname>Wilkins</surname>
          </string-name>
          , Tomasz Adamek, Eija Airio, Gareth Jones,
          <string-name>
            <given-names>Alan F.</given-names>
            <surname>Smeaton</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Eero</given-names>
            <surname>Sormunen</surname>
          </string-name>
          .
          <article-title>Dcu and uta at imageclefphoto 2007</article-title>
          .
          <source>In ImageCLEF 2007 - The CLEF Cross Language Image Retrieval Track Workshop</source>
          , Budapest, Hungary,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>B.S.</given-names>
            <surname>Manjunath</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Salembier</surname>
          </string-name>
          , and T. Sikora, editors. Introduction to MPEG-7:
          <string-name>
            <given-names>Multimedia</given-names>
            <surname>Content Description Language</surname>
          </string-name>
          . Wiley,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Iadh</surname>
            <given-names>Ounis</given-names>
          </string-name>
          , Christina Lioma, Craig Macdonald, and Vassilis Plachouras.
          <article-title>Research Directions in Terrier: a Search Engine for Advanced Retrieval on the Web</article-title>
          . Novatica/UPGRADE Special Issue on Web Information Access,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Stephen</surname>
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Robertson</surname>
            ,
            <given-names>S</given-names>
            teve Walker, , S
          </string-name>
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>M M</given-names>
          </string-name>
          <string-name>
            <surname>Hancock-Beaulieu</surname>
            , and
            <given-names>M</given-names>
          </string-name>
          <string-name>
            <surname>Gatford</surname>
          </string-name>
          .
          <article-title>Okapi at TREC-3</article-title>
          .
          <source>In Proceedings of the Third Text Retrieval Conference (TREC-3)</source>
          , pages
          <fpage>109</fpage>
          {
          <fpage>126</fpage>
          ,
          <string-name>
            <surname>Gaithersburg</surname>
            ,
            <given-names>MD</given-names>
          </string-name>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Peter</given-names>
            <surname>Wilkins</surname>
          </string-name>
          , Paul Ferguson, and
          <string-name>
            <surname>Alan</surname>
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Smeaton</surname>
          </string-name>
          .
          <article-title>Using Score Distributions for Querytime Fusion in Multimedia Retrieval</article-title>
          .
          <source>In MIR 2006 - 8th ACM SIGMM International Workshop on Multimedia Information Retrieval</source>
          , Santa Barbara, CA,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>