<!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>Fine-Grained Plant Classi cation Using Convolutional Neural Networks for Feature Extraction</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Niko Sunderhauf</string-name>
          <email>niko.suenderhauf@qut.edu.au</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chris McCool</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ben Upcroft</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tristan Perez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Agricultural Robotics Program, Queensland University of Technology 2</institution>
          <addr-line>George Street, Brisbane QLD 4001</addr-line>
          ,
          <country country="AU">Australia</country>
        </aff>
      </contrib-group>
      <fpage>756</fpage>
      <lpage>762</lpage>
      <abstract>
        <p>We present an overview of the QUT plant classi cation system submitted to LifeCLEF 2014. This system uses generic features extracted from a convolutional neural network previously used to perform general object classi cation. We examine the e ectiveness of these features to perform plant classi cation when used in combination with an extremely randomised forest. Using this system, with minimal tuning, we obtained relatively good results with a score of 0:249 on the test set of LifeCLEF 2014.</p>
      </abstract>
      <kwd-group>
        <kwd>convolutional neural network</kwd>
        <kwd>extremely random forest</kwd>
        <kwd>plant classi cation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Future food security presents a serious challenge. To sustain the projected world
population of over 9 billion in 2050, the current worldwide production of food
will have to almost double. This is a signi cant challenge given that the land
allocation dedicated to agriculture has already peaked in most countries. In
addition, agriculture requires a signi cant amount of energy and water, and it is
a large contributor to green-house-gas emissions. To overcome these problems
requires alternative approaches such as the use of new crop varieties with
increased yield and robustness to climate change, the adoption of policies leading
to sustainable practices, and the development of new technologies to increase
the e ciency of farms.</p>
      <p>Robot technology in farms will play an important role in the near future
in several applications. For both in eld and crop management, robots could
contribute to the e cient use of energy, herbicides, pesticides, water, and
fertiliser by measuring plant growth and detecting weeds/pests. In harvesting of
horticultural produce, robots could contribute to increased yield and quality by
automating the picking and grading processes. To do this requires sophisticated
algorithms that could identify plants in their various states of growth.</p>
      <p>
        The Plant Identi cation Task [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] of the LifeCLEF challenge [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] is an
established benchmark for ne-grained plant classi cation. The task asks the
participating teams to correctly identify the images taken of 500 di erent herbs, trees,
and fern species from France. The provided training dataset consists of over
47,000 individual images that are organized into observations. Each of these
observations can contain multiple images from the same plant, but from di erent
parts of it. These di erent parts are referred to as content categories and include:
Branch, Stem, Leaf, LeafScan, Fruit, Flower and Entire.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Our Approach</title>
      <p>
        We investigate the potential for generic features obtained from a well trained
convolutional neural network (CNN) to perform the task of plant classi cation.
This is a ne-grained image classi cation problem which has previously been
addressed by deriving hand-crafted features. By contrast, our proposed system
uses features from a CNN that was initially trained for general object classi
cation [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] using millions of images from the ImageNet dataset. To classify these
generic pre-trained features we make use of an extremely randomised forest. We
brie y describe our features and classi er below.
2.1
      </p>
      <p>
        Convolutional Neural Networks as Generic Feature Detectors
Convolutional neural networks (CNNs) were proposed in 1989 by LeCun et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]
to recognize hand-written digits. CNNs learn a sparser connection between
regions of an image and the NNs by imposing spatial dependencies; this can reduce
complexity. However, the broad applicability of CNNs has only recently shown
promise most likely due to the availability of large datasets, growth in
computational power, availability of GPUs and e cient algorithms such as recti ed
linear units [
        <xref ref-type="bibr" rid="ref1 ref6">1, 6</xref>
        ] which have been used to train these large networks.
      </p>
      <p>
        Several research groups have explored the potential of these large CNNs to
outperform more classical approaches to object recognition or detection that are
based on hand-crafted features [
        <xref ref-type="bibr" rid="ref10 ref11 ref2 ref4 ref8">2, 4, 8, 10, 11</xref>
        ]. The CNN systems applied in these
large-scale object recognition or detection tasks consist of a feature extractor (the
actual CNN) followed by a classi er or regressor. Razavian et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] showed that
combining CNN features with a simple classi er such as a linear SVM is highly
competitive or even superior to classical approaches for a variety of recognition
and detection tasks. We therefore follow the approach of Razavian et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
and apply a pre-trained CNN as a generic feature extractor to the images of the
LifeCLEF Plant Task.
      </p>
      <p>
        In our approach, we use the pre-trained Overfeat [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] features which is a
