<!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>BTU DBIS' Multimodal Wikipedia Retrieval Runs at ImageCLEF 2011</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>David Zellhofer</string-name>
          <email>david.zellhoefer@tu-cottbus.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thomas Bottcher</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Brandenburg Technical University, Database and Information Systems Group</institution>
          ,
          <addr-line>Walther-Pauer-Str. 1, 03046 Cottbus</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this work, we summarize the results of our rst participation in the Wikipedia Retrieval task. For our experiments, we rely on a cognitively motivated IR model: the principle of polyrepresentation. The principle's core hypothesis is that a document is de ned by di erent representations such as low-level features, or textual content that can be combined in a structured manner re ecting the user's information need. For our rst participation, we used mono-lingual English retrieval in combination with global low-level features without further user interaction or query modi cation techniques. Our best NOFB reached rank 64 or rank 13 of the mono-lingual English runs. This result is promising as we have not used structural information about the documents. Additionally, our ndings are indicating the correctness of the polyrepresentative hypothesis for multimodal retrieval.</p>
      </abstract>
      <kwd-group>
        <kwd>Content-Based Image Retrieval</kwd>
        <kwd>Information Retrieval</kwd>
        <kwd>Result Fusion</kwd>
        <kwd>IR Model</kwd>
        <kwd>Polyrepresentation</kwd>
        <kwd>Experiments</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The Database and Information Systems Group of the Brandenburg Technical
