<!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>Bluefield (KDE TUT) at LifeCLEF 2016 Plant Identification Task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Siang Thye Hang</string-name>
          <email>hang@kde.cs.tut.ac.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Atsushi Tatsuma</string-name>
          <email>tatsuma@cs.tut.ac.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Masaki Aono</string-name>
          <email>aono@tut.jp</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Knowledge Data Engineering&amp; Information Retrieval Laboratory (KDE Lab), Department of Computer Science and Engineering, Toyohashi University of Technology</institution>
          ,
          <country country="JP">Japan</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we propose an automatic approach for plant image identification. We enhanced the well-known VGG 16-layers Convolutional Neural Network model [1] by replacing the last pooling layer with a Spatial Pyramid Pooling layer [2]. Rectified Linear Units (ReLU) are also replaced with Parametric ReLUs [3]. The enhanced model is trained without external dataset. A post processing method is also proposed to reject irrelevant samples. We further improved identification performance using observation identity (ObservationId) provided in the dataset. Our methods showed outstanding performance in official evaluation results of the LifeCLEF 2016 Plant Identification Task.</p>
      </abstract>
      <kwd-group>
        <kwd>LifeCLEF</kwd>
        <kwd>plant identification</kwd>
        <kwd>deep learning</kwd>
        <kwd>sample rejection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Nowadays, conservation of biodiversity is becoming an important duty for us. To
achieve this, accurate knowledge is essential. However, even for professionals,
identifying a species can be a very difficult task. Convolutional Neural Networks (CNNs)
are leading the best performance in various image retrieval tasks such as the
ImageNet Large Scale Visual Recognition Challenge (ILSVRC) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. CNNs
learn filters of filters through multiple convolution layers, enabling higher level of
abstraction than hand crafted features such as Scale Invariant Feature Transform
(SIFT).
      </p>
      <p>
        In recent years, CNN has gained popularity in various image retrieval tasks
including the LifeCLEF Plant Identification Task (PlantCLEF). Over the past years,
participants of PlantCLEF have adopted to use CNN in their works [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. In PlantCLEF 2016
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], in addition to the 1000 class identification task, a new problem is introduced.
The evaluation set consists of not only native plant images but also images of
potentially invasive plants or irrelevant objects such as a table or a computer keyboard.
      </p>
      <p>Considering the new setting, we propose a post processing method to reject these
samples. In the next section we propose to enhance the VGG 16-layers model with
Spatial Pyramid Pooling and Parametric Rectified Linear Units. We detail our model
training strategy in Section 3, followed by irrelevant sample rejection algorithm in
Section 4. Section 5 shows evaluation results and Section 6 concludes this paper.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Model Enhancement</title>
      <p>In the following sections, a few enhancements to the VGG 16-layers model will be
described.
2.1</p>
      <p>Spatial Pyramid Pooling
The original VGG 16-layers model requires input image of spatial size 224 × 224.
On the other hand, the images in the PlantCLEF 2016 dataset are arbitrarily sized, as
shown in Figure 1. Following the spatial size restriction in VGG 16-layers model,
input images has to be either cropped or warped. Both of these methods may lead to
information loss.</p>
      <p>vertical image
square image</p>
      <p>
        horizontal image