CNN system. For feature extraction, we examine the e ectiveness of using
either the rst or second fully connected layers { referred to as Layer 17 and
Layer 19 respectively. To use the Overfeat features, we downsample the images
so that the smallest dimension is 231 pixels wide or high respectively, this is
because the Overfeat network operates on a region of size 231 231. The
extracted features are vectors of length 3; 072 or 4; 096 for Layer 17 and Layer 19
respectively. Overfeat will extract several feature vectors per image in a sliding
window fashion unless the images are square (231 231). These feature vectors
are then fed into an ensemble of extremely randomized trees that performs the
actual classi cation.
2.2
      </p>
      <p>
        Extremely Randomized Trees Classi er
An extremely randomized tree classi er (extratree) is a tree-based ensemble
method for supervised classi cation. It is conceptually similar to random
forest classi ers, but takes the idea of randomness one step further. In contrast to
decision trees that are designed o ine and derived from expert knowledge, an
extremely randomized tree classi er learns the layout of its ensemble of trees from
training data. The classi er output is a probability distribution over all classes,
in our case this would over all 500 possible species in LifeCLEF. We refer the
reader to the literature [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] for a further discussion of extremely randomized trees.
      </p>
      <p>We train a separate classi er for each of the content categories in the
LifeCLEF dataset. Thus for each category, Branch, Leaf or LeafScan, we have a
separate extremely randomized tree. To handle multiple samples from each
image the classi cation results of the extratrees are combined to provide just one
prediction per observation. This is achieved by averaging the output
(probability distribution) for all features from an image and results in one probability
distribution for each image.</p>
      <p>PlantCLEF introduces a further di culty in that an observation can have
multiple images or even multiple content categories available. To combine the
information from multiple images, or even multiple content categories, we treat the
result of each image as a likelihood score and sum them into a single distribution
of prediction scores over the 500 di erent classes for each observation.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Experimental Setup</title>
      <p>To derive the hyper parameters for our system, we performed cross validation.
The training dataset was split into two tests: the system is trained using 95%
of the training observations and then evaluated on the remaining 5%. We note
that our choice for forming the cross-validation dataset is overly simpli ed as we
uniformly sample across observations and do not uniformly sample over classes
(species) and observations; this means that we do not enforce an equal ratio
between classes and observations of the training and the evaluation sets. Finally,
we only used observations with a user-provided quality score of 3 or above in
the training and validation stage.</p>
      <p>The parameters of the ensemble classi er are tuned by sampling the
parameter space. The resultant values are listed in Table 1. Our system is implemented
in Python and uses the extratrees implementation of scikit-learn1.
1 http://scikit-learn.org/
size of ensemble 65 trees
used feature elements 64
tree depth 15
information gain measure entropy
4</p>
    </sec>
    <sec id="sec-4">
      <title>Results</title>
      <p>A total of ten teams participated in the challenge and we ranked 4th in the team
ranking. In Figure 1, we present the results using the LifeCLEF score metric
where it can be seen that our approach scored 0:249; to facilitate interpretation
of this plot we associated the runs of the top 4 teams with a di erent color.
This is slightly worse than BME TMIT systems and considerably better than
the FINKI systems.</p>
      <p>To understand better the performance of our system, we examined the
recognition accuracy for each content category. In Figure 2, we present the recognition
accuracy for our system for each content category and also for using di erent
layers of the neural network (Layers 17 and 19). We can see that our system is most
accurate for the LeafScan category and achieves a rank-1 identi cation rate of
more than 50%. The second best category is Flower with a rank-1 identi cation
rate of almost 25%. After this, our rank-1 identi cation rate for the categories
falls below 20% and performs worst on the Branch category. We believe that
the considerable performance di erence on the LeafScan category is due to the
fact that these images contain a single leaf image which is usually well centered
and has a homogeneous background; this greatly simpli es the feature extraction
stage and consequently classi cation. By contrast, other categories such as Fruit,
Branch and Leaf, have highly varying backgrounds and the object of interest is
rarely well centered or at a consistent scale. Finally, we note that despite the
considerable performance di erence between LeafScan and the other categories,
our overall system performance is acceptable. We believe this is because most of
the images in the dataset appear to be LeafScan images.</p>
      <p>
        Comparing the performance of the two di erent extracted feature sets, we can
see in Figure 2 that Layer 19 provides the best overall score. Layer 17 is the rst
fully connected layer and Layer 19 is the second fully connected layer. Examining
the performance on a per category basis, we can see that Layer 17 and 19 have
similar performance except for Flower and Fruit where Layer 19 outperforms
Layer 17. By contrast, Layer 17 provides slightly better performance for the
Stem category. We want to point out that Razavian et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] used the rst fully
connected layer (Layer 17) in their work.
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Work</title>
      <p>The initial results of our plant classi cation system using CNNs provides
competitive performance. We have found that using Layer 19, rather than Layer 17,
provides superior performance for the task of plant classi cation. Nevertheless,
some issues are worth considering further.</p>
      <p>One major issue is that we need to consider how to perform localisation of the
object of interest within the image. We believe this is an important factor that
degrades performance. One possible way to approach this problem is to search
the image for the most salient parts in the image. Also, we should examine the
properties of the CNN features, and how they could be re-trained to deal with
the speci c task of plant classi cation.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements</title>
      <p>This work has been supported by the Department of Agriculture Fisheries and
