<!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>IFSC/USP at ImageCLEF 2012: Plant identi cation task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dalcimar Casanova?</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jo~ao Batista Florindo??</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wesley Nunes Goncalves? ? ?</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Odemir Martinez Bruno</string-name>
          <email>bruno@ifsc.usp.br</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>USP - Universidade de S~ao Paulo IFSC - Instituto de F sica de Sa~o Carlos</institution>
          ,
          <addr-line>Sa~o Carlos</addr-line>
          ,
          <country country="BR">Brasil</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>ImageCLEF 2012 has a challenge based on leaf analysis for plant identi cation. This paper reports the method proposed by IFSC/USP team in the participation of this task. We try to explore several attributes (i.e. shape, location and texture) to make a system more accurate. The achieved results are promising and show as a principal outcome the power of texture on leaf analysis.</p>
      </abstract>
      <kwd-group>
        <kwd>Complex Network</kwd>
        <kwd>Fractal</kwd>
        <kwd>Taxonomy</kwd>
        <kwd>Plant identi cation</kwd>
        <kwd>Leaves</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Plants identi cation has become an important and challenging research area
since it is estimated that approximately one half of world plant species is still
not cataloged. Among such unidenti ed species one may nd, for instance, the
healing of a disease or a plant that can cooperate in the equilibrium of the
ecosystem around it. Despite the importance of studies related to the
description and categorization of plants, this is still a di cult task for a botanist once
this specialist still has a limited amount of information about the vegetal.
Furthermore, among the information which may be collected, the most relevant for
the botanist analysis are owers and fruits. However, it turns out that in most
cases these elements are observed only in speci c periods of the year. This is
a complicated issue given that the observation may not be possible when these
characteristics are noticeable.</p>
      <p>A solution for this impasse is the use of the plant leaf. This structure uses to
be observed the whole year and can be collected in a straightforward manner.
Nevertheless, most leaves lack more distinguishable attributes for a visual
analysis. Thus, image analysis based on computational tools is a worthwhile approach
in order to help the botanist or even provide by itself a reliable outcome for the
classi cation task.</p>
      <p>In this context, ImageCLEF is a world campaign to encourage the
development of novel strategies for the description and identi cation of objects, in this
case, plant leaves, based on computational/mathematical techniques applied over
digital images.</p>
      <p>
        As the group of this work has a signi cative background on computer vision
