<!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>PKU at ImageCLEF 2008: Experiments with Query Extension Techniques for Text-Based and Content-Based Image Retrieval</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Graduate University of Chinese Academy of Sciences</institution>
          ,
          <addr-line>Beijing 100080</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Key Lab of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Science</institution>
          ,
          <addr-line>Beijing 100190</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>The Institute of Digital Media, School of EE &amp; CS, Peking University</institution>
          ,
          <addr-line>Beijing 100871</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we present our solutions for the WikipediaMM task at ImageCLEF 2008. The aim of this task is to investigate effective retrieval approaches in the context of a large-scale and heterogeneous collection of Wikipedia images that are searched by textual queries (and/or sample images and/or concepts) describing a user's information need. We first experimented with a text-based image retrieval approach with query extension, where the expansion terms are automatically selected from a knowledge base that is (semi-)automatically constructed from Wikipedia. We show how this open, constantly evolving encyclopedia can yield inexpensive knowledge structures that are specifically tailored to effectively enhance the semantics of queries. Encouragingly, the experimental results rank in the first place among all submitted runs. The second approach we experimented with is content-based image retrieval (CBIR), in which we first train 1-vs-all classifiers for all query concepts by using the training images obtained by Yahoo! search, and then treat the retrieval task as visual concept detection in the given Wikipedia image set. By comparison, this approach performs better than other submitted CBIR runs. Finally, we experimented with a cross-media image retrieval approach by combining and re-ranking text-based and content-based retrieval results. Despite the final experimental results were not formally submitted before the deadline, this approach performs remarkably better than the text-based retrieval or CBIR approaches.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>ImageCLEF 2008 contains five different tasks (i.e., photo retrieval, medical retrieval, visual concept detection,
medical annotation, and WikipediaMM). In this paper we present our efforts in the WikipediaMM task of
ImageCLEF 2008. This is our first year at ImageCLEF and the WikipediaMM task we participated in is also
offered for the first time. We participated in all steps of the task, including topic creation, retrieval experiments,
and relevance assessment.</p>
      <p>The aim of WikipediaMM 2008 task is to investigate effective retrieval approaches in the context of a large-scale
and heterogeneous collection of Wikipedia images that are searched by textual queries (and/or sample images
and/or concepts) describing a user’s information need. Towards this end, WikipediaMM 2008 task needs to deal
with searching 75 topics from approximately 150,000 images in the Wikipedia collection. Roughly speaking,
there are three challenges that the task participants must deal with:
y Scalability. A good retrieval approach should perform well on such a large image set.
y Robustness. A natural, and also maybe the most effective solution for this task is text-based image retrieval
approach since each image in this dataset is associated with user-generated alphanumeric, unstructured
metadata (e.g., a brief caption or description of the image). However, text-based retrieval methods should be
robust to noisy textual description that many images may be annotated with.
y Multi-modal Fusion. Considering the fact that some images in this dataset have few or even no descriptive
texts, it may be more preferable to combine text-based and content-based image retrieval (CBIR) for better
performance. However, a pure combination of traditional text-based and content-based approaches is not
adequate for dealing with the problem of Wikipedia image retrieval [1]. Therefore, how to effectively exploit
the correlation between different modalities of retrieval clues remains challenging.</p>
      <p>In this participation, we carry out three kinds of experiments. Our key idea is to experiment with different query
extension techniques to help the retrieval system get close to users’ real intent. In general, the oft-used approach
of query extension is to add terms to queries or modify preliminary queries. In our experiments, query extension
techniques are used in different situations. In the case of text-based image retrieval, the expansion terms are
automatically selected from a knowledge base that is (semi-)automatically constructed from Wikipedia. This
open, constantly evolving encyclopedia can yield inexpensive knowledge structures that are specifically tailored
to effectively enhance the semantics of queries. Encouragingly, the experimental results rank in the first place
among all submitted runs. In the case of CBIR, 1-vs-all classifiers are trained for all query concepts by using the
training images obtained by Yahoo! search. Then the retrieval task can be implemented as visual concept
detection in the given Wikipedia image set. Clearly, the training images obtained by Yahoo! search are used to
enhance the image retrieval task. In the last case, we experimented with a cross-media image retrieval approach
by combining and re-ranking text-based and content-based retrieval results. Here the CBIR results are used to
modify preliminary text-based retrieval results. Despite the final experimental results were not formally
submitted before the deadline, this approach performs remarkably better than the single text-based retrieval or
CBIR approaches.</p>
      <p>The rest of this paper is organized as follows. First of all, we present the architecture of our system for the