0.50
0.56
0.63
0.71
0.83
1.00
1.20
1.40
1.60
1.80
2.00
To circumvent such restriction, we have replaced the last pooling layer (pool5) with a
Spatial Pyramid Pooling (SPP) layer [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The last convolution layer (conv5_3)
produces feature map of 512 channels. With SPP, the feature map is spatially divided
into 1 × 1, 2 × 2, 4 × 4, a total of 21 regions. Each region is then average pooled,
producing a vector of fixed size 21 × 512 = 10752. Such conversion of arbitrarily
sized feature map into a fixed size vector allows the model to accept input image of
any size. Meanwhile, with such layer replacement, the number of parameters in the
model is reduced from 138 million to 80 million.
We have also replaced all of the Rectified Linear Unit (ReLU) activations with a
learnable version known as Parametric ReLU [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], which consistently outperforms
ReLU in empirical experiments by Bing et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Before training, we initialize the
30
25
20
15
10
5
0
t
e
s
a
t
a
d
f
o
%
aspect
ratio
learnable parameters with 0.05. Weight decay of the learnable parameters is disabled
throughout the training process.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Model Training</title>
      <p>The following strategies are used to train the enhanced model.
3.1</p>
      <p>Data preparation
The PlantCLEF 2016 dataset consists of 113204 images. 2048 images are used for
validation purpose, while the remaining 111156 images are used to train the model.</p>
      <p>We have augmented the training images as follows: while preserving aspect ratio,
images are resized such that the shorter side becomes 224 and 336. Random cropping
to 224 × 224 and random flipping by y-axis are also applied to the resized images.
For evaluation process, images are resized such that the shorter side becomes 224, and
no cropping or flipping is applied. Cropping is not required during evaluation as the
enhanced model accepts image of any size.
3.2</p>
      <p>Image Mean
As the enhanced model is trained from scratch i.e. without external resources, image
mean is computed from the training set. Excluding LeafScan images (with high RGB
values due to bright background), the computed mean values of red, green and blue
channels are 105, 111, and 79 respectively. Images augmented in Section 3.1 are
subtracted with these mean values before being used for training.
3.3</p>
      <p>
        Training
We use the Caffe framework to train the enhanced model. To train such a deep model,
we use Xavier’s method [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] to initialize the weights of the convolution and fully
connected layers. We train the model using Stochastic Gradient Descent with
momentum 0.9, learning rate 0.01 through 0.0001, and batch size 50. The learning rate is
multiplied by 0.1 when the validation accuracy stops improving. As the result, we
have trained with learning rate 0.01 for 30 epochs, 0.001 for 15 epochs and finally
0.0001 for 8 epochs. Figure 2 shows the normalized softmax loss of both training and
validation. Figure 3 shows the validation accuracy of the first prediction.
training
validation
epoch
epoch
The next section discusses the One-Versus-All method’s limitation to reject irrelevant
samples in multiclass classification. To overcome such problem, an algorithm is
proposed in Section 4.2.
With (1), it is guaranteed a class will be assigned to  , regardless how high or low the
scores produced by each classifier. Figure 4’s first example (from left) is ideal, as
there is only one strong positive score, thus we can confidently predict that input  in
weak or no positive score. With (1), input  is classified to the third class, while
input  is classified to the first class, despite that all of the scores are rather low or even
negative.
      </p>
      <p>F(α)</p>
      <p>F(β)
1
2
3
class
4</p>
      <p>F(γ)
1
2
3
class
4
1
2
3
class
4
Based on the scenario above, we realized that there are cases that a sample should be
rejected by all of the binary classifiers. To identify such irrelevant sample, an
algorithm is elaborated in the next section.
4.2</p>
      <p>Irrelevant Sample Rejection Algorithm
After training the enhanced model as mentioned in Section 3, a matrix of raw (i.e.
before softmax normalization) scores   × of 
classes and 
training samples are
extracted from the classifier layer (fc8). Incorrect predictions are omitted. With only
correctly predicted class scores   ′× ( ′ ≤  ), rejection threshold  = [ 1, … ,   ]
of each class is computed from the class wise minima, as shown in (2).

 =
  ′
min   ,
(2)</p>
      <p>Fig. 5. Rejection threshold  of the training set, sorted in ascending order
30
25
20
15
10
5
0
threshold
class (sorted)
During evaluation, any sample with score lower than  for all of the classes will be
rejected as irrelevant. With the evaluation set, 195 out of 8000 images are rejected.
Some of the images are shown in Figure 6.
ing training set thresholds are computed, and then averaged into  . As detailed in (3),
the denominators are the thresholds of the training set, while the numerators are of the
validation set. The values in (3) are based on Figure 7.</p>
      <p>=
 is then multiplied to the threshold  of the training set, as shown in (4), before using
it to reject samples during evaluation.</p>
      <p>′ =  
(4)
Applying  ′ to the evaluation set, only 69 samples are rejected as it is lower compared
to the original  . Some of the images are shown in Figure 8.
Identification based on a single image may be insufficient. In the PlantCLEF2016
dataset, images based on the same observation share a unique ObservationId. One
ObservationId may be assigned with multiple images of different organs. Specifically
images of flower or fruit which have much characteristic features, their existence in
an observation often improves identification performance.</p>
      <p>To further improve the identification performance, after rejecting samples as
explained in Section 4.2 and 4.3, we sum the raw (i.e. before softmax normalization)
class scores of images with the same ObservationId. The summed scores are then
softmax normalized. As the result, images with the same ObservationId share the
same normalized scores.
5</p>
    </sec>
    <sec id="sec-4">
      <title>Evaluation</title>
      <p>In our evaluation experiments, the enhanced CNN model is used to extract class
scores. Four different post processing methods are then applied to the extracted class
scores, detailed as follows. As mentioned in Section 4.2 and 4.3,  is the rejection
threshold obtained from training set, while  ′ is the rejection threshold obtained by
considering both training and validation sets.</p>
      <p>─ Run 1: Sample rejection with  , identification based on single sample
─ Run 2: Sample rejection with  ′, identification based on single sample
─ Run 3: Sample rejection with  , observation based identification
─ Run 4: Sample rejection with  ′, observation based identification
In our run files (Bluefield), we provide scores up to top 30 classes, and rejected
samples are entirely excluded from our run files. Evaluation results compared with other
participants are summarized in Table 1 and Figure 9.
Bluefield Run 4 yields the highest official score among all of the participants. Usage
of ObservationId shows significant improvement. On the other hand, rejection
threshold  ′ that takes validation set into account shows a slight improvement in official
MAP.
6</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>In this paper, we described our approach to PlantCLEF 2016, focusing on model
enhancements, data augmentations, and an irrelevant sample rejection strategy. We still
leave some rooms for improvements, which are itemized as follows:
 As mentioned in Section 3.1, images for training process are resized to two scales.</p>
      <p>We should consider applying random scaling instead of a constant number of (two)
scales. Other than scaling, random rotation should be applied as well.
 In Section 4.2 and 4.3, instead of taking minima as rejection threshold, we should
consider using mean and standard deviation to obtain a more stable threshold.
 The PlantCLEF 2016 dataset includes rich metadata information such as Genus,
Family, Date, Longitude, Latitude, Location and Content (organ type). However, in
our work, only ClassId (class label) and ObservationId are used. More metadata
information should be utilized to obtain more accurate identification performance.
We would like to thank MEXT KAKENHI, Grant-in-Aid for Challenging Exploratory
Research, Grant Number 15K12027 for partial support of our work.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>K.</given-names>
            <surname>Simonyan</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Zisserman</surname>
          </string-name>
          ,
          <article-title>"Very Deep Convolutional Networks for LargeScale Image Recognition,"</article-title>
          <source>in CVPR</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ren</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <article-title>"Spatial Pyramid Pooling in Deep Convolutional Networks for Visual Recognition,"</article-title>
          <source>in TPAMI</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ren</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <article-title>"Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification,"</article-title>
          <source>in CVPR</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>A.</given-names>
            <surname>Krizhevsky</surname>
          </string-name>
          , I. Sutskever and
          <string-name>
            <given-names>G. E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <article-title>"ImageNet Classification with Deep Convolutional,"</article-title>
          <source>in NIPS</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>C.</given-names>
            <surname>Szegedy</surname>
          </string-name>
          , W. Liu,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sermanet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Reed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Anguelov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Erhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vanhoucke</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Rabinovich</surname>
          </string-name>
          ,
          <article-title>"Going deeper with convolutions,"</article-title>
          <source>in CVPR</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ren</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <article-title>"Deep Residual Learning for Image Recognition,"</article-title>
          <source>in CVPR</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>H.</given-names>
            <surname>Goeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bonnet</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Joly</surname>
          </string-name>
          ,
          <article-title>"LifeCLEF Plant Identification Task,"</article-title>
          <source>in CLEF</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>A.</given-names>
            <surname>Joly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Goëau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Glotin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Spampinato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bonnet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.-P.</given-names>
            <surname>Vellinga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Champ</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Planqué</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Palazzo</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <article-title>"LifeCLEF 2016: Multimedia Life Species Identification Challenges,"</article-title>
          <source>in LifeCLEF</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>H.</given-names>
            <surname>Goëau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bonnet</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Joly</surname>
          </string-name>
          ,
          <article-title>"Plant Identification In An Open-World (LifeCLEF</article-title>
          <year>2016</year>
          ),
          <article-title>"</article-title>
          <source>in PlantCLEF</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. B.
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            and
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>"Empirical Evaluation of Rectified Activations in Convolution,"</article-title>
          <source>in CVPR</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>X.</given-names>
            <surname>Glorot</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <article-title>"Understanding the difficulty of training deep feedforward neural networks,"</article-title>
          <source>in AISTATS</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>