<!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>Meiji University at the ImageCLEF2010 Visual Concept Detection and Annotation Task: Working notes</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Naoki Motohashi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ryo Izawa</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tomohiro Takagi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>1-1-1 Higashimita</institution>
          ,
          <addr-line>Tama-ku, Kawasaki-shi, Kanagawa, 214-8571</addr-line>
          ,
          <country country="JP">Japan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Annotation, Bag of Visual words, Conceptual Fuzzy Sets</institution>
          ,
          <addr-line>Visual Words Combination, ImageCLEF</addr-line>
          ,
          <country>Flickr User Tag</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Department of Computer Science</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes the participation of the Web Science Laboratory of Meiji University in the ImageCLEF2010 photo annotation task. We devised a system that combines conceptual fuzzy sets with visual words that have become popular in the fields of image retrieval and recognition. The utility of the system was verified by comparing it with the ordinary Bag of Visual words technique. In addition, we constructed a system using Flickr User Tags that was based on the same idea. Because there are many images without tags, the system integrates visual word and tag-based methods. The utility of the integrated system was verified in an experiment.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
    </sec>
    <sec id="sec-2">
      <title>CONCEPTUAL FUZZY SETS</title>
      <p>
        A Conceptual Fuzzy Set (CFS) [
        <xref ref-type="bibr" rid="ref3">4</xref>
        ] [
        <xref ref-type="bibr" rid="ref4">5</xref>
        ] is a theory to solve the problem of situated cognition of the meaning
representation for the concept, and it is based on the theory of meaning propounded by Wittgenstein. Simply put,
it is a theory that aims to make a computer understand the meanings of words that change from situation to
situation. For example, a dictionary gives the word “Java" three meanings: the "name of an island and region", a
"brand or type of coffee", and a "programming language". Thus, a computer cannot understand which meaning
to use unless it is supplied with a sufficient context. The vagueness can be resolved by considering the words
appearing around Java. For instance, if "Java" co-occurs with the word "computer", Java likely refers to the
programming language. A CFS for “Java” is thus the word plus links to other words related to or co-occurring
with it that distinguish its meanings. We devised a technique for applying CFS to visual words that are made
from clustered keypoints of images.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>VISUAL WORDS APPROACH</title>
      <p>
        First, the keypoints are extracted from an image by using SIFT [
        <xref ref-type="bibr" rid="ref5">6</xref>
        ], Second, they are clustered using k-means
clustering, and the center of each cluster is taken to be a visual word of that cluster. Reference [
        <xref ref-type="bibr" rid="ref6">7</xref>
        ] indicates that
image recognition and retrieval using visual words has been actively researched in recent years. The Bag of
Visual words [
        <xref ref-type="bibr" rid="ref7">8</xref>
        ] is a popular technique. In this technique, the keypoints are replaced with visual words, and the
image is represented by a frequency histogram of visual words. The images are retrieved on the basis of the
similarity of this histogram. However, visual words have a drawback in that they are vaguer than actual words.
For instance, a word like "Dog" may refer to an object in an image, but it is difficult for visual words to be used
to recognize such an object because they are only for one point in the image. Some research [
        <xref ref-type="bibr" rid="ref8">9</xref>
        ] has been done in
an attempt to resolve this vagueness.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>VISUAL WORDS COMBINATION APPROACH</title>
      <p>The Visual Words Combination Approach (VWCA) is a model that the CFS applies to visual words. Several
visual words are combined in order to decrease their vagueness. The Bag of Visual words technique was
originally proposed as an analogy of the Bag of Words approach, and visual words have the same meaning as
words in sentences. Thus, CFS, which is useful for sentence retrieval, might also be useful for visual words.
Moreover, this idea considers human psychology; someone visually recognizes an object by seeing many points
at the same time. For instance, we recognize someone’s face by seeing the eyes, nose, and mouth at the same
time.</p>
      <p>The Visual Words Combination (VWC) is a word set generated by combining several visual words. For
example, ten pairs (combinations) can be generated from five visual words. Because we cannot judge which
visual words are related to each other, we generated various combinations by using this method.
5</p>
    </sec>
    <sec id="sec-5">
      <title>SYSTEM DESCRIPTION</title>
      <p>5.1</p>
      <sec id="sec-5-1">
        <title>Visual Dictionary</title>
        <p>This section explains the system that we made for this task. First, we will explain the system using only visual
information. After that, we will explain the system that uses Flickr User Tags.</p>
        <p>
          The Visual Dictionary (VD) was our dictionary that contains visual words. Visual words were generated by
quantizing keypoints extracted from images. We randomly chose 1,200 images from the 8,000 training images,
and made 4,000 visual words from about 830,000 keypoints [10][
          <xref ref-type="bibr" rid="ref9">11</xref>
          ].