WikipediaMM task in section 2. Then three different approaches are described respectively in the following
three sections. The experimental results of our approaches are presented in section 6. Finally we draw a
conclusion and propose our future work.</p>
    </sec>
    <sec id="sec-2">
      <title>2. System Architecture</title>
      <p>
        In our system, we implemented a retrieve engine as a test environment for all methods. Fig.1 shows the
architecture of our system, illustrating how different components works together to generate retrieval results. The
components include:
returns relevant images.
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) Cross-Media Re-Ranking Module: Processing unit that combines the sets of returned images from CBIR and
text-based retrieval modules, and then performs cross-media re-ranking to obtain the final retrieval results.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Query Extension for Text Retrieval using Knowledge from Wikipedia</title>
      <p>A natural solution for WikipediaMM 2008 task is text-based image retrieval method. To help the retrieval system
get close to users’ real intent, query extension techniques are often used by adding terms to queries or modifying
preliminary queries. In this participation, we focus on how to automatically extract the expansion terms from a
knowledge base that is (semi-)automatically constructed from Wikipedia. Organized with concept identified by
URL (one user defined concept refers a single page) and links between concepts and external nodes, Wikipedia is
not only a Web collection but also an online knowledge center which assembles all users’ intelligences. Thereby,
it is naturally attractive and promising that this open, and constantly evolving encyclopedia can yield
inexpensive knowledge structures that are specifically tailored to effectively enhance the semantics of queries.
Recently, “Wikipedia mining” has been addressed as a new research area. WikiRelate [2] used links-based path
length for computing relatedness for given concepts; Nakayama et al. [3] proposed a link mining method called
PFIBF (Path Frequency – Inversed Backward link Frequency) as a base for Web thesaurus construction.
However, none of work is made on using Wikipedia as the knowledge base in information retrieval.
Fig. 2 shows the system framework and data flow of our text-based retrieval approach. As mentioned above, we
first construct a knowledge base from Wikipedia pages for query extension. Specifically, each non-administrative
Wikipedia page is used as a term/concept describing individuals (e.g., Jingtao Hu), concepts (e.g., Emissions
trading), locations (e.g., Big Ben), events (e.g., collapse of the World trade Center), and categories (e.g.,
microbiology). For a given term, the related terms can be easily extracted from the corresponding Wikipedia
page. Thus given a textual query (and/or concept), the query constructer searches the knowledge base with the
given query term and then extends the query with extracted terms. Finally, the extended query is given to the
retrieval engine to generate the final search results.</p>
      <p>(a) (b)</p>
      <p>Fig.2. Text-based retrieval with query extension. (a) System framework, and (b) Data flow.</p>
      <sec id="sec-3-1">
        <title>3.1 Knowledge Base Construction from Wikipedia for Query Extension</title>
        <p>
          In our system, the construction of the knowledge base from Wikipedia includes the following steps:
