<!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>Classifying Patent Images</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Roland Morzinger</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andras Horti</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Georg Thallinger</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Naeem Bhatti</string-name>
          <email>bhatti@caa.tuwien.ac.at</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Allan Hanbury</string-name>
          <email>hanbury@ifs.tuwien.ac.at</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>JOANNEUM RESEARCH DIGITAL - Institute for Information and Communication Technologies Steyrergasse 17</institution>
          ,
          <addr-line>8010 Graz</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Vienna University of Technology Institute for Computer-Aided Automation Favoritenstr.</institution>
          <addr-line>9-11/183, 1040 Vienna</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Vienna University of Technology Institute for Software Technology and Interactive Systems Favoritenstr.</institution>
          <addr-line>9-11/188, 1040 Vienna</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This report presents the work carried out for the image classi cation task in the course of the CLEF-IP 2011 competition. Based on the visual content, patent images are automatically classi ed into several drawing types, such as abstract drawings, tables, ow chart and graphs. For that purpose, a series of SVM classi ers, multi-modal fusion schemes and a variety of content-based low-level features for black and white images were used. The overall reported performance was promising. Our best runs achieved a true positive rate of over 66% and the reported average area under curve is over 0.9.</p>
      </abstract>
      <kwd-group>
        <kwd>patent</kwd>
        <kwd>image</kwd>
        <kwd>classi cation</kwd>
        <kwd>technical drawings</kwd>
        <kwd>SVM</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        There are many di erent types of images in patents, such as technical
