<!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>LIG-MRIM at Image Photo Annotation task in ImageCLEF 2011</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Rami Albatal</string-name>
          <email>Rami.Albatal@imag.fr</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bahjat Safadi</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Georges Qu´enot</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Philippe Mulhem</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LIG-CNRS 385 av. de la biblioth`eque</institution>
          ,
          <addr-line>38041 Grenoble Cedex</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>We describe in this paper the different approaches tested for the Photo Annotation task for CLEF 2011. We experimented state of the art techniques, by proposing late fusions of several classifiers trained on several features extracted from the images. The classifiers are SVMs and the late fusion is a simple addition of classification probabilities coming from the SVMs. The results obtained place our runs in the middle of the pack, with our best visual-based MAP at 0.337 We also integrated of Flickr human annotations, leading to a large increase of the MAP with a value of 0.377.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        This paper aims at describing the proposal and results of the LIG-MRIM
research group at the Photo Annotation task for CLEF 2011. The
proposal of the group focused mainly on applying a late fusion on multiple
learners based on SVM. We also experimented some processes to reduce
the feature space dimensions, and we made use of a simple integration
with Flickr tags. The findings according to the official evaluations confirm
that: late fusion of multiple features lead to good result, that dimension
reduction on few features is an interesting direction to focus on, and that
a simple integration of human assigned tags improves results.
The corpus [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] for this year is composed of a training set of 8,000 images
and the test set is 10,000 images large. The image annotation is a
multilabel classification process, where the 99 labels go from image elements
(like Flowers), to feelings generated by the images (like scary). The
images are possibly associated with EXIF data, as well as with Flickr tags
provided by human. The main evaluation is MAP-based, and we focus
here only on this measure to evaluate our runs.
      </p>
      <p>The outline of this paper is the following. In section 2, we begin describe
the visual feature extracted and their representation. Section 3 presents
the processing applied on Flickr tags. In section 4, we focus on the
classification applied on the extraction, as on the fusion processed between
the different learners results. In section 5, we list our results, and we
conclude in section 6.</p>
    </sec>
    <sec id="sec-2">
      <title>2 Extraction and representation of visual features</title>
      <p>We focus here the feature extracted, as well some PCA-based
dimension reduction on some features. The features considered cover most the
common feature we find the in literature.
2.1</p>
      <sec id="sec-2-1">
        <title>Simple features</title>
        <p>The features that were extracted are color-based as well as texture based.
Some features are extracted globally from the whole image, and others
are extracted from image regions, before being aggregated to represent
one image. In the following, we give an identifier for each feature before
explaining the extracted feature. Such identifiers will be reused in section
5.</p>
        <p>
          Global features
– h3d 64: normalized RGB Histogram. Such color-based histogram is
64 dimensions large, using a simple 4 x 4 x 4 subsampling respectively
the R, G and B colors components;
– gab 40: normalized Gabor transform [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. For this texture-based
feature, we select 8 orientations at 5 scales, leading to a 40 dimensions
space for these histograms;
– hg 104: this feature results in a simple concatenation of the two
representations above (h3d64 and gab40), generating a 104 dimensions
space for the histograms.
        </p>
        <p>
          Local features The local features extracted are SIFT-like. They are
extracted for regions of the images, resulting from dense sampling of
harris-laplace region of interest detection. Each of these features are
represented as bag of visual word, similarly to [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]; the visual vocabulary
is generated using a Kmeans algorithm on a sample of the features
extracted from the training set;
– opp sift har 1000 and opp sift har 4000: opponent sift features with
Harris-Laplace region of interest detector, generated using Koen Van
de Sande’s software [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. Two representations are considered: one of
1000 and one of 4000 dimensions.
– opp sift dense 1000: features similar to above, except that the
regions or obtained by dense sampling every 8 pixels of the images. The
bag of word representation generates 1000 dimensional histograms;
– rgSift har 4000: rgSIFT features are extracted based on regions
obtained by the Harris-Laplace detector. The same tool than above is
used to generate the 1000 dimensions histograms;
– rgSift dense 4000: the rgSIFT are extracted with dense sampling
selection. The size of the histograms is 4000 dimensions;
All the features described above are based on 1 nearest neighbor
assignment for the generation of the bag of visual words histograms. As
described in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], softer assignments may be used. We experiment those
on opponent sift features:
– opp sift har unc 1000 and opp sift har unc 4000: opponent sift
features extracted from region generated by Harris Laplace detectors,
with soft assignment. The space dimensions are respectively here
1000 and 4000;
– opp sift dense unc 1000: opponent sift features extracted from dense
sampling, with soft assignment. The space dimensions are 1000.
2.2
        </p>
        <p>
          Dimension reduction on features representations
As shown by [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], some space dimension reduction do not necessarily
degrades the results, and has a large advantage during the learning phase.
That is why we applied PCA-based dimension reduction on some of
the large spaces defined in the previous subsection. First, to modify the
values in histograms bin we apply a power law normalization, similar
to [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], so that the normalized value vnorm for each bin of the histograms
is: vnorm = vα, with v the initial value of the bin, and α a float number
depending on the collection. On the normalized histograms, we reduce
the dimensions to a fixed number by using Principal Component Analysis
(PCA). The resulting features are generated using the same a power law
normalization with α = 0.500 or α = 0.450 (according to the pw in the
identifier) and PCA reduction to 400 dimensions, leading to:
– rgsift har 4000 pw0.500p400: from rgsift har 4000;
– rgsift dense 4000 pw0.500p400: from rgsift har 4000;
– opp sift har 1000 pw0.450 p400 and opp sift har 4000 pw0.450 p400:
from respectively opp sift har 1000 and opp sift har 4000;
– opp sift dense 1000 pw0.450 p400: from opp sift dense 1000;
– opp sift har unc 1000 pw0.450 p400: from opp sift har unc 1000;
– opp sift dense unc 1000 pw0.450 p400: from opp sift dense unc 1000;
For the “low dimensional” features h3D64, gab40 and hg104, similar
techniques lead to h3d 64 pw0.250 32, gab 40 pw0.500 20 and hg 104 pw0.375 54,
when considering reducing the dimensions by a half.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Extraction and representation of Flickr tags</title>
      <p>As Image annotation collection is an excerpt from Flickr, the human
generated tags are available. We know that such manually input tags are
not always easy to process (typos, jokes, etc.), but we propose a simple
way to handle some of them. First, for each image, we split the tags
into words, and we apply a Porter stemmer in a way to group similar
words into classes. In a second step, if one stemmed tag equals one of
the 99 stemmed labels, then the label is selected for the image. The
resulting representation is a 99 dimensions binary vector, with 1 if the
label describes the image and 0 otherwise.
4
4.1</p>
    </sec>
    <sec id="sec-4">
      <title>Classification</title>
      <sec id="sec-4-1">
        <title>Visual only</title>
        <p>All the classification processes on the visual features use Multiple-SVM
classifiers based on Radial Basis Funcion (RBF) kernels, since it was
proved to be a good solution for data imbalance problems. Such problems
occur for many labels in the collection under consideration here. So, for
each label, we get positive and negative samples that are used as input
for the learning of the Support Vectors.</p>
        <p>
          During the classification, the image representation is input to the SVM
using each model, and a binary classification is processed. We assume
here that each classifier outputs a probability of classification in [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ].
The final score for each label is then the average of each individual score
from each classifier of the label, as shown in figure 1.
For integrating Flickr tags and visual elements, we also use a late fusion
approach. In this case the visual classification result for each label is
fused using a max with the label value for the image according to the
Flickr tags processing described earlier. The overall process is described
in figure 2.
5
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Validation set Results</title>
      <p>We present the MAP results obtained on a validation set. Our training
set is composed of 2/3rd of the official training set, generated randomly
with a post processing ensuring a similar distribution of the tags that on
the official training set. This last point is important, especially for the
labels that have only few samples (like skateboard with only 12 positive
samples). The validation set in composed of the 1/3rd remaining images
of the official training set.</p>
      <p>The table 1 presents the results obtained feature by feature for each
visual feature listed in section 2.1. This table shows that all the
SIFTbased features with hard assignment behave consistently, with MAP
values between 0.246 and 0.258. The soft assignment opp sift har unc 1000
outperforms slightly the hard assignments, but only marginally. We
notice also that the hg 104 features behave surprisingly well compared to
SIFT-like features.</p>
      <p>The table 2 focuses on the results obtained when considering the
dimension reduction process depicted in part 2.2. In the last column of this
table, we list the percentage of increase compared to the original (i.e.,
not reduced) features. This table shows that the reduction of
dimension proposed always outperforms the original features. This result is
especially visible with the opponent sift features with strict assignment.
In any cases, the dimension reduction seems effective for harris laplace
features, and less for dense sampling-based features. For the “low
dimansional” features, we notice also a large imrpovement with one one half
reduction, leading to very good results for hg 104 pw0.375 54, which has
onlyt 54 dimensions.</p>
      <p>The last table, 3 of this section deals with the results obtained after
fusing the results, according to the explanations of section 4. We chose
three fusions, which correspond to the configuration of the official run
submitted:
– msvm: the late fusion of all the 20 visual features considered earlier
in the paper;
– msvm tags: the late fusion of the visual scores and the Flickr tags
scores;
– msvw two desc: the late fusion of the two best features according the
table 2, but considering two different kinds of regions for the features
(i.e. one Harris-Laplace based, and one dense sampling based) to
ensure variability in the fused results: opp sift har unc 1000pw0.450p400
and opp sift dense 1000pw0.450p400.</p>
      <p>The conclusions drawn from this table is that the fusion always
outperforms each f its components (such result is well known in the community).
We see here that Flickr tags integration, even is the processing is quite
straightforward, leads to an important increase of the results.
These three configurations are the ones used for the official submissions.
Descriptor identifier MAP (increase vs. best visual feature in the fusion)
msvm
msvm tags
msvw two desc
We present here the official MAP results obtained from our runs in 4.
This table shows also in the last column the rank obtained in comparable
lists (i.e., list of visual results for msvm and msvw two desc, and list of
multi-modal results for msvm tags). The results obtained place our best
visual run, msvm with a MAP of 0.336, in the first tier of the list, and
above the average and the median values respectively of 0.289 and 0.323.
For the multimodal run, msvm tags with a MAP of 0.378, the rank is
above the middle, and also above the average and the median values of
respectively 0.370 and 0.371 .
This paper presented the worjk of the LIG-MRIM team for the Photo
Annotation task for CLEF 2011. We used a large set of 20 features, with
or without strict bin assignment, dimension reductions, with and without
integrating Flickr tags. The results obtained place our run in the first
tier for the visual runs, and in the first half for the multimedia runs.
In the future, we will focus on dimension reductions to find out what
reductions are useful.</p>
    </sec>
    <sec id="sec-6">
      <title>Aknowledgements</title>
      <p>This work was partly supported by: a) the Quaero Programme, funded
by OSEO, French State agency for innovation and b) the R´egion Rhones
Alpes (projet LIMA).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>G.</given-names>
            <surname>Csurka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. R.</given-names>
            <surname>Dance</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Willamowski</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Bray</surname>
          </string-name>
          .
          <article-title>Visual categorization with bags of keypoints</article-title>
          . In In Workshop on Statistical Learning in
          <source>Computer Vision</source>
          , ECCV, pages
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>B. S.</given-names>
            <surname>Manjunath</surname>
          </string-name>
          and
          <string-name>
            <given-names>W. Y.</given-names>
            <surname>Ma</surname>
          </string-name>
          .
          <article-title>Texture features for browsing and retrieval of image data</article-title>
          .
          <source>IEEE Trans. Pattern Anal. Mach</source>
          . Intell.,
          <volume>18</volume>
          :
          <fpage>837</fpage>
          -
          <lpage>842</lpage>
          ,
          <year>August 1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>T.</given-names>
            <surname>Mensink</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Csurka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Perronnin</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>S´anchez, and</article-title>
          <string-name>
            <given-names>J.</given-names>
            <surname>Verbeek</surname>
          </string-name>
          .
          <article-title>Lear and xrces participation to visual concept detection task - imageclef 2010</article-title>
          .
          <source>In Working Notes for the CLEF 2010 Workshop</source>
          , page 48, sep
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>S.</given-names>
            <surname>Nowak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Nagel</surname>
          </string-name>
          , and
          <string-name>
            <surname>J. Liebetrau.</surname>
          </string-name>
          <article-title>The clef 2011 photo annotation and concept-based retrieval tasks</article-title>
          .
          <source>In CLEF 2011 working notes</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>K. E. A. van de Sande</surname>
            , T. Gevers, and
            <given-names>C. G. M.</given-names>
          </string-name>
          <string-name>
            <surname>Snoek</surname>
          </string-name>
          .
          <article-title>Evaluating color descriptors for object and scene recognition</article-title>
          .
          <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          ,
          <volume>32</volume>
          (
          <issue>9</issue>
          ):
          <fpage>1582</fpage>
          -
          <lpage>1596</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>J. C. van Gemert</surname>
            ,
            <given-names>C. J.</given-names>
          </string-name>
          <string-name>
            <surname>Veenman</surname>
            ,
            <given-names>A. W.</given-names>
          </string-name>
          <string-name>
            <surname>Smeulders</surname>
          </string-name>
          , and J.
          <string-name>
            <surname>-M. Geusebroek</surname>
          </string-name>
          .
          <article-title>Visual word ambiguity</article-title>
          .
          <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          ,
          <volume>32</volume>
          :
          <fpage>1271</fpage>
          -
          <lpage>1283</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>