5.2
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>CFS System (VisualOnly_CFS_of_meiji)</title>
        <p>The CFS system was constructed by using VWCs. The procedure, from preprocessing to annotation, is as
follows.</p>
        <p>1 ) The test images are converted into a frequency histogram of visual words.
2 ) The VWCs are generated from the result of step 1).
3 ) Compare the test image’s VWCs with the visual words in the casebase made from the training images,
and identify similar images.</p>
        <p>4 ) The test images are annotated.</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.2.1 Frequency histogram</title>
        <p>The test images were converted into a frequency histogram of visual words. The procedure is as follows and
is illustrated in Figure 1.</p>
        <p>
          1 ) The keypoints are extracted from the test image by using SIFT.
2 ) Each keypoint is assigned into a visual word in the Visual Dictionary by using the nearest neighbor
algorithm [
          <xref ref-type="bibr" rid="ref10">12</xref>
          ].
3 ) A histogram is made from the visual words.
        </p>
      </sec>
      <sec id="sec-5-4">
        <title>5.2.2 Generation of VWC</title>
        <p>Next, the VWCs of the test image were generated. We needed to use a small number of visual words. For
instance, the VWCs generated from 300 visual words in combinations of 3 would amount to 300C3. As a
result, 4,455,100 combinations would be generated. The calculation cost increases when using a lot of visual
words. Hence, we used only 20 visual words that had high frequencies in the histogram and made 1,140 VWCs
from them.</p>
      </sec>
      <sec id="sec-5-5">
        <title>5.2.3 Construction of the Casebase</title>
        <p>The casebase for the CFS system to annotate the 10,000 test images was made from 8,000 training images.
Figure 2 shows an example of the casebase. The casebase stored relations such as "If this image has these
visual words, then this image has these concepts". The training images were also converted into histograms in
the same way and stored as combinations of 20 visual words.</p>
      </sec>
      <sec id="sec-5-6">
        <title>5.2.4 Retrieval</title>
        <p>We retrieved similar images in the casebase by matching VWCs generated from the test image and the
training images. If a training image had a VWC of the test image, the matching produced a hit. If it didn’t have
a VWC, the matching was considered to be a miss. If the number of hits for a certain training image exceeded
ten, the images were considered to be similar. An example of matching is shown in Fig. 3.</p>
      </sec>
      <sec id="sec-5-7">
        <title>5.2.5 Annotation</title>
        <p>The confidence was the word frequency in the retrieval results divided by the number of retrieval results. In
addition, when confidence was converted into a binary value of either 0 or 1, if the concept had a confidence of
0.2 or more, the concept's binary value was taken to be 1. If the value was less than 0.2, the binary value was 0.
5.3</p>
      </sec>
      <sec id="sec-5-8">
        <title>Bag of Visual words system (VisualOnly_BagOfVisual wordss_of_meiji)</title>
        <p>The Bag of Visual words system was used as a baseline for evaluating the CFS system. The procedure to
annotate the test images is almost the same as in the CFS system. The difference is that left side of the casebase
of the Bag of Visual Words system in Fig. 2 is not 20 visual words but the frequency histogram in 5.2.1.
Twenty training images were retrieved from the casebase, and each test image was annotated in the same way
as described in section 5.2.5. The cosine measure was used to determine the degree of similarity between the
test image and the training image.
5.4</p>
      </sec>
      <sec id="sec-5-9">
        <title>Flickr User Tag System</title>
        <p>We describe about a system using Flickr User Tag. The procedure from preprocessing to annotation is as
follows.</p>
        <p>1 ) The casebase is constructed in advance.
2 ) The confidence between the test image and concept is calculated.</p>
        <p>3 ) The test images are annotated.</p>
      </sec>
      <sec id="sec-5-10">
        <title>5.4.1 Construction of the Casebase</title>
        <p>The casebase here is different from the casebase explained in 5.2.3. It was constructed as follows.
1 ) The training images for each concept are collected.
2 ) The tags of the collected images are collected.
3 ) The term frequency (TF) and the document frequency (DF) of each tag are calculated, and the tags are
weighted by using the TF-IDF method.
4 ) The casebase (Fig. 4) paraphrasing concepts with tags is constructed by using tags having the calculated</p>
        <p>TF-IDF values. In the figure, the numerical values in parentheses are the TF-IDFs.</p>
        <p>We shall illustrate this procedure by using the concept "Dog" as an example. The training images come
annotated with concepts from ImageCLEF. Of the 8000 images, there were 211 images with the concept "dog"
attached to them. Moreover, the training images had tags plus the concept. The tags of the 211 images were
collected. The TF-IDF value of each tag was then calculated and the tag and its value were stored.</p>
        <p>The casebase described in sec. 5.2.3 stored the 8,000 cases, but the casebase here stored 93 cases. The idea
