<!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>Residual Network with Delayed Max Pooling for Very Large Scale Plant Identi cation</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>
          <xref ref-type="aff" rid="aff1">1</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>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Knowledge Data Engineering and Information Retrieval Laboratory, Department of Computer Science and Engineering, Toyohashi University of Technology</institution>
          ,
          <country country="JP">Japan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Residual Network with Delayed Max Pooling</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In our approach, we applied a few modi cations to the 50layered Residual Network. Our preliminary experiments with the PlantCLEF 2016 dataset showed that the modi cations improved classi cation performance. We have trained three models based on the modi ed Residual Network con guration with di erent combinations of trusted and noisy PlantCLEF 2017 datasets. Using con dence scores extracted from the three models, we have submitted four runs and our methods showed competitive classi cation performance.</p>
      </abstract>
      <kwd-group>
        <kwd>Plant Identi cation</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Down-sampling</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Max Pooling Based Down-sampling</title>
      <p>In ResNet-50, a total of three convolution operations1 with stride size 2 but lter
size 1 1 is used for down-sampling. As the lter size is smaller than stride size,
part of the activations may be ignored in the ltering i.e. convolution processes,
as demonstrated in Figure 1.</p>
      <p>Therefore, we reduced stride size of the three convolution operations in
ResNet-50 from 2 to 1. In addition to this, max pooling of stride size 2 and
lter size 2 2 are inserted before these convolution operations. We label this
modi ed con guration as ResNet-50-MP.
1.2
Down-sampling is an essential element in Convolutional Neural Network, which
reduces number of activations (as well as computational complexity). However,
1 Namely resf3,4,5ga branch2a based on the ResNet-50 model de nition in
github.com/KaimingHe/deep-residual-networks
applying down-sampling too early may leave too little activations for subsequent
convolution operations, thus impacting classi cation performance.</p>
      <p>
        In a paper by He et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], delaying down-sampling shows improved
classi cation performance. In their method, stride size of pooling operations are
reduced from 2 to 1, and stride size of their subsequent convolution operations
are increased from 1 to 2. In our method, we simply switched the position of the
newly introduced max pooling operations (in Subsection 1.1) with their
subsequent convolution operations. We label this con guration as ResNet-50-MPD.
2
      </p>
      <sec id="sec-2-1">
        <title>Network Training and Testing</title>
        <p>
          This section illustrates our implementation for the plant identi cation task i.e.
PlantCLEF. We use the Ca e framework by Jia et al. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] to implement all of the
con gurations. Note that all con gurations are trained from scratch i.e.
no pretrained weights are used.
2.1
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Input Data</title>
      <p>Data Augmentation. Training images are randomly scaled such that shorter
sides are in the range of [224; 336]. Scaled images are randomly rotated for 45 .
Rotated images are randomly cropped into 224 224, and nally the cropped
images are randomly horizontal ipped.</p>
      <p>As for test images, they are scaled such that the shorter sides become 224.
The scaled images are then horizontally ipped. Both ipped and non- ipped
images are applied into a trained network for prediction. Class-wise outputs
(before softmax normalization) of both instances are averaged and then softmax
normalized.</p>
      <p>Input Normalization. Mean centering of input is already a common
procedure to train or test a network. However, this alone may not be su cient as
variance is not considered in this process.</p>
      <p>
        Therefore, we attempted to normalize at higher order by applying Batch
Normalization [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] directly onto the (augmented) input. With Batch Normalization,
an input is normalized into zero mean and unit variance (and then scaled and
shifted accordingly). As the number of lters are quite limited i.e. 64 in the very
rst convolution layer of ResNet i.e. conv1, such normalization should facilitate
this convolution layer to learn lters of more varying features.
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Preliminary Experiments with PlantCLEF 2016 Dataset</title>
      <p>Dataset Preparation. ResNet-50, ResNet-50-MP and ResNet-50-MPD
congurations in Section 1 are trained for 100 epochs with PlantCLEF 2016 training
dataset. After each training epoch, each con guration is validated with
PlantCLEF 2016 test dataset. Omitting unseen images i.e. of ClassId 9999, a total
of 113204 training images and 4510 test images are utilized. Note that data
augmentation and normalization as detailed in Section 2.1 are applied to all
con gurations.</p>
      <p>Batch Size. The hardware we use for preliminary experiments is a single
NVIDIA's Tesla K40. We use largest possible batch sizes i.e. based on the
hardware's memory limitation of 12 GiB.</p>
      <p>Learning Schedule. Initial learning rate is 0.1 and is multiplied by 0.1 twice
throughout the training process. Training iterations for each learning rate is
divided with ratio 4:2:1 across 100 training epochs.</p>
      <p>In summary, batch sizes for both original ResNet-50 and ResNet-50-MP are
maximized at 31 and they are trained with learning rates 0.1, 0.01, 0.001 for
208671, 104336, 52168 iterations respectively. As for ResNet-50-MPD, the largest
possible batch size is 21 and this con guration is trained with the same learning
rates for 308038, 154019, 77010 iterations respectively. Validation accuracy of
the whole training process for all three con gurations is shown in Figure 2.
2.3</p>
    </sec>
    <sec id="sec-5">
      <title>Experiments with PlantCLEF 2017 Dataset</title>
      <p>Based on the results as shown in Figure 2, we selected the ResNet-50-MPD
con guration for this year's plant identi cation task.</p>
      <p>
        Dataset Preparation. Out of the 256287 trusted training images provided by