(
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) Near Pages Selection
We first index all titles of Wikipedia articles1, and then retrieve the Wikipedia pages with TF-IDF model. Only
pages with a similarity score higher than threshold θ (θ is set to be 0.9 in our experiments) are chosen as the
1 The Wikipedia articles and other related sources can be downloaded from http://download.wikipedia.org.
related pages of the input query.
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) Page Keyphrase Extraction
Keyphrases play a key role in the Wikipedia knowledge base construction. In a Wikipeida page, keyphrases or
keywords briefly describe the content of the concept. Thus they can be used to enhance the semantics of that
concept. When facing roughly 2,480,000 Wikipedia pages, we are motivated to summarize concepts and measure
the concept relatedness. Most existing keyphrase extraction algorithms, such as KEA [4], are supervised learning
methods which require human labeled training sets. However, it’s laborious to build such an appropriate training
set. Moreover, Wikipedia has various lengths of pages with complicated structure. Therefore, unsupervised
keyphrase extraction method is more preferable.
        </p>
        <p>
          In our system, we employ an unsupervised keyphrase extraction algorithm presented in our previous work [5].
This algorithm uses several set-independent feature weights, treating text in a page as a semantic network.
Several structure variables of Small-World Network (SWN) are used to select key nodes from the network as
keyphrases K = {(tk , P(tk ))} , each with a probability score P(tk ) indicating the importance of the extracted
keyphrase tk .
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) Term Selection for Query Extension
However, the top-ranked keyphrases can not be directly added for query extension. For instance, when searching
“saturn”, term “moon” may be extracted as keyphrase with a high score, but “moon” can appear on many pages
and should be considered more general. To address this problem, a statistical feature Inverse Backward link
Frequency ( ibf ) is calculated as:
        </p>
        <p>
          ibf = log(bf (tN) + β ) , (
          <xref ref-type="bibr" rid="ref1">1</xref>
          )
where bf (t) is the number of backward links in which the link text contains term t, N denotes the total number
of articles and β is a parameter in case bf (t) is zero.
        </p>
        <p>
          Therefore, the final weight of a keyphrase can be computed as:
wtk ∈K = P(tk ) ⋅ ibf (tk )
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          )
Then the keyphrases with their normalized weights are combined with the original query to construct an
extended query to be fed into the retrieve engine.
        </p>
        <p>Fig. 3 Examples for topic “daily show” and topic “Big Ben” in the knowledge base
For each topic, we can extract a knowledge tree which consists of the given topic, and keyphrases extracted from
Wikipedia pages. Moreover, this knowledge tree can be pre-constructed or online constructed. By treating each
query as a topic, the text-based retrieval system finds the topic in the knowledge base, and uses the weighted
keyphrases as query extension to enhance the system performance. It should be noted that if no relevant
keyphrases can be found in the base with respect to the query, it is very easy to perform the above steps online.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2 TF-IDF Model for Text Retrieval</title>
        <p>For the retrieve engine, we use the TF-IDF paradigm which is widely used in text mining and information
retrieval. It is defined as follows:</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Content-Based Image Classification and Retrieval</title>
      <p>In many real-world image datasets such as Wikipedia image collection, there are some images have few or even
no descriptive texts. To address this problem, content-based image retrieval (CBIR) is used in our system. Given
the pre-defined query concepts, 1-vs-all classifiers are trained for all these concepts by using the training images
obtained by Yahoo! search. Then the retrieval task can be treated as visual concept detection in the given
Wikipedia image set. Fig is a summary of our approach. Clearly, the training images obtained by Yahoo! search
are used for enhancing the image retrieval task.</p>
      <p>“skyscraper”
SVM</p>
      <p>SVM
training / testing</p>
      <p>Search engine</p>
      <p>
        Top k images
