<!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>Herbarium-Field Triplet Network for Cross-Domain Plant Identi cation NEUON Submission to LifeCLEF 2020 Plant</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sophia Chulif</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yang Loong Chang</string-name>
          <email>yangloongg@neuon.ai</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Arti cial Intelligence, NEUON AI</institution>
          ,
          <addr-line>94300 Sarawak, Malaysia https://neuon.ai/</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the implementation and performance of a Herbarium-Field triplet loss network to evaluate the herbarium- eld similarity of plants which corresponds to the cross-domain plant identi cation challenge in PlantCLEF 2020. A two-streamed triplet loss network is trained to maximize the embedding distance of di erent plant species and at the same time minimize the embedding distance of the same plant species given herbarium- eld pairs. The team submitted seven runs which achieved a Mean Reciprocal Rank score of 0.121 and 0.111 for the whole test set and the sub-set of the test set respectively.</p>
      </abstract>
      <kwd-group>
        <kwd>Cross-domain plant identi cation</kwd>
        <kwd>computer vision</kwd>
        <kwd>triplet loss</kwd>
        <kwd>convolutional neural networks</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Plant specimens in herbaria have been used by novices and experts alike to
study and con rm plant species as well as many other useful applications as
described in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Many works are being carried out to improve the access and
preservation of these specimens as they would be considerably less expensive
to obtain rather than eld images. Despite its large collection, the application
of herbaria specimens on the identi cation of real-world plants require more
research [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>
        The objective in PlantCLEF 2020 [
        <xref ref-type="bibr" rid="ref5 ref6">5,6</xref>
        ] involves a task of cross-domain plant
classi cation between herbarium specimens and eld (real-world plant) images.
In this paper, we present our approach using a two-streamed network, namely
Herbarium-Field triplet loss network to evaluate the similarity of herbarium- eld
pairs corresponding to the aforementioned task.
      </p>
      <p>We adopt triplet loss function to optimize the plant embeddings which
regulates the measure of plant similarity. The implemented network is trained to
maximize the embeddings of di erent herbarium- eld species pairs and minimize</p>
      <p>
        Fig. 1. The triplet loss concept mainly revolves around minimizing the distances
between same class and maximizing the distances between di erent classes. (a) shows
two classes with its herbarium counterpart, the image embedding is compared with its
own herbarium and the herbarium from another class (as indicated by the arrows). (b)
The distances between herbarium- eld pairs of the same species has to be less than
the herbarium-pairs of di erent species (red and blue box denotes the class label).
the embeddings of same species pairs. It learns the similarity between herbarium
sheets and eld images instead of directly classifying plant species as
conventional convolutional neural networks (CNN) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Works</title>
      <sec id="sec-2-1">
        <title>FaceNet: A Uni ed Embedding for Face Recognition and Clustering</title>
        <p>
          The authors in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] introduce triplet loss function that uses a CNN to optimize
face embeddings which corresponds to a measure of face similarity. Instead of
training an intermediate layer, the embeddings are directly optimized in an
Euclidean space for face veri cation. Likewise, this triplet loss function is adopted
in our networks to learn the optimized plant embeddings.
        </p>
        <p>
          Plant Disease Recognition with Siamese Network The authors in [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]