the task organizers of PlantCLEF 2017 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ][
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], we randomly selected around 110
of the images for validation purpose. Speci cally, after separating 25063 images
for validation, 231224 images remain for `trusted' training. As for noisy images,
out of the provided 1442642 metadata, we managed to obtain 99.0% of them,
speci cally 1428395 images.
      </p>
      <p>1.0
0.8</p>
      <p>Di erent combinations of trusted and noisy images are used to train the
ResNet-50-MPD con guration. Our rst model is trained with trusted training
images only2, and our second model is trained with noisy training images only3,
while our third model is trained with both mixed together. We label the rst as
model T, the second as model N, and the third as model X. All three models
are validated with the 25063 validation images.</p>
      <p>Batch Size. We use a single NVIDIA's Quadro P6000 to train the three
models. With 24 GiB memory, we were able to use batch size up to 47.
Learning Schedule. As the trusted and noisy datasets are a lot larger
compared to last year's, we were not able to train for 100 epochs but a xed amount
of training iterations. All three models are trained for 350000 iterations:
learning rate 0.1 for 200000 iterations, 0.01 for 100000 iterations and 0.001 for 50000
iterations. In other words, model T was trained for around 71 epochs, model
N was trained for around 12 epochs, while model X was trained for around 10
epochs. Validation accuracy of the training processes is summarized in Figure 3.
Run Submission. A total of 25170 test images are provided by the task
organizers. As detailed Subsection 2.1, each test image is scaled and then
horizontally ipped. Both ipped and non- ipped test images are applied into all
2 Corresponds to training set E in imageclef.org/lifeclef/2017/plant
3 Corresponds to training set W
1.0
0.8
three models i.e. model T, N and M. For each model, class-wise average of
condence scores (before softmax normalization) extracted from both ipped and
non- ipped images is computed. Additionally, class-wise average of con dence
scores with the same ObservationId is also computed. The averaged con dence
scores are then softmax normalized. We have submitted four runs with team
name KDETUT for this year's plant identi cation task, as summarized below.
{ KDETUT Run 1: Based on model T (trained with trusted images only)
{ KDETUT Run 2: Based on model N (trained with noisy images only)
{ KDETUT Run 3: Based on model X (trained with trusted and noisy img.)
{ KDETUT Run 4: Average of con dence scores based on model T and N
3</p>
      <sec id="sec-5-1">
        <title>Evaluation Result</title>
        <p>Mean Reciprocal Rank (MRR) is used as evaluation metric. Evaluation results
released by the task organizers are shown in Table 1 and Figure 4. Among the
submitted four runs, Run 4, which is average of con dence scores extracted from
model T and N, shows the best classi cation performance.</p>
      </sec>
      <sec id="sec-5-2">
        <title>Conclusion</title>
        <p>In this paper, we described our approach to PlantCLEF 2017, focusing on some
modi cations to the 50-layered Residual Network. Nevertheless, there are still
rooms for improvements in our approaches, as itemized below.</p>
        <p>{ Especially models trained with very large datasets i.e. model N and X, the
xed amount of 350000 training iterations may not be su cient. For example,
as detailed in Subsection 2.3, in fact model X is only trained for around 10
epochs. However, this setup already requires 4 days to train each model.
More training iterations i.e. longer training time may be required to achieve
superior classi cation performance.
{ Among the four runs we have submitted, Run 4 yields the highest
classication performance. It is based on average of con dence scores computed
from model T and N (one each). We believe classi cation performance can
be further improved if the con dence scores are averaged from even more
models, for example ve model T and ve model N. This is however at the
cost of multiplied computation time.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Goeau, H.,
          <string-name>
            <surname>Bonnet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joly</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Plant identi cation based on noisy web data: The amazing performance of deep learning (lifeclef 2017)</article-title>
          .
          <source>In: CLEF working notes 2017</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
          </string-name>
          , J.:
          <article-title>Convolutional neural networks at constrained time cost</article-title>
          .
          <source>In: Computer Vision and Pattern Recognition (CVPR)</source>
          ,
          <source>2015 IEEE Conference on (2015)</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
          </string-name>
          , J.:
          <article-title>Deep residual learning for image recognition</article-title>
          .
          <source>In: Computer Vision and Pattern Recognition (CVPR)</source>
          ,
          <source>2016 IEEE Conference on (2016)</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. Io e, S.,
          <string-name>
            <surname>Szegedy</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Batch normalization: Accelerating deep network training by reducing internal covariate shift</article-title>
          .
          <source>In: Proceedings of the 32nd International Conference on Machine Learning</source>
          ,
          <string-name>
            <surname>ICML</surname>
          </string-name>
          <year>2015</year>
          , Lille, France,
          <fpage>6</fpage>
          -
          <issue>11</issue>
          <year>July 2015</year>
          . pp.
          <volume>448</volume>
          {
          <issue>456</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Jia</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shelhamer</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Donahue</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karayev</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Long</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Girshick</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guadarrama</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Darrell</surname>
          </string-name>
          , T.:
          <article-title>Ca e: Convolutional architecture for fast feature embedding</article-title>
          .
          <source>In: Proceedings of the 22nd ACM international conference on Multimedia</source>
          . pp.
          <volume>675</volume>
          {
          <fpage>678</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Joly</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , Goeau, H.,
          <string-name>
            <surname>Glotin</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spampinato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bonnet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vellinga</surname>
            ,
            <given-names>W.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lombardo</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Planque</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palazzo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Muller, H.:
          <article-title>Lifeclef 2017 lab overview: Multimedia species identi cation challenges</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>