Forestry (DAFF) of the Queensland government through the Agricultural Robotics
Program at QUT. We would also like to thank David Hall and Dr. Feras Dayoub
for the fruitful conversations.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>George</surname>
            <given-names>E Dahl</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tara N Sainath</surname>
          </string-name>
          , and
          <string-name>
            <surname>Geo</surname>
            rey
            <given-names>E</given-names>
          </string-name>
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          .
          <article-title>Improving deep neural networks for lvcsr using recti ed linear units and dropout</article-title>
          .
          <source>In Acoustics, Speech and Signal Processing (ICASSP)</source>
          ,
          <year>2013</year>
          IEEE International Conference on, pages
          <volume>8609</volume>
          {
          <fpage>8613</fpage>
          . IEEE,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Je</given-names>
            <surname>Donahue</surname>
          </string-name>
          , Yangqing Jia, Oriol Vinyals, Judy Ho man, Ning Zhang, Eric Tzeng, and
          <string-name>
            <given-names>Trevor</given-names>
            <surname>Darrell</surname>
          </string-name>
          .
          <article-title>Decaf: A deep convolutional activation feature for generic visual recognition</article-title>
          .
          <source>arXiv preprint arXiv:1310.1531</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Pierre</given-names>
            <surname>Geurts</surname>
          </string-name>
          , Damien Ernst, and
          <string-name>
            <given-names>Louis</given-names>
            <surname>Wehenkel</surname>
          </string-name>
          .
          <article-title>Extremely randomized trees</article-title>
          .
          <source>Machine learning</source>
          ,
          <volume>63</volume>
          (
          <issue>1</issue>
          ):3{
          <fpage>42</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ross</surname>
            <given-names>Girshick</given-names>
          </string-name>
          , Je Donahue, Trevor Darrell, and
          <string-name>
            <given-names>Jitendra</given-names>
            <surname>Malik</surname>
          </string-name>
          .
          <article-title>Rich feature hierarchies for accurate object detection and semantic segmentation</article-title>
          .
          <source>arXiv preprint arXiv:1311.2524</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. Herve Goeau, Alexis Joly, Pierre Bonnet,
          <string-name>
            <surname>Jean-Francois</surname>
            <given-names>Molino</given-names>
          </string-name>
          , Daniel Barthelemy, and
          <string-name>
            <given-names>Nozha</given-names>
            <surname>Boujemaa</surname>
          </string-name>
          .
          <article-title>Lifeclef plant identi cation task 2014</article-title>
          .
          <source>In CLEF working notes</source>
          <year>2014</year>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Geo</surname>
          </string-name>
          rey E Hinton, Nitish Srivastava, Alex Krizhevsky, Ilya Sutskever, and
          <string-name>
            <surname>Ruslan R Salakhutdinov.</surname>
          </string-name>
          <article-title>Improving neural networks by preventing co-adaptation of feature detectors</article-title>
          .
          <source>arXiv preprint arXiv:1207.0580</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Alexis</given-names>
            <surname>Joly</surname>
          </string-name>
          , Henning Muller, Herve Goeau, Herve Glotin, Concetto Spampinato, Andreas Rauber, Pierre Bonnet,
          <string-name>
            <surname>Willem-Pier Vellinga</surname>
          </string-name>
          , and Bob Fisher.
          <source>Lifeclef</source>
          <year>2014</year>
          :
          <article-title>multimedia life species identi cation challenges</article-title>
          .
          <source>In Proceedings of CLEF</source>
          <year>2014</year>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Alex</given-names>
            <surname>Krizhevsky</surname>
          </string-name>
          , Ilya Sutskever, and
          <string-name>
            <surname>Geo</surname>
            rey
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          .
          <article-title>Imagenet classi cation with deep convolutional neural networks</article-title>
          . In F. Pereira,
          <string-name>
            <given-names>C.J.C.</given-names>
            <surname>Burges</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bottou</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          K.Q. Weinberger, editors,
          <source>Advances in Neural Information Processing Systems</source>
          <volume>25</volume>
          , pages
          <fpage>1097</fpage>
          {
          <fpage>1105</fpage>
          . Curran Associates, Inc.,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Yann</surname>
            <given-names>LeCun</given-names>
          </string-name>
          , Bernhard Boser, John S Denker, Donnie Henderson, Richard E Howard, Wayne Hubbard, and
          <string-name>
            <given-names>Lawrence D</given-names>
            <surname>Jackel</surname>
          </string-name>
          .
          <article-title>Backpropagation applied to handwritten zip code recognition</article-title>
          .
          <source>Neural computation</source>
          ,
          <volume>1</volume>
          (
          <issue>4</issue>
          ):
          <volume>541</volume>
          {
          <fpage>551</fpage>
          ,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. Ali Sharif Razavian, Hossein Azizpour, Josephine Sullivan, and Stefan Carlsson.
          <article-title>Cnn features o -the-shelf: an astounding baseline for recognition</article-title>
          .
          <source>arXiv preprint arXiv:1403.6382</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Pierre</surname>
            <given-names>Sermanet</given-names>
          </string-name>
          , David Eigen,
          <string-name>
            <given-names>Xiang</given-names>
            <surname>Zhang</surname>
          </string-name>
          , Michael Mathieu, Rob Fergus, and Yann LeCun. Overfeat:
          <article-title>Integrated recognition, localization and detection using convolutional networks</article-title>
          .
          <source>arXiv preprint arXiv:1312.6229</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>