introduce Few-Shot Learning algorithms that classify leaf images with deep
learning. They employ Siamese Network with triplet loss that shows the possibility
of achieving high accuracy with small datasets. In addition, the authors in [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]
address the classi cation problem using real-world images. They also show that
the image embeddings extracted from the employed Siamese Network are
better than using transfer learning. In the same way, we employed a two-streamed
triplet loss network which works similarly to classify plants utilising the
herbarium and eld embeddings.
This section describes our approach in PlantCLEF 2020, the implemented
network architecture and training stages involved. The training process is split
into three stages: pre-trained herbarium network, pre-trained eld network and
two-stream triplet loss network. The Herbarium and Field networks are trained
individually to construct networks that could model generalized herbarium and
eld features. A triplet network is then employed to model the triplets distance
between herbarium and eld features. The objective is to train the network to
behave: (i) herbarium features (or embeddings) of a species should be closer to
the eld features of the same class (ii) herbarium features of a species should be
further from eld features of a di erent class. Fig. 1 illustrates the concept of
triplets learning for herbarium- eld pairs.
The network architecture implemented in our approach is illustrated in Figure 2.
This Herbarium-Field triplet loss network is constructed with two Inception-v4
CNNs [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], namely Herbarium CNN and Field CNN which were initialized with
weights pre-trained on PlantCLEF 2020 [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and PlantCLEF 2017 [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] respectively.
Both networks are formed to cater for the generalization of herbarium and eld
features. At the nal embedding layer of each network, a batch normalization
layer is added and the output is fed into a fully-connected layer. The output
size of the fully-connected layer is then reduced from 1536 to 500. Subsequently,
these outputs are L2 normalized in the L2 layer and concatenated to give an
output size of (n m) 500 whereby n and m is the batch size of the Herbarium
and Field networks respectively. This concatenated embedding is later passed
into the triplet loss layer1 through which the network learns to compute the
herbarium and eld embeddings with respective to their optimum embedding
space. The network is trained to maximize the embedding distance of di erent
species in herbarium- eld pairs and minimize the embedding distance of the
same species. The classi cation of species is dependent on the computed
embedding space by which a large embedding distance denotes di erent species and a
small embedding distance indicates same species. There are two types of training
methods investigated i.e., frozen front layers and non-frozen front layers.
Frozen Front Layers In this method, the front layers of the pre-trained
Herbarium and Field network, or simply, the extractor layer of the network is
frozen. This allows only the weights in the newly added layer (triplet loss layer)
to be updated.
        </p>
        <p>Non-Frozen Layers This method on the other hand trains all layers in the
network. It allows the network to relearn and recompute the embeddings of
herbarium and eld images with respective to their optimized embedding space
from the triplet loss. The new layers are set to have a higher learning rate than
the migrated layers.
3.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Training stages</title>
        <p>
          Herbarium Network As mentioned in 3.1, a Herbarium network based on
the Inception-v4 model [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] is set up to make up the Herbarium-Field triplet
loss network. The Herbarium network is initialized on weights pre-trained from
ImageNet [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] and trained with PlantCLEF 2020 dataset (herbarium images) [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
Field Network Likewise, the Field network adopts the Inception-v4 [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]
network architecture. It is also initialized with weights pre-trained from ImageNet
[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] but trained with PlantCLEF 2017 dataset ( eld images) [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] instead.
Herbarium-Field Triplet Loss Network Once the Herbarium and Field
networks are trained, the Herbarium-Field Triplet Loss network is set up. The
network is trained with PlantCLEF 2020 dataset [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] consisting of both herbarium
and eld images. The network trained in the Non-Frozen Layers setup is set with
a learning rate of 0.00001 in the migrated layers and 0.0001 in the newly added
layers, whereas the Frozen Front Layers setup is set with a learning rate of zero
in the migrated layers.
1 The triplet loss is computed using triplet semihard loss function provided in
Tensor ow 1.13 [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Training Setup</title>
      <sec id="sec-3-1">
        <title>Data Preparation</title>
        <p>As mentioned in the task description, only a subset of species for eld images
were provided to allow learning a mapping between the herbarium and eld
domain. We separated the species which possess both herbarium and eld images
to be used for mapping. Out of 997 classes, 435 classes were identi ed having
both herbarium and eld images. These classes were then used for training.
Although the total number of classes was reduced from 997 to 435 species, the
network was still trained to map the embedding space of 997 classes.</p>
        <p>During the training of the Herbarium-Field triplet loss network, the images
used for each batch were picked to be balanced for each class. For instance, in a
batch of size 16, each class may not comprise more than 4 images, meanwhile the
minimum number of images in each class is 2. This allows a balanced selection
of anchors for the triplet loss.
4.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Data Augmentation</title>
        <p>
          In order to increase the network generalization and increase training sample size,
data augmentation was applied on the training images. Random cropping,
horizontal ipping and colour distortion (brightness, saturation, hue, and contrast)
of images were performed on the training dataset. As a result, features and
various transforms that are invariant to their original locations can be learned by
the network, consequently reducing the chance of over tting [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
4.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Training Dataset and Hyperparameters</title>
        <p>The training dataset distributions and network setup parameters are summarized
in Table 1 and Table 2 respectively.
5</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experiments</title>
      <p>
        The experiments were conducted using Tensor ow 1.13 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] alongside slim
packages. The codes are available at https://github.com/NeuonAI/plantclef2020 challenge
Parameter
      </p>
      <p>Batch Size
Input Image Size</p>
      <p>Optimizer
Initial Learning Rate</p>
      <p>Weight Decay</p>
      <p>Loss Function
5.1</p>
      <sec id="sec-4-1">
        <title>Dataset</title>
        <p>Due to the limited eld training samples, prior to training, a sample of images
from each of the \herbarium photo associations" and \photo" folders were
randomly segregated for validation purposes. 1,219 eld images were separated from
the test set leaving 5,038 eld images for training instead of 6,257 as stated in
Table 1. The number of images and classes present in the experimented training
and testing dataset are summarized in Table 3. Nevertheless, the class
number for the Herbarium-Field triplet loss network remains 997 and 10,000 in the
Herbarium and Field network stream respectively.</p>
      </sec>
      <sec id="sec-4-2">
        <title>Herbarium dictionary</title>
        <p>For inference, the embeddings from 997 herbarium classes were rst extracted
using the trained Herbarium-Field triplet loss network to form the reference
embeddings served as a herbarium dictionary. Random samples from each class
were picked and fed into the network to obtain the embeddings. The extracted
embeddings were then averaged to get a single embedding representation for
each class. The embedding for each class was subsequently saved as a dictionary.</p>
        <p>Note that the extraction was done with two di erent types of image cropping,
namely, Center Crop and Center and Corner Crop. The Center Crop approach
crops the centre region of the herbarium sample. Meanwhile, the Corner Crop
approach on the other hand crops the top left, top right, bottom left, and bottom
right region of the herbarium sample. Each region was cropped and resized then
passed into the network for the extraction of herbarium embeddings.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Feature similarity</title>
        <p>After obtaining the single embedding representation of each class, the saved
dictionary is then used to compare the embedding distance between the 997
herbarium representation and the test image. During validation, Center and
Corner Crop were also applied together with horizontal ip in obtaining the test
images' embeddings. This resulted in 10 di erent variations for each image which
was then averaged to obtain their similarity probability. Cosine similarity was
used as the distance metric in measuring the embedding similarity. Then, the
cosine distance was obtained by subtracting the cosine similarity from 1. Finally,
inverse distance weighting was performed on the cosine distance to obtain the
probabilities of each class.
5.3</p>
      </sec>
      <sec id="sec-4-4">
        <title>Network and Results</title>
        <p>The experimented results are tabulated in Table 4 and Table 5 for Center Crop
and Center Crop and Corner Crop herbarium extraction methods respectively.
The networks were tested on the same validation set of 1,219 images in which
the Top 1 and Top 5 predictions were evaluated. Center Crop and Corner Crop
were also applied on the eld test set before validation. 5 di erent
Herbarium</p>
      </sec>
      <sec id="sec-4-5">
        <title>Field triplet loss networks were experimented, i.e.:</title>
      </sec>
      <sec id="sec-4-6">
        <title>Network 1: Frozen Front Layers (FL) A network trained with frozen front</title>
        <p>layers.</p>
      </sec>
      <sec id="sec-4-7">
        <title>Network 2: Non-Frozen Layers (NFL) A network trained with non-frozen</title>
        <p>layers, or to put simply, trained with all layers.</p>
      </sec>
      <sec id="sec-4-8">
        <title>Network 3: Non-Frozen Layers Ensemble Model (NFL-ENS) A ensem</title>
        <p>ble of 3 di erent models trained on all layers.</p>
      </sec>
      <sec id="sec-4-9">
        <title>Network 4: Non-Frozen Layers Increased Augmentation (NFL-AUG)</title>
        <p>A network trained with all layers whereby the training images were pre-processed
with more transformations and augmentation.</p>
      </sec>
      <sec id="sec-4-10">
        <title>Network 5: Non-Frozen Layers Increased Augmentation Model En</title>
        <p>semble (NFL-AUG-ENS) An ensemble of Network 3 and Network 4.
5.4</p>
      </sec>
      <sec id="sec-4-11">
        <title>Discussion</title>
        <p>From the experiments, it can be seen that the NFL ensemble models performed
the best among the networks. The ensemble of these networks increased the
robustness of the system and returned better predictions. On the other hand, the
FL network performed the worst among the networks. It can be suggested that
the training of all layers does help the prediction model instead of freezing the
front layers or extractor layers of the network. In can be seen that the
ensemble models with increased augmentation performed equally as to the ensemble
model without increased augmentation. It can be suggested that the increased
augmentation may have not produced enough new signi cant information for
the network to learn. Since a portion of eld images were separated from the
training set to serve as test set, some of the classes may miss some eld
information. In addition, the trained model does not represent the entire classes as
some classes miss eld images. Consequently, the networks did not performed as
well as it was not fed with su cient images to represent the eld domain. An
approach to increasing the prediction accuracy would be increasing the training
samples of the eld images that are not present in the training set.
6</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Submission</title>
      <sec id="sec-5-1">
        <title>6.1 Inference Procedure</title>
        <p>The procedure adopted to produce the submitted results are as follow:
(i) Construct herbarium dictionary by extracting samples of herbarium
embeddings for all 997 plant species using the trained Herbarium-Field triplet loss
network.
(a) Apply Center and Corner Crops on the images before extraction.
(b) Average the cropped herbarium embeddings for each species and save
them.
(ii) Group the test images belonging to the same observation ID.
(iii) For each image under the same observation ID, apply Center and Corner</p>
        <p>Crops which result in 5 images each.
(iv) Subsequently ip the images horizontally resulting in 10 images each.
(v) Average the 10 images and pass them to the Herbarium-Field triplet loss
network.
(vi) Obtain the image embeddings.
(vii) Compute cosine similarity between each of the extracted embeddings with
the saved 997 herbarium embeddings.
(viii) Obtain cosine distance by subtracting the cosine similarity from the value
of 1.
(ix) Apply inverse distance weighting on the cosine distance.
(x) Obtain the probabilities of the embedding distance.
(xi) Average the probabilities over the total number of images for each
observation ID.
(xii) Repeat steps (iii) to (xii) for the remaining observation IDs.
(xiii) Collect the predictions, probabilities and ranks for each observation ID.
6.2</p>
      </sec>
      <sec id="sec-5-2">
        <title>Submitted Runs</title>
        <p>The team submitted a total of seven runs based o the networks mentioned in
Section 5.3.</p>
        <p>Run 1 This model was based o (FL). Unlike the rest of the runs, this
network was trained with frozen front layers and does not apply image ipping
during validation. Moreover, the embedding distances were normalized, inversed
then applied with softmax to obtain the probabilities. In addition, the
probabilities were based o the averaged embedding instead of all embeddings for each
observation ID.</p>
        <p>Run 2 This model was based o (NFL). Similar to Run 1 however it was
trained with all layers of the network, the embeddings of each observation IDs
were averaged and then applied with Cosine Similarity and Inverse Distance
Weighting to obtain the probabilities.</p>
        <p>Run 3 This model was based o (NFL). Similar to Run 2 however by using
Cosine Similariy and Inverse Weighting, the probabilities of each embeddings
were rst computed then averaged for each observation IDs .</p>
        <p>Run 4 This model was based o (NFL). Similar to Run 3 however the
probabilities take into account the total embeddings of each observation IDs multiplied
by their croppings which consist of 10 variations.
Run 5 This model was based o (NFL-ENS). Unlike Run 1 to 4, the network
was trained together with the full dataset as stated in Table 1. It is also an
ensemble of the predictions from 3 models of the same network.
Run 6 This model was based o (NFL-AUG). Similar to Run 5 which was
trained with the full dataset however it is not an ensemble of models and trained
with increased image processing transformations and augmentations.
Run 7 This model was based o (NFL-AUG-ENS). This run is the ensemble
of the predictions from Run 5 and Run 6.
6.3</p>
      </sec>
      <sec id="sec-5-3">
        <title>Submission Results</title>
        <p>Our best submitted runs scored a Mean Reciprocal Rank (MRR) of 0.121 and
0.108 for the rst and second metric respectively. Our results are tabulated in
Table 6. The results by all the participating teams are summarised in Fig. 3 and
Fig. 4.
6.4</p>
      </sec>
      <sec id="sec-5-4">
        <title>Discussion</title>
        <p>Similar to the experiment results, the ensemble models performed the best among
the networks. The ensemble model with increased augmentation on the other
hand performed best in the whole test set. In addition, the MRR score of the
networks for the rst and second metric are relatively close despite the few
training photos in the sub-set species. It can be suggested that the number of training
samples for each class does not directly in uence the performance of the model.
Other than lling the missing training samples of the eld classes, the methods
in obtaining the herbarium embedding representation can also be looked into to
increase prediction accuracy. Such methods involve nding the best herbarium
dictionary representation. Various image processing methods like ipping can be
performed before extracting the herbarium embeddings. Meanwhile, nding the
best model of the Herbarium-Field Triplet Loss Network and using it for the
extraction of the herbarium embeddings would be signi cant as well.</p>
        <p>Fig. 3. O cial Results of PlantCLEF 2020.
In addition to the submitted results, the team trained another 3 runs which was
based o the continuation of Run 6. However, the results did not performed
better than the submitted runs. Since the runs were trained with the whole
dataset, we believe the drop in performance is due to over tting as there was no
baseline to determine when to stop training the model. The MRR score of the
runs are tabulated in Table 7.</p>
        <p>Run 8 This model was based o (NFL-AUG). This run was a continuation of
the training from Run 6 which was trained with increased iterations.
Run 9 This model was based of (NFL-AUG-ENS). This run was an ensemble
of Run 8 and Run 5 predictions.</p>
        <p>Run 10 This model was based o (NFL-ENS). This run was an ensemble of 3
di erent models from Run 8.</p>
        <p>We tested the post-challenge runs on our segregated test set as well and the
results are tabulated in Table 8 and Table 9 for Center Crop and Center and
Corner Crop herbarium dictionary construction methods respectively. In contrast
with its MRR score, Run 8 shows the best performance in the experimental
validation setup when in fact it performed the worst among the post-challenge
runs. This is likely due to over tting as mentioned.
8</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>In this paper we have presented our approach in PlantCLEF 2020 which focused
on the cross-domain plant identi cation between herbarium sheets and in- eld
photos. We adopted a two-streamed Herbarium-Field triplet loss network which
performed relatively equal regardless if few eld training images were given.
Based on the similar score between MRR metric 1 and 2, it is proven that the
proposed network feature is not directly a ected by the plant class but it learns
to perceive the similarity between a given eld image with herbarium images. It
is shown that even with a minimal amount of eld images for each species,
crossdomain plant identi cation can be performed. The identi cation of real-world
plants based on herbarium sheets alone is indeed a challenging task. Although
our machines did not performed as well with missing eld classes which is the case
in real-world, it shows that with su cient data, it o ers a step in alleviating the
tedious task of herbarium- eld classi cation which requires high level expertise.
For future work, the eld images that are not present among the training dataset
can be added to improve the predictions. This would allow the model to learn
the whole representation of plant species with respect to their herbarium and
eld domain. Furthermore, the extraction of herbarium embeddings to form a
more powerful dictionary can be investigated to nd the best representation of
herbarium embeddings for the herbarium- eld similarity comparison.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgment</title>
      <p>The resources of this project is supported by NEUON AI SDN. BHD., Malaysia.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Abadi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barham</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brevdo</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Citro</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Devin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghemawat</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goodfellow</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harp</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Irving</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Isard</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jia</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jozefowicz</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaiser</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kudlur</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levenberg</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mane</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Monga</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Murray</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olah</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schuster</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shlens</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steiner</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Talwar</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tucker</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanhoucke</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vasudevan</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Viegas</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinyals</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Warden</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wattenberg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wicke</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>TensorFlow: Large-scale machine learning on heterogeneous systems (</article-title>
          <year>2015</year>
          ), https://www.tensorflow.org/, software available from tensor ow.org
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. Argueso,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Picon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Irusta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            ,
            <surname>Medela</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          , San-Emeterio,
          <string-name>
            <given-names>M.G.</given-names>
            ,
            <surname>Bereciartua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Alvarez-Gila</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Few-shot learning approach for plant disease classi cation using images taken in the eld</article-title>
          .
          <source>Computers and Electronics in Agriculture 175</source>
          ,
          <issue>105542</issue>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chandra</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patil</surname>
            ,
            <given-names>P.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roy</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Redkar</surname>
            ,
            <given-names>S.S.:</given-names>
          </string-name>
          <article-title>Classi cation of various plant diseases using deep siamese network (</article-title>
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Funk</surname>
          </string-name>
          , V.A.:
          <article-title>100 uses for an herbarium: well at least 72</article-title>
          . American Society of Plant Taxonomists Newsletter (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. 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>Overview of the lifeclef 2020 plant identi cation task</article-title>
          .
          <source>In: CLEF working notes</source>
          <year>2020</year>
          ,
          <article-title>CLEF: Conference and Labs of the Evaluation Forum</article-title>
          , Sep.
          <year>2020</year>
          , Thessaloniki,
          <string-name>
            <surname>Greece.</surname>
          </string-name>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Joly</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deneu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kahl</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Goeau, H., Ruiz De Castaneda,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Champ</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Eggel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Cole</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Bonnet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Botella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Dorso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Glotin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Lorieul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Servajean</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          , Stoter,
          <string-name>
            <given-names>F.R.</given-names>
            ,
            <surname>Vellinga</surname>
          </string-name>
          ,
          <string-name>
            <surname>W.P.</surname>
          </string-name>
          , Muller, H.:
          <article-title>Lifeclef 2020: Biodiversity identi cation and prediction challenges</article-title>
          .
          <source>In: Proceedings of CLEF</source>
          <year>2020</year>
          ,
          <article-title>CLEF: Conference and Labs of the Evaluation Forum</article-title>
          , Sep.
          <year>2020</year>
          , Thessaloniki,
          <string-name>
            <surname>Greece.</surname>
          </string-name>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <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>
          .
          <source>In: International Conference of the CrossLanguage Evaluation Forum for European Languages</source>
          . pp.
          <volume>255</volume>
          {
          <fpage>274</fpage>
          . Springer (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Adam: A method for stochastic optimization</article-title>
          .
          <source>arXiv preprint arXiv:1412.6980</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Krizhevsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          , G.E.:
          <article-title>Imagenet classi cation with deep convolutional neural networks</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <volume>1097</volume>
          {
          <issue>1105</issue>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Mikolajczyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grochowski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Data augmentation for improving deep learning in image classi cation problem</article-title>
          .
          <source>In: 2018 international interdisciplinary PhD workshop (IIPhDW)</source>
          . pp.
          <volume>117</volume>
          {
          <fpage>122</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Russakovsky</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deng</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krause</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Satheesh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Ma,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Karpathy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Khosla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Bernstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Berg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.C.</given-names>
            ,
            <surname>Fei-Fei</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.</surname>
          </string-name>
          :
          <article-title>Imagenet large scale visual recognition challenge</article-title>
          .
          <source>International journal of computer vision 115(3)</source>
          ,
          <volume>211</volume>
          {
          <fpage>252</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Schro</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalenichenko</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Philbin</surname>
          </string-name>
          , J.:
          <article-title>Facenet: A uni ed embedding for face recognition and clustering</article-title>
          .
          <source>In: Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          . pp.
          <volume>815</volume>
          {
          <issue>823</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Szegedy</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , Io e, S.,
          <string-name>
            <surname>Vanhoucke</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alemi</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          :
          <article-title>Inception-v4, inception-resnet and the impact of residual connections on learning</article-title>
          .
          <source>In: Thirty-First AAAI Conference on Arti cial Intelligence</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. Waldchen, J.,
          <string-name>
            <surname>Rzanny</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seeland</surname>
            ,
            <given-names>M.,</given-names>
          </string-name>
          <article-title>Mader</article-title>
          , P.:
          <article-title>Automated plant species identi cation|trends and future directions</article-title>
          .
          <source>PLoS computational biology</source>
          <volume>14</volume>
          (
          <issue>4</issue>
          ),
          <year>e1005993</year>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>