behind this casebase comes from the theory of meaning propounded by Wittgenstein. According to the theory
of meaning, the meaning of a word can be represented by another word. In the example of Figure 4, “partylife”
is paraphrased by “concert” and “fireworks”.</p>
      </sec>
      <sec id="sec-5-11">
        <title>5.4.2 Confidence Calculation</title>
        <p>Next, the confidence between the test image and each concept is calculated. The procedure is as follows (an
example is shown in Fig. 5).</p>
        <p>1 ) The tags of the concept and the test image are matched, and the TF-IDFs of the tags that become hits are
added together. The total TF-TDF is stored in the concept.
2 ) Step 1) is repeated for all concepts.
3 ) All concepts are regularized by the maximum value of each concept, and this value is assumed to be the
confidence.
4 ) The steps from 1) to 3) are repeated for all test images.</p>
        <p>When the tag of the test image and concept were compared, combinations like those in section 5.2.2 were not
always generated because there were many unsuitable tags. For instance, there were spelling mistakes like
"Mweeting" and sentences like "Girlecstaticallydancingondnbtuneswhileholdingaglass ofbeerinherhand".</p>
        <p>Moreover, about 1,000 images of the 10,000 test images didn’t have any tags; i.e., only about 9,000 images
were annotated.</p>
      </sec>
      <sec id="sec-5-12">
        <title>5.4.3 Conversion to Binary</title>
        <p>Every concept, not every image, was considered when the confidence was converted into a binary value.</p>
        <p>For every concept, the confidences of all test images were sorted in descending order. The binaries of the test
images that had the top n confidences became 1 because these images may have had a strong relationship with
each concept. The binaries of the other test images were 0.</p>
        <p>The value of n was determined stochastically. For instance, in the example described in 5.4.1, the concept
"Dog" was annotated on 211 of the 8000 training images. Note that when calculating the number of test images
that are annotated to 9,000 images stochastically, the concept "Dog" is sure to be annotated to 237 test images
in 9000 training images.</p>
        <p>Figure 6 shows an example of converting the concept "1: partylife". In this case, n is 2.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>SUBMISSIONS AND RESULTS</title>
      <p>6.1</p>
      <sec id="sec-6-1">
        <title>Submitted Systems</title>
        <p>Below, we describe the five systems that we submitted and their results.
1. VisualOnly_CFS_of_meiji</p>
        <p>This system is the CFS system.
2. VisualOnly_BagOfVisual words_of_meiji</p>
        <p>This system is the Bag of Visual words system.
3. Mixed_CFS_and_Tags_of_meiji
9,000 images that have tags attached to them are annotated by using the Flickr User Tag System. The
remaining 1,000 images are annotated with the CFS system. This system integrated the results of systems
1 and 2.
4. Mixed_Tag_Based_CFS_of_meiji.txt</p>
        <p>This system attempts to improve the result of system 1 by using the Flickr User Tag System.
5. Mixed_Text_Based_BagOfVisual_words_of_meiji</p>
        <p>This system attempts to improve on the result of system 2 by using the Flickr User Tag System.</p>
        <p>The improvements to system’s 4 and 5 were to refine the annotation results of systems 1 and 2 by using the
results of the Flickr User Tag System. The confidence of each concept was calculated by using the Flickr User
Tag System on all test images. Seven concepts that had high confidence were employed to improve the results
of systems 1 and 2. The confidences of these seven concepts of systems 1 and 2 added up to 0.5. They were
converted into a binary value of 1 because they exceeded 0.2.
6.2</p>
        <p>
          First, we can see that system 2, which uses the original Bag of Visual words, is more accurate than system
1 that uses CFS. The CFS result was not as good as we expected because the number of visual words was
limited in order to reduce the processing cost. In short, the image was represented by only 20 visual words,
and this is not enough information. Moreover, there is a research result showing that visual words whose
frequencies are high are not so important [
          <xref ref-type="bibr" rid="ref11">13</xref>
          ]. Thus, the visual words were improperly selected. On the other
hand, the accuracy went up when the tags were used. However, the improvement was small. The reason is
that the seven concepts were compulsorily annotated when the results of system 1 and 2 improved and this led
to the possibility that noise concepts were annotated. System 5 was the most accurate of the systems that we
submitted. We ranked 23rd out of 63 runs and 6th among 17 teams.
MAP
        </p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>CONCLUSION REFERENCES</title>
      <p>The system that improved the results of the Bag of Visual words method by using Flickr User Tags was the