topic representation
In our implementation, the training process includes the following three steps:
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) Building the training set: Top k (k=30 in our system) images for each query concepts are first clawed from
Yahoo! image search engine. Then some unrelated images with respect to the concept are manually filtered out,
forming a positive training image set for each concept. Negative images for each concept are randomly selected
from positive images of the other concepts.
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) Building Bag of Words (BOW) representation: SIFT (or Scale-invariant feature transform [6]),
Dense-SIFT[9] and Color-Dense-SIFT are extracted from the training sets of all concepts. Then k-means
algorithm is employed to quantized different types of features, forming a combined visual codebook for three
types of features. All images are represented by a set of tokens of the visual words.
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) Supervised training for each topic: Unsupervised probabilistic latent semantic analysis (pLSA) [10]is
utilized to infer the latent topic distribution of the training images based on the BOW representation. Then
support vector machine (SVM) is used to train a one-class classifier for each concept in the latent topic space.
Given the trained 1-vs-all classifiers for all query topics, the testing process includes the following three steps:
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) Representing Wikipedia images with BOW: After feature extraction and quantization, each test image is
represented by the visual words from the trained codebook.
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) Inferring latent topic distribution of test images: Based on the trained pLSA model, we infer the latent topic
distribution of the test imagse.
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) Visual concept detection: For each test image, compute the responds of the trained SVMs for different
concepts. Concept is detected only when the corresponding respond is above a given threshold. For a concept
based retrieval, test images are finally ranked according to their responds with respect to the concept.
      </p>
    </sec>
    <sec id="sec-5">
      <title>5. Cross-media Re-ranking with Text and Visual Content</title>
      <p>For better retrieval performance, we study cross-media image retrieval by combining both text-based retrieval