techniques applied to plant identi cation [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], we decided to engage in this
campaign and proposed a methodology combining complex networks and geometric
features of the leaf contour in addition to fractal descriptors of the texture
inside the leaf. These methods have already corroborated their e ciency on other
works related to plant identi cation tasks [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>This work is composed by 6 sections, including this introduction. The
following section describes brie y the materials and methods employed in the
experiments. The following one shows the experiments setup. The fourth section
shows obtained results over the training data. The fth one exhibits the results
for the test data set while the last section presents the conclusions of the results.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Material and Methods</title>
      <sec id="sec-2-1">
        <title>Database</title>
        <p>
          The experiments are performed over Pl@antLeaves dataset [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. This database
is maintained by the French project Pl@ntNet (INRIA, CIRAD, Telabotanica).
The full database contains 11572 images of 126 tree species. The images are
taken under 3 di erent practical conditions:
1. Scan: contains 6630 scans of leaves collected using atbed scanners. These
images are oriented vertically along the main natural axis and with the
petiole visible.
2. Scan-like photos: contains 2726 photos which look similar to the scans
images. Those images have uniform background but with some luminance
variations, optical distortions, shadows and color derivations.
3. Natural photos: contains 2216 photos taken directly from the trees. No
acquisition protocol is used, which results in a non-uniform background, rotated
and bad-scaled images, among other problems.
        </p>
        <p>Each image has an xml le associated that contain the date, type (single
leaf, single dead leaf or foliage), name of the author and GPS coordinates of the
observation among other data.</p>
        <p>The full database is split into training and testing dataset. The train dataset
has 8422 images (4870 scans, 1819 scan-like photos, 1733 natural photos) and
de test dataset have 3150 images (1760 scans, 907 scan-like photos, 483 natural
photos).
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Pre-processing</title>
        <p>
          For scan and scan-like photos in both test and train datasets, the Otsu's method
[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] was employed to automatically perform image thresholding. Since fully
automatic image thresholding is usually hard for natural photos, we have used two
strategies: (i) semi-automatic image segmentation proposed in [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] and (ii) fully
automatic k-means segmentation.
        </p>
        <p>Semi-automatic: rst, the photo is automatically segmented by the
wellknown mean shift segmentation method. Then, the user roughly indicates the
location of the leaf and the background by using some strokes (markers). The
regions marked by the user guide the merging process, which gradually labels
each non-marker region as either leaf or background based on the histogram
similarity.</p>
        <p>Automatic: the k-means algorithm is applied to cluster the pixels from the
photo into two groups based on the RGB color. Thus, pixels with similar color
are in the same group (e.g. green pixels which may be leaves). To decide which
group contains the leaf pixels, we calculate the mean RGB value of the central
region of the image. The centroid closest to the mean RGB value is chosen as
the leaf pixels.</p>
        <p>After the segmentation step, we apply a contour detection method to extract
the contour of the leaf. We do not bother to treat open or imperfect contours,
because the method of shape analysis is robust to such problems.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Leaf analysis features</title>
        <p>
          In order to explore several aspects of the leaf we use di erent kinds of methods.
Each method returns a feature vector that is used together in the nal classi er.
{ Complex Network: proposed by [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] this method explores and describes the
shape of objects using measurements of a graph model. In this method we
use T = f0:025; 0:050; 0:075; : : : ; 0:925g, totalizing 13 thresholds (jT j = 13).
We measure, for each threshold, the average and maximum degree resulting
in 26 features.
{ GPS coordinates: the XML le provided with the leaf image has the GPS
coordinates of the observation. We can consider this information as an a
priori knowledge, since the frequency of a specie may be higher in some
places. So, we use the latitude and longitude as feature vector (2 features)
{ Gabor lters: used before in leaf analysis by [
          <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
          ], the 2D Gabor lter
explores the texture aspect of the leaf. It is basically a bi-dimensional Gaussian
function moduled with an oriented sinusoid in a determined frequency and
direction. This procedure consists of convolving an input image by a family
of Gabor lters, which present various scales and orientations of the same
original con guration. We use a family of 64 lters (8 rotation lter and 8
scale lters), with a lower and upper frequency equal to 0.01 and 0.4,
respectively. The de nition of the individual parameters of each lter follows the
mathematical model presented in [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
{ Volumetric fractal dimension: other method used in leaf texture analysis is
the volumetric fractal dimension [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. The method is based on analyzing the
complexity of the surface generated by a texture. The dilatation procedure
is very sensitive to structural changes in the image, which are measured by
the in uence volume generated. In experiments we use rmax = 10, resulting
in 85 features.
{ Local binary patterns: this method [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] calculates the co-occurrence of
graylevels on circular neighborhoods. Each pixel is taken as a central pixel and
then we assign 1 to the neighbor pixels whose gray-level is greater than
the gray-level of the central pixel and 0 otherwise. Afterthat, a histogram
is built using the binary number of each central pixel. Since the histogram
contains a lot of features, we have used an extension called uniform local
binary patterns, which is used to reduce the length of the feature vector,
resulting in 51 features.
{ Geometric features: these features are extracted from the contour of the leaf
which is handled as being a generic shape. Thus, we extract the diameter,
aspect ratio, rectangularity, convex area ratio, convex perimeter ratio, form
factor, sphericity and eccentricity. These are morphological attributes which
are widely used in the literature and have demonstrated their e ciency in
works like [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Data analysis setup</title>
      <p>The imageCLEF task allows the submission of 3 di erent approaches trying to
recognize the leaves. In this way, we con gure 3 runs as:
1. IFSC USP run1: The training classi er is done with all features and we
simply concatenate them in order to obtain a single features vector (237
features). Additionally we used all samples for training (scan, like scan and
natural photos).
2. IFSC USP run2: this run is similar to IFSC USP run1 and the main di
erence is that only scan and like-scan images are used on training procedure.
The reason is try to avoid the in uence of bad-segmented leaves on training
set.
3. IFSC USP run3: For this run, we try a fully automated procedure. For
natural photos segmentation we use a simple clustering described above. So,
we use only Gabor and GPS features, due to the impossibility of measuring
shape information of this cluster-segmented images.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Results over training data</title>
      <p>In order to evaluate the accuracy of methods after submitting the results, we
use a 10-fold cross-validation over training data set. The employed classi er is a
Linear Discriminant Analysis (LDA), also known as Fisher discriminant.</p>
      <p>In a preliminary analysis, we investigate the accuracy of each method in an
independent way. The Table 1 shows this result. We notice that VFD provided
the best result in this case. This success is justi ed by the richness intrinsic to
the texture of leaves, which contain complex patterns with a high potential to
describe accurately the plant.</p>
      <p>In a subsequent analysis we try to concatenate theses features in order to
evaluate if each method explores di erent attributes of leaf data and images. The
result is the exact con guration of the run IFSC USP run1 presented above. As
expected, we have a very good result showed by Figure 1:</p>
      <p>We also comprobe that features which have not presented signi cative success
when used alone showed an expressive contribution when concatenated with
other features.</p>
      <p>Additionally, the Figure 1 shows as recognition rate increases if we consider
the classes with more a posteriori probabilities. If we are looking only at the class
with more higher probabilities, we get a 80:24% as success rate. As expected,
the accuracy increases if we consider a higher number of the possible classes. For
example, we reach 98:17% of accuracy if we look for the 9 most likely species
and 99:09 with 18 species with higher a posteriori probabilities.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Test data analysis and results</title>
      <p>We have submitted three runs to the plant identi cation task. The rst two runs
are human assisted while the third one is fully automatic. Table 2 presents the
classi cation score obtained for each run and each image type (scans, scan-like
photos and photos). We can see that the best average result was obtained by
the rst run. For the scan and scan-like, the results of the rst run show similar
results to the second run. For the photos, however, the result of the rst run was
superior to the other two runs. This result demonstrates that it is important
to train the classi er using features extracted from the photos. It is worth to
mention that the result of the rst run for the photos was the best of all runs
including other participants.</p>
      <p>Finally, we conclude that using di erent types of features (e.g. shape, texture
and GPS) improves the classi cation score in all image types. Moreover, the
human assisted segmentation is a good way to improve the discrimination of
natural photos.</p>
      <p>Run name</p>
      <p>No. of descriptors scan scan-like photos Avg
IFSC USP run1
IFSC USP run2
IFSC USP run3
Although we do not have the best results among all participants, we made some
good ndings about plant identi cation using leaves.</p>
      <p>As the main point, we have is the power of texture analysis in leaf
discrimination. We employ only simple methods and, besides the lack of standardization of
the images, especially images of free natural photos, the texture analysis works
ne.</p>
      <p>
        The results of texture methods are best than shapes approaches. In our
previous works [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], we had already noticed this phenomena and here we corroborate
them. In further, we hope that this morphological character be most studied.
      </p>
      <p>Otherwise, the synergy from the investigation of various aspects seems to be
the most promising ways, with good prospects to make a good system of leaf
identi cation with the use of all variables.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A. R.</given-names>
            <surname>Backes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Casanova</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O. M.</given-names>
            <surname>Bruno</surname>
          </string-name>
          .
          <article-title>Plant leaf identi cation based on volumetric fractal dimension</article-title>
          .
          <source>International Journal of Pattern Recognition and Arti cial Intelligence</source>
          ,
          <volume>23</volume>
          (
          <issue>6</issue>
          ):
          <volume>1145</volume>
          {
          <fpage>1160</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A. R.</given-names>
            <surname>Backes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Casanova</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O. M.</given-names>
            <surname>Bruno</surname>
          </string-name>
          .
          <article-title>A complex network-based approach for boundary shape analysis</article-title>
          .
          <source>Pattern Recognition</source>
          ,
          <volume>42</volume>
          (
          <issue>1</issue>
          ):
          <volume>54</volume>
          {
          <fpage>67</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Casanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. R.</given-names>
            <surname>Backes</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O. M.</given-names>
            <surname>Bruno</surname>
          </string-name>
          .
          <article-title>Measurements of color texture on plant leaf identi cation</article-title>
          .
          <source>In BIOMAT 2008 - International Symposium on Mathematical and Computational Biology</source>
          , Campos do Jord~ao,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Casanova</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. J. de Mesquita Sa Junior</surname>
            , and
            <given-names>O. M.</given-names>
          </string-name>
          <string-name>
            <surname>Bruno</surname>
          </string-name>
          .
          <article-title>Plant leaf identi cation using gabor wavelets</article-title>
          .
          <source>International Journal of Imaging Systems and Technology</source>
          ,
          <volume>19</volume>
          (
          <issue>3</issue>
          ):
          <volume>236</volume>
          {
          <fpage>243</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Go</surname>
          </string-name>
          eau,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bonnet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Yahiaoui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Barthelemy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Boujemaa</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.-F.</given-names>
            <surname>Molino</surname>
          </string-name>
          .
          <article-title>The imageclef 2012 plant identi cation task</article-title>
          .
          <source>In CLEF 2012 working notes</source>
          , Rome, Italy,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Knight</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Painter</surname>
          </string-name>
          ,
          <year>2010</year>
          .
          <article-title>Automatic Plant Leaf Classi cation for a Mobile Field Guide</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B. S.</given-names>
            <surname>Manjunath</surname>
          </string-name>
          and W.-Y. Ma.
          <article-title>Texture features for browsing and retrieval of image data</article-title>
          .
          <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          ,
          <volume>18</volume>
          (
          <issue>8</issue>
          ):
          <volume>837</volume>
          {
          <fpage>842</fpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Wu</surname>
          </string-name>
          .
          <article-title>Interactive image segmentation by maximal similarity based region merging</article-title>
          .
          <source>Pattern Recognition</source>
          ,
          <volume>43</volume>
          (
          <issue>2</issue>
          ):
          <volume>445</volume>
          {
          <fpage>456</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>T.</given-names>
            <surname>Ojala</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Pietikainen, and</article-title>
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Maenpaa. Multiresolution gray-scale and rotation invariant texture classi cation with local binary patterns</article-title>
          .
          <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          ,
          <volume>24</volume>
          (
          <issue>7</issue>
          ):
          <volume>971</volume>
          {
          <fpage>987</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N.</given-names>
            <surname>Otsu</surname>
          </string-name>
          .
          <article-title>A threshold selection method from grey-level histograms</article-title>
          .
          <source>IEEE Transactions on Systems, Man, and Cybernetics</source>
          ,
          <volume>9</volume>
          (
          <issue>1</issue>
          ):
          <volume>62</volume>
          {
          <fpage>66</fpage>
          ,
          <year>1979</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Rossatto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Casanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. M.</given-names>
            <surname>Kolb</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O. M.</given-names>
            <surname>Bruno</surname>
          </string-name>
          .
          <article-title>Fractal analysis of leaf-texture properties as a tool for taxonomic and identi cation purposes: a case study with species from neotropical melastomataceae (miconieae tribe)</article-title>
          .
          <source>Plant Systematics and Evolution</source>
          ,
          <volume>291</volume>
          (
          <issue>1</issue>
          ):
          <volume>103</volume>
          {
          <fpage>116</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>