<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Plant Sci.</journal-id>
<journal-title>Frontiers in Plant Science</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Plant Sci.</abbrev-journal-title>
<issn pub-type="epub">1664-462X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fpls.2021.789630</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Plant Science</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>A Novel Computational Framework for Precision Diagnosis and Subtype Discovery of Plant With Lesion</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Xia</surname> <given-names>Fei</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="author-notes" rid="fn002"><sup>&#x2020;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1566346/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Xie</surname> <given-names>Xiaojun</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="author-notes" rid="fn002"><sup>&#x2020;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1529468/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Wang</surname> <given-names>Zongqin</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1583162/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Jin</surname> <given-names>Shichao</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1075433/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Yan</surname> <given-names>Ke</given-names></name>
<xref ref-type="aff" rid="aff5"><sup>5</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1535906/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Ji</surname> <given-names>Zhiwei</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1465011/overview"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>College of Artificial Intelligence, Nanjing Agricultural University</institution>, <addr-line>Nanjing</addr-line>, <country>China</country></aff>
<aff id="aff2"><sup>2</sup><institution>Center for Data Science and Intelligent Computing, Nanjing Agricultural University</institution>, <addr-line>Nanjing</addr-line>, <country>China</country></aff>
<aff id="aff3"><sup>3</sup><institution>Plant Phenomics Research Centre, Academy for Advanced Interdisciplinary Studies, Regional Technique Innovation Center for Wheat Production, Key Laboratory of Crop Physiology and Ecology in Southern China, Ministry of Agriculture, Nanjing Agricultural University</institution>, <addr-line>Nanjing</addr-line>, <country>China</country></aff>
<aff id="aff4"><sup>4</sup><institution>Collaborative Innovation Centre for Modern Crop Production co-sponsored by Province and Ministry, Jiangsu Key Laboratory for Information Agriculture, Nanjing Agricultural University</institution>, <addr-line>Nanjing</addr-line>, <country>China</country></aff>
<aff id="aff5"><sup>5</sup><institution>Department of Building, School of Design and Environment, National University of Singapore</institution>, <addr-line>Singapore</addr-line>, <country>Singapore</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Peng Chen, Anhui University, China</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Guangming Zhang, University of Texas Health Science Center at Houston, United States; Lisha Zhu, University of Chicago, United States; Xin Gao, Suzhou Institute of Biomedical Engineering and Technology, Chinese Academy of Sciences (CAS), China</p></fn>
<corresp id="c001">&#x002A;Correspondence: Zhiwei Ji, <email>Zhiwei.Ji@njau.edu.cn</email></corresp>
<fn fn-type="equal" id="fn002"><p><sup>&#x2020;</sup>These authors have contributed equally to this work</p></fn>
<fn fn-type="other" id="fn004"><p>This article was submitted to Sustainable and Intelligent Phytoprotection, a section of the journal Frontiers in Plant Science</p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>03</day>
<month>01</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2021</year>
</pub-date>
<volume>12</volume>
<elocation-id>789630</elocation-id>
<history>
<date date-type="received">
<day>05</day>
<month>10</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>03</day>
<month>11</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x00A9; 2022 Xia, Xie, Wang, Jin, Yan and Ji.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Xia, Xie, Wang, Jin, Yan and Ji</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>Plants are often attacked by various pathogens during their growth, which may cause environmental pollution, food shortages, or economic losses in a certain area. Integration of high throughput phenomics data and computer vision (CV) provides a great opportunity to realize plant disease diagnosis in the early stage and uncover the subtype or stage patterns in the disease progression. In this study, we proposed a novel computational framework for plant disease identification and subtype discovery through a deep-embedding image-clustering strategy, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm (WDM-tSNE). To verify the effectiveness, we applied our method on four public datasets of images. The results demonstrated that the newly developed tool is capable of identifying the plant disease and further uncover the underlying subtypes associated with pathogenic resistance. In summary, the current framework provides great clustering performance for the root or leave images of diseased plants with pronounced disease spots or symptoms.</p>
</abstract>
<kwd-group>
<kwd>plant</kwd>
<kwd>disease diagnosis</kwd>
<kwd>subtype discovery</kwd>
<kwd>deep learning</kwd>
<kwd>t-SNE</kwd>
<kwd>image clustering</kwd>
</kwd-group>
<contract-sponsor id="cn001">Nanjing Agricultural University<named-content content-type="fundref-id">10.13039/501100008562</named-content></contract-sponsor>
<counts>
<fig-count count="11"/>
<table-count count="4"/>
<equation-count count="14"/>
<ref-count count="89"/>
<page-count count="19"/>
<word-count count="9749"/>
</counts>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="S1">
<title>Introduction</title>
<p>Plants are often attacked by various pathogens (e.g., bacteria, viruses, fungi, etc.) during their growth and development (<xref ref-type="bibr" rid="B65">Suzuki et al., 2014</xref>), resulting in abnormal physiological and morphological changes in plants. In severe cases, it may disrupt its normal growth and development and even cause large-scale disasters, such as leaf spot disease (<xref ref-type="bibr" rid="B49">Ozguven and Adem, 2019</xref>), powdery mildew (<xref ref-type="bibr" rid="B41">Lin et al., 2019</xref>), brown spot and blast diseases (<xref ref-type="bibr" rid="B53">Phadikar and Goswami, 2016</xref>), and gray mold (<xref ref-type="bibr" rid="B20">Fahrentrapp et al., 2019</xref>). The prior symptoms of these diseases include leaf discoloration, tissue deformation or necrosis, and root atrophy, etc. Plant diseases, especially crop diseases, may cause social problems such as economic losses or food shortages in a certain area (<xref ref-type="bibr" rid="B83">Wilkinson et al., 2011</xref>). Therefore, early diagnosis of plant diseases, especially the precise prediction of plant disease severity and drug resistance (<xref ref-type="bibr" rid="B14">Bock et al., 2020</xref>), will help formulate effective control strategies, thereby effectively prevent the spread of diseases and reduce economic losses (<xref ref-type="bibr" rid="B40">Liang et al., 2019</xref>). To solve the above problems, many researchers made great efforts on the diagnosis of plant diseases by exploring the relationship between pathogen infection and plant disease symptoms (<xref ref-type="bibr" rid="B9">Bass et al., 2019</xref>; <xref ref-type="bibr" rid="B78">Vishnoi et al., 2021</xref>). However, these studies cannot provide real-time disease diagnosis and even evolution trajectory inference and will cause delays or misjudgments in decision-making. In recent years, plant phenomics (<xref ref-type="bibr" rid="B69">Tardieu et al., 2017</xref>; <xref ref-type="bibr" rid="B51">Pasala and Pandey, 2020</xref>) was generated, which can automatically and non-destructively obtain high-throughput plant phenotyping images (<xref ref-type="bibr" rid="B38">Lee et al., 2018</xref>; <xref ref-type="bibr" rid="B39">Li et al., 2020</xref>), which makes computer-aided rapid diagnosis and real-time monitoring of plant diseases possible.</p>
<p>Computationally, phenomics-based plant disease diagnosis can be grouped into two categories, one is <italic>semantic</italic> feature-based models, and the other is <italic>non-sematic</italic> feature-based models (e.g., deep learning [DL] models). The first category (conventional image processing) is characterized by the features of color (<xref ref-type="bibr" rid="B24">Gaikwad and Musande, 2017</xref>), texture (<xref ref-type="bibr" rid="B31">Hossain et al., 2019</xref>; <xref ref-type="bibr" rid="B33">Ismail et al., 2020</xref>), and shape (<xref ref-type="bibr" rid="B13">Chouhan et al., 2020</xref>) extracted from the lesion area of the phenotypic images to achieve disease diagnosis and prediction. For example, <xref ref-type="bibr" rid="B87">Zhang et al. (2017)</xref> segmented the lesions from the leaf images and extracted the shape and color features for disease recognition in cucumber. Moreover, some researchers realized the automatic diagnosis of plant diseases through a classifier built with texture features (<xref ref-type="bibr" rid="B31">Hossain et al., 2019</xref>; <xref ref-type="bibr" rid="B33">Ismail et al., 2020</xref>). In addition, computer vision (CV) and machine learning were applied to quantify root traits in real time for precision plant breeding (<xref ref-type="bibr" rid="B57">Rahaman et al., 2019</xref>; <xref ref-type="bibr" rid="B21">Falk et al., 2020</xref>). However, the variation of plant phenomics and the dependence of prior knowledge always limit the generalization of this type of method to different plant diseases. In recent years, DL has been widely used in image classification and clustering (<xref ref-type="bibr" rid="B32">Hu et al., 2020</xref>; <xref ref-type="bibr" rid="B61">Saleem et al., 2020</xref>). The representative characterizations of DL-based models include powerful capabilities for feature extraction, low dependence on domain knowledge, and high predictive accuracy (<xref ref-type="bibr" rid="B71">Too et al., 2019</xref>; <xref ref-type="bibr" rid="B37">Lee et al., 2020</xref>). In the past few years, DL was used to analyze the phenomics of plant disease. Various convolutional neural network (CNN) models were developed as the image multi-class classifiers to distinguish different plant leaf diseases from high-throughput phenomics (<xref ref-type="bibr" rid="B11">Brahimi et al., 2018</xref>; <xref ref-type="bibr" rid="B86">Zhang et al., 2019</xref>). Furthermore, DL is also very effective for grading the severity of plants with the same disease (<xref ref-type="bibr" rid="B77">Verma et al., 2020</xref>). <xref ref-type="bibr" rid="B40">Liang et al. (2019)</xref> combined ResNet50 (<xref ref-type="bibr" rid="B81">Wen et al., 2020</xref>) model and Shufflenet-V2 (<xref ref-type="bibr" rid="B25">Ghosh et al., 2020</xref>) to build a PD<sup>2</sup>SE-Net network model, which realized the classification of plant diseases and the prediction of disease severity. <xref ref-type="bibr" rid="B85">Yu et al. (2006)</xref> applied VGG16 model on diseased leaf images for grading the severity of apple black rot (<xref ref-type="bibr" rid="B79">Wang et al., 2017</xref>). Although DL models are widely studied for plant disease diagnosis, they still face obvious challenges, such as poor generalization, unexplainable features, and high dependence on abundant training samples.</p>
<p>In this study, we proposed a novel image clustering method for both plant disease classification and subtype discovery. Firstly, all the original plant images were preprocessed to amplify the sample size. Secondly, we established a deep CNN to extract the features of phenotypic images. Finally, we designed a clustering strategy by integrating a Weighted Distance Metric (WDM) and the t-stochastic neighbor embedding algorithm, named &#x201C;WDM-tSNE.&#x201D; To validate the effectiveness, we applied the proposed method on a batch of public plant image datasets, namely, Modified National Institute of Standards and Technology (MNIST) (<xref ref-type="bibr" rid="B16">Deng, 2012</xref>), Aphanomyces Root Rot (ARR) in lentil (<xref ref-type="bibr" rid="B45">Marzougui et al., 2019</xref>), cherry powdery mildew, strawberry leaf scorch disease, and three types of tomato disease from <italic>PlantVillage</italic> dataset (<xref ref-type="bibr" rid="B47">Mohanty et al., 2016</xref>). The experimental results show that our method obtained high performance on plant disease classification and subtype discovery. In particular, the WDM-tSNE strategy provides better clustering accuracy than the standard tSNE.</p>
</sec>
<sec id="S2">
<title>Related Work</title>
<p>In this section, we briefly review the related work of plant disease diagnosis on semantic feature-based models, and non-sematic feature-based models.</p>
<sec id="S2.SS1">
<title>Semantic Feature-Based Models</title>
<p>The general idea of this kind of method includes four steps: (1) image preprocessing; (2) lesion segmentation; (3) image features are defined and extracted for describing the pathology signatures of the lesion regions; and (4) the image samples are classified by using a machine-learning model (<xref ref-type="bibr" rid="B78">Vishnoi et al., 2021</xref>). Considering the fact that the accuracy of lesion segmentation directly affects the sample classification, many researchers used various image-segmentation strategies to achieve the extraction of the target regions, such as threshold-based segmentation methods (<xref ref-type="bibr" rid="B70">Tete and Kamlu, 2017</xref>), edge detection algorithms (<xref ref-type="bibr" rid="B80">Wang et al., 2018</xref>), and spatial clustering methods (<xref ref-type="bibr" rid="B27">Guan et al., 2017</xref>). After obtaining the lesion regions, researchers often define the color, texture, or shape features to characterize the disease state of each sample. Gaikwad and coworkers applied K-means to segment the lesion regions in the wheat leaf images and extracted the color features, such as color histogram (<xref ref-type="bibr" rid="B63">Stricker, 1994</xref>), color moments (<xref ref-type="bibr" rid="B54">Poonam and Jadhav, 2015</xref>), and the texture features [e.g., gray-Level co-occurrence matrix [GLCM] (<xref ref-type="bibr" rid="B23">Gadelmawla, 2004</xref>)] to construct a support-vector machine (SVM) model for the classification of wheat diseases (<xref ref-type="bibr" rid="B24">Gaikwad and Musande, 2017</xref>). <xref ref-type="bibr" rid="B4">Ali et al. (2017)</xref> applied Delta E (&#x0394;<italic>E</italic>) segmentation to process the leave images of diseased potatoes and extract color and texture features based on red, green, and blue (RGB), hue, saturation, value (HSV), and local binary patterns (LBP) to implement the classification of early blight and late blight (<xref ref-type="bibr" rid="B33">Ismail et al., 2020</xref>). <xref ref-type="bibr" rid="B6">Ayyub and Manjramkar (2019)</xref> successfully classified the apple fruit diseases via a multi-class model by integrating improved sum and difference histogram (ISADH), completed local binary pattern (CLBP), and other color and texture features.</p>
<p>In general, this kind of method may obtain human-interpretable features and thus provide good performance on some plant diseases. However, three drawbacks exist. First, the calculation procedure of these methods is complicated. Second, these methods are highly dependent on expert knowledge. Third, they do not work well for real-time detection.</p>
</sec>
<sec id="S2.SS2">
<title>Non-sematic Feature-Based Models</title>
<p>In recent years, DL has promoted the development of CV, thereby providing new ideas for image analysis and automatic diagnosis of plant diseases. In particular, the CNN model has been widely studied by researchers because of its powerful image processing and feature extraction capabilities and without the prior knowledge of domain experts (<xref ref-type="bibr" rid="B66">Syed-Ab-Rahman et al., 2021</xref>). At present, most of the existing works applied CNN, combined with transfer learning (<xref ref-type="bibr" rid="B71">Too et al., 2019</xref>) to implement plant disease diagnosis. <xref ref-type="bibr" rid="B88">Zhang et al. (2018)</xref> used two improved CNN models, GoogleNet and Cifar10, to classify nine types of corn diseases and obtain high accuracy. To reduce the number of parameters, <xref ref-type="bibr" rid="B58">Rahman et al. (2020)</xref> constructed a two-stage light CNN framework Simple-CNN to identify rice diseases with high accuracy. Moreover, other researchers made great efforts to develop novel computational models for predicting the severity of plant disease. For example, <xref ref-type="bibr" rid="B34">Jos&#x00E9; et al. (2020)</xref> used five types of CNN models (AlexNet, GoogleNet, VGG16, ResNet50, and MobileNetV2) to estimate the severity of coffee leaf biotic stress. In addition, deep learning was also widely used to identify the diseases of fruit, root, and stem. <xref ref-type="bibr" rid="B68">Tan et al. (2016)</xref> presented a CNN model to recognize lesion images of diseased apples, such as scab skin, black rot, scar skin, and ring spot (<xref ref-type="bibr" rid="B82">Wenxue Tan, 2020</xref>). <xref ref-type="bibr" rid="B48">Nikhitha et al. (2019)</xref> used the Inception v3 model to detect the grades of infections in fruits (e.g., apple, banana, and cherry, <italic>etc</italic>.) based on color, size, and shape of the fruit (<xref ref-type="bibr" rid="B48">Nikhitha et al., 2019</xref>). <xref ref-type="bibr" rid="B73">Tusubira et al. (2020)</xref> achieved the automated scoring for root necrosis of diseased cassava by using deep CNN with semantic segmentation, which is done by classifying the necrotized and non-necrotized pixels of cassava root cross-sections without any additional feature engineering. Compared with the first category, DL models achieve higher recognition accuracy. However, we identify three limitations. First, they require large amounts of labeled data; second, they are overly sensitive to changes in the image; and third, the non-semantic features are hard to be explained.</p>
<p>To address the above limitations, we proposed an efficient pipeline for both disease diagnosis and severity estimation of plants with the lesion. A DL model combined with a novel clustering strategy contributes to higher prediction accuracy and lower computational cost.</p>
</sec>
</sec>
<sec id="S3" sec-type="materials|methods">
<title>Materials and Methods</title>
<p>The proposed computational framework includes three steps (<xref ref-type="fig" rid="F1">Figure 1</xref>) and will be explained in detail in the following subsections.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption><p>The flowchart of the proposed framework. ReLU, Rectified Linear Unit.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g001.tif"/>
</fig>
<sec id="S3.SS1">
<title>Image Preprocessing</title>
<p>Before extracting features, each image needs to be preprocessed, such as image enhancement and image segmentation. Image augmentation is to increase the diversity of samples (<xref ref-type="bibr" rid="B29">Halevy et al., 2009</xref>). we use horizontal flip (<xref ref-type="bibr" rid="B15">Connor Shorten, 2019</xref>) and affine transformation (<xref ref-type="bibr" rid="B62">Shen et al., 2019</xref>) on each image to enhance the size and quality of training datasets so that better DL models can be built. The purpose of image segmentation is to obtain areas related to plant tissues (root or leaf) from the original images. Therefore, the irrelevant region needs to be removed. In this study, we detected the relevant area by traversing all the pixels in each image and obtained the smallest circumscribed rectangle (<xref ref-type="bibr" rid="B85">Yu et al., 2006</xref>) of the outer contour of a plant tissue.</p>
</sec>
<sec id="S3.SS2">
<title>Feature Extraction</title>
<p>We developed a CNN model to extract the features from the plant images with the disease. The whole CNN model includes three layers: convolution layers, the spatial pyramid pooling (SPP) layer, and fully connected layer. The extracted high-dimensional features were further used to cluster the images with different severity levels. <xref ref-type="fig" rid="F2">Figure 2</xref> shows the details of the feature extraction process using the lentil images as an example.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption><p>CNN-based network for feature extraction. ReLU, Rectified Linear Unit; CNN, convolutional neural network.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g002.tif"/>
</fig>
<sec id="S3.SS2.SSS1">
<title>Creating the Feature Maps</title>
<p>As shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, the first step is to create the feature maps from each input image by using a series of convolutional, non-linear, and pooling. The convolutional layers can learn the low-level features, such as edges and curves, which provide the CNN with the important property of &#x201C;translation invariance&#x201D; (<xref ref-type="bibr" rid="B35">Kayhan and van Gemert, 2020</xref>). That makes it unnecessary to focus on the location of the disease on the plant roots or leaves and let alone to divide up the area of the spot. Convolution is done by applying filters to the input image data, which decreases its size (<xref ref-type="bibr" rid="B84">Yamashita et al., 2018</xref>). An additional operation called the Rectified Linear Unit (ReLU) (<xref ref-type="bibr" rid="B5">Atila and Seng&#x00FC;r, 2021</xref>) was used after every convolution operation to generate a non-linear relationship between input and output. Finally, The pooling layer is used for secondary feature extraction, retaining the main features, reducing parameters, saving computing resources, preventing over-fitting, and improving model generalization (<xref ref-type="bibr" rid="B64">Suarez-Paniagua and Segura-Bedmar, 2018</xref>). Here, we define a spatial neighborhood with a 2 &#x00D7; 2 window and take the largest element from the rectified feature map within that window. Max pooling not only reduces the dimensionality of each feature map but also retains the most important information. Comparing with the typical VGG16 model (<xref ref-type="bibr" rid="B56">Qassim et al., 2018</xref>), the network structure of our model retains all the convolutional and pooling layers and the activation method, but removes three fully connected layers.</p>
<p>Let us say we have a plant image, and its size is 224 &#x00D7; 224. The representative array of this image will be 224 &#x00D7; 224 &#x00D7; 3 (3 refers to the channels of RGB). After the first operation of convolution, we obtained the feature maps as an array with 224 &#x00D7; 224 &#x00D7;64. Passing this array through four convolutional layers, we finally obtained 512 feature maps with 14 &#x00D7; 14. The final output feature map (14 &#x00D7; 14 &#x00D7; 512) will be converted into one-dimensional vector.</p>
<p>Considering the fact that a CNN model may take time to train on large datasets, transfer learning (<xref ref-type="bibr" rid="B50">Pan and Yang, 2010</xref>) was considered in our study to re-use the model weights from pre-trained ImageNet (<xref ref-type="bibr" rid="B36">Krizhevsky et al., 2012</xref>) tasks. Here, we directly use the five convolutional layers from the entire architecture of the pre-trained the VGG16 model on ImageNet datasets.</p>
</sec>
<sec id="S3.SS2.SSS2">
<title>Converting the Feature Maps to a Fixed Length Feature Vector</title>
<p>In this step, we convert all the two-dimensional feature maps to a single long continuous linear vector because the fully connected layer expects to receive one-dimensional inputs (<xref ref-type="bibr" rid="B26">Gu et al., 2018</xref>). Here, we introduce SPP (<xref ref-type="bibr" rid="B30">He et al., 2015</xref>) layer to remove the limitation of the fixed size of the images. The SPP layer was placed after the last convolutional layer and aggregated multi-scale features. As shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, each feature map (14 &#x00D7; 14) is divided into a lattice of n &#x00D7; n (<italic>n</italic> = 1,2,4) and each lattice is pooled, resulting in 21 features. This also means that the 512 feature maps of an original image are finally represented as a one-dimensional vector with a length of 10,752 (21 &#x00D7; 512). The output of the fully connected layer is 4,096, which means each image matrix will be converted to a feature vector with length 4,096 for clustering calculation.</p>
</sec>
</sec>
<sec id="S3.SS3">
<title>Image Clustering</title>
<p>As mentioned above, each original image was finally represented as a 4,096 &#x00D7; 1 vector after the feature extraction process. The clustering of a group of original images is thus equivalent to a clustering task on a set of data points with a dimension of 4,096. Considering the fact that t-SNE is an efficient algorithm based on manifold learning for unsupervised clustering (<xref ref-type="bibr" rid="B74">Van der Maaten and Hinton, 2008</xref>), we designed an improved t-SNE algorithm for image clustering to classify plant diseases and graded the severity of a disease. The standard t-SNE algorithm assumes that the samples are distributed on a statistical manifold and converts the Euclidean distance between the samples into conditional probabilities to characterize the similarity between the samples (<xref ref-type="bibr" rid="B67">Talwalkar et al., 2008</xref>). However, the variables in the high-dimensional space often present complex non-linear relationships, and the Euclidean distance does not well reflect the real distribution of the samples, thus affecting its projection to the low-dimensional space. Within a manifold space, the Euclidean distance metrics can only represent the real distance between samples in a very small neighborhood subspace (<xref ref-type="bibr" rid="B89">Zhang et al., 2011</xref>).</p>
<p>Taken above together, we think that only the data points in the local neighborhood are applicable to the Euclidean distance, and they should be given greater weight in the conditional probability transformation. In this study, we adopted a WDM strategy to improve the t-SNE algorithm (WDM-tSNE) so that the similarity between samples can be better reflected after they are projected to a low-dimensional space. The details of WDM-tSNE are described as follows:</p>
<p>Firstly, we construct the distance matrix <italic>D</italic> of all the samples, where the element <italic>d</italic><sub><italic>ij</italic></sub> represents the distance between any two points <italic>X</italic><sub><italic>i</italic></sub> and <italic>X</italic><sub><italic>j</italic></sub> [Eq. (1)]:</p>
<disp-formula id="S3.E1"><label>(1)</label><mml:math id="M1" display="block"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>All the non-zero elements <italic>d</italic><sub><italic>ij</italic></sub> (<italic>i</italic>&#x2260;<italic>j</italic>) are sorted in ascending order, and the distance value that ranks approximately 10% is selected as the threshold of the neighborhood relationship, denoted as&#x03B8;. If <italic>d</italic><sub><italic>i</italic><italic>j</italic></sub>&#x2264;&#x03B8;, <italic>X</italic><sub><italic>i</italic></sub> and <italic>X</italic><sub><italic>j</italic></sub> have a neighbor relationship and weighting their distance will make them closer in the low-dimensional space. Therefore, we define a WDM strategy to adjust the distance coefficient <italic>l</italic> between any pair of samples <italic>X</italic><sub><italic>i</italic></sub> and <italic>X</italic><sub><italic>j</italic></sub>:</p>
<disp-formula id="S3.E2"><label>(2)</label><mml:math id="M2" display="block"><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>min</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi>c</mml:mi></mml:mrow><mml:mtable rowspacing="0pt"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>max</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>min</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mn>1</mml:mn><mml:mo rspace="41.4pt">,</mml:mo><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfrac><mml:mo rspace="4.2pt">,</mml:mo><mml:mi>i</mml:mi><mml:mpadded width="+3.3pt"><mml:mi>f</mml:mi></mml:mpadded><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mi mathvariant="normal">&#x03B8;</mml:mi></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>Under the Gaussian distribution centered on the point <italic>X</italic><sub><italic>i</italic></sub>, the conditional probability <italic>P</italic><sub><italic>j|i</italic></sub> is used to measure the similarity between <italic>X</italic><sub><italic>i</italic></sub> and <italic>X</italic><sub><italic>j</italic></sub>. In other words, <italic>P</italic><sub><italic>j|i</italic></sub>means the probability that <italic>X</italic><sub><italic>i</italic></sub> chooses <italic>X</italic><sub><italic>j</italic></sub> as its neighbor. We thus construct conditional probability <italic>P</italic><sub><italic>j|i</italic></sub> for <italic>X</italic><sub><italic>i</italic></sub> and <italic>X</italic><sub><italic>j</italic></sub>, and the probability distribution is defined as Eq. (3):</p>
<disp-formula id="S3.E3"><label>(3)</label><mml:math id="M3" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt" stretchy="false">|</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x002A;</mml:mo><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x002A;</mml:mo><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>From Eq. (3), we have <bold><italic>P</italic><sub><italic>i</italic>|<italic>i</italic></sub> = 0</bold>. Assuming that the points <italic>Y</italic><sub><italic>i</italic></sub> and <italic>Y</italic><sub><italic>j</italic></sub> in the low-dimensional space are projected from <italic>X</italic><sub><italic>i</italic></sub> and<italic>X</italic><sub><italic>j</italic></sub>, the similarity between the points <italic>Y</italic><sub><italic>i</italic></sub> and <italic>Y</italic><sub><italic>j</italic></sub> can be defined as:</p>
<disp-formula id="S3.E4"><label>(4)</label><mml:math id="M4" display="block"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt" stretchy="false">|</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>According to the above description, we expect that if two points are similar in the high-dimensional space, they should be closer after being projected to the low-dimensional space. Here, we use Kullback-Leibler divergence (<xref ref-type="bibr" rid="B74">Van der Maaten and Hinton, 2008</xref>) to measure the difference between the above two conditional probability distributions and define the following objective function as Eq. (5):</p>
<disp-formula id="S3.E5"><label>(5)</label><mml:math id="M5" display="block"><mml:mrow><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mi>K</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mpadded width="+3.3pt"><mml:mi>P</mml:mi></mml:mpadded><mml:mo stretchy="false">|</mml:mo><mml:mo rspace="5.8pt" stretchy="false">|</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:munder><mml:mpadded width="+1.7pt"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt" stretchy="false">|</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mi>log</mml:mi><mml:mfrac><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt" stretchy="false">|</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt" stretchy="false">|</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>However, the KL divergence (Kullback-Leibler divergence) is asymmetric [<italic>K</italic><italic>L</italic>(<italic>P</italic>||<italic>Q</italic>) &#x2260; <italic>K</italic><italic>L</italic>(<italic>Q</italic>||<italic>P</italic>)] (<xref ref-type="bibr" rid="B2">Afgani et al., 2008</xref>), which will cause the gradient calculation to be complicated. To optimize the KL divergence in SNE, t-SNE adopts symmetric SNE, that is, assuming <italic>P</italic><sub><italic>j</italic>|<italic>i</italic></sub> = <italic>P</italic><sub><italic>i</italic>|<italic>j</italic></sub> and <italic>Q</italic><sub><italic>j</italic>|<italic>i</italic></sub> = <italic>Q</italic><sub><italic>i</italic>|<italic>j</italic></sub>. The conditional probability <italic>p<sub>j|i</sub></italic> can be replaced with the joint probability <italic>p</italic><sub><italic>ij</italic></sub>:</p>
<disp-formula id="S3.E6"><label>(6)</label><mml:math id="M6" display="block"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x002A;</mml:mo><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x002A;</mml:mo><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mi>S</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>If <italic>X</italic><sub><italic>i</italic></sub> is an abnormal point, all the <italic>d</italic><sub><italic>ij</italic></sub> will be very large and may impact the calculation of <italic>P</italic><sub><italic>ij</italic></sub>. Therefore, we define the joint probability distribution <italic>P</italic><sub><italic>ij</italic></sub> as:</p>
<disp-formula id="S3.E7"><label>(7)</label><mml:math id="M7" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt" stretchy="false">|</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt" stretchy="false">|</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>To make the points in the same cluster in the low-dimensional space more closer and the points in different clusters are more distant (<xref ref-type="bibr" rid="B74">Van der Maaten and Hinton, 2008</xref>), the long-tailed t-distribution is used instead of the Gaussian distribution. The joint probability of two points in the low-dimensional space can be defined as:</p>
<disp-formula id="S3.E8"><label>(8)</label><mml:math id="M8" display="block"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>Therefore, Eq. (5) can be written as Eq. (9):</p>
<disp-formula id="S3.E9"><label>(9)</label><mml:math id="M9" display="block"><mml:mrow><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mi>K</mml:mi><mml:mi>L</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">|</mml:mo><mml:mo stretchy="false">|</mml:mo><mml:mi>Q</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:msub><mml:msub><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi>log</mml:mi><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:msubsup></mml:mrow></mml:math></disp-formula>
<p>The formula (9) can be optimized by using the gradient descent strategy shown in formula (10):</p>
<disp-formula id="S3.E10"><label>(10)</label><mml:math id="M10" display="block"><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x03B4;</mml:mi><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B4;</mml:mi><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mrow><mml:mn>4</mml:mn><mml:mrow><mml:msub><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo rspace="4.2pt" stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo rspace="5.8pt" stretchy="false">)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>Y</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>Finally, all the point pairs of <italic>X</italic><sub><italic>i</italic></sub> and <italic>X</italic><sub><italic>j</italic></sub> in the high-dimensional space are projected to the two-dimensional space as <italic>Y</italic><sub><italic>i</italic></sub> and <italic>Y</italic><sub><italic>j</italic></sub>. The visualization of all the points <italic>Y</italic> can show the clustering effect of image samples.</p>
</sec>
<sec id="S3.SS4">
<title>Experimental Protocol</title>
<p>In this section, we introduced the experimental protocol designed for the validation of the proposed approach, such as data collection, simulation design, evaluation metric, and parameter optimization.</p>
</sec>
<sec id="S3.SS5">
<title>Data Collection</title>
<p>The MNIST database (Modified National Institute of Standards and Technology database) (<xref ref-type="bibr" rid="B7">Baldominos et al., 2019</xref>), a large database of handwritten digits, was used for data collection, which is not only used for training various image processing systems but also for testing machine-learning algorithms (<xref ref-type="bibr" rid="B52">Pastor-L&#x00F3;pez et al., 2021</xref>). Currently, the MNIST database contains 60,000 training images and 10,000 testing images. In this study, we selected a data-subset Scikit-learn containing 1,797 8 &#x00D7; 8 digital images to test our proposed approach for image clustering.</p>
<p><italic>PlantVillage</italic> (<xref ref-type="bibr" rid="B8">Barbedo, 2019</xref>) is a large, open-access image database. Currently, it stores 54,306 leaf images, associate with 26 plant diseases of 14 species (<xref ref-type="bibr" rid="B3">Albert et al., 2017</xref>; <xref ref-type="bibr" rid="B12">Brahimi et al., 2017</xref>; <xref ref-type="bibr" rid="B22">Ferentinos, 2018</xref>). This dataset is widely employed to test the performance of machine-learning models (<xref ref-type="bibr" rid="B79">Wang et al., 2017</xref>). In this study, we mainly focused on the following image sets from PlantVillage: (1) three types of leaf diseases on tomatoes (<xref ref-type="fig" rid="F3">Figure 3C</xref>), such as bacterial spot of tomato (<xref ref-type="bibr" rid="B1">Adhikari et al., 2020</xref>), tomato leaf mold (<xref ref-type="bibr" rid="B59">Rivas and Thomas, 2005</xref>), and tomato yellow leaf curl virus (TYLCV) (<xref ref-type="bibr" rid="B55">Prasad et al., 2020</xref>); (2) cherry powdery mildew (<xref ref-type="bibr" rid="B28">Gupta et al., 2017</xref>; <xref ref-type="fig" rid="F3">Figure 3B</xref>); (3) leaf scorch of strawberry (<xref ref-type="bibr" rid="B17">Dhanvantari, 1967</xref>; <xref ref-type="fig" rid="F3">Figure 3A</xref>).</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption><p>The representative leaf images with diseases from PlantVillage. <bold>(A)</bold> Leaf scorch of strawberry; <bold>(B)</bold> cherry powdery mildew; <bold>(C)</bold> three types of leaf diseases on tomatoes: a bacterial spot of tomato, tomato leaf mold, and tomato yellow leaf curl virus (TYLCV).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g003.tif"/>
</fig>
<p><italic>Aphanomyces Root Rot Image Dataset</italic> (<xref ref-type="bibr" rid="B45">Marzougui et al., 2019</xref>) contains up to 6,460 lentil images with root rot. ARR is a soil-borne disease that severely reduces lentil production. Based on the percentage of the brown discoloration area of the root and the softness of the hypocotyl (<xref ref-type="bibr" rid="B46">McGee et al., 2012</xref>), <xref ref-type="bibr" rid="B45">Marzougui et al. (2019)</xref> labeled the relative severity of all the root images using 0&#x2013;5 disease scoring scale (<xref ref-type="bibr" rid="B46">McGee et al., 2012</xref>). For example, A score of 0 means that there are no obvious symptoms and good resistance to root rot; 1.5 means that the root has 15&#x2013;25% of partial discoloration lesions; 3.5 means that the entire root has completely turned brown, and the hypocotyl has some symptoms. Eleven representative images with scores from 0 to 5 are shown in <xref ref-type="fig" rid="F4">Figure 4</xref>. Furthermore, <xref ref-type="bibr" rid="B44">Marzougui et al. (2020)</xref> proposed three subtypes of ARR based on the visual score to evaluate the Rot severity: (1) resistant subtype with score 0&#x2013;1.5; (2) partially resistant with score 2&#x2013;3; (3) susceptible subtype with score 3.5&#x2013;5. In this study, we selected 950 representative images of ARR for experimental simulation.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption><p>Aphanomyces root rot disease severity scale.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g004.tif"/>
</fig>
</sec>
<sec id="S3.SS6">
<title>Simulation Design</title>
<p>Firstly, 1,797 digital images from MNIST were used to test the proposed method. Furthermore, we also compared the WDM-tSNE with the other five clustering strategies on MNIST. Secondly, a binary clustering test was further implemented on 400 strawberry and 400 cherry images to identify the diseased samples from the control. Thirdly, 300 tomato images were selected to test the clustering performance of our approach on three different diseases. Finally, we selected 950 ARR images to explore potential subtypes for the lentil invaded by Aphanomyces. We manually constructed balanced datasets and unbalanced datasets to evaluate if our approach is steady. The sample size for each dataset is presented in <xref ref-type="supplementary-material" rid="IS1">Supplementary File 1</xref>.</p>
</sec>
<sec id="S3.SS7">
<title>Clustering Performance Evaluation</title>
<p>In this study, we defined three types of metrics to assess the clustering performance. (1) Silhouette Coefficient (SC) (<xref ref-type="bibr" rid="B19">Dinh et al., 2019</xref>); (2) Calinski-Harabasz Index (CHI) (<xref ref-type="bibr" rid="B43">&#x0141;ukasik et al., 2016</xref>); (3) Davies-Bouldin Index (DBI) (<xref ref-type="bibr" rid="B76">Vergani and Binaghi, 2018</xref>).</p>
<p>Silhouette Coefficient was firstly proposed by <xref ref-type="bibr" rid="B60">Rousseeuw (1987)</xref>, which considered both the degree of cohesion and separation to measure the clustering performance. The <italic>SC</italic> value of sample <italic>j</italic> can be calculated by Eq. (11):</p>
<disp-formula id="S3.E11"><label>(11)</label><mml:math id="M11" display="block"><mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>max</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">{</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">}</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>where <italic>C</italic><sub><italic>j</italic></sub> and <italic>S</italic><sub><italic>j</italic></sub> represent the degree of cohesion and separation, respectively. We can clearly see that good clustering means smaller <italic>C</italic><sub><italic>j</italic></sub> and larger <italic>S</italic><sub><italic>j</italic></sub>.</p>
<p>Calinski-Harabasz Index is defined as the ratio of the between-clusters dispersion mean and the within-cluster dispersion. A larger CHI means that the clusters themselves are tighter and the cluster-clusters are more dispersed [Eq. (12)]:</p>
<disp-formula id="S3.E12"><label>(12)</label><mml:math id="M12" display="block"><mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>H</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mi>c</mml:mi></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mi>K</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mo>]</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:msubsup><mml:msup><mml:mrow><mml:mo fence="true">||</mml:mo><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo fence="true">||</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:mfrac><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>In Eq. (12), <italic>N</italic> and <italic>K</italic> are the number of samples and clusters, respectively. The variables <italic>n</italic><sub><italic>k</italic></sub> and <italic>c</italic><sub><italic>k</italic></sub> are the no. of points and centroid of the <italic>h</italic>-th cluster respectively, <italic>c</italic> is the global centroid.</p>
<p>Davies-Bouldin Index measures the average similarity between clusters [Eq. (13)].</p>
<disp-formula id="S3.E13"><label>(13)</label><mml:math id="M13" display="block"><mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>B</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>k</mml:mi></mml:mfrac><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>k</mml:mi></mml:munderover><mml:mrow><mml:munder><mml:mi>max</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>In Eq. (13), <italic>R</italic><sub><italic>ij</italic></sub> denotes the similarity between each cluster <italic>C</italic><sub><italic>i</italic></sub> and its most similar one <italic>C</italic><sub><italic>j</italic></sub>:</p>
<disp-formula id="S3.E14"><label>(14)</label><mml:math id="M14" display="block"><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p><italic>s</italic><sub><italic>i</italic></sub> denotes the average distance between each point of cluster <italic>i</italic>. <italic>d</italic><sub><italic>ij</italic></sub> denotes the distance between cluster centroids <italic>i</italic> and <italic>j</italic>.</p>
</sec>
<sec id="S3.SS8">
<title>Parameter Optimization</title>
<p>All the simulations were performed using Python with TensorFlow on Ubuntu 14.04 platform. The hardware setups are 2.30?GHz CPU and 4.00 GB RAM. CNN model is composed of 13 convolutional layers, and each layer uses a stacked 3 &#x00D7; 3 small convolution kernel to replace the large-size convolution kernel. After each convolutional layer, a 2 &#x00D7; 2 max pooling is used. In the WDM-tSNE model, the gradient descent strategy is used to optimize the cost function <italic>C</italic> [Formula (9)], and the momentum term &#x03B1;<sup>(<italic>t</italic>)</sup> is introduced to reduce the number of iterations (<italic>T</italic>). When the value of the cost function reaches 95% of the previous time, it indicates that the best result has been obtained, and the iteration is stopped. If <italic>T &#x003C; 250</italic>, we set &#x03B1;<sup>(<italic>t</italic>)</sup> = 0.5; otherwise, &#x03B1;<sup>(<italic>t</italic>)</sup> = 0.8. The initial learning rate is set to 100, which is updated by the adaptive learning algorithm after each iteration.</p>
</sec>
</sec>
<sec sec-type="results" id="S4">
<title>Results</title>
<sec id="S4.SS1">
<title>Validation on Modified National Institute of Standards and Technology Dataset</title>
<p>As a golden-standard image dataset, MNIST was firstly tested by our method. A total 1,797 digital images were imported to the CNN module and converted to a 1,797 &#x00D7; 64 matrix. Moreover, all the 1,797 samples in a 64-D space were then projected to 2D space by six dimensionality reduction approaches, namely, ISOMAP (Isometric Mapping), PCA (Principal Component Analysis), LLE (Locally Linear Embedding), MDS (Multidimensional Scaling), t-SNE (t-Distributed Stochastic Neighbor Embedding), and the proposed WDM-tSNE (<xref ref-type="fig" rid="F5">Figure 5</xref>). From <xref ref-type="fig" rid="F5">Figure 5</xref>, we found that LLE and PCA obtained the worst performance of dimensionality reduction as the 10 types of digital images in 2D space cannot be separated at all. ISOMAP and MDS work better rather than the first two, but the boundaries of inter-clusters are still blurred. In contrast, t-SNE and WDM-tSNE are significantly better than the previous four methods. Particularly, multiple evaluation metrics indicates that the WDM-tSNE strategy obtained higher clustering accuracy on MNIST superior to the standard t-SNE (<xref ref-type="supplementary-material" rid="TS1">Supplementary Table 1</xref>). For the geometric distribution of the samples in 2D space, WDM-tSNE can obtain better partitions of clusters (<xref ref-type="supplementary-material" rid="TS1">Supplementary Table 1</xref>).</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption><p>The plots for the MNIST dataset based on six dimensionality reduction approaches, including <bold>(A)</bold> Isomap, <bold>(B)</bold> LLE, <bold>(C)</bold> PCA, <bold>(D)</bold> MDS, <bold>(E)</bold> t-SNE, and <bold>(F)</bold> WDM-tSNE. MNIST, Modified National Institute of Standards and Technology; ISOMAP, Isometric Mapping; PCA, Principal Component Analysis; LLE, Locally Linear Embedding; MDS, Multidimensional Scaling; t-SNE, t-Distributed Stochastic Neighbor Embedding; WDM-tSNE, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g005.tif"/>
</fig>
</sec>
<sec id="S4.SS2">
<title>The Proposed Model Works Well for Disease Diagnosis</title>
<p>We then applied our method on 400 strawberry images with leaf scorch. <xref ref-type="fig" rid="F6">Figure 6</xref> shows that the scorched leaf images can be easily identified from the healthy samples. Both balanced and unbalanced datasets revealed that the clustering performance is steady. <xref ref-type="table" rid="T1">Table 1</xref> indicates that WDM-tSNE provides better clustering performance rather than t-SNE. Similarly, we also tested our approach on 400 cherry leaf images with powdery mildew. WCD-tSNE not only makes the samples in the same cluster more concentrated, but also guarantees the distance between different clusters is as far away as possible (<xref ref-type="fig" rid="F7">Figure 7</xref>). Compared with t-SNE, WDM-tSNE has a better clustering effect (<xref ref-type="table" rid="T2">Table 2</xref>). In addition to the binary-clustering, we also tested the multi-clustering situation on the leaf images of diseased tomato. <xref ref-type="fig" rid="F8">Figure 8</xref> reveals that three distinct leaf diseases on tomatoes can be clearly identified (<xref ref-type="table" rid="T3">Table 3</xref>). Taken above together, we suggest that the proposed framework is an effective tool for identifying plant disease with high accuracy.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption><p>The plots for the <bold>(A)</bold> balanced or <bold>(B&#x2013;C)</bold> unbalanced datasets of strawberry leaf scorch based on (i) t-SNE and (ii) WDM-tSNE. WDM-tSNE, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g006.tif"/>
</fig>
<table-wrap position="float" id="T1">
<label>TABLE 1</label>
<caption><p>The performance of WDM-tSNE on the multiple datasets of strawberry.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left"></td>
<td valign="top" align="center" colspan="2">Balanced dataset<hr/></td>
<td valign="top" align="left" colspan="2">Unbalanced dataset with more healthy leaves<hr/></td>
<td valign="top" align="left" colspan="2">Unbalanced dataset with more scorch leaves<hr/></td>
</tr>
<tr>
<td/>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Silhouette coefficient</td>
<td valign="top" align="left">0.723</td>
<td valign="top" align="left">0.729</td>
<td valign="top" align="left">0.755</td>
<td valign="top" align="left">0.788</td>
<td valign="top" align="left">0.725</td>
<td valign="top" align="left">0.799</td>
</tr>
<tr>
<td valign="top" align="left">Calinski-Harabasz</td>
<td valign="top" align="left">2014.769</td>
<td valign="top" align="left">2106.024</td>
<td valign="top" align="left">1026.573</td>
<td valign="top" align="left">1353.780</td>
<td valign="top" align="left">734.780</td>
<td valign="top" align="left">1391.950</td>
</tr>
<tr>
<td valign="top" align="left">Davies-Bouldin Index</td>
<td valign="top" align="left">0.4070</td>
<td valign="top" align="left">0.399</td>
<td valign="top" align="left">0.271</td>
<td valign="top" align="left">0.233</td>
<td valign="top" align="left">0.302</td>
<td valign="top" align="left">0.218</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="tfn1"><p><italic>WDM-tSNE, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm.</italic></p></fn>
</table-wrap-foot>
</table-wrap>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption><p>The plots for the <bold>(A)</bold> balanced and <bold>(B&#x2013;C)</bold> unbalanced datasets of the cherry leaf with powdery mildew based on (i) t-SNE and (ii) WDM-tSNE. WDM-tSNE, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g007.tif"/>
</fig>
<table-wrap position="float" id="T2">
<label>TABLE 2</label>
<caption><p>The performance of WDM-tSNE on the multiple datasets of cherry.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left"></td>
<td valign="top" align="left" colspan="2">Balanced dataset<hr/></td>
<td valign="top" align="left" colspan="2">Unbalanced dataset with more healthy leaves<hr/></td>
<td valign="top" align="left" colspan="2">Unbalanced dataset with more scorch leaves<hr/></td>
</tr>
<tr>
<td/>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Silhouette coefficient</td>
<td valign="top" align="left">0.496</td>
<td valign="top" align="left">0.494</td>
<td valign="top" align="left">0.362</td>
<td valign="top" align="left">0.369</td>
<td valign="top" align="left">0.354</td>
<td valign="top" align="left">0.361</td>
</tr>
<tr>
<td valign="top" align="left">Calinski-Harabasz</td>
<td valign="top" align="left">511.877</td>
<td valign="top" align="left">540.454</td>
<td valign="top" align="left">81.172</td>
<td valign="top" align="left">103.808</td>
<td valign="top" align="left">119.424</td>
<td valign="top" align="left">131.842</td>
</tr>
<tr>
<td valign="top" align="left">Davies-Bouldin Index</td>
<td valign="top" align="left">0.773</td>
<td valign="top" align="left">0.764</td>
<td valign="top" align="left">0.969</td>
<td valign="top" align="left">0.841</td>
<td valign="top" align="left">0.836</td>
<td valign="top" align="left">0.829</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="tfn2"><p><italic>WDM-tSNE, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm.</italic></p></fn>
</table-wrap-foot>
</table-wrap>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption><p>The plots for the balanced datasets of three tomato leaf diseases based on <bold>(A)</bold> t-SNE and <bold>(B)</bold> WDM-tSNE. WDM-tSNE, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g008.tif"/>
</fig>
<table-wrap position="float" id="T3">
<label>TABLE 3</label>
<caption><p>The performance of WDM-tSNE on the dataset of tomato disease.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left"></td>
<td valign="top" align="center" colspan="2">Balanced dataset<hr/></td>
</tr>
<tr>
<td/>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Silhouette coefficient</td>
<td valign="top" align="left">0.263</td>
<td valign="top" align="left">0.273</td>
</tr>
<tr>
<td valign="top" align="left">Calinski-Harabasz</td>
<td valign="top" align="left">25.538</td>
<td valign="top" align="left">40.427</td>
</tr>
<tr>
<td valign="top" align="left">Davies-Bouldin Index</td>
<td valign="top" align="left">1.615</td>
<td valign="top" align="left">1.279</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="tfn3"><p><italic>WDM-tSNE, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm.</italic></p></fn>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="S4.SS3">
<title>The Proposed Model Works Well for Subtype Discovery</title>
<p>Different from the experiments shown above, we further applied our model on 950 lentil root images infected by Aphanomyces euteiches to identify the underlying subtypes associate with Aphanomyces resistance. Firstly, 550 representative images (balanced dataset) of ARR with 11 rates of severity were projected to 2D space through six machine-learning approaches (<xref ref-type="fig" rid="F9">Figure 9</xref>). <xref ref-type="fig" rid="F9">Figures 9E,F</xref> shows that both t-SNE and WDM-tSNE can uncover the disease trajectory of all the samples from mild to severe. Secondly, we selected 550 images (50 samples for each rate) to test if WDM-tSNE has the ability to reveal the underlying subtypes of the plant samples with the same disease. <xref ref-type="fig" rid="F10">Figure 10</xref> shows that three clusters are obviously detected from balanced and unbalanced datasets. The clustering performance of WDM-tSNE is superior to t-SNE (<xref ref-type="table" rid="T4">Table 4</xref>). In the balanced dataset with 550 samples, 231 were predicted as a mild subtype with an average score of 1.93, 205 were predicted as a partially moderate subtype (average score: 2.45), and 114 were marked as a severe subtype (average score: 3.74) (<xref ref-type="fig" rid="F11">Figure 11</xref>). <xref ref-type="fig" rid="F11">Figure 11</xref> also suggests that the samples with serious symptoms can be easily detected (cluster 3). However, the visual score based on the percentage of discolored lesions on the entire root system defined by Marzougui et al. may cause bias when dividing mild and moderate samples. Therefore, the data annotations based on expert knowledge are also one of the factors that affect the accuracy of the algorithm.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption><p>The plots for the balanced dataset of ARR based on six dimensionality reduction approaches, including <bold>(A)</bold> Isomap, <bold>(B)</bold> LLE, <bold>(C)</bold> PCA, <bold>(D)</bold> MDS, <bold>(E)</bold> t-SNE, and <bold>(F)</bold> WDM-tSNE. The samples with 11 rates were plotted. ARR, Aphanomyces Root Rot.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g009.tif"/>
</fig>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption><p>The plots for the <bold>(A)</bold> balanced and <bold>(B&#x2013;C)</bold> unbalanced datasets of ARR are based on (i) t-SNE and (ii) WDM-tSNE. WDM-tSNE, Aphanomyces Root Rot; Weighted Distance Metric and the t-stochastic neighbor embedding algorithm; ARR, Aphanomyces Root Rot.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g010.tif"/>
</fig>
<table-wrap position="float" id="T4">
<label>TABLE 4</label>
<caption><p>The performance of WDM-tSNE on the multiple datasets of lentil.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left"></td>
<td valign="top" align="left" colspan="2">Balanced dataset<hr/></td>
<td valign="top" align="left" colspan="2">Unbalanced dataset with severe discoloration lesions<hr/></td>
<td valign="top" align="left" colspan="2">Unbalanced dataset with slight discoloration lesions<hr/></td>
</tr>
<tr>
<td/>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
<td valign="top" align="left">t-SNE</td>
<td valign="top" align="left">WDM-tSNE</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Silhouette coefficient</td>
<td valign="top" align="left">0.214</td>
<td valign="top" align="left">0.232</td>
<td valign="top" align="left">0.192</td>
<td valign="top" align="left">0.207</td>
<td valign="top" align="left">0.189</td>
<td valign="top" align="left">0.225</td>
</tr>
<tr>
<td valign="top" align="left">Calinski-Harabasz</td>
<td valign="top" align="left">130.182</td>
<td valign="top" align="left">165.652</td>
<td valign="top" align="left">163.077</td>
<td valign="top" align="left">182.195</td>
<td valign="top" align="left">161.421</td>
<td valign="top" align="left">237.701</td>
</tr>
<tr>
<td valign="top" align="left">Davies-Bouldin Index</td>
<td valign="top" align="left">1.279</td>
<td valign="top" align="left">1.147</td>
<td valign="top" align="left">1.799</td>
<td valign="top" align="left">1.667</td>
<td valign="top" align="left">1.402</td>
<td valign="top" align="left">1.235</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="tfn4"><p><italic>WDM-tSNE, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm.</italic></p></fn>
</table-wrap-foot>
</table-wrap>
<fig id="F11" position="float">
<label>FIGURE 11</label>
<caption><p>The predicted three subtypes of ARR: <bold>(A)</bold> mild; <bold>(B)</bold> moderate; <bold>(C)</bold> severe. The numbers denote how many samples are assigned to one of the subtypes. ARR, Aphanomyces Root Rot.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-12-789630-g011.tif"/>
</fig>
</sec>
</sec>
<sec sec-type="discussion" id="S5">
<title>Discussion</title>
<p>Plant diseases are not only a threat to food security on a global scale, but also cause disastrous consequences for smallholder farmers whose livelihoods depend on healthy crops (<xref ref-type="bibr" rid="B47">Mohanty et al., 2016</xref>). Identifying a disease correctly when it first appears is a crucial step for efficient disease management. Various efforts have been developed to prevent the loss of the plant due to diseases. For computer-vision-based plant diseases detection, conventional image processing or manual design of features plus classifiers are often used (<xref ref-type="bibr" rid="B72">Tsaftaris et al., 2016</xref>). This kind of method usually makes use of the different properties of plant disease to design the imaging scheme and chooses appropriate light sources and shooting angles, which is helpful to obtain images with uniform illumination. In the real complex natural environment, plant diseases detection is faced with many challenges, such as the small differences between the lesion area and the background, low contrast, large variations in the scale of the lesion area and various types, and a lot of noise in the lesion image (<xref ref-type="bibr" rid="B42">Liu and Wang, 2021</xref>). In addition, over-depend on expert knowledge to manually design the features of diseased plant often limits the generalization. In recent years, DL methods are widely used in various CV tasks for plant disease diagnosis. The most challenges of DL-based strategies include small sample size problem, fine-grained identification of small-size lesions in the early stage, and the performance under the influence of illumination and occlusion (<xref ref-type="bibr" rid="B42">Liu and Wang, 2021</xref>).</p>
<p>In this study, we proposed a computational framework for both plant disease identification and severity estimation (<xref ref-type="fig" rid="F1">Figure 1</xref>). Firstly, we designed a CNN network structure as a feature extractor to obtain the image features of lesion regions of a diseased plant. The input original images are not required with a fixed size, which avoid the impacts of image distortion or geometric distortion on feature extraction. Secondly, a dimension reduction strategy, WDM-tSNE, was developed for the imaging clustering tasks by improving the t-SNE with WDM. WDM-tSNE successfully realized the efficient clustering of high-dimensional samples in low-dimensional space.</p>
<p>To validate the effectiveness, we applied the proposed model on a bunch of plant image datasets. The experimental results revealed that our method not only identifies multiple distinct diseases of the same plant but also estimates the severity of the same disease. <xref ref-type="fig" rid="F5">Figures 5</xref>, <xref ref-type="fig" rid="F6">6</xref> indicate that our model is able to distinguish multiple diseases in a low-dimensional space. <xref ref-type="fig" rid="F7">Figures 7</xref>, <xref ref-type="fig" rid="F8">8</xref> show that the diseased samples can be easily identified from the health samples. From <xref ref-type="fig" rid="F9">Figure 9</xref>, we concluded that the proposed method can be used for subtype discovery or severity estimation from the same disease (ARR). The 10-fold cross-validation on the ARR dataset revealed that our model is robust (<xref ref-type="supplementary-material" rid="TS2">Supplementary Table 2</xref>). Furthermore, we applied our model on three small-scale datasets for cherry, strawberry, and tomato. The sample size of each class is only 50. Our analyses show that our model works well on small-scale image datasets (<xref ref-type="supplementary-material" rid="FS1">Supplementary Figure 1</xref> and <xref ref-type="supplementary-material" rid="TS3">Supplementary Table 3</xref>).</p>
<p>Considering the fact that the class imbalance may impact the clustering performance, we constructed multiple balanced and unbalanced datasets for ARR (lentil), cherry, and strawberry (<xref ref-type="supplementary-material" rid="IS1">Supplementary File 1</xref>). Regardless of binary-class or multi-class, WDM-tSNE shows better clustering performance than t-SNE (<xref ref-type="table" rid="T1">Tables 1</xref>&#x2013;<xref ref-type="table" rid="T4">4</xref>). It indicates that the sample variation does not affect the performance of our method.</p>
<p>The proposed WDM-tSNE outperformed other approaches. After extracting the features from images through the CNN module, we compared the clustering performance of WDM-tSNE with the other five dimension-reduction algorithms. <xref ref-type="fig" rid="F5">Figures 5</xref>, <xref ref-type="fig" rid="F9">9</xref> proved that WDM-tSNE is not only significantly better than ISOMAP, LLE, PCA, and MDS, but also prior to tSNE.</p>
<p>Recent advances in genomics technologies have greatly accelerated the progress in plant science (<xref ref-type="bibr" rid="B75">Varshney et al., 2021</xref>). There are some studies to link phenotypic data to genomic data for discovering the responsible genes or mutations that contributed to plant disease progression (<xref ref-type="bibr" rid="B10">Bolger et al., 2019</xref>). Particularly, the systems biology approaches developed by integrating multi-omics data will allow us to identify potential targets and predict new therapeutic strategies (<xref ref-type="bibr" rid="B18">Di Silvestre et al., 2018</xref>).</p>
<p>There are several limitations of our current method. Firstly, the features extracted from the plant images by the CNN module are non-semantic, thus, it is hard to interpretable for disease diagnosis and management. Secondly, the current approach only focused on a single disease for each cluster of the image but did not pay attention to the images of plants suffering from multiple diseases. Thirdly, we have not applied the current model on the high-throughput phenotypic images obtained from real natural environments. Finally, we cannot guarantee the clustering performance on the image samples of diseased plants whose severity is manually labeled by different experts.</p>
</sec>
<sec sec-type="conclusion" id="S6">
<title>Conclusion</title>
<p>This paper proposes a novel computational framework for plant disease identification and subtype discovery from phenomics data. Our proposed method has achieved high accuracy and good generalization ability in all four public datasets than other deep embedding clustering of images, e.g., t-SNE, ISOMAP, etc.</p>
<p>Specifically, our method does not depend on prior knowledge. Moreover, the size of input images is also unlimited. As a novel embedding strategy, WDM-tSNE provides the perfect clustering performance rather than other methods. The samples in 2D space present great distributions after space embedding, which is significant to reveal the underlying patterns and trajectory of plant disease.</p>
<p>In the future, we will further explore the association between the environmental parameters (climate, hydrology, and soil, etc.) and plant disease evolution.</p>
</sec>
<sec sec-type="data-availability" id="S7">
<title>Data Availability Statement</title>
<p>All the raw images involved in this study can be accessed through the links: <ext-link ext-link-type="uri" xlink:href="https://xf-data-bucket.oss-cn-hangzhou.aliyuncs.com/data.rar">https://xf-data-bucket.oss-cn-hangzhou.aliyuncs.com/data.rar</ext-link>. Source code is available at GitHub: <ext-link ext-link-type="uri" xlink:href="https://github.com/JakeJiUThealth/WDM1.0">https://github.com/JakeJiUThealth/WDM1.0</ext-link>. The original contributions presented in the study are included in the article/<xref ref-type="supplementary-material" rid="FS1">Supplementary Material</xref>, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="S8">
<title>Author Contributions</title>
<p>ZJ, FX, and XX designed the project. FX and XX analyzed the data. ZJ performed the mathematical modeling and optimization. ZJ, FX, ZW, SJ, and KY discussed the results. ZJ and FX wrote the manuscript. All authors contributed to the article and approved the submitted version.</p>
</sec>
<sec id="conf1" sec-type="COI-statement">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="pudiscl1" sec-type="disclaimer">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
</body>
<back>
<sec sec-type="funding-information" id="S9">
<title>Funding</title>
<p>This work was supported by the National Science Foundation of Jiangsu Province (no. BK20211210). This work was also supported by the startup award of a new professor at Nanjing Agricultural University (no. 106/804001), and the National Science Foundation of Zhejiang Province (no. LY20F020003).</p>
</sec>
<ack>
<p>The authors thank Prof. Haiyan Jiang at the College of Artificial Intelligence at Nanjing Agricultural University to provide valuable discussions.</p>
</ack>
<sec id="S11" sec-type="supplementary-material"><title>Supplementary Material</title>
<p>The Supplementary Material for this article can be found online at: <ext-link ext-link-type="uri" xlink:href="https://www.frontiersin.org/articles/10.3389/fpls.2021.789630/full#supplementary-material">https://www.frontiersin.org/articles/10.3389/fpls.2021.789630/full#supplementary-material</ext-link></p>
<supplementary-material xlink:href="Image_1.TIF" id="FS1" mimetype="image/tif" xmlns:xlink="http://www.w3.org/1999/xlink">
<label>Supplementary Figure 1</label>
<caption><p>The plots for the small-scale balanced datasets are based on t-SNE and WDM-tSNE. WDM-tSNE, Weighted Distance Metric and the t-stochastic neighbor embedding algorithm.</p></caption>
</supplementary-material>
<supplementary-material xlink:href="Table_1.DOCX" id="TS1" mimetype="application/vnd.openxmlformats-officedocument.wordprocessingml.document" xmlns:xlink="http://www.w3.org/1999/xlink">
<label>Supplementary Table 1</label>
<caption><p>Clustering performance on MNIST dataset. MNIST, Modified National Institute of Standards and Technology.</p></caption>
</supplementary-material>
<supplementary-material xlink:href="Table_1.DOCX" id="TS2" mimetype="application/vnd.openxmlformats-officedocument.wordprocessingml.document" xmlns:xlink="http://www.w3.org/1999/xlink">
<label>Supplementary Table 2</label>
<caption><p>A 10-fold cross-validation on the balanced dataset of ARR samples. ARR, Aphanomyces Root Rot.</p></caption>
</supplementary-material>
<supplementary-material xlink:href="Table_1.DOCX" id="TS3" mimetype="application/vnd.openxmlformats-officedocument.wordprocessingml.document" xmlns:xlink="http://www.w3.org/1999/xlink">
<label>Supplementary Table 3</label>
<caption><p>Clustering performance on three small-scale datasets. The sample size of each class is 50.</p></caption>
</supplementary-material>
<supplementary-material xlink:href="Table_2.XLSX" id="IS1" mimetype="application/vnd.openxmlformats-officedocument.spreadsheetml.sheet" xmlns:xlink="http://www.w3.org/1999/xlink">
<label>Supplementary File 1</label>
<caption><p>The sample assignment for each dataset involved in this study.</p></caption>
</supplementary-material>
</sec>
<ref-list>
<title>References</title>
<ref id="B1"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Adhikari</surname> <given-names>P.</given-names></name> <name><surname>Adhikari</surname> <given-names>T. B.</given-names></name> <name><surname>Louws</surname> <given-names>F. J.</given-names></name> <name><surname>Panthee</surname> <given-names>D. R.</given-names></name></person-group> (<year>2020</year>). <article-title>Advances and challenges in bacterial spot resistance breeding in tomato (Solanum lycopersicum L.).</article-title> <source><italic>Int. J. Mol. Sci.</italic></source> <volume>21</volume>:<issue>1734</issue>. <pub-id pub-id-type="doi">10.3390/ijms21051734</pub-id> <pub-id pub-id-type="pmid">32138355</pub-id></citation></ref>
<ref id="B2"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Afgani</surname> <given-names>M.</given-names></name> <name><surname>Sinanovic</surname> <given-names>S.</given-names></name> <name><surname>Haas</surname> <given-names>H.</given-names></name></person-group> (<year>2008</year>). &#x201C;<article-title>Anomaly detection using the Kullback-Leibler divergence metric</article-title>,&#x201D; in <source><italic>Proceeding of the First International Symposium on Applied Sciences on Biomedical and Communication Technologies</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>5</lpage>.</citation></ref>
<ref id="B3"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Albert</surname> <given-names>C.</given-names></name> <name><surname>Cruz</surname> <given-names>A. L.</given-names></name> <name><surname>De Bellis</surname> <given-names>L.</given-names></name> <name><surname>Ampatzidis</surname> <given-names>Y.</given-names></name></person-group> (<year>2017</year>). <article-title>X-FIDO: an effective application for detecting olive quick decline syndrome with deep learning and data fusion.</article-title> <source><italic>Front. Plant Sci.</italic></source> <volume>8</volume>:<issue>1741</issue>. <pub-id pub-id-type="doi">10.3389/fpls.2017.01741</pub-id> <pub-id pub-id-type="pmid">29067037</pub-id></citation></ref>
<ref id="B4"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ali</surname> <given-names>H.</given-names></name> <name><surname>Lali</surname> <given-names>M.</given-names> <suffix>I</suffix></name> <name><surname>Nawaz</surname> <given-names>M. Z.</given-names></name> <name><surname>Sharif</surname> <given-names>M.</given-names></name> <name><surname>Saleem</surname> <given-names>B. A.</given-names></name></person-group> (<year>2017</year>). <article-title>Symptom based automated detection of citrus diseases using color histogram and textural descriptors.</article-title> <source><italic>Comput. Electron. Agric.</italic></source> <volume>138</volume> <fpage>92</fpage>&#x2013;<lpage>104</lpage>. <pub-id pub-id-type="doi">10.1016/j.compag.2017.04.008</pub-id></citation></ref>
<ref id="B5"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Atila</surname> <given-names>O.</given-names></name> <name><surname>Seng&#x00FC;r</surname> <given-names>A.</given-names></name></person-group> (<year>2021</year>). <article-title>Attention guided 3D CNN-LSTM model for accurate speech based emotion recognition.</article-title> <source><italic>Appl. Acoustics</italic></source> <volume>182</volume>:<issue>108260</issue>. <pub-id pub-id-type="doi">10.1016/j.apacoust.2021.108260</pub-id></citation></ref>
<ref id="B6"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ayyub</surname> <given-names>S. R. N. M.</given-names></name> <name><surname>Manjramkar</surname> <given-names>A.</given-names></name></person-group> (<year>2019</year>). &#x201C;<article-title>Fruit disease classification and identification using image processing</article-title>,&#x201D; in <source><italic>Proceeding of the 3rd International Conference on Computing Methodologies and Communication (ICCMC)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>5</lpage>.</citation></ref>
<ref id="B7"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Baldominos</surname> <given-names>A.</given-names></name> <name><surname>Seaz</surname> <given-names>Y.</given-names></name> <name><surname>Isasi</surname> <given-names>P.</given-names></name></person-group> (<year>2019</year>). <article-title>A survey of handwritten character recognition with MNIST and EMNIST.</article-title> <source><italic>Appl. Sci.</italic></source> <volume>9</volume>:<issue>3169</issue>. <pub-id pub-id-type="doi">10.3390/app9153169</pub-id></citation></ref>
<ref id="B8"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Barbedo</surname> <given-names>J. G.</given-names></name></person-group> (<year>2019</year>). <article-title>Plant disease identification from individual lesions and spots using deep learning.</article-title> <source><italic>Biosyst. Eng.</italic></source> <volume>180</volume> <fpage>96</fpage>&#x2013;<lpage>107</lpage>. <pub-id pub-id-type="doi">10.1016/j.biosystemseng.2019.02.002</pub-id></citation></ref>
<ref id="B9"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bass</surname> <given-names>D.</given-names></name> <name><surname>Stentiford</surname> <given-names>G. D.</given-names></name> <name><surname>Wang</surname> <given-names>H. C.</given-names></name> <name><surname>Koskella</surname> <given-names>B.</given-names></name> <name><surname>Tyler</surname> <given-names>C. R.</given-names></name></person-group> (<year>2019</year>). <article-title>The pathobiome in animal and plant diseases.</article-title> <source><italic>Trends Ecol. Evol.</italic></source> <volume>34</volume> <fpage>996</fpage>&#x2013;<lpage>1008</lpage>. <pub-id pub-id-type="doi">10.1016/j.tree.2019.07.012</pub-id> <pub-id pub-id-type="pmid">31522755</pub-id></citation></ref>
<ref id="B10"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bolger</surname> <given-names>A. M.</given-names></name> <name><surname>Poorter</surname> <given-names>H.</given-names></name> <name><surname>Dumschott</surname> <given-names>K.</given-names></name> <name><surname>Bolger</surname> <given-names>M. E.</given-names></name> <name><surname>Arend</surname> <given-names>D.</given-names></name> <name><surname>Osorio</surname> <given-names>S.</given-names></name><etal/></person-group> (<year>2019</year>). <article-title>Computational aspects underlying genome to phenome analysis in plants.</article-title> <source><italic>Plant J.</italic></source> <volume>97</volume> <fpage>182</fpage>&#x2013;<lpage>198</lpage>. <pub-id pub-id-type="doi">10.1111/tpj.14179</pub-id> <pub-id pub-id-type="pmid">30500991</pub-id></citation></ref>
<ref id="B11"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Brahimi</surname> <given-names>M.</given-names></name> <name><surname>Arsonovic</surname> <given-names>M.</given-names></name> <name><surname>Laraba</surname> <given-names>S.</given-names></name> <name><surname>Sladojevic</surname> <given-names>S.</given-names></name> <name><surname>Boukhalfa</surname> <given-names>K.</given-names></name> <name><surname>Moussaoui</surname> <given-names>A.</given-names></name></person-group> (<year>2018</year>). <article-title>Deep learning for plant diseases: detection and saliency map visualisation.</article-title> <source><italic>Hum. Mach. Learn.</italic></source> <fpage>93</fpage>&#x2013;<lpage>117</lpage>.</citation></ref>
<ref id="B12"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Brahimi</surname> <given-names>M.</given-names></name> <name><surname>Boukhalfa</surname> <given-names>K.</given-names></name> <name><surname>Moussaoui</surname> <given-names>A.</given-names></name></person-group> (<year>2017</year>). <article-title>Deep learning for tomato diseases: classification and symptoms visualization.</article-title> <source><italic>Appl. Artificial Intell.</italic></source> <volume>31</volume> <fpage>299</fpage>&#x2013;<lpage>315</lpage>. <pub-id pub-id-type="doi">10.1080/08839514.2017.1315516</pub-id></citation></ref>
<ref id="B13"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chouhan</surname> <given-names>S. S.</given-names></name> <name><surname>Singh</surname> <given-names>U. P.</given-names></name> <name><surname>Jain</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>Applications of computer vision in plant pathology: a survey.</article-title> <source><italic>Arch. Comput. Methods Eng.</italic></source> <volume>27</volume> <fpage>611</fpage>&#x2013;<lpage>632</lpage>. <pub-id pub-id-type="doi">10.1007/s11831-019-09324-0</pub-id></citation></ref>
<ref id="B14"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bock</surname> <given-names>C. H.</given-names></name> <name><surname>Barbedo</surname> <given-names>J. G. A.</given-names></name> <name><surname>Del Ponte</surname> <given-names>E. M.</given-names></name> <name><surname>Bohnenkamp</surname> <given-names>D.</given-names></name> <name><surname>Mahlein</surname> <given-names>A.-K.</given-names></name></person-group> (<year>2020</year>). <article-title>From visual estimates to fully automated sensor-based measurements of plant disease severity: status and challenges for improving accuracy</article-title>. <source><italic>Phytopathology Res.</italic></source> <volume>2</volume>, <fpage>1</fpage>&#x2013;<lpage>30</lpage>. <pub-id pub-id-type="doi">10.1186/s42483-020-00049-8</pub-id></citation></ref>
<ref id="B15"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Connor Shorten</surname> <given-names>T. M. K.</given-names></name></person-group> (<year>2019</year>). <article-title>A survey on image data augmentation for deep learning.</article-title> <source><italic>J. Big Data</italic></source> <volume>6</volume> <fpage>1</fpage>&#x2013;<lpage>48</lpage>.</citation></ref>
<ref id="B16"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Deng</surname> <given-names>L.</given-names></name></person-group> (<year>2012</year>). <article-title>The MNIST database of handwritten digit images for machine learning research.</article-title> <source><italic>IEEE Signal Process. Magazine</italic></source> <volume>29</volume> <fpage>141</fpage>&#x2013;<lpage>142</lpage>. <pub-id pub-id-type="doi">10.1109/msp.2012.2211477</pub-id></citation></ref>
<ref id="B17"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dhanvantari</surname> <given-names>B. N.</given-names></name></person-group> (<year>1967</year>). <article-title>The leaf scorch disease of strawberry (Diplocarpon earliana) and the nature of resistance to it.</article-title> <source><italic>Can. J. Bot.</italic></source> <volume>45</volume> <fpage>1525</fpage>&#x2013;<lpage>1543</lpage>. <pub-id pub-id-type="doi">10.1139/b67-157</pub-id></citation></ref>
<ref id="B18"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Di Silvestre</surname> <given-names>D.</given-names></name> <name><surname>Bergamaschi</surname> <given-names>A.</given-names></name> <name><surname>Bellini</surname> <given-names>E.</given-names></name> <name><surname>Mauri</surname> <given-names>P.</given-names></name></person-group> (<year>2018</year>). <article-title>Large scale proteomic data and network-based systems biology approaches to explore the plant world.</article-title> <source><italic>Proteomes</italic></source> <volume>6</volume>:<issue>27</issue>. <pub-id pub-id-type="doi">10.3390/proteomes6020027</pub-id> <pub-id pub-id-type="pmid">29865292</pub-id></citation></ref>
<ref id="B19"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dinh</surname> <given-names>D. T.</given-names></name> <name><surname>Fujinami</surname> <given-names>T.</given-names></name> <name><surname>Huynh</surname> <given-names>V.-N.</given-names></name></person-group> (<year>2019</year>). &#x201C;<article-title>Estimating the optimal number of clusters in categorical data clustering by silhouette coefficient</article-title>,&#x201D; in <source><italic>International Symposium on Knowledge and Systems</italic></source>, <role>eds</role> <person-group person-group-type="editor"><name><surname>Chen</surname> <given-names>J.</given-names></name> <name><surname>Huynh</surname> <given-names>V.</given-names></name> <name><surname>Nguyen</surname> <given-names>G. N.</given-names></name> <name><surname>Tang</surname> <given-names>X.</given-names></name></person-group> (<publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.1007/978-981-15-1209-4_1</pub-id></citation></ref>
<ref id="B20"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fahrentrapp</surname> <given-names>J.</given-names></name> <name><surname>Ria</surname> <given-names>F.</given-names></name> <name><surname>Geilhausen</surname> <given-names>M.</given-names></name> <name><surname>Panassiti</surname> <given-names>B.</given-names></name></person-group> (<year>2019</year>). <article-title>Detection of gray mold leaf infections prior to visual symptom appearance using a five-band multispectral sensor.</article-title> <source><italic>Front. Plant Sci.</italic></source> <volume>10</volume>:<issue>628</issue>. <pub-id pub-id-type="doi">10.3389/fpls.2019.00628</pub-id> <pub-id pub-id-type="pmid">31156683</pub-id></citation></ref>
<ref id="B21"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Falk</surname> <given-names>K.</given-names></name> <name><surname>Jubery</surname> <given-names>Z.</given-names></name> <name><surname>Mirnezami</surname> <given-names>S. V.</given-names></name> <name><surname>Parmley</surname> <given-names>K. A.</given-names></name> <name><surname>Sarkar</surname> <given-names>S.</given-names></name> <name><surname>Singh</surname> <given-names>A.</given-names></name><etal/></person-group> (<year>2020</year>). <article-title>Computer vision and machine learning enabled soybean root phenotyping pipeline.</article-title> <source><italic>Plant Methods</italic></source> <volume>16</volume> <fpage>1</fpage>&#x2013;<lpage>19</lpage>. <pub-id pub-id-type="doi">10.1186/s13007-019-0550-5</pub-id> <pub-id pub-id-type="pmid">31993072</pub-id></citation></ref>
<ref id="B22"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ferentinos</surname> <given-names>K. P.</given-names></name></person-group> (<year>2018</year>). <article-title>Deep learning models for plant disease detection and diagnosis.</article-title> <source><italic>Comput. Electron. Agric.</italic></source> <volume>145</volume> <fpage>311</fpage>&#x2013;<lpage>318</lpage>. <pub-id pub-id-type="doi">10.1016/j.compag.2018.01.009</pub-id></citation></ref>
<ref id="B23"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gadelmawla</surname> <given-names>E. S.</given-names></name></person-group> (<year>2004</year>). <article-title>A vision system for surface roughness characterization using the gray level co-occurrence matrix.</article-title> <source><italic>NDT E Int.</italic></source> <volume>37</volume> <fpage>577</fpage>&#x2013;<lpage>588</lpage>. <pub-id pub-id-type="doi">10.1016/j.ndteint.2004.03.004</pub-id></citation></ref>
<ref id="B24"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gaikwad</surname> <given-names>V. P.</given-names></name> <name><surname>Musande</surname> <given-names>V.</given-names></name></person-group> (<year>2017</year>). &#x201C;<article-title>Wheat disease detection using image processing</article-title>,&#x201D; in <source><italic>Proceeding of the 1st International Conference on Intelligent Systems and Information Management (ICISIM)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>3</lpage>.</citation></ref>
<ref id="B25"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ghosh</surname> <given-names>S.</given-names></name> <name><surname>Mondal</surname> <given-names>M. J.</given-names></name> <name><surname>Sen</surname> <given-names>S.</given-names></name> <name><surname>Chatterjee</surname> <given-names>S.</given-names></name> <name><surname>Roy</surname> <given-names>N.</given-names></name> <name><surname>Patnaik</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). &#x201C;<article-title>A novel approach to detect and classify fruits using ShuffleNet V2</article-title>,&#x201D; in <source><italic>Proceeding of the IEEE Applied Signal Processing Conference (ASPCON)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>5</lpage>.</citation></ref>
<ref id="B26"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gu</surname> <given-names>J.</given-names></name> <name><surname>Wang</surname> <given-names>Z.</given-names></name> <name><surname>Kuen</surname> <given-names>J.</given-names></name> <name><surname>Ma</surname> <given-names>L.</given-names></name> <name><surname>Shahroudy</surname> <given-names>A.</given-names></name> <name><surname>Shuai</surname> <given-names>B.</given-names></name><etal/></person-group> (<year>2018</year>). <article-title>Recent advances in convolutional neural networks.</article-title> <source><italic>Pattern Recogn.</italic></source> <volume>77</volume> <fpage>354</fpage>&#x2013;<lpage>377</lpage>.</citation></ref>
<ref id="B27"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Guan</surname> <given-names>C.</given-names></name> <name><surname>Yuen</surname> <given-names>K. K. F.</given-names></name> <name><surname>Chen</surname> <given-names>Q.</given-names></name></person-group> (<year>2017</year>). &#x201C;<article-title>Towards a hybrid approach of k-means and density-based spatial clustering of applications with noise for image segmentation</article-title>,&#x201D; in <source><italic>Proceeding of the IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>396</fpage>&#x2013;<lpage>399</lpage>.</citation></ref>
<ref id="B28"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gupta</surname> <given-names>V.</given-names></name> <name><surname>Sengar</surname> <given-names>N.</given-names></name> <name><surname>Dutta</surname> <given-names>M. K.</given-names></name> <name><surname>Travieso</surname> <given-names>C. M.</given-names></name> <name><surname>Alonso</surname> <given-names>J. B.</given-names></name></person-group> (<year>2017</year>). &#x201C;<article-title>Automated segmentation of powdery mildew disease from cherry leaves using image processing</article-title>,&#x201D; in <source><italic>International Conference and Workshop on Bioinspired Intelligence (IWOBI)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>4</lpage>. <pub-id pub-id-type="doi">10.34133/2020/5839856</pub-id> <pub-id pub-id-type="pmid">33313559</pub-id></citation></ref>
<ref id="B29"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Halevy</surname> <given-names>A.</given-names></name> <name><surname>Norvig</surname> <given-names>P.</given-names></name> <name><surname>Pereira</surname> <given-names>F.</given-names></name></person-group> (<year>2009</year>). <article-title>The unreasonable effectiveness of data.</article-title> <source><italic>IEEE Intell. Syst.</italic></source> <volume>24</volume> <fpage>8</fpage>&#x2013;<lpage>12</lpage>.</citation></ref>
<ref id="B30"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>He</surname> <given-names>K.</given-names></name> <name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Ren</surname> <given-names>S.</given-names></name> <name><surname>Sun</surname> <given-names>J.</given-names></name></person-group> (<year>2015</year>). <article-title>Spatial pyramid pooling in deep convolutional networks for visual recognition.</article-title> <source><italic>IEEE Trans. Pattern Anal. Mach. Intell.</italic></source> <volume>37</volume> <fpage>1904</fpage>&#x2013;<lpage>1916</lpage>. <pub-id pub-id-type="doi">10.1109/tpami.2015.2389824</pub-id> <pub-id pub-id-type="pmid">26353135</pub-id></citation></ref>
<ref id="B31"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hossain</surname> <given-names>E.</given-names></name> <name><surname>Hossain</surname> <given-names>F.</given-names></name> <name><surname>Rahaman</surname> <given-names>M. A.</given-names></name></person-group> (<year>2019</year>). &#x201C;<article-title>A color and texture based approach for the detection and classification of plant leaf disease using KNN classifier</article-title>,&#x201D; in <source><italic>International Conference on Electrical, Computer and Communication Engineering (ECCE)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</citation></ref>
<ref id="B32"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hu</surname> <given-names>H.</given-names></name> <name><surname>Guan</surname> <given-names>Q.</given-names></name> <name><surname>Chen</surname> <given-names>S.</given-names></name> <name><surname>Ji</surname> <given-names>Z.</given-names></name> <name><surname>Lin</surname> <given-names>Y.</given-names></name></person-group> (<year>2020</year>). <article-title>Detection and recognition for life state of cell cancer using two-stage cascade CNNs.</article-title> <source><italic>IEEE/ACM Trans. Comput. Biol. Bioinform.</italic></source> <volume>17</volume> <fpage>887</fpage>&#x2013;<lpage>898</lpage>. <pub-id pub-id-type="doi">10.1109/TCBB.2017.2780842</pub-id> <pub-id pub-id-type="pmid">29990223</pub-id></citation></ref>
<ref id="B33"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ismail</surname> <given-names>W.</given-names></name> <name><surname>Attique Khan</surname> <given-names>M.</given-names></name> <name><surname>Shah</surname> <given-names>S. A.</given-names></name> <name><surname>Younus</surname> <given-names>M.</given-names></name></person-group> (<year>2020</year>). &#x201C;<article-title>An adaptive image processing model of plant disease diagnosis and quantification based on color and texture histogram</article-title>,&#x201D; in <source><italic>Proceeding of the 2nd International Conference on Computer and Information Sciences (ICCIS)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</citation></ref>
<ref id="B34"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jos&#x00E9;</surname> <given-names>G. M.</given-names></name> <name><surname>Esgario</surname> <given-names>R. A. K.</given-names></name> <name><surname>Ventura</surname> <given-names>J. A.</given-names></name></person-group> (<year>2020</year>). <article-title>Deep learning for classification and severity estimation of coffee leaf biotic stress.</article-title> <source><italic>Comput. Electron. Agric.</italic></source> <volume>169</volume>:<issue>105162</issue>. <pub-id pub-id-type="doi">10.1016/j.compag.2019.105162</pub-id></citation></ref>
<ref id="B35"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kayhan</surname> <given-names>O. S.</given-names></name> <name><surname>van Gemert</surname> <given-names>J. C.</given-names></name></person-group> (<year>2020</year>). &#x201C;<article-title>On translation invariance in cnns: convolutional layers can exploit absolute spatial location</article-title>,&#x201D; in <source><italic>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>14274</fpage>&#x2013;<lpage>14285</lpage>.</citation></ref>
<ref id="B36"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Krizhevsky</surname> <given-names>A.</given-names></name> <name><surname>Sutskever</surname> <given-names>I.</given-names></name> <name><surname>Hinton</surname> <given-names>G. E.</given-names></name></person-group> (<year>2012</year>). &#x201C;<article-title>ImageNet classification with deep convolutional neural networks. <italic>NIPS&#x2019;12</italic></article-title>,&#x201D; in <source><italic>Proceedings of the 25th International Conference on Neural Information Processing Systems</italic></source>, <volume>Vol. 1</volume> (<publisher-name>IEEE</publisher-name>), <fpage>1097</fpage>&#x2013;<lpage>1105</lpage>.</citation></ref>
<ref id="B37"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lee</surname> <given-names>S. H.</given-names></name> <name><surname>Goeau</surname> <given-names>H.</given-names></name> <name><surname>Bonnet</surname> <given-names>P.</given-names></name> <name><surname>Joly</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). <article-title>New perspectives on plant disease characterization based on deep learning.</article-title> <source><italic>Comput. Electron. Agric.</italic></source> <volume>170</volume>:<issue>105220</issue>. <pub-id pub-id-type="doi">10.1016/j.compag.2020.105220</pub-id></citation></ref>
<ref id="B38"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lee</surname> <given-names>U.</given-names></name> <name><surname>Chang</surname> <given-names>S.</given-names></name> <name><surname>Putra</surname> <given-names>G. A.</given-names></name> <name><surname>Kim</surname> <given-names>H.</given-names></name> <name><surname>Kim</surname> <given-names>D. H.</given-names></name></person-group> (<year>2018</year>). <article-title>An automated, high-throughput plant phenotyping system using machine learning-based plant segmentation and image analysis.</article-title> <source><italic>PLoS One</italic></source> <volume>13</volume>:<issue>e0196615</issue>. <pub-id pub-id-type="doi">10.1371/journal.pone.0196615</pub-id> <pub-id pub-id-type="pmid">29702690</pub-id></citation></ref>
<ref id="B39"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>D.</given-names></name> <name><surname>Quan</surname> <given-names>C.</given-names></name> <name><surname>Song</surname> <given-names>Z.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Yu</surname> <given-names>G.</given-names></name> <name><surname>Li</surname> <given-names>C.</given-names></name><etal/></person-group> (<year>2020</year>). <article-title>High-throughput plant phenotyping platform (HT3P) as a novel tool for estimating agronomic traits from the lab to the field.</article-title> <source><italic>Front. Bioeng. Biotechnol.</italic></source> <volume>8</volume>:<issue>623705</issue>. <pub-id pub-id-type="doi">10.3389/fbioe.2020.623705</pub-id> <pub-id pub-id-type="pmid">33520974</pub-id></citation></ref>
<ref id="B40"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liang</surname> <given-names>Q.</given-names></name> <name><surname>Xiang</surname> <given-names>S.</given-names></name> <name><surname>Hu</surname> <given-names>Y.</given-names></name> <name><surname>Coppola</surname> <given-names>G.</given-names></name> <name><surname>Zhang</surname> <given-names>D.</given-names></name> <name><surname>Sun</surname> <given-names>W. J. C.</given-names></name><etal/></person-group> (<year>2019</year>). <article-title>PD2SE-Net: computer-assisted plant disease diagnosis and severity estimation network.</article-title> <source><italic>Comput. Electron. Agric.</italic></source> <volume>157</volume> <fpage>518</fpage>&#x2013;<lpage>529</lpage>.</citation></ref>
<ref id="B41"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>K.</given-names></name> <name><surname>Gong</surname> <given-names>L.</given-names></name> <name><surname>Huang</surname> <given-names>Y.</given-names></name> <name><surname>Liu</surname> <given-names>C.</given-names></name> <name><surname>Pan</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>Deep learning-based segmentation and quantification of cucumber powdery mildew using convolutional neural network.</article-title> <source><italic>Front. Plant Sci.</italic></source> <volume>10</volume>:<issue>155</issue>. <pub-id pub-id-type="doi">10.3389/fpls.2019.00155</pub-id> <pub-id pub-id-type="pmid">30891048</pub-id></citation></ref>
<ref id="B42"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>J.</given-names></name> <name><surname>Wang</surname> <given-names>X.</given-names></name></person-group> (<year>2021</year>). <article-title>Plant diseases and pests detection based on deep learning: a review.</article-title> <source><italic>Plant Methods</italic></source> <volume>17</volume>:<issue>22</issue>. <pub-id pub-id-type="doi">10.1186/s13007-021-00722-9</pub-id> <pub-id pub-id-type="pmid">33627131</pub-id></citation></ref>
<ref id="B43"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>&#x0141;ukasik</surname> <given-names>S.</given-names></name> <name><surname>Kowalski</surname> <given-names>P. A.</given-names></name> <name><surname>Charytanowicz</surname> <given-names>M.</given-names></name> <name><surname>Kulczycki</surname> <given-names>P.</given-names></name></person-group> (<year>2016</year>). &#x201C;<article-title>Clustering using flower pollination algorithm and Calinski-Harabasz index</article-title>,&#x201D; in <source><italic>Proceeding of the IEEE Congress on Evolutionary Computation (CEC)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>5</lpage>.</citation></ref>
<ref id="B44"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Marzougui</surname> <given-names>A.</given-names></name> <name><surname>Ma</surname> <given-names>Y.</given-names></name> <name><surname>McGee</surname> <given-names>R. J.</given-names></name> <name><surname>Khot</surname> <given-names>L. R.</given-names></name> <name><surname>Sankaran</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>Generalized linear model with elastic net regularization and convolutional neural network for evaluating aphanomyces root rot severity in lentil.</article-title> <source><italic>Plant Phenomics</italic></source> <volume>2020</volume>:<issue>2393062</issue>. <pub-id pub-id-type="doi">10.34133/2020/2393062</pub-id> <pub-id pub-id-type="pmid">33575665</pub-id></citation></ref>
<ref id="B45"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Marzougui</surname> <given-names>A.</given-names></name> <name><surname>Ma</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>C.</given-names></name> <name><surname>McGee</surname> <given-names>R. J.</given-names></name> <name><surname>Coyne</surname> <given-names>C. J.</given-names></name> <name><surname>Main</surname> <given-names>D.</given-names></name><etal/></person-group> (<year>2019</year>). <article-title>Advanced imaging for quantitative evaluation of aphanomyces root rot resistance in lentil.</article-title> <source><italic>Front. Plant Sci.</italic></source> <volume>10</volume>:<issue>383</issue>. <pub-id pub-id-type="doi">10.3389/fpls.2019.00383</pub-id> <pub-id pub-id-type="pmid">31057562</pub-id></citation></ref>
<ref id="B46"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>McGee</surname> <given-names>R. J.</given-names></name> <name><surname>Coyne</surname> <given-names>J. C.</given-names></name> <name><surname>Pilet-Nayel</surname> <given-names>M. L.</given-names></name> <name><surname>Moussart</surname> <given-names>A.</given-names></name> <name><surname>Tivoli</surname> <given-names>B.</given-names></name> <name><surname>Baranger</surname> <given-names>A.</given-names></name><etal/></person-group> (<year>2012</year>). <article-title>Registration of pea germplasm lines partially resistant to aphanomyces root rot for breeding fresh or freezer pea and dry pea types.</article-title> <source><italic>J. Plant Registrations</italic></source> <volume>6</volume> <fpage>203</fpage>&#x2013;<lpage>207</lpage>. <pub-id pub-id-type="doi">10.3198/jpr2011.03.0139crg</pub-id></citation></ref>
<ref id="B47"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mohanty</surname> <given-names>S. P.</given-names></name> <name><surname>Hughes</surname> <given-names>D. P.</given-names></name> <name><surname>Salathe</surname> <given-names>M.</given-names></name></person-group> (<year>2016</year>). <article-title>Using deep learning for image-based plant disease detection.</article-title> <source><italic>Front. Plant Sci.</italic></source> <volume>7</volume>:<issue>1419</issue>. <pub-id pub-id-type="doi">10.3389/fpls.2016.01419</pub-id> <pub-id pub-id-type="pmid">27713752</pub-id></citation></ref>
<ref id="B48"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nikhitha</surname> <given-names>M.</given-names></name> <name><surname>Roopa Sri</surname> <given-names>S.</given-names></name> <name><surname>Uma Maheswari</surname> <given-names>B.</given-names></name></person-group> (<year>2019</year>). &#x201C;<article-title>Fruit recognition and grade of disease detection using inception V3 model</article-title>,&#x201D; in <source><italic>Proceeding of the 3rd International Conference on Electronics, Communication and Aerospace Technology (ICECA)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1040</fpage>&#x2013;<lpage>1043</lpage>.</citation></ref>
<ref id="B49"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ozguven</surname> <given-names>M. M.</given-names></name> <name><surname>Adem</surname> <given-names>K.</given-names></name></person-group> (<year>2019</year>). <article-title>Automatic detection and classification of leaf spot disease in sugar beet using deep learning algorithms.</article-title> <source><italic>Phys. A: Stat. Mechan. Appl.</italic></source> <volume>535</volume>:<issue>122537</issue>. <pub-id pub-id-type="doi">10.1016/j.physa.2019.122537</pub-id></citation></ref>
<ref id="B50"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pan</surname> <given-names>S. J.</given-names></name> <name><surname>Yang</surname> <given-names>Q.</given-names></name></person-group> (<year>2010</year>). <article-title>A survey on transfer learning.</article-title> <source><italic>IEEE Trans. Knowledge Data Eng.</italic></source> <volume>22</volume> <fpage>1345</fpage>&#x2013;<lpage>1359</lpage>.</citation></ref>
<ref id="B51"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pasala</surname> <given-names>R.</given-names></name> <name><surname>Pandey</surname> <given-names>B. B.</given-names></name></person-group> (<year>2020</year>). <article-title>Plant phenomics: high-throughput technology for accelerating genomics.</article-title> <source><italic>J. Biosci.</italic></source> <volume>45</volume>:<issue>111</issue>.</citation></ref>
<ref id="B52"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pastor-L&#x00F3;pez</surname> <given-names>I.</given-names></name> <name><surname>Sanz</surname> <given-names>B.</given-names></name> <name><surname>Tellaeche</surname> <given-names>A.</given-names></name> <name><surname>Psaila</surname> <given-names>G.</given-names></name> <name><surname>Gaviriade la Puerta</surname> <given-names>J.</given-names></name> <name><surname>Bringas</surname> <given-names>P. G.</given-names></name></person-group> (<year>2021</year>). <article-title>Quality assessment methodology based on machine learning with small datasets: industrial castings defects.</article-title> <source><italic>Neurocomputing</italic></source> <volume>456</volume> <fpage>622</fpage>&#x2013;<lpage>628</lpage>. <pub-id pub-id-type="doi">10.1016/j.neucom.2020.08.094</pub-id></citation></ref>
<ref id="B53"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Phadikar</surname> <given-names>S.</given-names></name> <name><surname>Goswami</surname> <given-names>J.</given-names></name></person-group> (<year>2016</year>). &#x201C;<article-title>Vegetation indices based segmentation for automatic classification of brown spot and blast diseases of rice</article-title>,&#x201D; in <source><italic>Proceeding of the 3rd International Conference on Recent Advances in Information Technology (RAIT)</italic></source> (<publisher-name>IEEE</publisher-name>).</citation></ref>
<ref id="B54"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Poonam</surname> <given-names>S. J.</given-names></name> <name><surname>Jadhav</surname> <given-names>D. S.</given-names></name></person-group> (<year>2015</year>). <article-title>Video summarization using higher order color moments (VSUHCM).</article-title> <source><italic>Proc. Comput. Sci.</italic></source> <volume>45</volume> <fpage>275</fpage>&#x2013;<lpage>281</lpage>. <pub-id pub-id-type="doi">10.1016/j.procs.2015.03.140</pub-id></citation></ref>
<ref id="B55"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prasad</surname> <given-names>A.</given-names></name> <name><surname>Sharma</surname> <given-names>N.</given-names></name> <name><surname>Hari-Gowthem</surname> <given-names>G.</given-names></name> <name><surname>Muthamilarasan</surname> <given-names>M.</given-names></name> <name><surname>Prasad</surname> <given-names>M.</given-names></name></person-group> (<year>2020</year>). <article-title>Tomato yellow leaf curl virus: impact, challenges, and management.</article-title> <source><italic>Trends Plant Sci.</italic></source> <volume>25</volume> <fpage>897</fpage>&#x2013;<lpage>911</lpage>. <pub-id pub-id-type="doi">10.1016/j.tplants.2020.03.015</pub-id> <pub-id pub-id-type="pmid">32371058</pub-id></citation></ref>
<ref id="B56"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qassim</surname> <given-names>H.</given-names></name> <name><surname>Verma</surname> <given-names>A.</given-names></name> <name><surname>Feinzimer</surname> <given-names>D.</given-names></name></person-group> (<year>2018</year>). &#x201C;<article-title>Compressed residual-VGG16 CNN model for big data places image recognition</article-title>,&#x201D; in <source><italic>Proceeding of the IEEE 8th Annual Computing and Communication Workshop and Conference (CCWC)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>7</lpage>.</citation></ref>
<ref id="B57"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rahaman</surname> <given-names>M. M.</given-names></name> <name><surname>Ahsan</surname> <given-names>M. A.</given-names></name> <name><surname>Chen</surname> <given-names>M.</given-names></name></person-group> (<year>2019</year>). <article-title>Data-mining techniques for image-based plant phenotypic traits identification and classification.</article-title> <source><italic>Sci. Rep.</italic></source> <volume>9</volume>:<issue>19526</issue>. <pub-id pub-id-type="doi">10.1038/s41598-019-55609-6</pub-id> <pub-id pub-id-type="pmid">31862925</pub-id></citation></ref>
<ref id="B58"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rahman</surname> <given-names>C. R.</given-names></name> <name><surname>Arko</surname> <given-names>S.</given-names></name> <name><surname>Ali</surname> <given-names>M. E.</given-names></name> <name><surname>Khan</surname> <given-names>M. A. I.</given-names></name> <name><surname>Apon</surname> <given-names>S. H.</given-names></name> <name><surname>Nowrin</surname> <given-names>F.</given-names></name><etal/></person-group> (<year>2020</year>). <article-title>Identification and recognition of rice diseases and pests using convolutional neural networks.</article-title> <source><italic>Biosyst. Eng.</italic></source> <volume>194</volume> <fpage>112</fpage>&#x2013;<lpage>120</lpage>.</citation></ref>
<ref id="B59"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rivas</surname> <given-names>S.</given-names></name> <name><surname>Thomas</surname> <given-names>C. M.</given-names></name></person-group> (<year>2005</year>). <article-title>Molecular interactions between tomato and the leaf mold pathogen Cladosporium fulvum.</article-title> <source><italic>Annu. Rev. Phytopathol.</italic></source> <volume>43</volume> <fpage>395</fpage>&#x2013;<lpage>436</lpage>. <pub-id pub-id-type="doi">10.1146/annurev.phyto.43.040204.140224</pub-id> <pub-id pub-id-type="pmid">16078890</pub-id></citation></ref>
<ref id="B60"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rousseeuw</surname> <given-names>P.</given-names></name></person-group> (<year>1987</year>). <article-title>Silhouettes: a graphical aid to the interpretation and validation of cluster analysis</article-title>. <source><italic>J. Comput. Appl. Math.</italic></source> <volume>20</volume>, <fpage>53</fpage>&#x2013;<lpage>65</lpage>.</citation></ref>
<ref id="B61"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Saleem</surname> <given-names>M. H.</given-names></name> <name><surname>Potgieter</surname> <given-names>J.</given-names></name> <name><surname>Arif</surname> <given-names>K. M.</given-names></name></person-group> (<year>2020</year>). <article-title>Plant disease classification: a comparative evaluation of convolutional neural networks and deep learning optimizers.</article-title> <source><italic>Plants (Basel)</italic></source> <volume>9</volume>:<issue>1319</issue>. <pub-id pub-id-type="doi">10.3390/plants9101319</pub-id> <pub-id pub-id-type="pmid">33036220</pub-id></citation></ref>
<ref id="B62"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shen</surname> <given-names>N.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Zheng</surname> <given-names>S.</given-names></name> <name><surname>Zhang</surname> <given-names>L.</given-names></name> <name><surname>Fu</surname> <given-names>Y.</given-names></name> <name><surname>Liu</surname> <given-names>X.</given-names></name><etal/></person-group> (<year>2019</year>). <article-title>Automated and accurate quantification of subcutaneous and visceral adipose tissue from magnetic resonance imaging based on machine learning.</article-title> <source><italic>Magn. Reson. Imaging</italic></source> <volume>64</volume> <fpage>28</fpage>&#x2013;<lpage>36</lpage>. <pub-id pub-id-type="doi">10.1016/j.mri.2019.04.007</pub-id> <pub-id pub-id-type="pmid">31004712</pub-id></citation></ref>
<ref id="B63"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stricker</surname> <given-names>S.</given-names></name></person-group> (<year>1994</year>). &#x201C;<article-title>The capacity of color histogram indexing</article-title>,&#x201D; in <source><italic>Proceedings of IEEE Conference on Computer Vision and Pattern Recognition</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>5</lpage>.</citation></ref>
<ref id="B64"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Suarez-Paniagua</surname> <given-names>V.</given-names></name> <name><surname>Segura-Bedmar</surname> <given-names>I.</given-names></name></person-group> (<year>2018</year>). <article-title>Evaluation of pooling operations in convolutional architectures for drug-drug interaction extraction.</article-title> <source><italic>BMC Bioinform.</italic></source> <volume>19(Suppl. 8)</volume>:<issue>209</issue>. <pub-id pub-id-type="doi">10.1186/s12859-018-2195-1</pub-id> <pub-id pub-id-type="pmid">29897318</pub-id></citation></ref>
<ref id="B65"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Suzuki</surname> <given-names>N.</given-names></name> <name><surname>Rivero</surname> <given-names>R. M.</given-names></name> <name><surname>Shulaev</surname> <given-names>V.</given-names></name> <name><surname>Blumwald</surname> <given-names>E.</given-names></name> <name><surname>Mittler</surname> <given-names>R.</given-names></name></person-group> (<year>2014</year>). <article-title>Abiotic and biotic stress combinations.</article-title> <source><italic>New Phytol.</italic></source> <volume>203</volume> <fpage>32</fpage>&#x2013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.1111/nph.12797</pub-id> <pub-id pub-id-type="pmid">24720847</pub-id></citation></ref>
<ref id="B66"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Syed-Ab-Rahman</surname> <given-names>S. F.</given-names></name> <name><surname>Hesamian</surname> <given-names>M. H.</given-names></name> <name><surname>Prasad</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>Citrus disease detection and classification using end-to-end anchor-based deep learning model.</article-title> <source><italic>Appl. Intell.</italic></source> <fpage>1</fpage>&#x2013;<lpage>12</lpage>.</citation></ref>
<ref id="B67"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Talwalkar</surname> <given-names>A.</given-names></name> <name><surname>Kumar</surname> <given-names>S.</given-names></name> <name><surname>Rowley</surname> <given-names>H.</given-names></name></person-group> (<year>2008</year>). &#x201C;<article-title>Large-scale manifold learning</article-title>,&#x201D; in <source><italic>Proceeding of the IEEE Conference on Computer Vision and Pattern Recognition</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>8</lpage>.</citation></ref>
<ref id="B68"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tan</surname> <given-names>W.</given-names></name> <name><surname>Zhao</surname> <given-names>C.</given-names></name> <name><surname>Wu</surname> <given-names>H.</given-names></name></person-group> (<year>2016</year>). <article-title>Intelligent alerting for fruit-melon lesion image based on momentum deep learning.</article-title> <source><italic>Multimedia Tools Appl.</italic></source> <volume>75</volume> <fpage>16741</fpage>&#x2013;<lpage>16761</lpage>.</citation></ref>
<ref id="B69"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tardieu</surname> <given-names>F.</given-names></name> <name><surname>Cabrera-Bosquet</surname> <given-names>L.</given-names></name> <name><surname>Pridmore</surname> <given-names>T.</given-names></name> <name><surname>Bennett</surname> <given-names>M.</given-names></name></person-group> (<year>2017</year>). <article-title>Plant phenomics, from sensors to knowledge.</article-title> <source><italic>Curr. Biol.</italic></source> <volume>27</volume> <fpage>R770</fpage>&#x2013;<lpage>R783</lpage>. <pub-id pub-id-type="doi">10.1016/j.cub.2017.05.055</pub-id> <pub-id pub-id-type="pmid">28787611</pub-id></citation></ref>
<ref id="B70"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tete</surname> <given-names>T. N.</given-names></name> <name><surname>Kamlu</surname> <given-names>S.</given-names></name></person-group> (<year>2017</year>). &#x201C;<article-title>Plant disease detection using different algorithms</article-title>,&#x201D; in <source><italic>Proceedings of the Second International Conference on Research in Intelligent and Computing in Engineering</italic></source> (<publisher-name>RICE</publisher-name>), <fpage>103</fpage>&#x2013;<lpage>106</lpage>.</citation></ref>
<ref id="B71"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Too</surname> <given-names>E.</given-names></name> <name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Njuki</surname> <given-names>S.</given-names></name> <name><surname>Yingchun</surname> <given-names>L.</given-names></name></person-group> (<year>2019</year>). <article-title>A comparative study of fine-tuning deep learning models for plant disease identification.</article-title> <source><italic>Comput. Electron. Agric.</italic></source> <volume>161</volume> <fpage>272</fpage>&#x2013;<lpage>279</lpage>.</citation></ref>
<ref id="B72"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tsaftaris</surname> <given-names>S. A.</given-names></name> <name><surname>Minervini</surname> <given-names>M.</given-names></name> <name><surname>Scharr</surname> <given-names>H.</given-names></name></person-group> (<year>2016</year>). <article-title>Machine learning for plant phenotyping needs image processing.</article-title> <source><italic>Trends Plant Sci.</italic></source> <volume>21</volume> <fpage>989</fpage>&#x2013;<lpage>991</lpage>. <pub-id pub-id-type="doi">10.1016/j.tplants.2016.10.002</pub-id> <pub-id pub-id-type="pmid">27810146</pub-id></citation></ref>
<ref id="B73"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tusubira</surname> <given-names>J. F.</given-names></name> <name><surname>Akera</surname> <given-names>B.</given-names></name> <name><surname>Nsumba</surname> <given-names>S.</given-names></name> <name><surname>Nakatumba-Nabende</surname> <given-names>J.</given-names></name> <name><surname>Mwebaze</surname> <given-names>E.</given-names></name></person-group> (<year>2020</year>). <article-title>Scoring root necrosis in cassava using semantic segmentation.</article-title> <source><italic>Comput. Vision Pattern Recogn.</italic></source> <fpage>1</fpage>&#x2013;<lpage>10</lpage>.</citation></ref>
<ref id="B74"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Van der Maaten</surname> <given-names>L.</given-names></name> <name><surname>Hinton</surname> <given-names>G.</given-names></name></person-group> (<year>2008</year>). <article-title>Visualizing data using t-SNE.</article-title> <source><italic>J. Mach. Learn. Res.</italic></source> <volume>9</volume> <fpage>2579</fpage>&#x2013;<lpage>2605</lpage>.</citation></ref>
<ref id="B75"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Varshney</surname> <given-names>R. K.</given-names></name> <name><surname>Bohra</surname> <given-names>A.</given-names></name> <name><surname>Yu</surname> <given-names>J.</given-names></name> <name><surname>Graner</surname> <given-names>A.</given-names></name> <name><surname>Zhang</surname> <given-names>Q.</given-names></name> <name><surname>Sorrells</surname> <given-names>M. E.</given-names></name></person-group> (<year>2021</year>). <article-title>Designing future crops: genomics-assisted breeding comes of age.</article-title> <source><italic>Trends Plant Sci</italic></source> <volume>26</volume> <fpage>631</fpage>&#x2013;<lpage>649</lpage>. <pub-id pub-id-type="doi">10.1016/j.tplants.2021.03.010</pub-id> <pub-id pub-id-type="pmid">33893045</pub-id></citation></ref>
<ref id="B76"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vergani</surname> <given-names>A. A.</given-names></name> <name><surname>Binaghi</surname> <given-names>E.</given-names></name></person-group> (<year>2018</year>). &#x201C;<article-title>A soft davies-bouldin separation measure</article-title>,&#x201D; in <source><italic>Proceeding of the 2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)</italic></source> (<publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>8</lpage>.</citation></ref>
<ref id="B77"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Verma</surname> <given-names>S.</given-names></name> <name><surname>Chug</surname> <given-names>A.</given-names></name> <name><surname>Singh</surname> <given-names>P.</given-names></name></person-group> (<year>2020</year>). &#x201C;<article-title>Impact of hyperparameter tuning on deep learning based estimation of disease severity in grape plan</article-title>,&#x201D; in <source><italic>Recent Advances on Soft Computing and Data Mining</italic></source> (Cham: Springer), <fpage>161</fpage>&#x2013;<lpage>171</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-36056-6_16</pub-id></citation></ref>
<ref id="B78"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vishnoi</surname> <given-names>V. K.</given-names></name> <name><surname>Kumar</surname> <given-names>K.</given-names></name> <name><surname>Kumar</surname> <given-names>B.</given-names></name></person-group> (<year>2021</year>). <article-title>Plant disease detection using computational intelligence and image processing.</article-title> <source><italic>J. Plant Dis. Protect.</italic></source> <volume>128</volume> <fpage>19</fpage>&#x2013;<lpage>53</lpage>. <pub-id pub-id-type="doi">10.1007/s41348-020-00368-0</pub-id></citation></ref>
<ref id="B79"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>G.</given-names></name> <name><surname>Sun</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name></person-group> (<year>2017</year>). <article-title>Automatic image-based plant disease severity estimation using deep learning.</article-title> <source><italic>Comput. Intell. Neurosci.</italic></source> <volume>2017</volume>:<issue>2917536</issue>. <pub-id pub-id-type="doi">10.1155/2017/2917536</pub-id> <pub-id pub-id-type="pmid">28757863</pub-id></citation></ref>
<ref id="B80"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Z.</given-names></name> <name><surname>Wang</surname> <given-names>K.</given-names></name> <name><surname>Yang</surname> <given-names>F.</given-names></name> <name><surname>Pan</surname> <given-names>S.</given-names></name> <name><surname>Han</surname> <given-names>Y.</given-names></name></person-group> (<year>2018</year>). <article-title>Image segmentation of overlapping leaves based on Chan&#x2013;Vese model and Sobel operator.</article-title> <source><italic>Inform. Processing Agric.</italic></source> <volume>5</volume> <fpage>1</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1016/j.inpa.2017.09.005</pub-id></citation></ref>
<ref id="B81"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wen</surname> <given-names>L.</given-names></name> <name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Gao</surname> <given-names>L.</given-names></name></person-group> (<year>2020</year>). <article-title>A transfer convolutional neural network for fault diagnosis based on ResNet-50.</article-title> <source><italic>Neural. Comput. Appl.</italic></source> <volume>32</volume> <fpage>6111</fpage>&#x2013;<lpage>6124</lpage>. <pub-id pub-id-type="doi">10.3934/mbe.2019165</pub-id> <pub-id pub-id-type="pmid">31499615</pub-id></citation></ref>
<ref id="B82"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wenxue Tan</surname> <given-names>C. Z. H. W.</given-names></name></person-group> (<year>2020</year>). <article-title>Intelligent alerting for fruit-melon lesion image based on momentum deep learning</article-title>. <source><italic>Multimed. Tools. Appl.</italic></source> <volume>75</volume>, <fpage>16741</fpage>&#x2013;<lpage>16761</lpage>. <pub-id pub-id-type="doi">10.1007/s11042-015-2940-7</pub-id></citation></ref>
<ref id="B83"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wilkinson</surname> <given-names>K.</given-names></name> <name><surname>Grant</surname> <given-names>W. P.</given-names></name> <name><surname>Green</surname> <given-names>L. E.</given-names></name> <name><surname>Hunter</surname> <given-names>S.</given-names></name> <name><surname>Jeger</surname> <given-names>M. J.</given-names></name> <name><surname>Lowe</surname> <given-names>P.</given-names></name><etal/></person-group> (<year>2011</year>). <article-title>Infectious diseases of animals and plants: an interdisciplinary approach.</article-title> <source><italic>Philos. Trans. R Soc. Lond. B Biol. Sci.</italic></source> <volume>366</volume> <fpage>1933</fpage>&#x2013;<lpage>1942</lpage>. <pub-id pub-id-type="doi">10.1098/rstb.2010.0415</pub-id> <pub-id pub-id-type="pmid">21624914</pub-id></citation></ref>
<ref id="B84"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yamashita</surname> <given-names>R.</given-names></name> <name><surname>Nishio</surname> <given-names>M.</given-names></name> <name><surname>Do</surname> <given-names>R. K. G.</given-names></name> <name><surname>Togashi</surname> <given-names>K.</given-names></name></person-group> (<year>2018</year>). <article-title>Convolutional neural networks: an overview and application in radiology.</article-title> <source><italic>Insights Imaging</italic></source> <volume>9</volume> <fpage>611</fpage>&#x2013;<lpage>629</lpage>. <pub-id pub-id-type="doi">10.1007/s13244-018-0639-9</pub-id> <pub-id pub-id-type="pmid">29934920</pub-id></citation></ref>
<ref id="B85"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yu</surname> <given-names>F.</given-names></name> <name><surname>Chou</surname> <given-names>A.</given-names></name> <name><surname>Ko</surname> <given-names>K.-I.</given-names></name></person-group> (<year>2006</year>). <article-title>On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain.</article-title> <source><italic>J. Complexity</italic></source> <volume>22</volume> <fpage>803</fpage>&#x2013;<lpage>817</lpage>.</citation></ref>
<ref id="B86"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>K.</given-names></name> <name><surname>Zhang</surname> <given-names>L.</given-names></name> <name><surname>Wu</surname> <given-names>Q.</given-names></name></person-group> (<year>2019</year>). <article-title>Identification of cherry leaf disease infected by Podosphaera pannosa via convolutional neural network.</article-title> <source><italic>Int. J. Agric. Environ. Inform. Syst.</italic></source> <volume>10</volume> <fpage>98</fpage>&#x2013;<lpage>110</lpage>. <pub-id pub-id-type="doi">10.4018/ijaeis.2019040105</pub-id></citation></ref>
<ref id="B87"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>S.</given-names></name> <name><surname>Wu</surname> <given-names>X.</given-names></name> <name><surname>You</surname> <given-names>Z.</given-names></name> <name><surname>Zhang</surname> <given-names>L.</given-names></name></person-group> (<year>2017</year>). <article-title>Leaf image based cucumber disease recognition using sparse representation classification.</article-title> <source><italic>Comput. Electron. Agric.</italic></source> <volume>134</volume> <fpage>135</fpage>&#x2013;<lpage>141</lpage>. <pub-id pub-id-type="doi">10.1016/j.compag.2017.01.014</pub-id></citation></ref>
<ref id="B88"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>X.</given-names></name> <name><surname>Qiao</surname> <given-names>Y.</given-names></name> <name><surname>Meng</surname> <given-names>F.</given-names></name> <name><surname>Fan</surname> <given-names>C.</given-names></name> <name><surname>Zhang</surname> <given-names>M. J.</given-names></name></person-group> (<year>2018</year>). <article-title>Identification of maize leaf diseases using improved deep convolutional neural networks.</article-title> <source><italic>IEEE Access</italic>.</source> <volume>6</volume> <fpage>30370</fpage>&#x2013;<lpage>30377</lpage>. <pub-id pub-id-type="doi">10.1109/access.2018.2844405</pub-id></citation></ref>
<ref id="B89"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>Z.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name> <name><surname>Zha</surname> <given-names>H.</given-names></name></person-group> (<year>2011</year>). <article-title>Adaptive manifold learning.</article-title> <source><italic>IEEE Trans. Pattern Anal. Mach. Intell.</italic></source> <volume>34</volume> <fpage>253</fpage>&#x2013;<lpage>265</lpage>.</citation></ref>
</ref-list>
</back>
</article>