and CBIR methodologies. In our system, we use the re-ranking scheme to combine the retrieval results of the
two engines. Given a query topic, either text-based retrieval or CBIR engine can return a set of result images. By
combining the two result sets, the returned images are re-ranked with weighting factors</p>
      <p>
        WeightedScore(q, d ) = w1 * Score(qtext , dtext ) + w2 * Score(qvisual , dvisual ) . (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
Here the key idea is to compare the overlap of the returned images between results returned by each engine. Let
R1 and R2 respectively denote the returned result sets of text-based and CBIR-based retrieval engines, and
M 1 and M 2 are their corresponding sizes. Let image di1 ∈ R1, i &lt; M 1 , and d 2j ∈ R2 , j &lt; M 2 , then we have a
overlap set G of the two results:
      </p>
      <p>G = {(di1, d 2j ) : di1 = d 2j , i &lt; M 1, j &lt; M 2} ,
where (di1, d 2j ) stands for an image both returned by the two engines. The numbers of overlap images in Top N
ranked images are computed as:</p>
      <p>H = #{di1 : di1 ∈ G, i &lt; N}, H2 = #{d 2j : d 2j ∈ G, j &lt; N}</p>
      <p>1
and the weight of each engine is calculated as:
wl =
σ / 2 + Hl / N ,
σ + ∑ Hl / N</p>
      <p>l
where l is the engine identifier and σ is an adjusting parameter.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Experiments</title>
      <p>In this section, we describe our experiments for WikipediaMM task at the ImageCLEF 2008. Note that some of
experimental results reported in this section were not formally submitted before the deadline.</p>
      <sec id="sec-6-1">
        <title>6.1 Experimental Methodology</title>
        <p>
          (
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
(
          <xref ref-type="bibr" rid="ref6">6</xref>
          )
(
          <xref ref-type="bibr" rid="ref7">7</xref>
          )
We can see that, by combining filename text and description to a single search field, text-based retrieval can
achieve a MAP of 25.65%. This is much better than the retrieval models with only filename or text description.
Clearly, it’s reasonable to include additional textual clues for retrieval.
Text-based retrieval with query expansion. By using the approach described in section 3, we add further terms
to a text query to effectively enhance its semantics (denoted by QE-SW-20 and QE-SWIBF-20, respectively with
different keyphrase extraction algorithms such as Small-World (SW) based algorithm and SW-IBF based
algorithm). We also conducted experiments by using other query extension methods, such as query extension
Fig. 6. Experimental Results of Precision at top N results of text-based retrieval with query
expansion from the automatically constructed Wikipedia knowledge base.
        </p>
        <p>In the experiments, we found that with a high threshold, the number of similar article titles is limited and there
are few terms to be added to the query. From the experimental results shown in Table 2, we can see that using
similar article titles in Wikipedia with respect to the queries directly does not help improving the performance of
text-based retrieval system.</p>
        <p>Link structure mining of Wikipedia can be used in Web thesaurus construction or query expansion. However, due
to the complexity of Wikipedia hyperlink network, there were too many noises in these links, including
Wikipedia system-generated links, and links that are rarely referenced. Therefore, we obtained even worse
results than text-based retrieval without query extension.</p>
        <p>For query expansion with the automatically constructed knowledge base, we found that the performance of the
text-based retrieval system using keyphrases with just high probabilities is worse than text-based retrieval
without any query extension. This means that keyphrases with general meanings have negative effects on
retrieval results.</p>
        <p>In contrast, by using the Keyword-IBF method, general keyphrases referenced by many articles are granted a
lower weight in the extended query. As a consequence, this query extension method tends to choose terms that
are more specific. The average improvement of all queries in this case is around 0.5% over text-based retrieval
methods without query extension.</p>
      </sec>
      <sec id="sec-6-2">
        <title>Text-based retrieval with query extension from the semi-automatically constructed knowledge base.</title>
        <p>Text-based image retrieval approach with query extension can perform better than traditional text retrieval
Fig. 7. Experimental Results of Precision at top N results of text-based retrieval with query
extension from the semi-automatically constructed Wikipedia knowledge base.</p>
        <p>By reasonably manual confirmation of the knowledge base, we obtained an obvious improvement of the retrieval
results. From Table 3 and Fig. 7, we can see that this approach performs much better than all other models. This
shows that query extension by using a knowledge construction procedure with a good keyphrase extraction
algorithm and reasonably manual confirmation can remarkably improve the retrieval performance.</p>
      </sec>
      <sec id="sec-6-3">
        <title>6.3 Experimental Results with CBIR</title>
        <p>For content-based image retrieval, the experimental results show that our BOW methods perform better than
other CBIR systems. Compared with the text-based systems, our CBIR obtained a comparable MAP (0.1912 of
CBIR vs. 0.21003 of text-based retrieval), and higher precisions in the top-ranked images (P@5=0.5333 and
P@10= 0.448 of CBIR vs. P@5=0.405333 and P@10=0.346667 of text-based retrieval). Although visual content
ambiguity hampers the overall performance (MAP) by returning images with similar low-level features, the
experimental results show that learning visual models from Web images (e.g., from Yahoo! search) do help to
rank the content-relevant images in higher places.</p>
        <p>Table 4: The testing results of CBIR.</p>
        <p>Run ID QE Modality MAP P@5 P@10 R-Prec
CBIR run1 with IMG 0.1912 0.5333 0.442667 0.292887
CBIR run2 with IMG 0.1928 0.5307 0.4507 0.2295
It also should be noted that, our CBIR approach performs best in all submitted CBIR runs in WikipediaMM 2008
task.</p>
      </sec>
      <sec id="sec-6-4">
        <title>6.4 Experimental Results with Cross-media Re-ranking</title>
        <p>
          In the last set of experiments, text-based and content-based image retrieval approaches are combined so as to
achieve better performance. In the experiments, we set M2 smaller than M1. This means that only the top-ranked
images returned by the CBIR approach are included in the re-ranking phase since the lower-ranked images may
have much higher probabilities to be noises in the CBIR system. Table 5 shows the testing results on the given
collection, where ReRank-Text-Visual-N denotes the combination of CBIR and text-based retrieval without query
extension, and ReRank-Semi-Visual-N denotes the combination of CBIR and text-based retrieval with query
extension from the semi-automatically constructed knowledge base, and N denotes the corresponding parameter
in formula (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) and (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ).
        </p>
        <p>
          Run ID
ReRank-Text-Visual-10
ReRank-Text-Visual-20
ReRank-Text-Visual-40
ReRank-Text-Visual-60
ReRank-Text-Visual-80
ReRank-Text-Visual-100
ReRank-Semi-Visual-10
ReRank-Semi-Visual-20
ReRank-Semi-Visual-40
ReRank-Semi-Visual-60
ReRank-Semi-Visual-80
ReRank-Semi-Visual-100
(a) (b)
Fig. 8 Performance of cross-media re-ranking: (a) Precision at top N results of cross-media re-ranking. (b) MAP
of re-ranking with different values of N in formula (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) and (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ).
        </p>
        <p>
          We used 6 values of N (N=10, 20, 40, 60, 80, 100) in formula (
          <xref ref-type="bibr" rid="ref6">6</xref>
          ) and (
          <xref ref-type="bibr" rid="ref7">7</xref>
          ). It’s interesting to find that when N
increases, the number of overlap images in top-N results of the two systems tends to be closer. In this case, the
parameters w1 and w2 tends to 0.5 and the preliminary results of the two systems are more likely to be equally
treated. As a consequence, the retrieval performance decreases when N increases. Therefore, we used N=10 in
the following experiments.
        </p>
        <p>As shown in Table 5 and fig. 8, the re-ranking approach performs remarkably better than the single text-based or
content-based retrieval approaches. For the combination of CBIR and text-based retrieval without query
extension, the average improvement of all the queries in ReRank-Text-Visual-10 is around 5.34% over the single
text-based retrieval approach (25.6498% of MAP, as shown in Table 1). While for the combination of CBIR and
text-based retrieval with query extension from the semi-automatically constructed knowledge base, the average
improvement for all the queries in ReRank-Semi-Visual-10 is around 1.403% over the single text-based retrieval
approach (34.44% of MAP, as shown in Table 3).</p>
        <p>Fig. 9 shows two examples of the re-ranking results. For query “golden gate bridge”, text-based retrieval returns
more relevant images than visual-based information retrieval. By re-ranking the two results, we get a better
performance and a higher precision of top ranked images than the previous two methods. For query “Singapore”,
visual-based retrieval does not perform well, however, combining CBIR result with text-based retrieval can still
improve the system performance.</p>
        <p>We also observed that the re-ranked results have higher precision of top-ranked images than results returned by
text-based retrieval or CBIR. There are some possible reasons. Text-based retrieval can return more relevant
images by searching keywords with image descriptions, while CBIR can obtain high precision of top-ranked
images but too many noises in lower-ranked images. Thus combining CBIR with text-based retrieval can help
increase the precision of top-ranked images.</p>
        <p>In conclusion, the cross-media re-ranking approach performs remarkably well. This indicates that cross-media
fusion is definitely a promising direction to investigate effective retrieval approaches in the context of a
large-scale and heterogeneous collection of images.</p>
        <sec id="sec-6-4-1">
          <title>Text-based</title>
        </sec>
        <sec id="sec-6-4-2">
          <title>Text-based</title>
        </sec>
        <sec id="sec-6-4-3">
          <title>Visual-based (a)</title>
        </sec>
        <sec id="sec-6-4-4">
          <title>Visual-based (b)</title>
        </sec>
        <sec id="sec-6-4-5">
          <title>Cross-media Re-ranking</title>
        </sec>
        <sec id="sec-6-4-6">
          <title>Cross-media Re-ranking</title>
          <p>Fig. 9 Search results for (a) topic “Golden Gate Bridge” and (b) topic “Singapore” using text-only (left),
visual-only (middle) and their combination (right).</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion and Future Work</title>
      <p>In this paper, we reported our solutions for WikipediaMM task at ImageCLEF 2008. We experimented with
text-based, CBIR and cross-media image retrieval approaches with query extension. Encouragingly, the
experimental results of our text-based approach rank in the first place among all submitted runs. Moreover, our
CBIR approach also performs better than other submitted CBIR runs. Despite the final experimental results were
not formally submitted before the deadline, our cross-media approach performs remarkably better than the single
text-based or content-based retrieval approaches.</p>
      <p>However, our experiments are just a first attempt towards effective cross-media retrieval in the context of a
large-scale and heterogeneous collection of images. The query extension techniques can still be improved.
Specifically, our knowledge base construction procedure strongly depends on the keyphrase extraction algorithm.
Thus how to more effectively extract concepts and their relationships from Wikipedia is still a challenging future
work.</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgement</title>
      <p>This work is supported by grants from Chinese NSF under contract No. 60605020, National Hi-Tech R&amp;D
Program (863) of China under contract No. 2006AA01Z320 and 2006AA010105.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.H.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.J.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Gao</surname>
          </string-name>
          , “
          <article-title>Exploiting multi-context analysis in semantic image classification</article-title>
          ,
          <source>” J. Zhejiang Univ. SCI.</source>
          , vol.
          <volume>6A</volume>
          , no.
          <issue>11</issue>
          , pp.
          <fpage>1268</fpage>
          -
          <lpage>1283</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Strube</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Ponzetto</surname>
          </string-name>
          . “WikiRelate!
          <article-title>Computing semantic relatedness using Wikipedia”</article-title>
          .
          <source>Proc. of National Conference on Artificial Intelligence (AAAI2006)</source>
          , pages
          <fpage>1419</fpage>
          -
          <lpage>1424</lpage>
          , Boston, Mass.,
          <year>July 2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>K.</given-names>
            <surname>Nakayama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hara</surname>
          </string-name>
          , S. Nishio, “
          <article-title>A thesaurus construction method from large scale web dictionaries”</article-title>
          ,
          <source>Proc. of IEEE International Conference on Advanced Information Networking and Applications (AINA2007)</source>
          , pp.
          <fpage>932</fpage>
          -
          <lpage>939</lpage>
          ,
          <year>2007</year>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>I.H.</given-names>
            <surname>Witten</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.W.</given-names>
            <surname>Paynter</surname>
          </string-name>
          , E. Frank,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gutwin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.G.</given-names>
            <surname>Nevill-Manning</surname>
          </string-name>
          ,
          <article-title>“KEA: practical automatic keyphrase extraction”</article-title>
          .
          <source>Proc. of Fourth ACM Conference on Digital Libraries</source>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.H.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <surname>Charles</surname>
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Ling</surname>
            ,
            <given-names>T.J.</given-names>
          </string-name>
          <string-name>
            <surname>Huang</surname>
          </string-name>
          , “
          <article-title>Keyphrase extraction using Semantic Networks Structure Analysis”</article-title>
          ,
          <source>Proc. of the sixth IEEE Int'l. Conf. on Data Mining (ICDM</source>
          <year>2006</year>
          ), Hong Kong,
          <year>2006</year>
          , pp.
          <fpage>275</fpage>
          -
          <lpage>284</lpage>
          , IEEE press.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lowe</surname>
          </string-name>
          , “
          <article-title>Object recognition from local scale-invariant feature</article-title>
          ,
          <source>” Proc. Int'l Conf</source>
          .
          <source>Computer Vision</source>
          (ICCV
          <year>1999</year>
          ), pp.
          <fpage>1150</fpage>
          -
          <lpage>1157</lpage>
          , Sep.
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Porter</surname>
          </string-name>
          ,
          <source>The Porter Stemming Algorithm</source>
          . (
          <year>2005</year>
          ) http://www.tartarus.org/~martin/PorterStemmer
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Apache</given-names>
            <surname>Lucene</surname>
          </string-name>
          . Apache Software Foundation, http://lucene.apache.org/java/docs/index.html,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Lazebnik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Schmid</surname>
          </string-name>
          , J. Ponce, “
          <article-title>Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories”</article-title>
          ,
          <source>Proceedings of the IEEE CVPR</source>
          <year>2006</year>
          , pp.
          <fpage>2169</fpage>
          -
          <lpage>2178</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T.</given-names>
            <surname>Hofmann</surname>
          </string-name>
          , “
          <article-title>Unsupervised learning by probabilistic latent semantic analysis”</article-title>
          ,
          <source>Machine Learning</source>
          <volume>41</volume>
          (
          <year>2001</year>
          )
          <fpage>177</fpage>
          -
          <lpage>196</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>