<!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>An approach to Semantic Content Based Image Retrieval using Logical Concept Analysis. Application to comicbooks.</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Clement Guerin</string-name>
          <email>cguerin@univ-lr.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Karell Bertet</string-name>
          <email>kbertet@univ-lr.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arnaud Revel</string-name>
          <email>arevel@univ-lr.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>L3I, University of La Rochelle</institution>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we present an ongoing work aiming to improve content based image retrieval performance with the help of logical concept analysis. Domain semantic is formalized and used instead of classical CBIR visual features. This is being applied to comicbooks using Sewelis.</p>
      </abstract>
      <kwd-group>
        <kwd>Comic Books</kwd>
        <kwd>Description Logics</kwd>
        <kwd>Semantic</kwd>
        <kwd>Logical Concept Analysis</kwd>
        <kwd>Content-Based Image Retrieval</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Web search engines usually give poor results when searching in multimedia
databases since they use the contextual web page, or the meta information
attached to the multimedia objects. The semantic meaning that the user usually
attaches to the content of the document is often very di erent from the text used
for indexing the image (semantic gap). Content Based Image Retrieval (CBIR)
has been proposed to search into huge unstructured image databases by giving
an example of what the user is looking for instead of describing the concept it
represents. Classically, visual features are extracted from the images and then
compiled into a signature [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. To perform the retrieval, a similarity function is
computed to compare the index of the query to those of the collection. A ranking
of the results is produced according to the similarity and shown to the users. To
improve the quality of the retrieval, an interaction with the user, called relevance
feedback [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], can be added. These techniques work pretty well in the context of
searching visually similar images in unstructured image databases.
      </p>
      <p>
        In this article, we are interested in CBIR in the context of comicbook databases.
In this case, databases cannot be considered as unstructured anymore since
images can be grouped in terms of panels, pages and volumes which are themselves
associated with metadata concerning the author or the series they belong to.
We would like to bene t both from the search facilities given by CBIR
techniques with feedback and semantic information embedded in the structure of the
comicbooks documents. To do such a thing, Logical Concept Analysis (LCA),
an extension of Formal Concept Analysis (FCA) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], is used through the Sewelis
implementation [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. We will rst go through the presentation of our comicbook
model and its transcription into LCA. Then we will explain how we can mix
classical CBIR and LCA techniques together to enhance retrieval relevance.
      </p>
      <p>PanelValidation</p>
      <p>TextRegion
- hasText
- hasRank
is_a is_a hasReference hasValidation</p>
      <p>RegionOfInterest
NextValidation - hasX</p>
      <p>- hasY
is_a is_a</p>
      <p>Panel
hasNext
is_a</p>
      <p>- hasRank
Validation
- isCorrect
hasBalloon</p>
      <p>Balloon</p>
      <p>Semantic Content Based Image Retrieval</p>
      <sec id="sec-1-1">
        <title>Model description</title>
        <p>
          Comicbooks have a natural hierarchical structure that can be formalized. They
are made of pages which contain panels. These panels can eventually be
gathered in strips1 and contain di erent kind of objects, such as speech balloons,
characters, free text, etc. Balloons can be of many kinds (dialogue, thoughts
etc.).This knowledge can be used to deduce more information such as pieces of
the storyline. Fig. 1 illustrates the model we propose to formalize the comicbooks
domain. It has been described with more details in [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
Some works [6{8] already enhanced the classical CBIR techniques with an
ontology approach. The modelling was mainly focused on the description of segmented
areas though. We would like to go further and use the full power of description
provided by description logics.Indeed, the model presented previously is
expressive enough to allow the retrieval of similar panels considering di erent
characteristics like low-level image features, spatial relations or semantic information.
        </p>
        <p>An input picture, picked from the database, being given, the system will not
only be able to retrieve similar pictures based on the classical image
characteristics (colors, shapes, textures...), but also based on the associated semantic
and the knowledge that could have been learnt previously. Considering that the
query is a Panel instance, the search can focus on:</p>
        <p>(1) The panel's characteristics (i.e. data properties of a Panel object). This
could be its rank, its shape, its size, its position, its shot type, its view angle,
1 A strip is de ned as an horizontal sequence of panels. Traditionally, a strip is made
of 1 to 6 panels and a page can contain up to 4 stacked strips.</p>
        <p>Comic
- hasLabel
- hasWriter
- hasDrawer
hasPart</p>
        <p>Page
- hasNumber
hasPart
hasExtractor
hasNext -EhxatsrNacatmore
is_a</p>
        <p>is_a
GroundTruth</p>
        <p>Automatic
hasImage
Image
- hasWidth
- hasHeight
etc. Images of a very close shot of a character's face or a landscape picture of a
valley being at the top of a page can be examples of queries.</p>
        <p>(2) The panel's relations (i.e. object properties). Properties of objects related
to the query panel can be used as well as its own characteristics. Therefore, there
are two directions to look at from a panel point of view.</p>
        <p>{ The search can focus on what is inside the panel, like similar amount of
objects in a scene (a dialogue between two characters for instance) or related
text content. The retrieval process can also rely on objects contained in the
panel, whether they are identi ed or not. Assume that the query picture
contains an identi ed character A whose visual signature is de ned by the
set of features X. The system will not only look for panels containing an
instance of A, but also for those showing a spatial region matching X.
{ Outside: the search can focus on panels sharing page's or comic's
characteristics (such as author, style, etc.)</p>
        <p>These kinds of retrieval angles are not mutually exclusive and it is very
possible to combine two or more of them in order to narrow the result set. The
search possibilities are only limited by the completeness of the description.</p>
      </sec>
      <sec id="sec-1-2">
        <title>2.3 Sewelis integration</title>
        <p>
          In databases, information retrieval is classically performed by request queries
expressed in a speci c request language, as SQL for example. However, the more
re ned is the search, the more sophisticated is the request. Some information
retrieval systems o er a simpler search re nement by navigation in a prede ned
static data structure, where each navigation step proposes to the user a more
re ned query answer. For example, le systems can be considered as an
information retrieval system where data is organized in a static tree structure. A new
approach of information retrieval, both by request and by navigation in a Galois
lattice structure [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], has been proposed in [
          <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
          ].
        </p>
        <p>
          The concept lattice is a rich and exible navigation structure automatically
derived from data, and can therefore be considered as a dynamic and complete
space search enabling data description while preserving its diversity. Querying
and navigation can be freely combined: to each user request corresponds a
concept of the lattice as answer ; the user can then improve its search either by
amending its request, or by on-line browsing around the concept in the lattice
structure. Such an approach was already proposed, for example in [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] with the
logical information systems (LIS) and has been implemented in Sewelis [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
        </p>
        <p>Sewelis is used to load the comics' ontology and to create a bound between
the model and a concept lattice. The objects of the lattice match the classes of
the model, the attributes are their properties and each concept stands for a set
of classes' instances sharing the same properties. It is then possible to navigate
all the way to any concept, using the exible navigation structure provided by
the concept lattice.
2.4</p>
      </sec>
      <sec id="sec-1-3">
        <title>Application</title>
        <p>
          Let us illustrate this with a simple example. Let say we have a query panel and
we want to retrieve the strip it is coming from. While it only takes a quick look
to a human being to nd the answer, it is not something obvious for a machine,
the strip concept not even being part of the model. Classical CBIR methods,
based on a similar visual features criterion, are helpless in that case. However,
if the knowledge related to the panels and their inside/outside relatives is used,
it becomes possible to return results that can be justi ed by the system and
iteratively re ned with the relevance feedback brought by the user. Concerning
this request, the page number of the panel will rst be considered (outside panel's
relation) in order to focus on panels coming from the same page. Then, the y-axis
value of its centroid will be selected and only panel's whose centroid corresponds
to the same y-value, within a prede ned delta, will be kept. Finally, the hasNext
[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] relation can be used to sort output panels in order to rebuild the strip.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Conclusion and perspectives</title>
      <p>This paper has presented an ongoing work about a Semantic Content Based
Image Retrieval system applied to comic books. The nal aim would be to
provide a complete system that would be able to (1) retrieve resources similar to a
query, based on the amount of mutual properties they share and the signi cance
of these properties guided by the user relevance feedback, and (2) explain to the
user why a returned resource is considered to be relevant to the query.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>R.C.</given-names>
            <surname>Veltkamp</surname>
          </string-name>
          .
          <article-title>Content-Based Image Retrieval System: A Survey</article-title>
          .
          <source>In Technical report</source>
          , University of Utrecht,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>M.E.J.</given-names>
            <surname>Wood</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.W.</given-names>
            <surname>Campbell</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.T.</given-names>
            <surname>Thomas</surname>
          </string-name>
          .
          <article-title>Iterative re nement by relevance feedback in content-based digital image retrieval</article-title>
          .
          <source>In ACM Multimedia 98</source>
          , pages
          <fpage>13</fpage>
          {
          <fpage>20</fpage>
          ,
          <year>September 1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>B.</given-names>
            <surname>Ganter</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <article-title>Formal concept analysis</article-title>
          ,
          <source>Mathematical foundations</source>
          . Springer Verlag, Berlin, 284 pages,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>S.</given-names>
            <surname>Ferre</surname>
          </string-name>
          and
          <string-name>
            <surname>A. Hermann.</surname>
          </string-name>
          <article-title>Semantic search: reconciling expressive querying and exploratory search</article-title>
          .
          <source>In Proceedings of the ISWC'11</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>N.</given-names>
            <surname>Tsopze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Guerin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bertet</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Revel</surname>
          </string-name>
          .
          <article-title>Ontologies et relations spatiales dans la lecture d'une bande dessinee</article-title>
          .
          <source>In IC</source>
          , pages
          <volume>175</volume>
          {
          <fpage>182</fpage>
          , Paris,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>P.</given-names>
            <surname>Stanchev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Green</surname>
          </string-name>
          Jr, and
          <string-name>
            <given-names>B.</given-names>
            <surname>Dimitrov</surname>
          </string-name>
          .
          <article-title>High level color similarity retrieval</article-title>
          .
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , G. Lu, and W.Y. Ma.
          <article-title>Region-based image retrieval with perceptual colors</article-title>
          .
          <source>Advances in Multimedia Information Processing-PCM</source>
          <year>2004</year>
          , pages
          <fpage>931</fpage>
          {
          <fpage>938</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>V.</given-names>
            <surname>Mezaris</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Kompatsiaris</surname>
          </string-name>
          , and
          <string-name>
            <surname>M.G. Strintzis.</surname>
          </string-name>
          <article-title>An ontology approach to objectbased image retrieval</article-title>
          .
          <source>In Image Processing</source>
          ,
          <year>2003</year>
          .
          <article-title>ICIP 2003</article-title>
          . Proceedings. 2003 International Conference on, volume
          <volume>2</volume>
          ,
          <string-name>
            <surname>pages</surname>
            <given-names>II</given-names>
          </string-name>
          {
          <article-title>511</article-title>
          . IEEE,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>G.</given-names>
            <surname>Birkho</surname>
          </string-name>
          .
          <source>Lattice theory</source>
          , volume
          <volume>25</volume>
          .
          <source>American Mathematical Society</source>
          ,
          <volume>418</volume>
          pages,
          <source>third edition</source>
          ,
          <year>1967</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>S.</given-names>
            <surname>Ferre</surname>
          </string-name>
          and
          <string-name>
            <given-names>O.</given-names>
            <surname>Ridoux</surname>
          </string-name>
          .
          <article-title>An introduction to logical information systems</article-title>
          .
          <source>Information Processing &amp; Management</source>
          ,
          <volume>40</volume>
          (
          <issue>3</issue>
          ):
          <volume>383</volume>
          {
          <fpage>419</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>C.</given-names>
            <surname>Carpineto</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Romano</surname>
          </string-name>
          .
          <article-title>Concept data analysis</article-title>
          .
          <source>Wiley Online Library</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>