<!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>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Addressing the ImageClef 2009 Challenge Using a Patch-based Visual Words Representation U. Avni</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Bar-Ilan University</institution>
          ,
          <country country="IL">Israel</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>IBM Almaden Research Center</institution>
          ,
          <addr-line>San Jose, CA</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Tel-Aviv University</institution>
          ,
          <country country="IL">Israel</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes our participation at the ImageClef 2009 medical annotation task. In this task we have used the bag-of-words approach for image representation. We submitted one run, using support-vector-machines trained on the visual word histograms in multiple scales. In this task our result ranked first, with error score of 852.8. In the last several years, "patch-based" representations and "bag-of-features" classification techniques have been proposed for general object recognition tasks [1 - 6]. In these approaches, a shift is made from the pixel entity to a "patch" - a small window centered on the pixel. In its most simplified form, raw pixel values (intensities) within the window are used as the components of the feature vector. It is possible to take the patch information as a collection of pixel values, or to shift the representation to a different set of features based on the pixels, such as SIFT features [7], and reduce the dimensionality of the representation via dimensionality reduction techniques, such as principlecomponent analysis (PCA) [8].</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Patch-based methods have evolved from texton methods in texture analysis [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] and were motivated from the text
processing world [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. In the classical bag-of-features approach, spatial information and geometrical relationship
between patches is lost. Recent works have shown that including the spatial information as additional features per patch
may provide additional mage characterization strength. The patch-based, bag-of-features approach is simple,
computationally efficient, and shows robustness to occlusions and spatial variations. Using this approach, a substantial
increase in performance capabilities in general computer-vision object and scene classification tasks has been
demonstrated [e.g., 4, 5]. Motivated by these works, and the by success of works based on similar approach in
ImageClef2007 challenges [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ] we have developed a retrieval and classification system for large medical databases,
and put it to the test in ImageClefMed 2008 tasks. This work is an enhancement of the classification system we have
submitted to the medical annotation challenge in ImageClef 2008 [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>Medical Image Annotation Task</title>
      <p>In this task we are presented with 12,729 classified x-ray images, labeled according to four label sets, labels are
based on labeling standards from the last four years. Label sets from 2005 and 2006 contain 57 and 116 labels,
respectively. Label sets from 2007 and 2008 contain 116 and 196 IRMA codes. The goal is to classify about 2000
unseen images according the four label sets. Error evaluation scheme is described in the task website.</p>
    </sec>
    <sec id="sec-3">
      <title>Method</title>
      <p>We model an image as a collection of local patches, where a patch is a small rectangular sub region of the image.
Each patch is represented as a codeword index out of a finite vocabulary of visual codewords. Images are compared and
classified based on this discrete and compact representation.</p>
      <p>We built a dictionary from a random subset of 400 images from the database. The dictionary building process
extracts patches of a fixed size of 9x9 pixels with a grid of 6 pixels spacing, patches are normalized to have 0 mean and
1 variance. We then compute a covariance matrix of a set of roughly 2,000,000 patches, and apply PCA to find its
eigenvectors. The 6 vectors with the highest energy are shown in Figure 1.</p>
      <p>These eigenvectors are later used as a base for the rest of the patches in the database. Patch center coordinates are
added to the feature set, in order to include information about the visual words layout. Running k-means algorithm on
this set produces 1000 dictionary visual words. A sample dictionary is displayed in Figure 2.</p>
      <p>The dictionary building process is repeated in 3 image scales: full resolution, 1/2 scale and 1/8 scale. The resulting
dictionary is a concatenation of the 3 dictionaries from the 3 scales. In the image representation step, patches are
extracted from each image using a dense grid- around every pixel. An image is represented as a word histogram over
the multi-scale dictionary.
Image classification is performed on the word histograms by an SVM classifier with kernel. Multi-class
classification is implemented using one-vs-one heuristic. In the training step each IRMA code is treated as a separate
label, without using the hierarchical nature of the code. The classifier output is returned without using wildcards, except
for replacing trailing ‘0’s with ‘*’. This does not damage the error score if the last digit in the true code is ‘0’, and can
reduce the error score if the last digit is non-zero.</p>
    </sec>
    <sec id="sec-4">
      <title>Experiments and Results</title>
      <p>Kernel parameter and SVM tradeoff parameters C were exhaustively searched to minimize cross-validation average
error over 5 experiments, where in each experiment 2000 random images served as test data. Parameter tweaking was
done using the 2007 code labels. Figure 3 displays the error landscape of the scanned parameters space. The optimal
parameters set was used in all four classification tasks.</p>
    </sec>
    <sec id="sec-5">
      <title>Summary</title>
      <p>We presented a classification system for large medical databases, based on compact bag-of-features image
representation. The system achieves comparatively good results in the ImageClef 2009 medical annotation challenge,
while maintaining efficient computation times.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Leung</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Malik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2001</year>
          ).
          <article-title>Representing and recognizing the visual appearance of materials using threedimensional textons</article-title>
          .
          <source>IJCV</source>
          ,
          <volume>43</volume>
          (
          <issue>1</issue>
          ),
          <fpage>29</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Varma</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Zisserman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2003</year>
          )
          <article-title>Texture classification: are filter banks necessary? In CVPR03</article-title>
          ,
          <string-name>
            <surname>pages</surname>
            <given-names>II</given-names>
          </string-name>
          :
          <fpage>691</fpage>
          -
          <lpage>698</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Sivic</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Zisserman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2003</year>
          )
          <article-title>“Video Google: A Text Retrieval Approach to Object Matching in Videos,”</article-title>
          <string-name>
            <given-names>Proc. Ninth</given-names>
            <surname>Int'l Conf</surname>
          </string-name>
          .
          <source>Computer Vision</source>
          , pp.
          <fpage>1470</fpage>
          -
          <lpage>1478</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Fei-Fei</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Perona</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2005</year>
          ).
          <article-title>A Bayesian Hierarchical Model for Learning Natural Scene Categories</article-title>
          .
          <source>Proc. of IEEE Computer Vision</source>
          and Pattern Recognition:
          <fpage>524</fpage>
          -
          <lpage>531</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Nowak</surname>
            <given-names>E.</given-names>
          </string-name>
          et al. (
          <year>2006</year>
          ).
          <article-title>Sampling strategies for bag-of-features image classification</article-title>
          .
          <source>In ECCV 06</source>
          ,
          <fpage>406</fpage>
          -
          <lpage>503</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Jiang</surname>
            <given-names>Y-G</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ngo C-W &amp; Yang</surname>
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2007</year>
          ):
          <article-title>Towards optimal bag-of-features for object categorization and semantic video retrieval</article-title>
          .
          <source>CIVR</source>
          <year>2007</year>
          :
          <fpage>494</fpage>
          -
          <lpage>501</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Lowe</surname>
          </string-name>
          . D. (
          <year>1999</year>
          )
          <article-title>Object recognition from local scale-invariant features</article-title>
          .
          <source>In Proc. ICCV</source>
          , pages
          <fpage>1150</fpage>
          -
          <lpage>1157</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Bishop</surname>
            ,
            <given-names>C. M.</given-names>
          </string-name>
          (
          <year>1995</year>
          ).
          <article-title>Neural Networks for Pattern Recognition</article-title>
          . Oxford University Press.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Vapnik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          (
          <year>1995</year>
          ).
          <article-title>The Nature of Statistical Learning Theory</article-title>
          . Springer Verlag, New York.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Tommasi</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orabona</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Caputo</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          (
          <year>2007</year>
          )
          <article-title>CLEF2007 Image Annotation Task: an SVM-based Cue Integration Approach</article-title>
          .
          <source>In Working Notes of the 2007 CLEF Work-shop</source>
          , Budapest, Hungary.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Deselaers</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          et al. (
          <year>2006</year>
          ).
          <article-title>Sparse patch- histograms for object classification in cluttered images</article-title>
          .
          <source>In DAGM 2006, Lecture Notes in Computer Science</source>
          , Berlin, Germany,
          <volume>4174</volume>
          ,
          <fpage>202</fpage>
          -
          <lpage>211</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. U. Avni,
          <string-name>
            <given-names>J.</given-names>
            <surname>Goldberger</surname>
          </string-name>
          ,
          <string-name>
            <surname>H. Greenspan.</surname>
          </string-name>
          , (
          <year>2008</year>
          )
          <article-title>TAU MIPLAB at ImageClef 2008, in working notes of the 2008 CLEF Work-shop,</article-title>
          <string-name>
            <surname>Aarhus</surname>
          </string-name>
          , Denmark
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>