most accurate one that we submitted. This means that annotations using text information like tags are effective.
Unfortunately, the system did not have as good a result as we expected. We think the problem was that the
selection and the number of visual words were not suitable (see sec. 6.2). It will be necessary to verify which
visual words to select in the future.
[3] MIR Flickr 25.000 image dataset, http://press.liacs.nl/mirflickr/</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <issue>ImageCLEFphotoAnnotation2010</issue>
          , http://www.imageclef.org/2010/PhotoAnnotation
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Stefanie</given-names>
            <surname>Nowak</surname>
          </string-name>
          and
          <string-name>
            <given-names>Mark</given-names>
            <surname>Huiskes</surname>
          </string-name>
          . “
          <article-title>New Strategies for Image Annotation: Overview of the Photo Annotation Task at ImageCLEF 2010</article-title>
          .
          <source>In the Working Notes of CLEF</source>
          <year>2010</year>
          ”, Padova, Italy,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>T.</given-names>
            <surname>Takagi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Imura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ushida</surname>
          </string-name>
          , and T. Yamaguchi, “
          <article-title>Conceptual fuzzy sets as a meaning representation and their inductive construction”</article-title>
          .
          <source>International Journal of Intelligent Systems</source>
          , Vol.
          <volume>10</volume>
          , pp.
          <fpage>929</fpage>
          -
          <lpage>945</lpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T.</given-names>
            <surname>Takagi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Imura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Ushida</surname>
          </string-name>
          , and T. Yamaguchi, “
          <article-title>Multilayered reasoning by means of conceptual fuzzy sets”</article-title>
          .
          <source>International Journal of Intelligent Systems</source>
          , Vol.
          <volume>11</volume>
          , pp.
          <fpage>97</fpage>
          -
          <lpage>111</lpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.G.</given-names>
            <surname>Lowe</surname>
          </string-name>
          , “
          <article-title>Distinctive Image Features from Scale-Invariant Keypoints”</article-title>
          ,
          <source>International Journal of Computer Vision</source>
          , Vol.
          <volume>60</volume>
          , No.
          <issue>2</issue>
          , pp.
          <fpage>91</fpage>
          -
          <lpage>110</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Sivic</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Zisserman</surname>
          </string-name>
          ,
          <article-title>"Video Google: A Text Retrieval Approach to Object Matching in Videos,"</article-title>
          <source>Proc. Int'l Conf</source>
          .
          <source>Computer Vision</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>G.</given-names>
            <surname>Csurka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Dance</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Fan</surname>
          </string-name>
          , “
          <article-title>Visual categorization with bags of keypoints”</article-title>
          ,
          <source>In Proc. of ECVWCorkshop on Statistical Learning in Computer Vision</source>
          , pp.
          <fpage>59</fpage>
          -
          <lpage>74</lpage>
          ,
          <year>2004</year>
          ..
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Jan</surname>
            <given-names>C. van Gemert</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cor J. Veenman</surname>
          </string-name>
          ,
          <string-name>
            <surname>Arnold W.M. Smeulders</surname>
          </string-name>
          ,
          <string-name>
            <surname>Jan-Mark Geusebroek</surname>
          </string-name>
          ,
          <article-title>"Visual words Ambiguity"</article-title>
          ,
          <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          , vol.
          <volume>32</volume>
          , no.
          <issue>7</issue>
          , pp.
          <fpage>1271</fpage>
          -
          <lpage>1283</lpage>
          ,
          <year>June 2010</year>
          , doi:10.1109/TPAMI.
          <year>2009</year>
          .132 Koen E. A. van de Sande, Theo Gevers and
          <string-name>
            <surname>Arnold W. M. Smeulders</surname>
          </string-name>
          ,
          <article-title>"The University of Amsterdam's Concept Detection System at ImageCLEF 2009"</article-title>
          ,
          <source>In CLEF working notes 2009</source>
          , Corfu, Greece,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Binder</surname>
          </string-name>
          and
          <string-name>
            <given-names>Motoaki</given-names>
            <surname>Kawanabe</surname>
          </string-name>
          ,
          <article-title>"Fraunhofer FIRST's Submission to ImageCLEF2009 Photo Annotation Task: Non-sparse Multiple Kernel Learning"</article-title>
          ,
          <source>In CLEF working notes 2009</source>
          , Corfu, Greece,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [12]
          <article-title>Nearest neighbour algorithm</article-title>
          , http://en.wikipedia.org/wiki/Nearest_neighbor_algorithm
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>F.</given-names>
            <surname>Jurie</surname>
          </string-name>
          and
          <string-name>
            <given-names>B.</given-names>
            <surname>Triggs</surname>
          </string-name>
          , “
          <article-title>Creating Efficient Codebooks for Visual Recognition,”</article-title>
          <source>Proc. Int'l Conf</source>
          .
          <source>Computer Vision</source>
          , pp.
          <fpage>604</fpage>
          -
          <lpage>610</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>