University (DBIS) is participating for the rst time in ImageCLEF's Wikipedia
Retrieval task [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Hence, our rst submitted runs are focussing at gaining
experience with the handling of the task and at testing recently published theoretical
results.
      </p>
      <p>
        Over the past years, DBIS has worked on establishing a new query language,
the commuting quantum query language (CQQL) [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], which is capable of
combining similarity predicates as found in information retrieval (IR) as well as
relational predicates common in databases (DB). In addition, CQQL is an
extension of the relational domain calculus, i.e., it can be directly executed within
a relational DB system [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. To combine both data access paradigms, CQQL relies
on the mathematical foundations of quantum mechanics and logic. For the scope
of this paper, we will not emphasize the theoretical implications of the quantum
theoretical background. However, the relation of CQQL to fuzzy logic [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] can
be found in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Its relation to probabilistic IR models is discussed in [
        <xref ref-type="bibr" rid="ref21 ref25">21, 25</xref>
        ].
Recently, the correlation between the principle of polyrepresentation [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and
quantum mechanics-inspired IR models has been discussed in the community
[
        <xref ref-type="bibr" rid="ref21 ref24 ref5">21, 5, 24</xref>
        ]. Being based on van Rijsbergen's basal work [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], two approaches are
researching a combination of the principle of polyrepresentation with ideas
derived from quantum mechanics [
        <xref ref-type="bibr" rid="ref10 ref23">10, 23</xref>
        ]. Only the latter approach is dealing with
multimodal retrieval explicitly. Thus, it will be used as the theoretical IR model
for the remainder of this paper.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Retrieval Model</title>
      <p>
        The discussed IR model is using CQQL to implement the ndings of the
cognitively motivated principle of polyrepresentation. The main hypothesis of the
principle is that a document is de ned by various functionally and cognitively
di erent representations [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. \Functionally di erent representations are the title
of a document, the actual textual content, or an abstract that has been created
by a sole actor, e.g., the author. Cognitively di erent representations denote
such representations that have been created by another actor such as a retrieval
model1, summaries written by a librarian, or former related INs. Hence, a
combination of di erent IR systems that describe the same document (e.g. examined
in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]) can be regarded polyrepresentative as well." [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]
      </p>
      <p>
        If one combines these representations into a so-called \cognitive overlap"
(CO), documents that are contained within this overlap are likely to be relevant
w.r.t. a user's information need (IN). As a consequence, it is assumed that this
combination of representation can compensate the insecurity of relevance
assessment of retrieved documents [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The utility of the principle of polyrepresentation
has been shown for (textual) IR [
        <xref ref-type="bibr" rid="ref16 ref7">16, 7</xref>
        ]. In addition, both aforementioned works
address actual means of construction of a cognitive overlap. As a result, it could
be shown that highly structured queries2 modeling a CO lead to higher precision
in direct comparison to unstructured queries such a bag-of-words.
      </p>
      <p>
        As said before, our research relies on CQQL to re ect the principle of
polyrepresentation in a query language. We believe that the principle provides a sound
theoretical framework for dealing with the various representations that are
inherent within a multimedia document. As a cognitively motivated model, it does
not stop here. Furthermore, it can include additional information that is
important during a search task, such as the user's context. The representations of a
document can have di erent origins such as copyright information stored in a
DB, text annotations or low-level features like a color histogram. This data has
to be accessed and combined in a consistent manner in order to retrieve
multimodal data. CQQL provides means to query both IR and DB systems while
maintaining their semantics. For instance, representations from a relational DB
can be restricted in Boolean fashion to evaluate only against true or false (i.e. 1
1 Ingwersen and Jarvelin regard an IR system as a peer actor because it assesses the
relevance of a document on basis of di erent representations. Thus, it participates
as well in the search.
2 A query combining Boolean connectors to combine parts of a query.
or 0). In contrast, representations originating from an IR system maintain their
similarity semantics in an interval of [0; 1] (for details see [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]).
      </p>
      <p>To simplify, CQQL can be considered a query language dealing with
probabilities that is consistent with the laws of the Boolean algebra. The probabilities
denote how likely it is that a certain document's representation is relevant to the
CO and therefore the user's IN. In the next section, we will sketch the arithmetic
evaluation of CQQL as it is necessary for the understanding of this paper.
2.1</p>
      <sec id="sec-2-1">
        <title>Evaluation of CQQL</title>
        <p>Given that f'(d) is the evaluation of a document d w.r.t. a CO modeled by a
CQQL query. To model a CO, various representations ' can be linked in an
arbitrary manner using the conjunction (1), disjunction (2), or negation (3). If
' is atomic, f'(d) can be directly evaluated yielding a value out of the interval
[0; 1] As stated before, the actual value of a representation can be calculated by
a similarity measure or a Boolean evaluation carried out by a DB system or the
like.</p>
        <p>
          After a necessary syntactical normalization step [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], the evaluation of a
CQQL query modeling the CO is performed by recursively applying the
succeeding formulas until the atomic base case is reached:
        </p>
        <p>f'1^'2 (d) = f'1 (d) f'2 (d)
f'1_'2 (d) = f'1 (d) + f'2 (d)</p>
        <p>(f'1 (d) ^ f'2 (d))
f:'(d) = 1
f'(d)
An example of an arithmetic evaluation of a sample query is given in Sec. 3.1.
The result of an evaluation of a document d yields the probability of relevance
of d w.r.t. the given CO. This probability value is then used for the ranking of
the result list of documents.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Weighting in CQQL</title>
        <p>
          In order to steer the in uence of certain representation onto the CO, CQQL has
been extended with a weighting scheme [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. This weighting scheme can be used
for relevance feedback (RF) during the retrieval process. Weighting is a crucial
part of our machine-based learning supported user interaction model discussed
in [
          <xref ref-type="bibr" rid="ref22 ref25">22, 25</xref>
          ]. Although an evaluation of RF for multimodal retrieval is not in the
scope of this paper, we will outline how weights are embedded in a CQQL query
because they will occur with xed settings in Sec. 3 as part of the experiments.
        </p>
        <p>Eq. 4 denotes a weighted conjunction, whereas Eq. 5 states a weighted
disjunction. A weight i is directly associated with a logical connector and steers
the in uence of a representation 'i on the evaluation. To evaluate a weighted
(1)
(2)
(3)
CQQL query, the weights are syntactically replaced by constant values according
to the following rules:</p>
        <p>
          ('1 _ : 1) ^ ('2 _ : 2)
Recently conducted experiments provided promising results about the utility of
the principle of polyrepresentation for the content-based image retrieval (CBIR)
domain [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. The same ndings apply to the textual IR domain [
          <xref ref-type="bibr" rid="ref16 ref7">16, 7</xref>
          ]. As a
consequence, our experiments are focussing on the combination of both worlds.
Yet, we are not researching representations derived from image metadata or
the like. For the scope of this paper, experiments have been conducted only
on textual information and low-level features alone. In addition, our rst runs
do not incorporate any user modi cation of the query or interaction during the
retrieval process such as relevance feedback. For the sake of simplicity, we do not
use other languages than English during the experimental retrieval. Although all
nodes within the provided XML documents were indexed, structural information
such as \title" has not been used explicitly.
        </p>
        <p>
          In order to obtain the di erent representations for each document, we used
the Indri 5 IR engine from the Lemur project3. All text retrieval has been carried
out by this engine. The global low-level features of the images involved in the
task were extracted by LIRE 0.8 [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. Tab. 2 lists all available low-level features
that are mostly part of the MPEG-7 standard besides CEDD (also provided
during the Wikipedia Retrieval task [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]) and FCTH. Regarding the principle
of polyrepresentation, the LIRE features are di erent functional representations
of a document while Indri provides a cognitively di erent one. To address the
fact that multiple query-by-example (QBE) image documents were available
for each query, we have created averaged representations to keep the evaluation
simple (see Sec. 4 for details). To obtain averaged representations, we calculated a
similarity value for each representation of each QBE image and a given document
of the collection. Then, we calculated the arithmetic mean over all QBE image
similarities for a given document.
        </p>
        <p>
          Before our ImageCLEF-related experiments, we have analyzed the
performance of di erent queries that involved LIRE-based representations alone (see
Tab. 1). In order to obtain meaningful results, we tested various features and
feature combinations with the following well-known collections \Wang" [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], \UCID
v2" [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], and \Caltech 101" [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Additionally, we have used the \Bali" collection
[
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] as a representative of personal holiday photographies. Fig. 1 illustrates some
of the ndings. For the scope of this paper it is notable that the highly structured
queries Q10 and Q9 perform almost as well as QAND or QMAX while relying
on about half of the available features. The features used in Q10 and Q9 have
3 http://www.lemurproject.org/
been chosen because of their performance when used on their own and to mirror
assumptions about the utility of a combination of structural and color-based
features as stated in [
          <xref ref-type="bibr" rid="ref2 ref3">3, 2</xref>
          ].
        </p>
        <p>To evaluate the principle of polyrepresentation's utility for multimodal
retrieval, we used two di erent strategies to model the CO and to assess the
relevance of a document w.r.t. a given query.
Our rst approach used the direct evaluation of CQQL queries. The experiment
subdivides into three parts that are related to the used modalities, features, and
structural characteristics of the query itself. If weights were present in a query,
they were set to 0:5.</p>
        <p>Group 1 consists of the queries Eq. 6, Eq. 7, and Eq. 8. All have in common
that the LIRE-based part of the CO model is based on Q10 (see Sec. 3). For
the discussed runs, COLORLAY OU T has been removed. This is due to the
fact that this feature could not be extracted for a number of image documents.
See Tab. 2 for a list of all missing features. This problem has been caused by
corrupted ICC pro les within the ImageCLEF image document corpus. These
corruptions resulted in a crash of Java's ImageIO during le access.</p>
        <p>
          The textual part of the CO (denoted as IN DRIsxim, whereas x stands for
the query type) has been calculated by Indri using di erent search strategies.
All Indri queries used Krovetz stemming and case normalization4. The English
4 See http://lemur.sourceforge.net/indri/IndriIndexer.html for the standard settings.
query text de ned by the task [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] served directly as query terms. The di erences
of the Indri query formulation are as follows.
        </p>
        <p>Q71 72 : IN DRIsoirmdered window ^ ((CEDDsim _ 1; 2 F CT Hsim)^
(6)
(T AM U RAsim ^ EDGEHIST OGRAMsim))
Here, the English query text has been input directly including the information
that the query terms in a document have to appear ordered with at most 4 terms
between them using Indri's ordered window operator. A sample Indri query for
the text \close up of trees" would look like this: #combine(close up of trees
#5(close up of trees)).</p>
        <p>In combination with the LIRE-based representations this results in the
following arithmetic evaluation given in pseudo code:
q10 = (1 ((1 (cedd (1 (1
relevance = indri q10;
1)))) (1 (f cth (1 (1
2))))));
Q73 : IN DRIsoirmdered window+SW ^ ((CEDDsim _ 1; 2 F CT Hsim)^
(T AM U RAsim ^ EDGEHIST OGRAMsim))
This query is equal to 6 but uses stop word elimination.</p>
        <p>Q79 : IN DRIspilmain combine ^ ((CEDDsim _ 1; 2 F CT Hsim)^</p>
        <p>(T AM U RAsim ^ EDGEHIST OGRAMsim))
This query is equal to 6 but drops the ordered window operator resulting in
queries such as #combine(close up of trees).</p>
        <p>Group 2 consists of one query that uses the modi ed version of Q10 alone in
order to measure the \raw" low-level feature performance.</p>
        <p>Q110 : (CEDDsim _ 1; 2 F CT Hsim)^
(T AM U RAsim ^ EDGEHIST OGRAMsim)
Group 3 contains COs that have not been sent in before. Because of the missing
features for some documents (see Tab. 2), we have investigated the in uence of
such incomplete information on the retrieval performance of our approach.</p>
        <p>Q500 : IN DRIsoirmdered window ^ (^(All LIRE f eatures))
For the rst query, we used the best performing Indri query in a conjunction
with a weighted conjunction of all 9 LIRE features.</p>
        <p>Q600 : ^(IN DRIsoirmdered window; All LIRE f eatures)</p>
        <p>
          i
i
(7)
(8)
(9)
(10)
(11)
The second examined CO is modeled by a weighted conjunction of all LIRE
features in addition to the representation provided by Indri. The di erence to
Eq. 10 is that the textual representation does not have more impact on the
result. Here, it is a mere peer amongst all other representations.
For our second approach, we have examined a pre- ltering approach that is
closely related to [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. First, we have calculated the relevance of each document
according to Indri's ordered window operator including stop word elimination
as described for Eq. 7. Second, we have calculated the average similarity for
each image document. That is, we have computed each LIRE feature similarity.
Then, all similarity values have been averaged to obtain an averaged similarity
value. Furthermore, we averaged the result over all QBE documents for each
query. The result list of the image retrieval was then reduced to the top 5000
documents.
        </p>
        <p>To combine both result lists, we regarded the Indri list as a pre- lter. In other
words, we only considered documents that are present in this list as potentially
relevant. In a next step, we obtained the relevance score of a document d in the
Indri list as the document's base score. If document d was also present in the
low-level feature-based result list, we improved its relevance score by 0:15. This
re ects the principle of polyrepresentation's hypothesis that two cognitively
different representations \pointing" at one document are more likely to be relevant.</p>
        <p>This approach leaves the proposed usage of CQQL and is merely based on
heuristics. The choice of a boosting factor of 0:15 is based on experiments
carried out with the ImageCLEF 2010 collection and ground-truth alone. A formal
justi cation cannot be given. This approach is listed in Tab. 3 as run #64.
3.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Strategy Comparison</title>
        <p>
          In compliance with the ndings from [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] our pre- ltering approach performed
best. A direct comparison to the other contributors is di cult as not enough
information about their runs is available at the present moment. Nevertheless,
we compare our approaches with the best performing, automatic English-only
textual run #45. Tab. 3 gives an overview of our overall performance. We assume
that run #45 uses some kind of optimized query formulation strategy while we
are using a fairly naive approach towards the textual retrieval part. That is,
we basically hand the query text directly to the Indri IR engine and neglect
additional structural information, e.g., if a term is present in a document's title.
        </p>
        <p>Still, our pre- ltering approach #64 reaches 84,39% MAP performance of the
best textual run #45, whereas the pure CQQL runs are in the range of 80.58%
to 75.39%. As expected, the plain visual run #110 performs very bad (1.31%
MAP of #45). This behavior is in accordance with the result trend from former
ImageCLEF Wikipedia Retrieval tasks.</p>
        <p>
          An interesting nding from [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] could be duplicated within the Wikipedia
Retrieval task. It seems that there is evidence that a structured combination of
functionally di erent representations (here: low-level features) can compensate a
large amount of representations or even surpass it in terms of retrieval quality. In
our scenario, run #500 makes use of 9 CBIR-based representation while run #64
and #71-79 use only 4, i.e., 44 % of the available features. This is strengthening
the polyrepresentative hypothesis as well as it might be a fruitful area of future
research because the actual calculation of such representation can be a costly
operation { especially in the eld of multimedia retrieval. Concluding from the
results of [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], we did expect a slightly better performance for queries involving
all features (see run #500) in comparison to, e.g., #71. In our opinion, the
presence of missing representations lead to the inverse e ect. Hence, it cannot
be generalized that a structured combination of representations will outperform
an unstructured query in every case. This leaves room for further research.
        </p>
        <p>Run #600 (without an emphasis on textual representations) results in a
MAP performance of 19.38% clearly showing that the main contribution of the
retrieval quality is derived from textual representations.</p>
        <p>
          Regarding fusion strategies, the ndings from the textual domain as stated
in [
          <xref ref-type="bibr" rid="ref16 ref7">16, 7</xref>
          ] that highly structured queries alone will improve the retrieval quality
cannot be justi ed for the multimodal retrieval domain for now. Our current
results indicate that a cleverly chosen fusion strategy itself is contributing to the
overall retrieval quality of a multimodal retrieval system.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Conclusion and Future Work</title>
      <p>Regarding our low experience with the Wikipedia Retrieval task, we are
satis ed with our results. Our best run is place at rank 64, i.e., rank 13 of the
mono-lingual English runs. If we consider NOFB runs only, we get rank 4 being
the only multimodal approach in this mono-lingual ranking. In accordance with
our ndings about the contribution of textual representations, we assume that
the poor performance in comparison to the text-only runs is due to our naive
approach towards textual IR. Hence, we would really appreciate the cooperation
with other working groups having a strong textual IR experience. In future, we
will incorporate the usage of structured information within the XML documents
as it is already supported by the CQQL-based query model.</p>
      <p>
        Another criticism of our approach is the over-simpli cation of the principle
of polyrepresentation for the CBIR part of our work. The averaging of
representations in order to deal with multiple QBE documents within one query removed
important semantics from the query. To model the CO in a better way, each QBE
document has to be used as an additional cognitively di erent representation of
the query. We assume that this might improve the retrieval quality because it is
likely to re ect the user's subjective IN more complete. In combination with our
RF approach [
        <xref ref-type="bibr" rid="ref20 ref22">22, 20</xref>
        ], this might improve the overlap between the user's
cognitive structures { e.g. expressed by di erent images with di erent contributions
to the user's IN{ and the actual query.
      </p>
      <p>Another eld for further research is the dealing with missing representations.
This is an important issue as it cannot be assumed that all queried
representations are always present. For instance, this problem is likely to re-appear when
distributed IR systems are used or cross-media retrieval is concerned.</p>
      <p>Although it is somewhat out of the scope of system-centric initiatives such as
ImageCLEF, we will continue our research on integrating contextual information
about the user.</p>
      <p>1
0.95
0.9
0.85
0.8
0.75
0.7
0.65
0.6
0.55
0.5
0.45
0.4
0.35
0.3
0.25
0.2
0.15
0.1
0.05
0
1
0.95
0.9
0.85
0.8
0.75
0.7
0.65
0.6
0.55
0.5
0.45
0.4
0.35
0.3
0.25
0.2
0.15
0.1
0.05
0</p>
      <p>P at 5</p>
      <p>P at 5</p>
      <p>RF AND
Pseudo RF</p>
      <p>AVG
AND</p>
      <p>Q10
ComboOR</p>
      <p>Q9</p>
      <p>Q13
Colorhist
RF Q10</p>
      <p>MAX</p>
      <p>RF AND
Pseudo RF</p>
      <p>AVG
AND</p>
      <p>Q10
ComboOR</p>
      <p>Q9
RF Q10</p>
      <p>MAX
Colorhist</p>
      <p>RF AND
Pseudo RF</p>
      <p>AVG
AND</p>
      <p>Q10
ComboOR</p>
      <p>Q9</p>
      <p>Q13
Colorhist</p>
      <p>MAX
RF Q10</p>
      <p>RF AND
Pseudo RF</p>
      <p>AVG
AND</p>
      <p>Q10
ComboOR</p>
      <p>RF Q10</p>
      <p>Q9</p>
      <p>Q13
Colorhist</p>
      <p>MAX</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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>Ah-Pine</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jacquet</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perronnin</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanchez</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Minoukadeh</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>XRCE's Participation in Wikipedia Retrieval, Medical Image Modality Classi cation and Ad-hoc Retrieval Tasks of ImageCLEF 2010</article-title>
          . In: Braschler,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Harman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Pianta</surname>
          </string-name>
          , E. (eds.)
          <article-title>CLEF 2010 LABs and Workshops</article-title>
          , Notebook Papers,
          <fpage>22</fpage>
          -
          <lpage>23</lpage>
          September 2010, Padua, Italy (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <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>Information Retrieval</source>
          <volume>11</volume>
          ,
          <issue>77</issue>
          {
          <fpage>107</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Eidenberger</surname>
          </string-name>
          , H.:
          <article-title>How good are the visual MPEG-7 features?</article-title>
          <source>In: SPIE &amp; IEEE Visual Communications and Image Processing Conference</source>
          . pp.
          <volume>476</volume>
          {
          <issue>488</issue>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Fei-Fei</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fergus</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perona</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Learning generative visual models from few training examples an incremental Bayesian approach tested on 101 object categories</article-title>
          .
          <source>In: Proceedings of the Workshop on Generative-Model Based Vision</source>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Frommholz</surname>
            , I., van Rijsbergen,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Towards a Geometrical Model for Polyrepresentation of Information Objects</article-title>
          .
          <source>In: Proc. of the "Information Retrieval 2009" Workshop at LWA</source>
          <year>2009</year>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Ingwersen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Jarvelin,
          <string-name>
            <surname>K.</surname>
          </string-name>
          :
          <article-title>The Turn: Integration of Information Seeking and</article-title>
          Retrieval in Context. Springer-11645 /Dig. Serial], Springer, Dordrecht (
          <year>2005</year>
          ), http://dx.doi.org/10.1007/1-4020-3851-8 / http://www.zentralblattmath.org/zmath/en/search/?an=
          <volume>1079</volume>
          .
          <fpage>68532</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Larsen</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ingwersen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Kekalainen, J.:
          <article-title>The polyrepresentation continuum in IR</article-title>
          .
          <source>In: IIiX: Proceedings of the 1st international conference on Information interaction in context</source>
          . pp.
          <volume>88</volume>
          {
          <fpage>96</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lehrack</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmitt</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>QSQL: Incorporating Logic-Based Retrieval Conditions into SQL</article-title>
          . In: Kitagawa,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Ishikawa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            ,
            <surname>Watanabe</surname>
          </string-name>
          , C. (eds.)
          <article-title>Database Systems for Advanced Applications</article-title>
          , 15th International Conference, DASFAA 2010, Tsukuba, Japan, April 1-
          <issue>4</issue>
          ,
          <year>2010</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>I</given-names>
          </string-name>
          , Lecture Notes in Computer Science, vol.
          <volume>5981</volume>
          , pp.
          <volume>429</volume>
          {
          <fpage>443</fpage>
          . Springer (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Lux</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chatzichristo s</surname>
          </string-name>
          , A.S.: Lire:
          <article-title>Lucene Image Retrieval: An Extensible Java CBIR Library</article-title>
          .
          <source>In: MM '08: Proceeding of the 16th ACM International Conference on Multimedia</source>
          . pp.
          <volume>1085</volume>
          {
          <fpage>1088</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Piwowarski</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frommholz</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lalmas</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>van Rijsbergen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>What can quantum theory bring to information retrieval</article-title>
          .
          <source>In: Proceedings of the 19th ACM international conference on Information and knowledge management</source>
          . pp.
          <volume>59</volume>
          {
          <fpage>68</fpage>
          . CIKM '10,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2010</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/1871437.1871450
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. van Rijsbergen,
          <string-name>
            <surname>C.</surname>
          </string-name>
          :
          <article-title>The Geometry of Information Retrieval</article-title>
          . Cambridge University Press, Cambridge, England (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Schaefer</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stich</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>UCID - An Uncompressed Colour Image Database</article-title>
          .
          <source>In: Proc. SPIE</source>
          , Storage and
          <string-name>
            <given-names>Retrieval</given-names>
            <surname>Methods</surname>
          </string-name>
          and Applications for Multimedia, pp.
          <volume>472</volume>
          {
          <fpage>480</fpage>
          . San Jose, USA (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Schmitt</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Weighting in CQQL</article-title>
          .
          <source>Cottbus</source>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Schmitt</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>QQL: A DB&amp;IR Query Language</article-title>
          .
          <source>The VLDB Journal</source>
          <volume>17</volume>
          (
          <issue>1</issue>
          ),
          <volume>39</volume>
          {
          <fpage>56</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Schmitt</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Zellhofer,
          <string-name>
            <surname>D.</surname>
          </string-name>
          , Nurnberger, A.:
          <article-title>Towards quantum logic based multimedia retrieval</article-title>
          .
          <source>In: IEEE (ed.) Proceedings of the Fuzzy Information Processing Society (NAFIPS)</source>
          . pp.
          <volume>1</volume>
          {
          <issue>6</issue>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2008</year>
          ),
          <volume>10</volume>
          .1109/NAFIPS.
          <year>2008</year>
          .4531329
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Skov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pedersen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Larsen</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ingwersen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Testing the Principle of Polyrepresentation</article-title>
          . In: Ingwersen, P., van Rijsbergen,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Belkin</surname>
          </string-name>
          , N. (eds.)
          <source>Proceedings of ACM SIGIR 2004 Workshop on "Information Retrieval in Context"</source>
          . pp.
          <volume>47</volume>
          {
          <issue>49</issue>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Tsikrika</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Popescu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kludas</surname>
          </string-name>
          , J.:
          <article-title>Overview of the wikipedia image retrieval task at ImageCLEF 2011</article-title>
          . In: CLEF (Notebook Papers/LABs/Workshops) :
          <article-title>CLEF 2011 working notes (</article-title>
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Z.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiederhold</surname>
          </string-name>
          , G.:
          <article-title>SIMPLIcity: Semantics-sensitive Integrated Matching for Picture Libraries</article-title>
          .
          <source>In: Proceedings of the 4th International Conference on Advances in Visual Information Systems</source>
          . pp.
          <volume>360</volume>
          {
          <fpage>371</fpage>
          . VISUAL '
          <volume>00</volume>
          ,
          <string-name>
            <surname>SpringerVerlag</surname>
          </string-name>
          (
          <year>2000</year>
          ), http://portal.acm.org/citation.cfm?id=
          <volume>647061</volume>
          .
          <fpage>714442</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>A.L.</given-names>
          </string-name>
          :
          <article-title>Fuzzy Logic</article-title>
          .
          <source>IEEE Computer 21(4)</source>
          ,
          <volume>83</volume>
          {
          <fpage>93</fpage>
          (
          <year>1988</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. Zellhofer, D.:
          <article-title>Inductive User Preference Manipulation for Multimedia Retrieval</article-title>
          . In: Boszormenyi, L.,
          <string-name>
            <surname>Burdescu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Davies</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Newell</surname>
            ,
            <given-names>D</given-names>
          </string-name>
          . (eds.)
          <source>Proc. of the Second International Conference on Advances in Multimedia</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21. Zellhofer,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Frommholz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Schmitt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Lalmas</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>van Rijsbergen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          : Towards
          <string-name>
            <surname>Quantum-Based</surname>
            <given-names>DB</given-names>
          </string-name>
          +
          <article-title>IR Processing Based on the Principle of Polyrepresentation</article-title>
          . In: Clough,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Foley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Gurrin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Kraaij</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            ,
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Murdoch</surname>
          </string-name>
          , V. (eds.)
          <source>Advances in Information Retrieval - 33rd European Conference on IR Research</source>
          , ECIR
          <year>2011</year>
          , Dublin, Ireland,
          <source>April 18-21</source>
          ,
          <year>2011</year>
          .
          <source>Proceedings, Lecture Notes in Computer Science</source>
          , vol.
          <volume>6611</volume>
          , pp.
          <volume>729</volume>
          {
          <fpage>732</fpage>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. Zellhofer,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Schmitt</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>A Preference-based Approach for Interactive Weight Learning: Learning Weights within a Logic-Based Query Language</article-title>
          . Distributed and Parallel
          <string-name>
            <surname>Databases</surname>
          </string-name>
          (
          <year>2009</year>
          ), doi:10.1007/s10619-009-7049-4
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. Zellhofer,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Schmitt</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>Approaching Multimedia Retrieval from a Polyrepresentative Perspective: (to appear)</article-title>
          . In: Detyniecki,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Knees</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          , Nurnberger,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Schedl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Stober</surname>
          </string-name>
          , S. (eds.) 8th International Workshop on Adaptive Multimedia Retrieval (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24. Zellhofer,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Schmitt</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>Ein Polyreprasentatives Anfrageverfahren fur das Multimedia Retrieval</article-title>
          . In: Atzmuller,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Benz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Hotho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Stumme</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G</given-names>
            . (eds.) Proceedings of LWA2010 - Workshop-Woche: Lernen, Wissen &amp;
            <surname>Adaptivitaet</surname>
          </string-name>
          (
          <year>2010</year>
          ), http://www.kde.cs.uni-kassel.de/conf/lwa10/papers/ir5.pdf
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25. Zellhofer,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Schmitt</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>A User Interaction Model based on the Principle of Polyrepresentation</article-title>
          . In: Nica,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Suchanek</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.F</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 4th workshop on Ph.D. students in information and knowledge management</source>
          .
          <source>PIKM '11</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2011</year>
          )
          <article-title>(to appear)</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>