<!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>SINAI at ImagePhoto 2009</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>General Terms</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Measurement</institution>
          ,
          <addr-line>Performance, Experimentation</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>en. Computers Department. SINAI Group</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the fourth participation of the SINAI group, University of Ja¶en, in the Photo Retrieval task at Image CLEF 2009. Our system uses only the text of the queries, and a clustering system (based on kmeans) that combines di®erent approaches based on a di®erent use of the cluster data of the queries. The o±cial results shown that the combination between the title of each query and the other titles of the clusters obtain our best performance and that our clustering system did not work well.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        In this paper we describe our approach to the ImagePhoto 2009 evaluation campaign at CLEF, over
the new collection, which contains 498,920 images from Belga News Agency. Given a monolingual
English query the goal of the ImagePhoto task is to ¯nd as many relevant images as possible from
an image collection[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>In 2008 this task took a di®erent approach to evaluate the image clustering. This year the
organizers give special value to the diversity of results. Given a query the goal is to retrieve a
relevant set of images at the top of a ranked list. Text and visual information can be used to
improve the retrieval methods, and the main evaluation points are the use of pseudo-relevant
feedback (PRF), query expansion, IR systems with di®erent weighting functions and clustering
or ¯ltering methods applied over the cluster terms. Our system makes use of text information,
not visual information, to improve the retrieval methods. This year, a new method has been
implemented to cluster images.</p>
      <p>The following section describes the queries built and the new algorithm of clustering. In
Section 3 we explain the experiment carried out. Finally, the obtained results and conclusions are
presented in Section 4.</p>
    </sec>
    <sec id="sec-2">
      <title>System description</title>
      <p>
        In our system we have used an automatic modality, without user interaction, with English text
information (not visual information). The English collection documents have been preprocessed
as usual (English stopwords removal and the Porter's stemmer[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]). Then, it has been indexed
using as Information Retrieval (IR) system Lemur1.
      </p>
      <p>
        Past campaigns our adhoc system worked with di®erent IR systems, and test di®erent
approaches, such as combination of retrieved lists or fusion of a ¯ltering method that used some
clusters terms. The precision results obtained were very similar to di®erent languages[
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. In
2007, a simple combination method with both IR results was developed, and the evaluation of
the combined list of relevant documents ¯x the parameter that weight each list in 0.8 for Lemur
documents and 0.2 for Jirs documents. Using the same combination parameters the main
objective in 2008 has been to improve the basic case with di®erent combinations of methods and the
application of a ¯lter with the cluster term, a similar ¯ltering method is applied in our system
that works with geographical information[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In 2008 the use of the cluster term was oriented in
a ¯ltering way, and after the retrieval process the documents or passages marked as relevant are
¯ltered[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        The weighting function of the IR system is a parameter changed to test previous results and
based on them we have used Okapi. The use of Psedo-Relevance Feedback (PRF) to improve the
retrieval process is not conclusive, but in general the precision is increased in past experiments,
so it is always used with Lemur. The blind feedback algorithm is based on the probabilistic term
relevance weighting formula developed by Robertson and Sparck Jones[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>The evolution of our system introduces a clustering module, based on the algorithm kmeans,
and the creation of the ¯nal topics using the information of the title and the clusters terms.
2.1</p>
      <sec id="sec-2-1">
        <title>Building the queries</title>
        <p>The ¯rst module of our system uses the data of the title and the cluster title, in some cases, and
combines them to obtain the ¯nal topics. These topics, in a second step, are run over the IR
system, and a ¯nal list of relevant documents is obtained.</p>
        <p>The following four sets of topics have been built for these experimentation:
1. In the baseline case only the title of the query is used against the index of the IR system.
2. Each ¯nal topic is a combination between the query title and the title of the last cluster.
3. Each ¯nal topic is a combination between the query title and the other words of each cluster.</p>
        <p>The ¯gure 1 shows a general scheme of the system developed.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Clustering subsystem</title>
        <p>
          It has been found that the variability of top results in a list of documents retrieved as answer to a
query, the performance of the retrieval systems increases too, being in some cases more desirable
to have less but more varied items in this list [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. In order to increase variability, a clustering
system has been applied. This has also been used in other systems with the same aim [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. The
idea behind is rather simple: re-arrange most relevant documents so that documents belonging to
di®erent clusters are promoted to the top of the list.
        </p>
        <p>We have applied kmeans on each list returned by the Lemur IR system. For this, Rapid Miner
tool was used2. The clustering algorithm has tried to group these results, without any concern
on ranking, into 4 di®erent groups. The number of groups has been stablished at this value as
documents in the training set have this average number of clusters speci¯ed in their metadata.
1Available at http://www.lemurproject.org/
2Available at http://rapid-i.com</p>
        <p>Once each of the documents in the list has been labeled to its resulting cluster index, the list
has been reordered according to the described principle: we ¯ll the list by alternating documents
from di®erent clusters.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experiments description</title>
      <p>The data set contains 498,920 images from Belga News Agency, an image search engine for news
photographs. Each photograph will be up to a maximum of 512 pixels in either width or height,
accompanied by a caption composed of English text up to a few sentences in length. Di®erent to
the data last year, captions are provided without a speci¯c format to increase the challenges to
participants. Caption might contain date and place where image was captured.</p>
      <p>The topics statements include a query title with few words, and some cluster titles and
descriptions, to promote the diversity of the ¯nal results, as appear in the Figure 2. In our system
descriptions are not used.
In our system we have proved the following con¯gurations:
2. (2) SINAI2 - title and ¯nal cluster. This experiment combines the query title with the
title of the ¯nal cluster that appear in the topics ¯le. Lemur also uses Okapi as weighting
function and PRF.
3. (3) SINAI3 - title and all clusters. This experiment combines the query title with all
the words that appear in the titles of all the clusters. Lemur also uses Okapi as weighting
function and PRF.
4. (4) SINAI4 - clustering. The query title and each cluster title (except the last one that
combines all) are run against the index generated by the IR system. Several lists of relevant
documents are retrieved, and the clustering module combines them to obtain the ¯nal list of
relevant documents. The aim of this experiment is to increment the diversity of the retrieved
results using a clustering algorithm.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Results and Discussion</title>
      <p>The data set of the collection has been indexed using Lemur3 IR system, by applying Okapi
weighing function and using Pseudo-Relevance Feedback (PRF). We have used only textual information
in English. Table 1 shows the results obtained in our four experiments submitted this year.</p>
      <p>Experiment
sinai1 T TXT
sinai2 TCT TXT
sinai3 TCT TXT
sinai4 TCT TXT</p>
      <p>We have experimented with di®erent kinds of cluster combination. However, as we can see in
Table 1, the application of clustering does not improve the results greatly. In fact, only in the run
used SINAI3 the query the original title and the titles of all the clusters overcomes the baseline
case SINAI1 that only uses the original title. Unfortunately, the experiment SINAI4 that applies
our clustering and fusion approach has achieved the worst results. Thus, the obtained results show
that it is necessary to continue investigating the clustering methodology. In addition, the use of
visual information could improve the ¯nal system.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgements</title>
      <p>This work has been supported by the Regional Government of Andaluca (Spain) under
excellence project GeOasis (P08-41999), the Spanish Government under project Text-Mess TIMOM
(TIN2006-15265-C06-03) and the local project RFC/PP2008/UJA-08- 16-14.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Paramita</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanderson</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Clough</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <article-title>Diversity in photo retrieval: overview of the ImageCLEFPhoto task 2009</article-title>
          .
          <source>CLEF working notes 2009</source>
          , Corfu, Greece,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M. F.</given-names>
            <surname>Porter</surname>
          </string-name>
          :
          <article-title>An algorithm for su±x stripping</article-title>
          .
          <source>In Readings in information retrieval. ISBN 1-55860-454-5</source>
          ; pages
          <fpage>313</fpage>
          -
          <lpage>316</lpage>
          . Morgan Kaufmann Publishers Inc.,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D</given-names>
            <surname>¶</surname>
          </string-name>
          <article-title>³az-</article-title>
          <string-name>
            <surname>Galiano</surname>
            ,
            <given-names>M.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garc</surname>
          </string-name>
          <article-title>¶³a-</article-title>
          <string-name>
            <surname>Cumbreras</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <article-title>Mart¶³n-</article-title>
          <string-name>
            <surname>Valdivia</surname>
            ,
            <given-names>M.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montejo-Raez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <article-title>and Uren~a-Lo¶pez, L.A.: SINAI at ImageCLEF 2006</article-title>
          .
          <source>In Proceedings of the Cross Language Evaluation Forum (CLEF</source>
          <year>2006</year>
          ),
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D</given-names>
            <surname>¶</surname>
          </string-name>
          <article-title>³az-</article-title>
          <string-name>
            <surname>Galiano</surname>
            ,
            <given-names>M.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garc</surname>
          </string-name>
          <article-title>¶³a-</article-title>
          <string-name>
            <surname>Cumbreras</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <article-title>Mart¶³n-</article-title>
          <string-name>
            <surname>Valdivia</surname>
            ,
            <given-names>M.T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Montejo-Raez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <article-title>and Uren~a-Lo¶pez, L.A.: SINAI at ImageCLEF 2007</article-title>
          .
          <source>In Proceedings of the Cross Language Evaluation Forum (CLEF</source>
          <year>2007</year>
          ),
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Perea-Ortega</surname>
            ,
            <given-names>J.M</given-names>
          </string-name>
          ,
          <article-title>Garc¶³a-</article-title>
          <string-name>
            <surname>Cumbreras</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <article-title>Garc¶³a-</article-title>
          <string-name>
            <surname>Vega</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Montejo-Raez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          : GEOUJA System. University of Ja¶
          <article-title>en at GEOCLEF 2007</article-title>
          .
          <article-title>In Proceedings of the Cross Language Evaluation Forum (CLEF</article-title>
          <year>2007</year>
          ),
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D</given-names>
            <surname>¶</surname>
          </string-name>
          <article-title>³az-</article-title>
          <string-name>
            <surname>Galiano</surname>
            ,
            <given-names>M.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garc</surname>
          </string-name>
          <article-title>¶³a-</article-title>
          <string-name>
            <surname>Cumbreras</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <article-title>Mart¶³n-</article-title>
          <string-name>
            <surname>Valdivia</surname>
            ,
            <given-names>M.T.</given-names>
          </string-name>
          and
          <article-title>Uren~a-L¶opez</article-title>
          , L.A.:
          <article-title>SINAI at ImageCLEF 2008</article-title>
          .
          <source>In Proceedings of the Cross Language Evaluation Forum (CLEF</source>
          <year>2008</year>
          ),
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Robertson</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Sparck Jones</surname>
          </string-name>
          :
          <article-title>Relevance weighting of search terms</article-title>
          .
          <source>Journal of the American Society for Information Science</source>
          .
          <year>1976</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karger</surname>
            ,
            <given-names>D.R.</given-names>
          </string-name>
          :
          <article-title>Less is more: probabilistic models for retrieving fewer relevant documents</article-title>
          .
          <source>SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval</source>
          . Seattle, Washington,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Ah-Pine</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bressan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clinchant</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Csurka</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hoppenot</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Renders</surname>
            ,
            <given-names>J.M.:</given-names>
          </string-name>
          <article-title>Crossing textual and visual content in di®erent application scenarios</article-title>
          .
          <source>Multimedia Tools Appl.</source>
          , pages
          <volume>31</volume>
          {
          <fpage>56</fpage>
          . Volume
          <volume>41</volume>
          , number 1. Kluwer Academic Publishers, ISSN
          <volume>1380</volume>
          -7501.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Chevallet</surname>
            ,
            <given-names>J.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lim</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Radhouani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Using Ontology Dimensions and Negative Expansion to solve Precise Queries in CLEF Medical Task</article-title>
          .
          <source>Working Notes of the 2005 CLEF Workshop</source>
          . Sep,
          <year>2005</year>
          . Vienna, Austria.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>