drawings, diagrams, photos, ow charts and graphs [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In patents, these images are
linked to the text through references which usually only contain the label 'Fig.',
see examples in Figure 1. In many patent examination tasks, it is important
to focus an analysis on a speci c type of image. This information is frequently
not available in the patent text. The automatic classi cation of the drawing
type of patent images is helpful for restricting the search to relevant gures. For
example, shape-based similarity search for shapes with Gaussian distribution
can be automatically restricted to all images with graphs and all other image
types such as abstract drawings are disregarded in the search process. Moreover,
classi cation results from automatic content-based analysis can be used to
validate text-based classi cation of the drawing type. This paper presents methods
for automatic content-based classi cation of patent images into several drawing
types (classes) for the image classi cation task (IMG CLS) in CLEF-IP 2011.
The aim of the image classi cation task is to automatically classify the type
of patent images based on their visual content. Manually classi ed and checked
data is provided for training, and the long term aim is, based on these training
data, to make it possible to reliably classify the millions of images in patents.
It is required to classify images into these 9 classes: abstract drawing, chemical
structure, program listing (code), gene sequence (dna), ow chart, graph, math
formula, table and character (symbol). This paper describes the work done for
producing the results for the image classi cation challenge.
      </p>
      <p>The rest of this paper is organized as follows: Section 2 describes the used
content-based features in detail, Section 3 outlines the classi cation process.
Results are presented in Section 4.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Features for content-based classi cation</title>
      <p>The content-based features described in this section are the basis for the image
classi cation. All features were extracted globally for each image in the training
and test set.</p>
      <p>
        Local Binary Patterns (LBP) The LBP [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is a simple yet very e cient
texture operator which labels the pixels of an image by thresholding the
neighborhood of each pixel and considers the result as a binary number. The
descriptor is a histogram of 8-digit binary numbers which yields 256 feature
values.
      </p>
      <p>
        MPEG-7 Edge Histogram (EH) The edge histogram descriptor[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] represents
the spatial distribution of ve types of edges, namely four directional edges
and one non-directional edge. We use a global histogram generated directly
from the local edge histograms of 4x4 sub-images. The nal descriptor
comprises 80 features values.
      </p>
      <p>Optical Character Recognition (OCR) The following feature values were
obtained by applying an optical character recognition toolkit 4 on the
images: font size, number of of text blocks, ratio between area of text blocks
and image area image size, number of ' g' occurrences, number of 'tab'
occurrences, number of digits and image orientation.</p>
      <p>Binary Image Features (BIF) For each of the images a descriptor with total
length of 12 was computed. It comprises the image's Euler number, mean,
standard deviation, variance, skewness, kurtosis, perimeter, area, number of
(4- and 8-) connected components, thinness ratio and density.</p>
      <p>The range of all feature vectors in the training set was linearly scaled between
0 and 1. The feature values in the test set were rescaled accordingly.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Semi-supervised classi cation</title>
      <p>
        Our approach to patent image classi cation is based on training support vector
machines (SVMs) since they had achieved satisfactory performance in related
tasks over the past few years. The challenge of classifying a patent image into
one of the 9 classes, see Section 1, was regarded as a sest of two-class problems
(i.e. ' ow chart' or 'no ow chart' and 'graph' or 'no graph'), where for each
problem the positive and negative examples were extracted from an existing
annotated training set. The maximum of the scores yields the nal classi cation
for an image. Since for all classes there were more negative examples than
positive examples, the SVM training data for a speci c class was composed of all
its positive annotations with an equal number of negative annotations randomly
selected from the remaining classes. The training data, contains between 310
(for ow charts) and 5983 (for dna) training images per class. For better
comparability we assured that the random selection produced the same annotations
across di erent runs. In total, 36 SVMs (9 classes * 4 feature sets) were produced
using the LIBSVM software package [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. We adopted the Gaussian RBF kernel
function. Due to limited time and computational power, only half of SVMs were
tuned by grid search with cross-validation in order to select the best choice of
the parameters C and .
      </p>
      <p>
        The list below describes the speci c con guration of the 8 runs produced. For
runs with a single modality, only one of the previously mentioned content-based
features was chosen. The other 4 runs apply various simple late fusion methods
4 http://www.leadtools.com/sdk/ocr/
on the output of the base classi ers. Late fusion rst reduces unimodal features
to separately learned scores, then these scores are integrated to produce nal
scores for the classes [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
arcturus Run uses EH feature set.
vega Run uses OCR feature set.
alphacentauri Run uses LBP feature set.
procyon Run uses BIF feature set.
betelgeuse Maximum probability of the scores obtained in the runs using the
feature sets OCR, EH and LBP.
sirius Joint probability (product) of the scores obtained in the runs using the
feature sets OCR, EH and LBP.
canopus Mean probability of the scores obtained in the runs using the feature
sets OCR, EH and LBP.
rigel Joint probability (product) of the scores obtained in the runs using the
feature sets OCR, EH and LBP. For weighting each score is multiplied by its
absolute di erence from the mean classi cation scores for the image. This
puts emphasis on cases where an image has a high score for a single class
rather than similar scores for all classes.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Results and Evaluation</title>
      <p>In order to get a rst impression of the image classi cation task, exemplary
classi cation results from the test data are presented in Figure 5. For each of the 9
classes (from top to bottom row: abstract drawing, chemical, code program, gene
sequence/dna, ow chart, graph, maths, table, character/symbol) the 5 images
with highest classi cation scores are shown. The images with chemical structures,
mathematical formulas and symbols are apparently easy to discriminate. On the
contrast, tables and code programs seem visually similar. The last image in the
row with gene sequences was incorrectly classi ed. The second image in the row
of graphs shows an abstract drawing and was also misclassi ed which is possibly
due to its graph like curved structure. The analysis has to deal with images with
multiple gures (of the same class in our case), see last image in row with graphs.
Another challenge is the variable and unknown orientation of the images. As can
be seen in the row with tables and graphs, some of the images are rotated.</p>
      <p>The test data consists of 1000 unclassi ed images. For each of the images
the type of the image was classi ed. Figure 2 shows the performance per run
and class using the Area under Curve (AUC) and True Positive Rate (TPR)
measures. From the submitted 8 runs, 5 runs achieved satisfactory performance
indicated by an AUC value of 0.9 an above. The best run according to the TPR
measure is alphacentauri with an accuracy of 66.3% and AUC of 0.96, slightly
outperforming the runs with score fusion (TPR between 62.4% and 65.3%). The
good performance is obviously due to the feature LBP. Interestingly, a fusion
with other features did not improve the classi cation results on average. As can
be seen in Figure 2, the fusion with OCR and EH was only bene cial for the
classes ow chart (improvement from 44.7% to 82.8%), abstract drawing (from
54.2% to 75.3%) and table (from 68.7% to 76.5%). The single modalities using
OCR, EH, or BIF only did not provide satisfactory results on average. Most or
even all of the characters/symbols were correctly classi ed even when applying
runs that use features that generally came of badly.</p>
      <p>A detailed view on the performance of the run alphacentauri is shown in
Figure 3. Very promising results could be achieved for characters/symbols, chemical
structures and math formulas (AUC value over 0.95). The image types abstract
drawing, ow charts and graphs are di cult cases mainly due to their intra-class
variance.</p>
      <p>A confusion matrix for run alphacentauri is given in Figure 4. Actuals belong
on the side of the confusion matrix and predictions are across the top. For the
classi er many image types (all but chemical, maths and characters) seem to
be di cult to distinguish from tables. Similarly, graphs were di cult to classify.
No or hardly any confusion was attained for the types chemical, maths and
characters.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>This paper presented the experiments for our participation in the CLEF-IP
image classi cation challenge. The type of images in patents was automatically
classi ed by using SVM classi ers and simple multi-modal fusion schemes. A
variety of content-based low-level features for black and white images were used.
Generally, training the SVM models and in particular the parameter tuning is
a computationally expensive process and must not be neglected. The
performance of the classi ers tested on 1000 patent images was promising. Our best
runs achieved a true positive rate of over 66% and the reported average area
under curve is over 0.9 for 4 of the 8 submitted runs. Some classes have been
identi ed better by using only a single input feature and others by late fusion.
Consequently, for di erent classes di erent features and fusion methods should
be applied.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments References</title>
      <p>This work was supported by the Austrian Research Promotion Agency (FFG)
FIT-IT project IMPEx 5 Image Mining for Patent EXploration (No. 825846).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>C.-C. Chang</surname>
            and
            <given-names>C.-J.</given-names>
          </string-name>
          <string-name>
            <surname>Lin</surname>
          </string-name>
          .
          <article-title>LIBSVM: a library for support vector machines</article-title>
          ,
          <year>2001</year>
          . Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>2. MPEG-7. Multimedia content description interface</article-title>
          .
          <source>Technical report, Standard No. ISO/IEC n15938</source>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>T.</given-names>
            <surname>Ojala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pietikainen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Harwood</surname>
          </string-name>
          .
          <article-title>A comparative study of texture measures with classi cation based on feature distributions</article-title>
          .
          <volume>29</volume>
          (
          <issue>1</issue>
          ):
          <volume>51</volume>
          {
          <fpage>59</fpage>
          ,
          <year>January 1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>C. G. M. Snoek</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Worring</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. W. M.</given-names>
            <surname>Smeulders</surname>
          </string-name>
          .
          <article-title>Early versus late fusion in semantic video analysis</article-title>
          .
          <source>In MULTIMEDIA '05: Proceedings of the 13th annual ACM international conference on Multimedia</source>
          , pages
          <volume>399</volume>
          {
          <fpage>402</fpage>
          , New York, NY, USA,
          <year>2005</year>
          . ACM Press.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>S.</given-names>
            <surname>Vrochidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Papadopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moumtzidou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sidiropoulos</surname>
          </string-name>
          , E. Pianta,
          <string-name>
            <given-names>and I.</given-names>
            <surname>Kompatsiaris</surname>
          </string-name>
          .
          <article-title>Towards content-based patent image retrieval: A framework perspective</article-title>
          .
          <source>World Patent Information</source>
          ,
          <volume>32</volume>
          (
          <issue>2</issue>
          ):
          <volume>94</volume>
          {
          <fpage>106</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>