<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="2.3" xml:lang="EN">
<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.2023.1221557</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>TrIncNet: a lightweight vision transformer network for identification of plant diseases</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Gole</surname>
<given-names>Pushkar</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/873884"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Bedi</surname>
<given-names>Punam</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2351475"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Marwaha</surname>
<given-names>Sudeep</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="author-notes" rid="fn001">
<sup>*</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1354864"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Haque</surname>
<given-names>Md. Ashraful</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1354869"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Deb</surname>
<given-names>Chandan Kumar</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1283635"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Department of Computer Science, University of Delhi</institution>, <addr-line>New Delhi</addr-line>, <country>India</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>Indian Council of Agricultural Research (ICAR)-Indian Agricultural Statistics Research Institute</institution>, <addr-line>New Delhi</addr-line>, <country>India</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>Edited by: Guoxiong Zhou, Central South University Forestry and Technology, China</p>
</fn>
<fn fn-type="edited-by">
<p>Reviewed by: Jinrong He, Yan&#x2019;an University, China; Yongqiang Zheng, Southwest University, China</p>
</fn>
<fn fn-type="corresp" id="fn001">
<p>*Correspondence: Sudeep Marwaha, <email xlink:href="mailto:sudeep@icar.gov.in">sudeep@icar.gov.in</email>
</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>27</day>
<month>07</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>14</volume>
<elocation-id>1221557</elocation-id>
<history>
<date date-type="received">
<day>12</day>
<month>05</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>27</day>
<month>06</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Gole, Bedi, Marwaha, Haque and Deb</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Gole, Bedi, Marwaha, Haque and Deb</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>In the agricultural sector, identifying plant diseases at their earliest possible stage of infestation still remains a huge challenge with respect to the maximization of crop production and farmers&#x2019; income. In recent years, advanced computer vision techniques like Vision Transformers (ViTs) are being successfully applied to identify plant diseases automatically. However, the MLP module in existing ViTs is computationally expensive as well as inefficient in extracting promising features from diseased images. Therefore, this study proposes a comparatively lightweight and improved vision transformer network, also known as &#x201c;TrIncNet&#x201d; for plant disease identification. In the proposed network, we introduced a modified encoder architecture a.k.a. Trans-Inception block in which the MLP block of existing ViT was replaced by a custom inception block. Additionally, each Trans-Inception block is surrounded by a skip connection, making it much more resistant to the vanishing gradient problem. The applicability of the proposed network for identifying plant diseases was assessed using two plant disease image datasets viz: PlantVillage dataset and Maize disease dataset (contains in-field images of Maize diseases). The comparative performance analysis on both datasets reported that the proposed TrIncNet network outperformed the state-of-the-art CNN architectures viz: VGG-19, GoogLeNet, ResNet-50, Xception, InceptionV3, and MobileNet. Moreover, the experimental results also showed that the proposed network had achieved 5.38% and 2.87% higher testing accuracy than the existing ViT network on both datasets, respectively. Therefore, the lightweight nature and improved prediction performance make the proposed network suitable for being integrated with IoT devices to assist the stakeholders in identifying plant diseases at the field level.</p>
</abstract>
<kwd-group>
<kwd>vision transformer (ViT)</kwd>
<kwd>inception block</kwd>
<kwd>deep learning</kwd>
<kwd>automatic plant disease detection</kwd>
<kwd>PlantVillage dataset</kwd>
<kwd>maize crop</kwd>
</kwd-group>
<counts>
<fig-count count="13"/>
<table-count count="7"/>
<equation-count count="8"/>
<ref-count count="45"/>
<page-count count="19"/>
<word-count count="8594"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-in-acceptance</meta-name>
<meta-value>Technical Advances in Plant Science</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1" sec-type="intro">
<label>1</label>
<title>Introduction</title>
<p>The agricultural industry is crucial for overall economic development in India as it contributes approximately twenty percent of the country&#x2019;s GDP, and roughly 55% of India&#x2019;s workforce is engaged in agricultural-related activities (<xref ref-type="bibr" rid="B10">Chand and Singh, 2022</xref>). As the country&#x2019;s population is increasing exponentially, the demand for food is also proliferating day by day. The agriculture sector faces many challenges in fulfilling such colossal food demand. Hence, agrarian researchers across the country are actively engaged in developing a sustainable food grain production system. Disease infestation in the crops is one of such challenges as it hampers overall food-grain production and impacts the overall food supply chain. In this context, identifying the plant diseases in their earliest possible stage would be a viable solution that would help in minimizing the crop loss and maximizes the farmer&#x2019;s income too. Conventionally, farmers and plant pathologists manually examine the plants to detect probable diseases, which is quite a difficult and laborious task. Due to the technological advancements in computer vision, nowadays, plant diseases are being identified with the help of computational techniques and digital visual images of plant leaves.</p>
<p>In order to diagnose plant diseases <italic>via</italic> their symptomatic leaf images, various researchers have applied different Machine Learning (ML) techniques (<xref ref-type="bibr" rid="B24">Khan et&#xa0;al., 2022</xref>). Although ML techniques can solve the problem of automatic plant disease recognition <italic>via</italic> digital leaf images, but these methods prominently suffer from two issues. First, these techniques cannot automatically extract various temporal and spatial features of images, which are used in image classification. Second, they are unable to process large image datasets quickly as they are not implemented in such a manner that they can take the computational advantages of Graphic Processing Units (GPUs). In order to conquer the shortcomings of these techniques, researchers have used Deep learning (DL) methods, particularly CNNs, to recognize plant diseases in an automated manner. The CNN automatically extracts various temporal and spatial features from the given image <italic>via</italic> small convolutional filters to classify the images into their corresponding classes. Moreover, it can also take the computational advantage of the GPUs to perform various mathematical operations faster. Therefore, many researchers have used CNN models (either state-of-the-art CNN architectures or customized CNN architectures) to diagnose plant diseases automatically (<xref ref-type="bibr" rid="B2">Atila et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B13">Dhaka et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B38">Tiwari et&#xa0;al., 2021</xref>).</p>
<p>
<xref ref-type="bibr" rid="B41">Vaswani et&#xa0;al. (2017)</xref> proposed the Transformer model that revolutionized the natural language processing domain. Thereafter, <xref ref-type="bibr" rid="B14">Dosovitskiy et&#xa0;al. (2021)</xref> designed a novel ViT model for image classification based on the Transformer model. It encompasses multiple encoder blocks connected by a direct connection only. Each encoder block of ViT model is comprised of Multi-Head Attention, Layer Normalization, and MLP modules. <xref ref-type="bibr" rid="B14">Dosovitskiy et&#xa0;al. (2021)</xref> found that it outperformed various state-of-the-art CNN architectures. Therefore, researchers have applied the ViT model to detect plant diseases automatically (<xref ref-type="bibr" rid="B9">Borhani et&#xa0;al., 2022</xref>). Despite of great performance of the ViT model, this model suffers from a major drawback that it contains an MLP module in its encoder block which is computationally expensive as well as inefficient in extracting various temporal and spatial features from the images under study. Therefore, we addressed these drawbacks and developed a comparatively less computationally expensive ViT network for diagnosis of plant diseases. The major contribution of the present study has been provided below:</p>
<list list-type="simple">
<list-item>
<p>&#x2022; We proposed a computationally lightweight and improved Vision Transformer (ViT) network also known as &#x201c;TrIncNet&#x201d; for image-based plant disease detection. The TrIncNet model is composed of multiple modified encoder blocks aka Trans-Inception blocks. Each Trans-Inception block comprises of inception module in place of MLP module for extracting various temporal and spatial features from leaf images. Additionally, skip connections are added between each Trans-Inception block to make the proposed network more resistant towards the vanishing gradient problem.</p>
</list-item>
<list-item>
<p>&#x2022; The proposed network has been trained and tested on two plant disease image datasets viz: PlantVillage dataset (<xref ref-type="bibr" rid="B27">Mohanty et&#xa0;al., 2016</xref>) and in-field Maize image dataset (<xref ref-type="bibr" rid="B18">Haque et&#xa0;al., 2022</xref>) for showcasing their applicability in the real-world scenario. Moreover, we performed the comparative performance analysis of the proposed network with the existing state of the art networks (e.g., ViT, VGG-19, GoogLeNet, ResNet-50, Xception, InceptionV3, MobileNet, etc) on both the dataset.</p>
</list-item>
</list>
<p>This paper is organized into eight sections. Section 1 (current section) highlights the devastating impact of plant diseases, importance of crop protection, constraints of the conventional approaches of disease detection and management, importance of computer vision based technologies <italic>etc.</italic>: Section 2 explores and discusses the relevant works related to the current study, Section 3 explains and describes the approach of proposed model development; Section 4 describes the dataset and experimental setup used in the present study; Section 5 presents the experimental results and finding of the current study; Section 6 briefly discusses and interprets the results of the current studies; and section 7 concludes the whole study and aligns the future perspective of this study.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related works</title>
<p>Many research efforts are made in the literature to automatically identify plant diseases <italic>via</italic> their digital leaf images. Earlier, researchers have applied different ML techniques (<xref ref-type="bibr" rid="B39">Trivedi et&#xa0;al., 2020</xref>; <xref ref-type="bibr" rid="B40">Varshney et&#xa0;al., 2021</xref>). Though ML methods effectively identify plant diseases, but they suffer from two main limitations. First, they are unable to capture the various spatial and temporal features of images automatically. Second, processing large image datasets can be slow and time-consuming with traditional ML techniques as they are not developed in a way that they can leverage the advantages of GPUs. To conquer the shortcomings of ML algorithms, researchers have utilized DL methods, particularly CNNs, to identify plant diseases automatically. For example, <xref ref-type="bibr" rid="B27">Mohanty et&#xa0;al. (2016)</xref> analyzed the performances of GoogLeNet and AlexNet architectures and found that GoogLeNet outperformed AlexNet with 99.34% testing accuracy. Other research works (<xref ref-type="bibr" rid="B31">Sakkarvarthi et&#xa0;al., 2022</xref>; <xref ref-type="bibr" rid="B8">Biswas and Yadav, 2023</xref>) used different state-of-the-art CNN architectures to identify plant diseases. <xref ref-type="bibr" rid="B17">Haque et&#xa0;al. (2021)</xref> used GoogLeNet architecture to recognize the Maydis Leaf Blight (MLB) disease in Maize crops. They used real-field Maize leaf images for model training and got 99.14% testing accuracy. In another research work, <xref ref-type="bibr" rid="B18">Haque et&#xa0;al. (2022)</xref> investigated the effect of the dense layer, global average pooling layer, and flatten layer on the performance of InceptionV3 (<xref ref-type="bibr" rid="B35">Szegedy et&#xa0;al., 2016</xref>) model in detecting three types of diseases in Maize plants. <xref ref-type="bibr" rid="B29">Nigam et&#xa0;al. (2023)</xref> experimented with eight EfficientNet-based CNN architectures to identify Stem Rust, Stripe Rust, and Leaf Rust diseases in wheat plants. They found that EfficientNet-B4 CNN architecture outperformed other architectures with 99.35% testing accuracy.</p>
<p>Some researchers tried to build a lightweight DL model for the plant disease diagnosis. <xref ref-type="bibr" rid="B5">Bedi and Gole (2021a)</xref> developed a hybrid model with the help of Convolutional Autoencoder (CAE) and CNN to identify peach plants&#x2019; Bacterial Spot disease, and their model attained 98.38% testing accuracy. In (<xref ref-type="bibr" rid="B6">Bedi and Gole, 2021b</xref>), an effort was made by authors to increase the accuracy of peach plants&#x2019; Bacterial Spot disease identification to 99.51% by developing a novel DL model by combining the Ghost (<xref ref-type="bibr" rid="B16">Han et&#xa0;al., 2020</xref>) and Squeeze-and-Excitation (<xref ref-type="bibr" rid="B21">Hu et&#xa0;al., 2018</xref>) modules. <xref ref-type="bibr" rid="B43">Xiang et&#xa0;al. (2021)</xref> developed a lightweight network to identify the severity of plant diseases. They designed a lightweight CNN model with the help of multiple-size convolutional filters and channel shuffle operation. Their best model achieved 90.6% accuracy and 84.3% f1-score. <xref ref-type="bibr" rid="B18">Haque et&#xa0;al. (2022)</xref> proposed a lightweight custom CNN model for detecting the diseases of maize crop based on the maize dataset from plant data repository. Their proposed network worked quite well on test dataset and obtained 99.1% classification accuracy. <xref ref-type="bibr" rid="B32">Sharma et&#xa0;al. (2023)</xref> designed a lightweight DLMC-Net model by using novel collective blocks and passage layers. Moreover, they used depth-wise separable convolution operation to reduce the number of weight parameters. Their proposed DLMC-Net model achieved 93.56%, 92.34%, 99.50%, and 96.56% accuracy in detecting diseases from the leaf images of citrus, cucumber, grapes, and tomato plants, respectively.</p>
<p>In some recent studies, attention-mechanism is also utilized to enhance the efficacy of different DL frameworks. <xref ref-type="bibr" rid="B22">Karthik et&#xa0;al. (2020)</xref> applied attention to the ResNet architecture for disease diagnosis in tomato plants and achieved 98% accuracy in detecting ten tomato plant diseases. <xref ref-type="bibr" rid="B11">Chen et&#xa0;al. (2021)</xref> embedded channel and spatial attention modules in the DenseNet CNN architecture and used the Depthwise separable convolution operation in place of standard convolution operation. They tested the applicability of their approach in identifying diseases in Maize plants on their own collected dataset and PlantVillage dataset. They reported in the paper that their model attained 95.86% and 98.5% accuracy on their collected and PlantVillage datasets, respectively. <xref ref-type="bibr" rid="B45">Zhao et&#xa0;al. (2022)</xref> designed RIC-NET model using Residual and Inception blocks. They used Convolutional Block Attention Module (CBAM) to enhance the RIC-NET model&#x2019;s performance. Their model identified the diseases in potato, corn, and tomato plants with 99.55% accuracy, as claimed by the authors. <xref ref-type="bibr" rid="B25">Li et&#xa0;al. (2023)</xref> designed a novel Muti-Dilated-CBAM-DenseNet (MDCDenseNet) architecture to identify Maize plant diseases in the farmlands. Their proposed model attained 98.84% testing accuracy on the Maize plant leaf images collected from the agricultural fields of Northeastern Agricultural University, China. <xref ref-type="bibr" rid="B28">Naik et&#xa0;al. (2022)</xref> used the squeeze-and-excitation network-based CNN model (SECNN) to detect five diseases (down curl of a leaf, Geminivirus, Cercospora leaf spot, yellow leaf disease, and up curl) in Chili plant&#x2019;s leaf images. Their proposed model attained 98.63% and 99.12% accuracy without augmentation and with augmentation, respectively. Moreover, they tested the model&#x2019;s performance on the PlantVillage dataset and found that the SECNN model achieved 99.28% accuracy. <xref ref-type="bibr" rid="B30">Pandey and Jain (2022)</xref> proposed a novel attention-based learning paradigm to improve the CNN model&#x2019;s performance in diagnosing plant diseases from leaf images. Their proposed model achieved 99.93% accuracy on the PlantVillage dataset. <xref ref-type="bibr" rid="B23">Kaya and G&#xfc;rsoy (2023)</xref> used the Muti-Head Attention operation in the DenseNet-121 CNN architecture to identify plant diseases and achieved 98.17% accuracy on the PlantVillage dataset.</p>
<p>Due to the powerful capabilities of the Vision Transformer (ViT) model in image classification, <xref ref-type="bibr" rid="B37">Thai et&#xa0;al. (2021)</xref> applied the ViT model to identify diseases in the cassava field. They observed that the ViT model outperformed other standard CNN architectures like EfficientNet and ResNet-50 by giving 1% higher accuracy. Another work that utilized the ViT model for plant disease detection was done by <xref ref-type="bibr" rid="B42">Wu et&#xa0;al. (2021)</xref>. They used the ViT model and a novel multi-granularity feature extraction module to identify tomato plant diseases. As per their paper, the proposed approach outperformed others by roughly 2% higher accuracy. In research work done by <xref ref-type="bibr" rid="B26">Lu et&#xa0;al. (2022)</xref>, a novel ghost-convolutional Transformer model was proposed to detect diseases in grape plants and attained 98.14% accuracy in identifying eleven grape plant diseases. Some recent studies have combined the ViT and CNN models to solve various computer vision problems. <xref ref-type="bibr" rid="B33">Si et&#xa0;al. (2022)</xref> designed Inception-Transformer model for image classification and segmentation tasks. They tested their model on the ImageNet and COCO datasets and found that it surpassed other DL models. Similarly, <xref ref-type="bibr" rid="B4">Bana et&#xa0;al. (2022)</xref> designed a Generative Adversarial Network (GAN), which utilized the ViT model and Inception module for image colorization. Another research work done by <xref ref-type="bibr" rid="B44">Zhang et&#xa0;al. (2022)</xref> combined the goodness of ViT and CNN models to design a novel Tranvolution model to diagnose plant diseases automatically. They tested their model on the PlantDoc dataset and found that the Tranvolution model outperformed other research works present in the literature.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Model development</title>
<sec id="s3_1">
<label>3.1</label>
<title>Existing vision transformer network</title>
<p>The ViT network is a Transformer (<xref ref-type="bibr" rid="B41">Vaswani et&#xa0;al., 2017</xref>) based DL model designed by <xref ref-type="bibr" rid="B14">Dosovitskiy et&#xa0;al. (2021)</xref> to perform image classification and segmentation tasks. This model comprises multiple stacked encoder blocks, and each encoder block of the ViT model contains three modules: Multi-Head Attention module, Layer Normalization module, and MLP module. The ViT model&#x2019;s architectural design is shown in <xref ref-type="fig" rid="f1">
<bold>Figure&#xa0;1</bold>
</xref>.</p>
<fig id="f1" position="float">
<label>Figure&#xa0;1</label>
<caption>
<p>Architectural design of the existing ViT network.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g001.tif"/>
</fig>
<p>The Multi-Head Attention module performs multiple self-attention operations parallelly, through which the model can capture global dependencies between image patches. The Layer-Normalization module normalizes its previous layer&#x2019;s activations to improve the model&#x2019;s stability and performance. The MLP module comprises two densely connected layers that extract various features from image patches. However, the MLP module suffers from a major drawback: all layers of this module are densely connected to each other. Therefore, it requires a huge number of weight parameters to be trained, which makes the ViT model computationally heavy. Moreover, the MLP module is unable to capture the temporal and spatial features of images efficiently and effectively, which can later enhance the performance of model in image classification. Hence, in this study, a novel TrIncNet model has been designed and developed, which fixes these drawbacks of the ViT model, and the description of the TrIncNet model has been given in the next subsection.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Proposed vision transformer network</title>
<p>In order to conquer the shortcoming of ViT model, the MLP module has been replaced with the Inception module in the ViT model&#x2019;s encoder block, and this modified encoder block is named as &#x201c;Trans-Inception block&#x201d;. The reason for using the Inception module in place of the MLP module is that the Inception module performs convolution and max-pooling operations parallelly. Thus, it uses significantly less number trainable weight parameters as compared to the MLP module. Moreover, it can also extract various spatial and temporal features of images effectively and efficiently, which can enhance the performance of the model to perform image classification. In this research work, a novel Trans-Inception Network also known as TrIncNet model is proposed, which comprises of multiple stacked Trans-Inception blocks. As per our best belief, this model has not been proposed in any existing studies present in the literature. Furthermore, each Trans-Inception block of the TrIncNet model is also surrounded by a skip connection which makes the model much more resistant to the vanishing gradient problem. The architectural design of TrIncNet model and its Trans-Inception block has been shown in <xref ref-type="fig" rid="f2">
<bold>Figure&#xa0;2</bold>
</xref>.</p>
<fig id="f2" position="float">
<label>Figure&#xa0;2</label>
<caption>
<p>Architectural design of the proposed TrIncNet network.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g002.tif"/>
</fig>
<p>Each Trans-Inception block of the TrIncNet model comprises three modules: Multi-Head Attention, Layer Normalization, and Inception modules. Out of these three modules, two modules: Multi-Head Attention and Layer Normalization modules are taken from the ViT model&#x2019;s encoder block, and the Inception module is added to the Trans-Inception block in this research work. All modules of the Trans-Inception block have been described below:</p>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>Multi-head attention module</title>
<p>It performs <inline-formula>
<mml:math display="inline" id="im1">
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> self-attention operation parallelly, where <inline-formula>
<mml:math display="inline" id="im2">
<mml:mi>m</mml:mi>
</mml:math>
</inline-formula> is a hyperparameter representing the number of heads used in this module. In this research work, twelve-headed attention has been used. The phenomenon of human eye perception inspires self-attention operation, as the human eye focuses only on the part of information while ignoring other things. This operation aims to gather the relationship among all patches of an image. Let there be <inline-formula>
<mml:math display="inline" id="im3">
<mml:mi>k</mml:mi>
</mml:math>
</inline-formula> such patches, i.e., <inline-formula>
<mml:math display="inline" id="im4">
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:msub>
<mml:mi>e</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> represented by <inline-formula>
<mml:math display="inline" id="im5">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula>
<mml:math display="inline" id="im6">
<mml:mi>d</mml:mi>
</mml:math>
</inline-formula> is the embedding dimension in which the information of each patch has been embedded. In self-attention operation, three learnable weight matrices: Query (<inline-formula>
<mml:math display="inline" id="im7">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>Q</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>), Key (<inline-formula>
<mml:math display="inline" id="im8">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>K</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>), and Value (<inline-formula>
<mml:math display="inline" id="im9">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>V</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>v</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>) are trained using the backpropagation algorithm, where <inline-formula>
<mml:math display="inline" id="im10">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>q</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math display="inline" id="im11">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>v</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the number of columns present in Query, Key, and Value weight matrices. In self-attention operation, first, the input sequence <inline-formula>
<mml:math display="inline" id="im12">
<mml:mi>E</mml:mi>
</mml:math>
</inline-formula> is multiplied with these learnable matrices to get <inline-formula>
<mml:math display="inline" id="im13">
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>E</mml:mi>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>Q</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im14">
<mml:mrow>
<mml:mi>K</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>E</mml:mi>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>K</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im15">
<mml:mrow>
<mml:mi>V</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>E</mml:mi>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>V</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> matrices. After obtaining the <inline-formula>
<mml:math display="inline" id="im16">
<mml:mi>Q</mml:mi>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im17">
<mml:mi>K</mml:mi>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im18">
<mml:mi>V</mml:mi>
</mml:math>
</inline-formula> matrices, the self-attention score (<inline-formula>
<mml:math display="inline" id="im19">
<mml:mi>Z</mml:mi>
</mml:math>
</inline-formula>) matrix is calculated by equation 1 (<xref ref-type="bibr" rid="B41">Vaswani et&#xa0;al., 2017</xref>).</p>
<disp-formula>
<label>(1)</label>
<mml:math display="block" id="M1">
<mml:mrow>
<mml:mi>Z</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>Q</mml:mi>
<mml:msup>
<mml:mi>K</mml:mi>
<mml:mi>t</mml:mi>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>&#xb7;</mml:mo>
<mml:mi>V</mml:mi>
</mml:mrow>
</mml:math>
</disp-formula>
<p>The outputs of all <inline-formula>
<mml:math display="inline" id="im20">
<mml:mi>m</mml:mi>
</mml:math>
</inline-formula> heads are concatenated together and then multiplied by an output weight matrix (<inline-formula>
<mml:math display="inline" id="im21">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>O</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>m</mml:mi>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mi>v</mml:mi>
</mml:msub>
<mml:mo>&#xa0;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>) according to equation 2, where <inline-formula>
<mml:math display="inline" id="im22">
<mml:mrow>
<mml:msub>
<mml:mi>Z</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the self-attention score matrix of <inline-formula>
<mml:math display="inline" id="im23">
<mml:mrow>
<mml:msup>
<mml:mi>i</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> head.</p>
<disp-formula>
<label>(2)</label>
<mml:math display="block" id="M2">
<mml:mrow>
<mml:msub>
<mml:mi>Z</mml:mi>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>t</mml:mi>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>Z</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>Z</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>Z</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:msub>
<mml:mi>Z</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msup>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>O</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>Layer normalization module</title>
<p>To conquer Batch Normalization&#x2019;s shortcomings, <xref ref-type="bibr" rid="B3">Ba et&#xa0;al. (2016)</xref> proposed the Layer Normalization technique. This technique normalizes the activations in the feature direction instead of the batch direction. Hence, it removes the shortcoming of Batch Normalization by removing the dependence on batches. Moreover, it normalizes every feature of the activations to unit variance and zero mean. In the Layer Normalization paradigm, first, means and variances are calculated for each channel of the feature map as per equation 3 and equation 4, respectively. Second, the normalized feature maps are computed by equation 5, and at last, scaling and shifting are done with the help of two learnable parameters, i.e., <inline-formula>
<mml:math display="inline" id="im24">
<mml:mi>&#x3b3;</mml:mi>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math display="inline" id="im25">
<mml:mi>&#x3b2;</mml:mi>
</mml:math>
</inline-formula>, by equation 6.</p>
<disp-formula>
<label>(3)</label>
<mml:math display="block" id="M3">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3bc;</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mi>H</mml:mi>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>H</mml:mi>
</mml:munderover>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>W</mml:mi>
</mml:munderover>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(4)</label>
<mml:math display="block" id="M4">
<mml:mrow>
<mml:msubsup>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>H</mml:mi>
</mml:munderover>
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>W</mml:mi>
</mml:munderover>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3bc;</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(5)</label>
<mml:math display="block" id="M5">
<mml:mrow>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>=</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>&#x3bc;</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msqrt>
<mml:mrow>
<mml:msubsup>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>c</mml:mi>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msubsup>
<mml:mo>+</mml:mo>
<mml:mi>&#x3f5;</mml:mi>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
</disp-formula>
<disp-formula>
<label>(6)</label>
<mml:math display="block" id="M6">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mo>&#xa0;</mml:mo>
<mml:msubsup>
<mml:mi>x</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>+</mml:mo>
<mml:mi>&#x3b2;</mml:mi>
<mml:mo>&#x2261;</mml:mo>
<mml:mi>L</mml:mi>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where <inline-formula>
<mml:math display="inline" id="im26">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> denotes the number of the feature maps, <inline-formula>
<mml:math display="inline" id="im27">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>d</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im28">
<mml:mi>H</mml:mi>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im29">
<mml:mi>W</mml:mi>
</mml:math>
</inline-formula>, and C are the height, weight, and channels of the feature map, respectively, and <inline-formula>
<mml:math display="inline" id="im30">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>c</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>Inception module</title>
<p>The Inception module performs three convolutional operations with <inline-formula>
<mml:math display="inline" id="im31">
<mml:mrow>
<mml:mn>5</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im32">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im33">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> filters and a <inline-formula>
<mml:math display="inline" id="im34">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> max-pooling operation simultaneously; therefore, it can extract various temporal and spatial features of images parallelly with different receptive fields. As the Inception module performs convolution and max-pooling operations; thus, it has various advantages over the MLP module, which are listed below:</p>
<sec id="s3_2_3_1">
<label>3.2.3.1</label>
<title>Spatial invariance (Shift invariance)</title>
<p>It refers to the property of the convolution operation, which makes it able to recognize the object in the image irrespective of its position. The convolution operation holds this property because the filter size is much lesser as compared to image size.</p>
</sec>
<sec id="s3_2_3_2">
<label>3.2.3.2</label>
<title>Local translation invariance</title>
<p>Through this property, the Inception module can recognize the rotated or tilted object in the image. The pooling operation of Inception module helps to achieve this property.</p>
</sec>
<sec id="s3_2_3_3">
<label>3.2.3.3</label>
<title>Parameter sharing</title>
<p>In convolution operation, weight parameters are shared with the help of convolutional filters. The size of these convolutional filters is much lesser than the image size, and only these filters are trained to extract the images&#x2019; features. Hence, the total trainable parameters present in the Inception module are much lesser than those in the MLP.</p>
</sec>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Asymptomatic analysis on weight parameters used by ViT and TrIncNet models</title>
<p>To analyze the efficiency of the novel Trans-Inception block over the original encoder of the ViT model, asymptomatic analysis has been done on the number of weight parameters used by these blocks. As it can be seen from <xref ref-type="fig" rid="f1">
<bold>Figures&#xa0;1</bold>
</xref>, <xref ref-type="fig" rid="f2">
<bold>2</bold>
</xref>, the Trans-Inception block is different from the original encoder block of ViT only in terms of the Inception module&#x2019;s presence. Therefore, the asymptomatic analysis is done only between the MLP and Inception modules. Let, <inline-formula>
<mml:math display="inline" id="im35">
<mml:mrow>
<mml:mi>I</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is the input to the MLP module of the ViT, where <inline-formula>
<mml:math display="inline" id="im36">
<mml:mi>M</mml:mi>
</mml:math>
</inline-formula> is the number of patches in one leaf image, and <inline-formula>
<mml:math display="inline" id="im37">
<mml:mi>N</mml:mi>
</mml:math>
</inline-formula> is the size of one embedded patch. As mentioned in (<xref ref-type="bibr" rid="B14">Dosovitskiy et&#xa0;al., 2021</xref>), the MLP module present in the encoder block of the ViT model contains two fully connected layers having output sizes <inline-formula>
<mml:math display="inline" id="im38">
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula>
<mml:math display="inline" id="im39">
<mml:mi>N</mml:mi>
</mml:math>
</inline-formula>, respectively. Hence the total number of weight parameters used by the MLP module for one patch of leaf image is <inline-formula>
<mml:math display="inline" id="im40">
<mml:mrow>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>N</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>N</mml:mi>
<mml:mo>&#xa0;</mml:mo>
<mml:mo>+</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>N</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mi>N</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>&#x21d2;</mml:mo>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, asymptomatically. Similarly, for <inline-formula>
<mml:math display="inline" id="im41">
<mml:mrow>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> number patches, total <italic>O</italic>(<italic>MN</italic>
<sup>2</sup>) weight parameters are used by the MLP module. On the other hand, if <inline-formula>
<mml:math display="inline" id="im42">
<mml:mrow>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the maximum number of filters used by any convolution operation of the Inception module, then it requires <italic>O</italic>(max(<italic>M</italic>
<sup>2</sup>
<italic>F</italic>
<sup>2</sup>)) weight parameters asymptomatically (calculated in Appendix). The above analysis shows that the proposed Trans-Inception block requires significantly fewer weight parameters to train than the ViT model&#x2019;s encoder block. Furthermore, lesser weight parameters used by any model imply that it would require less training time and inference time. Hence, the TrIncNet model needs a smaller amount of inference time and training time as compared to the ViT model. Details of experimentation done in this work are described in the next section.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental material</title>
<sec id="s4_1">
<label>4.1</label>
<title>Dataset description</title>
<p>The experimentation of this research work is carried out on the Maize dataset (which comprises real-field leaf images having complex backgrounds) and the PlantVillage dataset (which acts as a benchmark dataset for plant disease detection problems). These datasets are described below:</p>
<sec id="s4_1_1">
<label>4.1.1</label>
<title>Maize dataset</title>
<p>The Maize dataset contains 13,971 leaf images which were captured from multiple agricultural fields of Indian Institute of Maize Research, Ludhiana, India. The images are captured non-invasively by maintaining 25-40 cm distance from the camera device to the affected part of the plant and focused on the top/front view of symptomatic parts of the plant. In this dataset, leaf images of three diseases, i.e., Turcicum Leaf Blight (TLB), Banded Leaf and Sheath Blight (BLSB), and Maydis Leaf Blight (MLB), are present along with the healthy leaf images. Few representative leaf images from each class of the dataset are shown in <xref ref-type="fig" rid="f3">
<bold>Figure&#xa0;3</bold>
</xref>.</p>
<fig id="f3" position="float">
<label>Figure&#xa0;3</label>
<caption>
<p>Leaf images from each class of the Maize dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g003.tif"/>
</fig>
</sec>
<sec id="s4_1_2">
<label>4.1.2</label>
<title>PlantVillage dataset</title>
<p>It is a benchmark dataset used to measure the performance of any DL or ML model for automatically recognizing diseases in plants (<xref ref-type="bibr" rid="B27">Mohanty et&#xa0;al., 2016</xref>). This dataset contains 54,503 leaf images of 14 plant species which have been categorized into 38 classes. Few representative leaf images from each class of the dataset are shown in <xref ref-type="fig" rid="f4">
<bold>Figure&#xa0;4</bold>
</xref>.</p>
<fig id="f4" position="float">
<label>Figure&#xa0;4</label>
<caption>
<p>Leaf images from each class of the PlantVillage dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g004.tif"/>
</fig>
</sec>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Data preprocessing</title>
<p>It is an important step in designing a DL framework for automatically diagnosing diseases in plants. In this research work, following data preprocessing techniques have been used:</p>
<sec id="s4_2_1">
<label>4.2.1</label>
<title>Image resizing</title>
<p>It is used to either increase or decrease the image&#x2019;s resolution. The major advantage of image resizing is that it speeds up the DL model&#x2019;s training process. Therefore, the images of both datasets have been resized to 256 &#xd7; 256 dimension <italic>via ImageDataGenerator</italic> class of the Keras library.</p>
</sec>
<sec id="s4_2_2">
<label>4.2.2</label>
<title>Image normalization</title>
<p>The pixel value varies between 0 to 255, and using these pixel values while training the Deep Learning model, computation becomes complex for high pixel values. Therefore, pixel values of images should be normalized between 0 and 1. This can be done by dividing each image pixel value by  255.</p>
</sec>
<sec id="s4_2_3">
<label>4.2.3</label>
<title>Data augmentation</title>
<p>DL models need a large amount of data to generalize a model or prevent the overfitting problem. Data augmentation is a process that increases the dataset&#x2019;s size by applying various image processing techniques like rotation, flipping, etc. (<xref ref-type="bibr" rid="B7">Bedi et&#xa0;al., 2021</xref>). There are two types of data augmentation: online data augmentation and offline data augmentation. In offline data augmentation, the output images are saved on disk after going through the various image processing operations and then used for model training. Whereas in online data augmentation, the transformed images are directly used in model training. Since the leaf images present in the Maize dataset are fewer in number and during model training, it causes model overfitting. Therefore, in order to tackle this problem, the size of the Maize dataset is artificially increased <italic>via</italic> offline data augmentation. After augmentation, the Maize dataset has 100000 leaf images.</p>
</sec>
<sec id="s4_2_4">
<label>4.2.4</label>
<title>Data Splitting</title>
<p>In this step, the leaf images of both datasets are randomly split into the training subset, validation subset, and test subset as per the 70:15:15 ratio. The training subset&#x2019;s leaf images are utilized for training the models, and validation subset has been utilized to adjust the values of hyperparameters so that the best-performing model can be achieved. Finally, the test subset is utilized for measuring the TrIncNet model&#x2019;s effectiveness on unseen leaf images.</p>
</sec>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Experimental setup</title>
<p>The Nvidia DGX Server having Intel(R) Xeon(R) CPU with 528 GB RAM and NVidia Tesla V100-SXM2 32 GB Graphic Card, is used to carry out the experiments of this research work. Python programming language is used to write the scripts for the experiments; however, any programming language can be used for experimentation. The <italic>Keras</italic> Python library embedded in <italic>Tensorflow 2.6.0</italic> has been utilized to develop the TrIncNet model, the ViT model, and six state-of-the-art CNN architectures.</p>
<p>The TrIncNet model&#x2019;s performance is compared with the ViT (<xref ref-type="bibr" rid="B14">Dosovitskiy et&#xa0;al., 2021</xref>) model and six state-of-the-art CNN architectures: VGG-19 (<xref ref-type="bibr" rid="B34">Simonyan and Zisserman, 2015</xref>), GoogLeNet (<xref ref-type="bibr" rid="B36">Szegedy et&#xa0;al., 2015</xref>), ResNet-50 (<xref ref-type="bibr" rid="B19">He et&#xa0;al., 2016</xref>), Xception (<xref ref-type="bibr" rid="B12">Chollet, 2017</xref>), InceptionV3 (<xref ref-type="bibr" rid="B35">Szegedy et&#xa0;al., 2016</xref>), MobileNet (<xref ref-type="bibr" rid="B20">Howard et&#xa0;al., 2017</xref>). These models are trained for 500 epochs and 32 batch size using Adam optimizer to minimize the categorical cross-entropy loss between the logits and actual labels of leaf images. Early stopping with patience value 20 is used to prevent model overfitting., i.e., if validation accuracy is not improved for twenty consecutive iterations, then model training would stop.</p>
<p>As already discussed, the TrIncNet model is designed by replacing the MLP model with the Inception module in the encoder block of the ViT model. Therefore, in order to examine the effect of this replacement on number of weight parameters, ViT and TrIncNet models are implemented using the hyperparameters given in <xref ref-type="table" rid="T1">
<bold>Tables&#xa0;1</bold>
</xref>, <xref ref-type="table" rid="T2">
<bold>2</bold>
</xref>, respectively. These values for different hyperparameters of the ViT and TrIncNet models have been derived <italic>via</italic> extensive experimentation. The layer-wise implementation details of ViT and TrIncNet models have been tabulated in <xref ref-type="table" rid="T3">
<bold>Tables&#xa0;3</bold>
</xref>, <xref ref-type="table" rid="T4">
<bold>4</bold>
</xref>, respectively.</p>
<table-wrap id="T1" position="float">
<label>Table&#xa0;1</label>
<caption>
<p>Values of hyperparameters for the ViT model&#x2019;s implementation.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Hyperparameter</th>
<th valign="top" align="left">Value</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Image size</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im43">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">Patch size <inline-formula>
<mml:math display="inline" id="im44">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im45">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">Size of Embedded Patch (<inline-formula>
<mml:math display="inline" id="im46">
<mml:mi>N</mml:mi>
</mml:math>
</inline-formula>)</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im47">
<mml:mrow>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">Number of Encoder blocks</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im48">
<mml:mn>2</mml:mn>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">Number of Heads <inline-formula>
<mml:math display="inline" id="im49">
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">12</td>
</tr>
<tr>
<td valign="middle" rowspan="2" align="left">Activation function</td>
<td valign="top" align="left">SoftMax (Output Layer)</td>
</tr>
<tr>
<td valign="top" align="left">ReLu (Hidden Layers)</td>
</tr>
<tr>
<td valign="top" align="left">Layer_normalization_rate (epsilon)</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im50">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>6</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T2" position="float">
<label>Table&#xa0;2</label>
<caption>
<p>Values of hyperparameters for the TrIncNet model&#x2019;s implementation.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Hyperparameter</th>
<th valign="top" align="left">Value</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Image size</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im51">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">Patch size <inline-formula>
<mml:math display="inline" id="im52">
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im53">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">Size of Embedded Patch (<inline-formula>
<mml:math display="inline" id="im54">
<mml:mi>N</mml:mi>
</mml:math>
</inline-formula>)</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im55">
<mml:mrow>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">Number of Trans-Inception blocks</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im56">
<mml:mn>2</mml:mn>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">Number of Heads <inline-formula>
<mml:math display="inline" id="im57">
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">12</td>
</tr>
<tr>
<td valign="top" rowspan="2" align="left">Activation function</td>
<td valign="top" align="left">SoftMax (Output Layer)</td>
</tr>
<tr>
<td valign="top" align="left">ReLu (Hidden Layers)</td>
</tr>
<tr>
<td valign="top" align="left">Layer_normalization_rate (epsilon)</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im58">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mn>10</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>6</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">Number of Filters (used in the Inception module)</td>
<td valign="top" align="left">96, 16, 64, 128, 32, 32</td>
</tr>
<tr>
<td valign="top" align="left">Padding (used in the Inception module)</td>
<td valign="top" align="left">Same</td>
</tr>
<tr>
<td valign="top" align="left">Stride (used in the Inception module)</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im59">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T3" position="float">
<label>Table&#xa0;3</label>
<caption>
<p>ViT model&#x2019;s implementation details.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" colspan="3" align="left">Layer No.</th>
<th valign="top" align="left">Layer Name</th>
<th valign="top" align="left">Input Shape</th>
<th valign="top" align="left">Connected to</th>
<th valign="top" align="left">Output Shape</th>
<th valign="top" align="left">Parameters</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" colspan="3" align="left">1</td>
<td valign="top" align="left">Input Layer</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im60">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">&#x2013;</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im61">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im62">
<mml:mn>0</mml:mn>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">2</td>
<td valign="top" align="left">Patches</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im63">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Input Layer</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im64">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>768</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im65">
<mml:mn>0</mml:mn>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">3</td>
<td valign="top" align="left">Patch Encoder</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im66">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>768</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Patches</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im67">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im68">
<mml:mrow>
<mml:mn>262400</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">4</td>
<td valign="top" align="left">Layer Normalization #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im69">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Patch Encoder</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im70">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im71">
<mml:mrow>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">5</td>
<td valign="top" align="left">Multi-Head Attention #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im72">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Layer Normalization #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im73">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im74">
<mml:mrow>
<mml:mn>3155200</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">6</td>
<td valign="top" align="left">Add #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im75">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im76">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Multi-Head attention #1, Patch Encoder</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im77">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">7</td>
<td valign="top" align="left">Layer Normalization #2</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im78">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im79">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im80">
<mml:mrow>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="2" align="left">8</td>
<td valign="middle" rowspan="2" colspan="2" align="left">
<bold>MLP Module #1</bold>
</td>
<td valign="top" align="left">
<bold>Dense #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im81">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Layer Normalization #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im82">
<mml:mrow>
<mml:mn mathvariant="bold">256</mml:mn>
<mml:mo mathvariant="bold">&#xd7;</mml:mo>
<mml:mn mathvariant="bold">512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im83">
<mml:mrow>
<mml:mn mathvariant="bold">131584</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Dense #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im84">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Dense #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im85">
<mml:mrow>
<mml:mn mathvariant="bold">256</mml:mn>
<mml:mo mathvariant="bold">&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im86">
<mml:mrow>
<mml:mn mathvariant="bold">131328</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">9</td>
<td valign="top" align="left">Add #2</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im87">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im88">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Dense #2,<break/>Add #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im89">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">10</td>
<td valign="top" align="left">Add #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im90">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im91">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #2,<break/>Patch Encoder</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im92">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">11</td>
<td valign="top" align="left">Layer Normalization #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im93">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im94">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo mathvariant="bold">&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im95">
<mml:mrow>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">12</td>
<td valign="top" align="left">Multi-Head attention #2</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im96">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Layer Normalization #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im97">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im98">
<mml:mrow>
<mml:mn>3155200</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">13</td>
<td valign="top" align="left">Add #4</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im99">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im100">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Multi-Head attention #2, Add #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im101">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">14</td>
<td valign="top" align="left">Layer Normalization #4</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im102">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #4</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im103">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im104">
<mml:mrow>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="2" colspan="2" align="left">15</td>
<td valign="top" rowspan="2" align="left">
<bold>MLP Module #2</bold>
</td>
<td valign="top" align="left">
<bold>Dense #3</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im105">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Layer Normalization #4</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im106">
<mml:mrow>
<mml:mn mathvariant="bold">256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im107">
<mml:mrow>
<mml:mn mathvariant="bold">131584</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Dense #4</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im108">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Dense #3</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im109">
<mml:mrow>
<mml:mn mathvariant="bold">256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im110">
<mml:mrow>
<mml:mn mathvariant="bold">131328</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">16</td>
<td valign="top" align="left">Add #5</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im111">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im112">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Dense #4,<break/>Add #4</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im113">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">17</td>
<td valign="top" align="left">GlobalAveragePooling1D #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im114">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #5</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im115">
<mml:mrow>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">18</td>
<td valign="top" align="left">Dense #5</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im116">
<mml:mrow>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">GlobalAveragePooling1D #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im117">
<mml:mrow>
<mml:mn>64</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im118">
<mml:mrow>
<mml:mn>16448</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">19</td>
<td valign="top" align="left">Dense #6 (Output Layer)</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im119">
<mml:mrow>
<mml:mn>64</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Dense #1</td>
<td valign="top" align="center">4 (for the Maize dataset),<break/>38 (for the PlantVillage dataset)</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im120">
<mml:mrow>
<mml:mn>262</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im121">
<mml:mrow>
<mml:mn>2470</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="6" align="left">
<bold>Total Weight Parameters</bold>
</td>
<td valign="top" colspan="2" align="center">
<bold>7117382 (for the Maize dataset)</bold>
<break/>
<bold>7119590 (for the PlantVillage dataset)</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>The value written in bold font highlights the layers of MLP module in this table. These layers are the only difference between existing ViT model and our proposed TrIncNet model.</p>
</table-wrap-foot>
</table-wrap>
<table-wrap id="T4" position="float">
<label>Table&#xa0;4</label>
<caption>
<p>TrIncNet model&#x2019;s implementation details.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" colspan="3" align="left">Layer No.</th>
<th valign="top" align="center">Layer Name</th>
<th valign="top" align="center">Input Shape</th>
<th valign="top" align="center">Connected to</th>
<th valign="top" align="center">Output Shape</th>
<th valign="top" align="center">Parameters</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" colspan="3" align="left">1</td>
<td valign="top" align="left">Input Layer</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im122">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">&#x2013;</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im123">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im124">
<mml:mn>0</mml:mn>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">2</td>
<td valign="top" align="left">Patches</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im125">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Input Layer</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im126">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>768</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im127">
<mml:mn>0</mml:mn>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">3</td>
<td valign="top" align="left">Patch Encoder</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im128">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>768</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Patches</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im129">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im130">
<mml:mrow>
<mml:mn>262400</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">4</td>
<td valign="top" align="left">Layer Normalization #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im131">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Patch Encoder</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im132">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im133">
<mml:mrow>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">5</td>
<td valign="top" align="left">Multi-Head Attention #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im134">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Layer Normalization #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im135">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im136">
<mml:mrow>
<mml:mn>3155200</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">6</td>
<td valign="top" align="left">Add #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im137">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im138">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Multi-Head attention #1, Patch Encoder</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im139">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">7</td>
<td valign="top" align="left">Layer Normalization #2</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im140">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im141">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im142">
<mml:mrow>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="10" align="left">8</td>
<td valign="top" rowspan="10" colspan="2" align="left">
<bold>Inception Module #1</bold>
</td>
<td valign="top" align="left">
<bold>Reshape #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im143">
<mml:mrow>
<mml:mn mathvariant="bold">256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Layer Normalization #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im144">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im145">
<mml:mn mathvariant="bold">0</mml:mn>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im146">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Reshape #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im147">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">96</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im148">
<mml:mrow>
<mml:mn mathvariant="bold">24672</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im149">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Reshape #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im150">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im151">
<mml:mrow>
<mml:mn mathvariant="bold">4112</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #3</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im152">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Reshape #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im153">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">64</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<bold>16448</bold>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>MaxPooling2D #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im154">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Reshape #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im155">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<bold>0</bold>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #4</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im156">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">96</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Conv2D #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im157">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">128</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im158">
<mml:mrow>
<mml:mn mathvariant="bold">110720</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #5</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im159">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Conv2D #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im160">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im161">
<mml:mrow>
<mml:mn mathvariant="bold">12832</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #6</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im162">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>MaxPooling2D #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im163">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im164">
<mml:mrow>
<mml:mn mathvariant="bold">8224</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Concatenate #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im165">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">64</mml:mn>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>
<inline-formula>
<mml:math display="inline" id="im166">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">128</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im167">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im168">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Conv2D #3,</bold>
<break/>
<bold>Conv2D #4,</bold>
<break/>
<bold>Conv2D #5,</bold>
<break/>
<bold>Conv2D #6</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im169">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<bold>0</bold>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Reshape #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im170">
<mml:mrow>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Concatenate #1</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im171">
<mml:mrow>
<mml:mn mathvariant="bold">256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn mathvariant="bold">256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<bold>0</bold>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">9</td>
<td valign="top" align="left">Add #2</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im172">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im173">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Reshape #2,<break/>Add #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im174">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">10</td>
<td valign="top" align="left">Add #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im175">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im176">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #2,<break/>Patch Encoder</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im177">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">11</td>
<td valign="top" align="left">Layer Normalization #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im178">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im179">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im180">
<mml:mrow>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">12</td>
<td valign="top" align="left">Multi-Head attention #2</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im181">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Layer Normalization #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im182">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im183">
<mml:mrow>
<mml:mn>3155200</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">13</td>
<td valign="top" align="left">Add #4</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im184">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im185">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Multi-Head attention #2, Add #3</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im186">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">14</td>
<td valign="top" align="left">Layer Normalization #4</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im187">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #4</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im188">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im189">
<mml:mrow>
<mml:mn>512</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="middle" rowspan="10" colspan="2" align="left">15</td>
<td valign="top" rowspan="10" align="left">
<bold>Inception Module #2</bold>
</td>
<td valign="top" align="left">
<bold>Reshape #3</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im190">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Layer Normalization #4</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im191">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im192">
<mml:mn>0</mml:mn>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #7</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im193">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Reshape #3</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im194">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>96</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im195">
<mml:mrow>
<mml:mn>24672</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #8</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im196">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Reshape #3</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im197">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im198">
<mml:mrow>
<mml:mn>4112</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #9</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im199">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Reshape #3</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im200">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>64</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<bold>16448</bold>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>MaxPooling2D #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im201">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Reshape #3</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im202">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<bold>0</bold>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #10</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im203">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>96</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Conv2D #7</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im204">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>128</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im205">
<mml:mrow>
<mml:mn>110720</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #11</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im206">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Conv2D #8</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im207">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im208">
<mml:mrow>
<mml:mn>12832</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Conv2D #12</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im209">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>MaxPooling2D #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im210">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im211">
<mml:mrow>
<mml:mn>8224</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Concatenate #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im212">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>64</mml:mn>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>
<inline-formula>
<mml:math display="inline" id="im213">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>128</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im214">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im215">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>32</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Conv2D #9,</bold>
<break/>
<bold>Conv2D #10,</bold>
<break/>
<bold>Conv2D #11,</bold>
<break/>
<bold>Conv2D #12</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im216">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<bold>0</bold>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Reshape #4</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im217">
<mml:mrow>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>16</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<bold>Concatenate #2</bold>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im218">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<bold>0</bold>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">16</td>
<td valign="top" align="left">Add #5</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im219">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im220">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Reshape #4,<break/>Add #4</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im221">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">17</td>
<td valign="top" align="left">GlobalAveragePooling1D #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im222">
<mml:mrow>
<mml:mn>256</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Add #5</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im223">
<mml:mrow>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">18</td>
<td valign="top" align="left">Dense #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im224">
<mml:mrow>
<mml:mn>256</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">GlobalAveragePooling2D #1</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im225">
<mml:mrow>
<mml:mn>64</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im226">
<mml:mrow>
<mml:mn>16448</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="3" align="left">19</td>
<td valign="top" align="left">Dense #2 (Output Layer)</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im227">
<mml:mrow>
<mml:mn>64</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">Dense #1</td>
<td valign="top" align="left">4 (for the Maize dataset),<break/>38 (for the Plant-Village dataset)</td>
<td valign="top" align="center">
<inline-formula>
<mml:math display="inline" id="im228">
<mml:mrow>
<mml:mn>262</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im229">
<mml:mrow>
<mml:mn>2470</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" colspan="6" align="left">
<bold>Total Weight Parameters</bold>
</td>
<td valign="top" colspan="2" align="center">
<bold>6945574 (for the Maize dataset)</bold>
<break/>
<bold>6947782 (for the PlantVillage dataset)</bold>
</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p>The value written in bold font highlights the layers of  Inception module in this table. These layers are the only difference between existing ViT model and our proposed TrIncNet model.</p>
</table-wrap-foot>
</table-wrap>
<p>It can be perceived from <xref ref-type="table" rid="T3">
<bold>Tables&#xa0;3</bold>
</xref>, <xref ref-type="table" rid="T4">
<bold>4</bold>
</xref> that the Inception module present in the TrIncNet model has used 32.67% fewer weight parameters compared to the MLP module present in the ViT model. This results in a 2.41% overall decrement in weight parameters from the ViT model to the TrIncNet model for both datasets. The results obtained during the experimentation of this research work are given in the next section.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Experimental results</title>
<p>The proposed TrIncNet network was trained and tested on two agricultural image datasets viz. PlantVillage and Maize dataset. The prediction performance of proposed network was evaluated on the validation and test subsets of both the datasets and comparative analysis was done with the existing ViT model and six state-of-the-art CNN architectures: VGG-19, GoogLeNet, ResNet-50, Xception, InceptionV3, and MobileNet.</p>
<sec id="s5_1">
<label>5.1</label>
<title>Performance of the proposed network on Maize dataset</title>
<p>The plot of validation loss and validation accuracy of the TrIncNet model, along with the ViT model and six state-of-the-art CNN architectures for the Maize dataset, has been depicted in <xref ref-type="fig" rid="f5">
<bold>Figure&#xa0;5</bold>
</xref>. It can be observed from <xref ref-type="fig" rid="f5">
<bold>Figure&#xa0;5</bold>
</xref> that the proposed TrIncNet model attained the maximum validation accuracy, i.e., 97.0% and minimum validation loss, i.e., 0.035. Among the other six DL models, the GoogLeNet model attained second finest results for both validation accuracy and validation loss. Moreover, Xception and InceptionV3 models have achieved comparable accuracy, i.e., 90.38% and 90.23%, and comparable loss, i.e., 0.091 and 0.095. Other DL models which are used for comparison have attained validation accuracies in the range of 73.18% to 91.78% and validation losses in the range of 0.286 to 0.082.</p>
<fig id="f5" position="float">
<label>Figure&#xa0;5</label>
<caption>
<p>Plot of validation accuracies and validation losses of the TrIncNet model along with the ViT model and the six other state-of-the-art CNN architectures for the Maize dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g005.tif"/>
</fig>
<p>To study the efficacy of the TrIncNet model more thoroughly, f1-score, precision, recall, and accuracy are also computed for the TrIncNet model along with the ViT model and six state-of-the-art CNN architectures on the Maize dataset&#x2019;s test subset. These results have been given in <xref ref-type="fig" rid="f6">
<bold>Figure&#xa0;6</bold>
</xref>. It can be observed from <xref ref-type="fig" rid="f6">
<bold>Figure&#xa0;6</bold>
</xref> that the TrIncNet model achieved the best results for each above-mentioned metrics, i.e., 96.93% accuracy, 96.98% precision, 96.83% recall, and 96.9% f1-score on the Maize dataset. The Xception and InceptionV3 models have attained comparable results, and ResNet-50 have got minimum values for the aforementioned metrics. Moreover, GoogLeNet, ViT, MobileNet, and VGG-19 models achieved 95.72%, 91.55%, 91.64%, and 84.46% f1-score, respectively.</p>
<fig id="f6" position="float">
<label>Figure&#xa0;6</label>
<caption>
<p>Comparison of f1-score, precision, recall, and accuracy attained by the proposed TrIncNet model along with the ViT model and six state-of-the-art CNN architectures for the Maize dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g006.tif"/>
</fig>
<p>The number of weight parameters utilized by the TrIncNet model, along with the ViT model and six state-of-the-art CNN architectures trained on the Maize dataset, have been compared in <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref>. It is observed by seeing <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref> that Xception, VGG-19, and InceptionV3 models require a comparable number of trainable parameters, i.e., 20.03 million, 20.87 million, and 21.81 million. Whereas ResNet-50 uses 23.60 million, and the GoogLeNet model uses 8.21 million trainable weight parameters. It can also be observed from <xref ref-type="fig" rid="f7">
<bold>Figure&#xa0;7</bold>
</xref> that the TrIncNet model requires 6.95 million trainable weight parameters, which is 2.41% lesser than the ViT model, which requires 7.12 million weight parameters. Although the MobileNet model have minimum trainable weight parameters, i.e., 3.23 million, but it did not perform well as compared to the proposed TrIncNet model.</p>
<fig id="f7" position="float">
<label>Figure&#xa0;7</label>
<caption>
<p>Comparison of the number of trainable weight parameters used by the TrIncNet along with the ViT model and six state-of-the-art CNN architectures trained on the Maize dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g007.tif"/>
</fig>
<p>The TrIncNet model&#x2019;s performance on Maize dataset has been compared in <xref ref-type="table" rid="T5">
<bold>Table&#xa0;5</bold>
</xref> with the research work done by <xref ref-type="bibr" rid="B18">Haque et&#xa0;al. (2022)</xref>. The reason for comparing it with only this research work is that the TrIncNet model is trained on the same Maize dataset, which was used by <xref ref-type="bibr" rid="B18">Haque et&#xa0;al. (2022)</xref> in their research work.</p>
<table-wrap id="T5" position="float">
<label>Table&#xa0;5</label>
<caption>
<p>Comparison of the TrIncNet model&#x2019;s performance with a recent research work present in the literature for the identification of Maize plant diseases.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Research Work</th>
<th valign="top" align="center">Techniques used</th>
<th valign="top" align="center">Dataset used</th>
<th valign="top" align="center">Type of dataset</th>
<th valign="top" align="center">Testing Accuracy</th>
<th valign="top" align="left">Number of trainable weight parameters<break/>(In millions)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B18">Haque et&#xa0;al., 2022</xref>)</td>
<td valign="top" align="left">InceptionV3 with Global Average Pooling layer</td>
<td valign="top" align="left">Maize dataset</td>
<td valign="top" align="center">Captured from field</td>
<td valign="top" align="center">95.99%</td>
<td valign="top" align="left">21.78</td>
</tr>
<tr>
<td valign="top" align="left">Proposed Work</td>
<td valign="top" align="left">TrIncNet model</td>
<td valign="top" align="left">Maize dataset</td>
<td valign="top" align="center">Captured from field</td>
<td valign="top" align="center">96.93%</td>
<td valign="top" align="left">6.95</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It can be perceived from <xref ref-type="table" rid="T5">
<bold>Table&#xa0;5</bold>
</xref> that the TrIncNet model achieved approximately one percent higher testing accuracy than the research work done by <xref ref-type="bibr" rid="B18">Haque et&#xa0;al. (2022)</xref> in detecting three diseases (MLB, TLB, and BLSB) of Maize plants under real-field conditions. Moreover, the TrIncNet model requires approximately 68.1% lesser trainable weight parameters than the research work done by <xref ref-type="bibr" rid="B18">Haque et&#xa0;al. (2022)</xref>. In the next subsection, results obtained on the PlantVillage dataset are discussed.</p>
</sec>
<sec id="s5_2">
<label>5.2</label>
<title>Performance of the proposed network on PlantVillage dataset</title>
<p>In order to evaluate the TrIncNet model&#x2019;s performance with the ViT model and six state-of-the-art CNN architectures, we have analyzed the trend of validation loss and validation accuracy w.r.t the epochs (depicted in <xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref>) obtained during the training. It has been observed by analyzing the plot given in <xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref>, that the Xception, GoogLeNet, and InceptionV3 models have attained comparable accuracies, i.e., 99.76%, 99.78%, 99.28%, and comparable loss, i.e., 0.04, 0.04, and 0.05. Furthermore, other DL models used for comparison have attained validation accuracies in the range of 92% to 97% and validation losses in the range of 0.18 to 0.08. It can also be observed from <xref ref-type="fig" rid="f8">
<bold>Figure&#xa0;8</bold>
</xref> that the proposed TrIncNet model attained highest validation accuracy and lowest validation loss, i.e., 99.95%, and 0.02, respectively.</p>
<fig id="f8" position="float">
<label>Figure&#xa0;8</label>
<caption>
<p>Plot of validation accuracies and validation losses of the TrIncNet model along with the ViT model and the six other state-of-the-art CNN architectures for the PlantVillage dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g008.tif"/>
</fig>
<p>The performance of TrIncNet model along with ViT model and six state-of-the-art CNN architectures has been analyzed more thoroughly by computing f1-score, precision, recall, and accuracy on the test subset of PlantVillage dataset for all models. These results have been compared in <xref ref-type="fig" rid="f9">
<bold>Figure&#xa0;9</bold>
</xref>, and it can be observed from <xref ref-type="fig" rid="f9">
<bold>Figure&#xa0;9</bold>
</xref>, that the proposed TrIncNet outperformed the ViT model and six state-of-the-art CNN architectures with 99.93% accuracy, 99.92% precision, 99.91% recall, and 99.91% f1-score. Whereas, GoogLeNet, VGG-19, ViT, and MobileNet models achieved 97.22%, 96.96%, and 96.68%, and 97.68% f1-score, respectively.</p>
<fig id="f9" position="float">
<label>Figure&#xa0;9</label>
<caption>
<p>Comparison of f1-score, precision, recall, and accuracy attained by the proposed TrIncNet model along with the ViT model and six state-of-the-art CNN architectures for the PlantVillage dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g009.tif"/>
</fig>
<p>We have also calculated the number of weight parameters used by the TrIncNet model for the PlantVillage dataset and compared them with the weight parameters of the ViT model and six state-of-the-art CNN architectures on the same dataset. This comparison of weight parameters has been shown by a line chart in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref>. It can be seen by analysing the line chart given in <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref> that the ResNet-50 and GoogLeNet models use 8.24 million and 23.67 million trainable parameters, respectively. Whereas the VGG-19, Xception, and InceptionV3 models require comparable weight parameters. Although, it can also be observed from <xref ref-type="fig" rid="f10">
<bold>Figure&#xa0;10</bold>
</xref> that the MobileNet model requires minimum trainable weight parameters, i.e., 3.27 million, but it did not perform well as compared to the proposed TrIncNet model.</p>
<fig id="f10" position="float">
<label>Figure&#xa0;10</label>
<caption>
<p>Comparison of the number of trainable weight parameters used by the TrIncNet along with the ViT model and six state-of-the-art CNN architectures trained on the PlantVillage dataset.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g010.tif"/>
</fig>
<p>The performance of the TrIncNet model on PlantVillage dataset has also been compared in <xref ref-type="table" rid="T6">
<bold>Table&#xa0;6</bold>
</xref> with several recent research works present in the literature in which the PlantVillage dataset is used for model training. It can be observed from <xref ref-type="table" rid="T6">
<bold>Table&#xa0;6</bold>
</xref> that the proposed model has attained state-of-the-art results by using a significantly lesser number of trainable weight parameters on the PlantVillage dataset as compared to other studies present in the literature.</p>
<table-wrap id="T6" position="float">
<label>Table&#xa0;6</label>
<caption>
<p>Comparison of the TrIncNet model&#x2019;s performance with several recent studies present in the literature on PlantVillage dataset.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Research Work</th>
<th valign="top" align="left">Techniques<break/>used</th>
<th valign="top" align="left">Dataset<break/>used</th>
<th valign="top" align="left">Testing Accuracy</th>
<th valign="top" align="left">Number of trainable weight parameters<break/>(In millions)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">
<xref ref-type="bibr" rid="B23">Kaya and G&#xfc;rsoy (2023)</xref>
</td>
<td valign="top" align="left">Fused-DenseNet-121</td>
<td valign="top" align="left">PlantVillage dataset</td>
<td valign="top" align="left">98.17%</td>
<td valign="top" align="left">8.13</td>
</tr>
<tr>
<td valign="top" align="left">
<xref ref-type="bibr" rid="B1">Ahmad et&#xa0;al. (2023)</xref>
</td>
<td valign="top" align="left">DenseNet-169</td>
<td valign="top" align="left">PlantVillage dataset</td>
<td valign="top" align="left">99.5%</td>
<td valign="top" align="left">12.70</td>
</tr>
<tr>
<td valign="top" align="left">
<xref ref-type="bibr" rid="B2">Atila et&#xa0;al. (2021)</xref>
</td>
<td valign="top" align="left">EfficientNet-B5</td>
<td valign="top" align="left">PlantVillage dataset</td>
<td valign="top" align="left">99.91%</td>
<td valign="top" align="left">30.56</td>
</tr>
<tr>
<td valign="top" align="left">Proposed Work</td>
<td valign="top" align="left">TrIncNet model</td>
<td valign="top" align="left">PlantVillage dataset</td>
<td valign="top" align="left">99.93%</td>
<td valign="top" align="left">6.95</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s5_3">
<label>5.3</label>
<title>Ablation study</title>
<p>In order to visualize the feature extraction abilities of the MLP module of ViT model&#x2019;s encoder block and the Inception module of Trans-Inception block, their extracted features are plotted in <xref ref-type="fig" rid="f11">
<bold>Figures&#xa0;11</bold>
</xref>, <xref ref-type="fig" rid="f12">
<bold>12</bold>
</xref>, respectively. It can be seen from <xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref> that the MLP module present in ViT model&#x2019;s encoder block is able to capture various features of leaf images. However, these features are very limited (as many feature maps shown in <xref ref-type="fig" rid="f11">
<bold>Figure&#xa0;11</bold>
</xref> are empty) and not very rich in quality because the MLP module is inefficient in capturing various spatial and temporal features of images.</p>
<fig id="f11" position="float">
<label>Figure&#xa0;11</label>
<caption>
<p>Visual representation of features extracted by MLP module present in the ViT model&#x2019;s encoder block.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g011.tif"/>
</fig>
<fig id="f12" position="float">
<label>Figure&#xa0;12</label>
<caption>
<p>Visual representation of features extracted by the Inception module present in the Trans-Inception block. <bold>(A)</bold> Features extracted by 1 &#xd7; 1 convolution operation. <bold>(B)</bold> Features extracted by 3 &#xd7; 3 convolution operation. <bold>(C)</bold> Features extracted by 5 &#xd7; 5 convolution operation. <bold>(D)</bold> Features extracted by 3 &#xd7; 3 max-pooling operation. <bold>(E)</bold> Concatenation of all features extracted by 1 &#xd7; 1, 3 &#xd7; 3, 5 &#xd7; 5 convolution operations and 3 &#xd7; 3 max-pooling operation.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g012.tif"/>
</fig>
<p>The Inception module performs three convolution operations with <inline-formula>
<mml:math display="inline" id="im230">
<mml:mrow>
<mml:mn>5</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula>
<mml:math display="inline" id="im231">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula>
<mml:math display="inline" id="im232">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> filters and a <inline-formula>
<mml:math display="inline" id="im233">
<mml:mrow>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> max-pooling operation simultaneously. The features extracted by individual operations of the Inception module are represented in <xref ref-type="fig" rid="f12">
<bold>Figures&#xa0;12A&#x2013;D</bold>
</xref>, and the concatenation of all features extracted by all four operations of the Inception module is shown in <xref ref-type="fig" rid="f12">
<bold>Figure&#xa0;12E</bold>
</xref>. It can be observed from <xref ref-type="fig" rid="f12">
<bold>Figure&#xa0;12E</bold>
</xref> that the features captured by the Inception module are much richer in quality as compared to the MLP module. Moreover, the Inception module is able to capture more number of features than the MLP module. Hence, in this research work, the MLP module of ViT model&#x2019;s encoder is replaced with the Inception module to form the Trans-Inception block, and these multiple Trans-Inception blocks are stacked together to form the novel TrIncNet model. In the next subsection, the TrIncNet model&#x2019;s performance is compared with the ViT model and six state-of-the-art CNN architectures on the Maize dataset (which comprises real-field leaf images with complex backgrounds) and PlantVillage dataset, which acts as a benchmark dataset for plant disease detection problems.</p>
<p>It can be concluded from the above discussion that the TrIncNet model has achieved remarkable performance in diagnosing plant disease either in lab conditions or in real-field conditions with the minimum number of weight parameters. Therefore, it can be integrated with different IoT devices to assist farmers in identifying plant diseases at the earliest possible stage.</p>
</sec>
</sec>
<sec id="s6" sec-type="discussion">
<label>6</label>
<title>Discussion</title>
<p>This research aims to efficiently and effectively detect plant diseases by using digital images of their leaves and machine intelligence. The majority of the related studies have utilized various ML techniques (<xref ref-type="bibr" rid="B24">Khan et&#xa0;al., 2022</xref>), CNN-based techniques (<xref ref-type="bibr" rid="B2">Atila et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B13">Dhaka et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B38">Tiwari et&#xa0;al., 2021</xref>), ViT-based techniques (<xref ref-type="bibr" rid="B37">Thai et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B42">Wu et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B9">Borhani et&#xa0;al., 2022</xref>), or combination of ViT and CNN techniques (<xref ref-type="bibr" rid="B44">Zhang et&#xa0;al., 2022</xref>) to identify plant diseases, but all of these works have used the computationally expensive MLP module in the encoder block of ViT model. Thus, in the proposed TrIncNet model, the MLP module has been replaced with the Inception module in the ViT model&#x2019;s encoder block to reduce the computational complexity of the ViT model. Furthermore, the TrIncNet model is much more resistant to the vanishing gradient problem than the ViT model, as it comprises of skip connections around each Trans-Inception block. Results obtained from the experimentation performed on two different datasets (Maize dataset and PlantVillage dataset) showed that despite of utilizing the minimum number of trainable weight parameters, the proposed TrIncNet model achieved the highest testing accuracy in identifying plant diseases <italic>via</italic> digital leaf images obtained either from labs or farmlands.</p>
<p>Experimental results revealed that the TrIncNet model attained higher testing accuracy than the ViT model. This trend of the results can be argued on the fact that in the Trans-Inception block of the proposed TrIncNet model, the MLP module is replaced with the Inception module, which can effectively and efficiently extract various spatial and temporal features from leaf images. This replacement also reduced the number of trainable weight parameters used by the proposed TrIncNet model, as the Inception module performs convolution and max-pooling operations which require lesser trainable weight parameters than the fully connected layers present in the MLP module. It can be seen from <xref ref-type="table" rid="T5">
<bold>Tables&#xa0;5</bold>
</xref>, <xref ref-type="table" rid="T6">
<bold>6</bold>
</xref> that, on both datasets, the proposed model also got higher testing accuracy with a significantly lesser number of trainable weight parameters than the six state-of-the-art CNN architectures and the research work done by (<xref ref-type="bibr" rid="B2">Atila et&#xa0;al., 2021</xref>; <xref ref-type="bibr" rid="B18">Haque et&#xa0;al., 2022</xref>; <xref ref-type="bibr" rid="B1">Ahmad et&#xa0;al., 2023</xref>; <xref ref-type="bibr" rid="B23">Kaya and G&#xfc;rsoy, 2023</xref>).</p>
<p>Conclusively, it can be said that the TrIncNet model proposed in this study has the potential to efficiently and effectively identify plant diseases <italic>via</italic> their digital leaf images captured either from the lab or agricultural fields with high accuracy. Moreover, the low computational complexity of the proposed model improves its training and inferencing speed. This study is also opened a new arena for further improvements in the ViT model&#x2019;s architecture for plant disease detection and other image-based tasks. In this research work, the proposed model&#x2019;s performance is evaluated on only two datasets; however, in the future, it is planned to train the model on other plant disease detection datasets that encompass leaf images with a wider range of diseases. Furthermore, the future work also includes the deployment of the proposed model on IoT devices such as UAVs, enabling real-time plant disease detection in agricultural fields.</p>
</sec>
<sec id="s7" sec-type="conclusions">
<label>7</label>
<title>Conclusion</title>
<p>Identifying plant diseases in their earliest possible infestation stage is one of the major research problems in the agricultural sector because it can potentially maximize crop yield and profit of the farmers. In order to solve this research problem, many researchers applied various ML techniques, CNN-based techniques, the combination of CNN and ML techniques, ViT-based techniques, or a combination of CNN and ViT for automatically diagnosing diseases in plants. However, none of the research works removed the MLP block from the ViT model&#x2019;s encoder block, as it was a computationally expensive module as well as inefficient in extracting features from images. Hence, in this research work, a novel TrIncNet model was proposed, which contains multiple stacked Trans-Inception blocks. The proposed Trans-Inception block was designed by replacing the MLP module with the Inception module in the original ViT model&#x2019;s encoder block. Moreover, in the TrIncNet model, each Trans-Inception block was surrounded by a skip connection which made the proposed model much more resistant to the vanishing gradient problem. The performance of TrIncNet model compared with the ViT model and six state-of-the-art CNN architectures (ResNet-50, VGG-19, GoogLeNet, Xception, InceptionV3, and MobileNet) using the PlantVillage dataset (benchmark dataset for plant disease detection problems) and Maize dataset (contains real-in-field leaf images with complex background). During experimental study, it was found that the TrIncNet model outperformed the ViT model and six CNN architectures with testing accuracies of 99.93% and 96.93% for the PlantVillage dataset and Maize dataset, respectively. Moreover, during experimentation, it was found that the proposed model used 6.94 million trainable weight parameters, which was the minimum among the ViT model and six state-of-the-art CNN architectures. The TrIncNet model&#x2019;s performance has also been compared with other research works present in the literature, and its performance was found best among all of them.</p>
</sec>
<sec id="s9" sec-type="data-availability">
<title>Data availability statement</title>
<p>The experimentation of this research work has been carried on two datasets: PlantVillage dataset and Maize dataset. The PlantVillage dataset, is openly available on <ext-link ext-link-type="uri" xlink:href="https://github.com/spMohanty/PlantVillage-Dataset/tree/master/raw">https://github.com/spMohanty/PlantVillage-Dataset/tree/master/raw</ext-link>, and the Maize dataset will be available from the corresponding author on reasonable request.</p>
</sec>
<sec id="s10" sec-type="author-contributions">
<title>Author contributions</title>
<p>PG: Conceptualization, Methodology, Software, Writing - Original Draft, Visualization; PB: Project Administration, Writing - Review and Editing, Supervision, Formal analysis, Conceptualization, Methodology; SM: Writing Review and Editing, Formal Analysis, Resources; MH: Writing Review and Editing, Formal Analysis, Resources, Software; CD: Writing Review and Editing, Formal Analysis, Resources. All authors contributed to the article and approved the submitted version.</p>
</sec>
</body>
<back>
<ack>
<title>Acknowledgments</title>
<p>The authors are thankful for the resources and support provided by ICAR-Indian Agricultural Statistical Research Institute (ICAR-IASRI) and National Agricultural Higher Education Project (NAHEP) Component 2, ICAR. Furthermore, the authors are also grateful for the support given by the ICAR-Indian Institute of Maize Research (ICAR-IIMR) and ICAR-National Agriculture Science Fund. The first author expresses his gratitude to the University Grants Commission (UGC) for providing Junior Research Fellowship Ref. No. 3607/(NET-JULY2018) during his Ph.D. work.</p>
</ack>
<sec id="s11" 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="s12" 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>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahmad</surname> <given-names>A.</given-names>
</name>
<name>
<surname>El Gamal</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Saraswat</surname> <given-names>D.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Toward generalization of deep learning-based plant disease identification under controlled and field conditions</article-title>. <source>IEEE Access</source> <volume>11</volume>, <fpage>9042</fpage>&#x2013;<lpage>9057</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ACCESS.2023.3240100</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Atila</surname> <given-names>&#xdc;.</given-names>
</name>
<name>
<surname>U&#xe7;ar</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Akyol</surname> <given-names>K.</given-names>
</name>
<name>
<surname>U&#xe7;ar</surname> <given-names>E.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Plant leaf disease classification using EfficientNet deep learning model</article-title>. <source>Ecol. Inform</source> <volume>61</volume>, <fpage>101182</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecoinf.2020.101182</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Ba</surname> <given-names>J. L.</given-names>
</name>
<name>
<surname>Kiros</surname> <given-names>J. R.</given-names>
</name>
<name>
<surname>Hinton</surname> <given-names>G. E.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>Layer normalization</article-title>,&#x201d; in <source>30th conference on neural information processing systems</source>. Eds. <person-group person-group-type="editor">
<name>
<surname>Lee</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Sugiyama</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Luxburg</surname> <given-names>U.</given-names>
</name>
<name>
<surname>Guyon</surname> <given-names>I.</given-names>
</name>
<name>
<surname>Garnett</surname> <given-names>R.</given-names>
</name>
</person-group> (<publisher-loc>Barcelona Spain</publisher-loc>: <publisher-name>Curran Associates, Inc</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>14</lpage>.</citation>
</ref>
<ref id="B4">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Bana</surname> <given-names>T.</given-names>
</name>
<name>
<surname>Loya</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Kulkarni</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). &#x201c;<article-title>ViT - inception - GAN for image colourisation</article-title>,&#x201d; in <source>International conference on machine learning, optimization, and data science</source> (<publisher-loc>Grasmere, United Kingdom</publisher-loc>: <publisher-name>Springer Science and Business Media Deutschland GmbH</publisher-name>), <fpage>105</fpage>&#x2013;<lpage>118</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/978-3-030-95467-3_8/COVER</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bedi</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Gole</surname> <given-names>P.</given-names>
</name>
</person-group> (<year>2021</year>a). <article-title>Plant disease detection using hybrid model based on convolutional autoencoder and convolutional neural network</article-title>. <source>Artif. Intell. Agric.</source> <volume>5</volume>, <fpage>90</fpage>&#x2013;<lpage>101</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.aiia.2021.05.002</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Bedi</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Gole</surname> <given-names>P.</given-names>
</name>
</person-group> (<year>2021</year>b). &#x201c;<article-title>PlantGhostNet: an efficient novel convolutional neural network model to identify plant diseases automatically</article-title>,&#x201d; in <conf-name>2021 9th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)</conf-name>, (<publisher-loc>Noida, India</publisher-loc>), <publisher-name>IEEE</publisher-name>. <fpage>1</fpage>&#x2013;<lpage>6</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ICRITO51393.2021.9596543</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Bedi</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Gole</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Agarwal</surname> <given-names>S. K.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>8 using deep learning for image-based plant disease detection</article-title>,&#x201d; in <source>Internet Of things and machine learning in agriculture</source> (<publisher-name>De Gruyter</publisher-name>). doi:&#xa0;<pub-id pub-id-type="doi">10.1515/9783110691276-018</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Biswas</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Yadav</surname> <given-names>R. K.</given-names>
</name>
</person-group> (<year>2023</year>). &#x201c;<article-title>A review of convolutional neural network-based approaches for disease detection in plants</article-title>,&#x201d; in <conf-name>2023 International Conference on Intelligent Data Communication Technologies and Internet of Things (IDCIoT)</conf-name>, <conf-loc>Bengaluru, India</conf-loc>: <publisher-name>IEEE</publisher-name>. <fpage>514</fpage>&#x2013;<lpage>518</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/IDCIoT56793.2023.10053428</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Borhani</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Khoramdel</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Najafi</surname> <given-names>E.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A deep learning based approach for automated plant disease classification using vision transformer</article-title>. <source>Sci. Rep.</source> <volume>12</volume>, <fpage>11554</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1038/s41598-022-15163-0</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Chand</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Singh</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2022</year>) <source>Workforce changes and employment some findings from PLFS data series NITI aayog government of India new Delhi</source> (<publisher-loc>New Delhi</publisher-loc>). Available at: <uri xlink:href="https://www.niti.gov.in/sites/default/files/2022-04/Discussion_Paper_on_Workforce_05042022.pdf">https://www.niti.gov.in/sites/default/files/2022-04/Discussion_Paper_on_Workforce_05042022.pdf</uri> (Accessed <access-date>March 2, 2023</access-date>).</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Zeb</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Nanehkaran</surname> <given-names>Y. A.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Attention embedded lightweight network for maize disease recognition</article-title>. <source>Plant Pathol.</source> <volume>70</volume>, <fpage>630</fpage>&#x2013;<lpage>642</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1111/ppa.13322</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Chollet</surname> <given-names>F.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Xception: deep learning with depthwise separable convolutions</article-title>,&#x201d; in <conf-name>2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</conf-name>, <conf-loc>Honolulu, HI, USA</conf-loc>: <publisher-name>IEEE</publisher-name>. <fpage>1800</fpage>&#x2013;<lpage>1807</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/CVPR.2017.195</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dhaka</surname> <given-names>V. S.</given-names>
</name>
<name>
<surname>Meena</surname> <given-names>S. V.</given-names>
</name>
<name>
<surname>Rani</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Sinwar</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Kavita</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Ijaz</surname> <given-names>M. F.</given-names>
</name>
<etal/>
</person-group>. (<year>2021</year>). <article-title>A survey of deep convolutional neural networks applied for prediction of plant leaf diseases</article-title>. <source>Sensors</source> <volume>21</volume>, <fpage>4749</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/s21144749</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Dosovitskiy</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Beyer</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Kolesnikov</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Weissenborn</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Zhai</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Unterthiner</surname> <given-names>T.</given-names>
</name>
<etal/>
</person-group>. (<year>2021</year>). &#x201c;<article-title>An image is worth 16x16 words: transformers for image recognition at scale</article-title>,&#x201d; in <conf-name>9th International Conference on Learning Representations</conf-name>. <fpage>1</fpage>&#x2013;<lpage>22</lpage>(<publisher-loc>Austria</publisher-loc>: <uri xlink:href="https://OpenReview.net">https://OpenReview.net</uri>).</citation>
</ref>
<ref id="B15">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Goodfellow</surname> <given-names>I.</given-names>
</name>
<name>
<surname>Bengio</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Courville</surname> <given-names>A.</given-names>
</name>
</person-group> (<year>2016</year>). <source>Deep learning</source>. <edition>1st ed</edition> (<publisher-loc>Cambridge, United Kingdom</publisher-loc>: <publisher-name>The MIT Press</publisher-name>).</citation>
</ref>
<ref id="B16">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Han</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Tian</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Guo</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>C.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>GhostNet: more features from cheap operations</article-title>,&#x201d; in <conf-name>2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)</conf-name>, <conf-loc>Seattle, WA, USA</conf-loc>: <publisher-name>IEEE</publisher-name>. <fpage>1577</fpage>&#x2013;<lpage>1586</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/CVPR42600.2020.00165</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Haque</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Marwaha</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Arora</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Kumar Paul</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Singh Hooda</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Sharma</surname> <given-names>A.</given-names>
</name>
<etal/>
</person-group>. (<year>2021</year>). <article-title>Image-based identification of maydis leaf blight disease of maize (Zea mays) using deep learning</article-title>. <source>Indian J. Agric. Sci.</source> <volume>91</volume>, <fpage>1362</fpage>&#x2013;<lpage>1369</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.56093/ijas.v91i9.116089</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Haque</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Marwaha</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Deb</surname> <given-names>C. K.</given-names>
</name>
<name>
<surname>Nigam</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Arora</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Hooda</surname> <given-names>K. S.</given-names>
</name>
<etal/>
</person-group>. (<year>2022</year>). <article-title>Deep learning-based approach for identification of diseases of maize crop</article-title>. <source>Sci. Rep.</source> <volume>12</volume>, <fpage>1</fpage>&#x2013;<lpage>14</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1038/s41598-022-10140-z</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="confproc">
<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>2016</year>). &#x201c;<article-title>Deep residual learning for image recognition</article-title>,&#x201d; in <conf-name>2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</conf-name>, <conf-loc>Las Vegas, NV, USA</conf-loc>: <publisher-name>IEEE</publisher-name>. <fpage>770</fpage>&#x2013;<lpage>778</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/CVPR.2016.90</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Howard</surname> <given-names>A. G.</given-names>
</name>
<name>
<surname>Zhu</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Kalenichenko</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Weyand</surname> <given-names>T.</given-names>
</name>
<etal/>
</person-group>. (<year>2017</year>). <article-title>MobileNets: efficient convolutional neural networks for mobile vision applications</article-title>. <source>arXiv preprint arXiv</source>. <page-range>1-9</page-range>. doi:&#xa0;<pub-id pub-id-type="doi">10.48550/arXiv.1704.04861</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Hu</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Shen</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>G.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Squeeze-and-Excitation networks</article-title>,&#x201d; in <conf-name>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</conf-name>, <conf-loc>Salt Lake City, UT, USA: IEEE</conf-loc>. <fpage>7132</fpage>&#x2013;<lpage>7141</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/CVPR.2018.00745</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Karthik</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Hariharan</surname> <given-names>M.</given-names>
</name>
<name>
<surname>Anand</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Mathikshara</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Johnson</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Menaka</surname> <given-names>R.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Attention embedded residual CNN for disease detection in tomato leaves</article-title>. <source>Appl. Soft Computing J.</source> <volume>86</volume>, <elocation-id>105933</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.asoc.2019.105933</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kaya</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>G&#xfc;rsoy</surname> <given-names>E.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A novel multi-head CNN design to identify plant diseases using the fusion of RGB images</article-title>. <source>Ecol. Inform</source> <volume>75</volume>, <elocation-id>101998</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecoinf.2023.101998</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khan</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Vibhute</surname> <given-names>A. D.</given-names>
</name>
<name>
<surname>Mali</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Patil</surname> <given-names>C. H.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A systematic review on hyperspectral imaging technology with a machine and deep learning methodology for agricultural applications</article-title>. <source>Ecol. Inform</source> <volume>69</volume>, <elocation-id>101678</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/J.ECOINF.2022.101678</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname> <given-names>E.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Xie</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Gao</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Su</surname> <given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A novel deep learning method for maize disease identification based on small sample-size and complex background datasets</article-title>. <source>Ecol. Inform</source> <volume>75</volume>, <elocation-id>102011</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecoinf.2023.102011</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lu</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Yang</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Zhou</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Jiao</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>F.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>Y.</given-names>
</name>
<etal/>
</person-group>. (<year>2022</year>). <article-title>A hybrid model of ghost-convolution enlightened transformer for effective diagnosis of grape leaf disease and pest</article-title>. <source>J. King Saud Univ. - Comput. Inf. Sci.</source> <volume>34</volume>, <fpage>1755</fpage>&#x2013;<lpage>1767</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.jksuci.2022.03.006</pub-id>
</citation>
</ref>
<ref id="B27">
<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>Salath&#xe9;</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>Front. Plant Sci.</source> <volume>7</volume>. doi:&#xa0;<pub-id pub-id-type="doi">10.3389/fpls.2016.01419</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Naik</surname> <given-names>B. N.</given-names>
</name>
<name>
<surname>Malmathanraj</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Palanisamy</surname> <given-names>P.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Detection and classification of chilli leaf disease using a squeeze-and-excitation-based CNN model</article-title>. <source>Ecol. Inform</source> <volume>69</volume>, <elocation-id>101663</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecoinf.2022.101663</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nigam</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Jain</surname> <given-names>R.</given-names>
</name>
<name>
<surname>Marwaha</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Arora</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Md.</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Dheeraj</surname> <given-names>A.</given-names>
</name>
<etal/>
</person-group>. (<year>2023</year>). <article-title>Deep transfer learning model for disease identification in wheat crop</article-title>. <source>Ecol. Inform</source> <volume>75</volume>, <elocation-id>102068</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecoinf.2023.102068</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pandey</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Jain</surname> <given-names>K.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A robust deep attention dense convolutional neural network for plant leaf disease identification and classification from smart phone captured real world images</article-title>. <source>Ecol. Inform</source> <volume>70</volume>, <fpage>101725</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecoinf.2022.101725</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sakkarvarthi</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Sathianesan</surname> <given-names>G. W.</given-names>
</name>
<name>
<surname>Murugan</surname> <given-names>V. S.</given-names>
</name>
<name>
<surname>Reddy</surname> <given-names>A. J.</given-names>
</name>
<name>
<surname>Jayagopal</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Elsisi</surname> <given-names>M.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Detection and classification of tomato crop disease using convolutional neural network</article-title>. <source>Electron. (Basel)</source> <volume>11</volume>, <elocation-id>3618</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/electronics11213618</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sharma</surname> <given-names>V.</given-names>
</name>
<name>
<surname>Tripathi</surname> <given-names>A. K.</given-names>
</name>
<name>
<surname>Mittal</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>DLMC-net: deeper lightweight multi-class classification model for plant leaf disease detection</article-title>. <source>Ecol. Inform</source> <volume>75</volume>, <elocation-id>102025</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecoinf.2023.102025</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Si</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Yu</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Zhou</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Zhou</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Yan</surname> <given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). &#x201c;<article-title>Inception transformer</article-title>,&#x201d; in <conf-name>36th Conference on Neural Information Processing Systems</conf-name>, <conf-loc>Los Angels, USA</conf-loc>: <publisher-name>Curran Associates, Inc</publisher-name>. <fpage>1</fpage>&#x2013;<lpage>17</lpage>.</citation>
</ref>
<ref id="B34">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Simonyan</surname> <given-names>K.</given-names>
</name>
<name>
<surname>Zisserman</surname> <given-names>A.</given-names>
</name>
</person-group> (<year>2015</year>). &#x201c;<article-title>Very deep convolutional networks for Large-scale image recognition</article-title>,&#x201d; in <source>3rd international conference on learning representations</source>. Eds. <person-group person-group-type="editor">
<name>
<surname>Bengio</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>LeCun</surname> <given-names>Y.</given-names>
</name>
</person-group> (<publisher-loc>San Diego, CA</publisher-loc>: <publisher-name>OpenReview.net</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>14</lpage>.</citation>
</ref>
<ref id="B36">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Szegedy</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Liu</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Yangqing</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Sermanet</surname> <given-names>P.</given-names>
</name>
<name>
<surname>Reed</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Anguelov</surname> <given-names>D.</given-names>
</name>
<etal/>
</person-group>. (<year>2015</year>). &#x201c;<article-title>Going deeper with convolutions</article-title>,&#x201d; in <conf-name>2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</conf-name>, <conf-loc>Boston, MA, USA</conf-loc>: <publisher-name>IEEE</publisher-name>. <fpage>1</fpage>&#x2013;<lpage>9</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/CVPR.2015.7298594</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Szegedy</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Vanhoucke</surname> <given-names>V.</given-names>
</name>
<name>
<surname>Ioffe</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Shlens</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Wojna</surname> <given-names>Z.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>Rethinking the inception architecture for computer vision</article-title>,&#x201d; in <conf-name>2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (IEEE)</conf-name>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/CVPR.2016.308</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Thai</surname> <given-names>H. T.</given-names>
</name>
<name>
<surname>Tran-Van</surname> <given-names>N. Y.</given-names>
</name>
<name>
<surname>Le</surname> <given-names>K. H.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>Artificial cognition for early leaf disease detection using vision transformers</article-title>,&#x201d; in <conf-name>International Conference on Advanced Technologies for Communications</conf-name>, <conf-loc>Ho Chi Minh City, Vietnam</conf-loc>: <publisher-name>IEEE</publisher-name>. <fpage>33</fpage>&#x2013;<lpage>38</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ATC52653.2021.9598303</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tiwari</surname> <given-names>V.</given-names>
</name>
<name>
<surname>Joshi</surname> <given-names>R. C.</given-names>
</name>
<name>
<surname>Dutta</surname> <given-names>M. K.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Dense convolutional neural networks based multiclass plant disease detection and classification using leaf images</article-title>. <source>Ecol. Inform</source> <volume>63</volume>, <fpage>101289</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ecoinf.2021.101289</pub-id>
</citation>
</ref>
<ref id="B39">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Trivedi</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Shamnani</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Gajjar</surname> <given-names>R.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Plant leaf disease detection using machine learning</article-title>,&#x201d; in <source>Communications in computer and information science</source> (<publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>267</fpage>&#x2013;<lpage>276</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/978-981-15-7219-7_23</pub-id>
</citation>
</ref>
<ref id="B40">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Varshney</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Babukhanwala</surname> <given-names>B.</given-names>
</name>
<name>
<surname>Khan</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Saxena</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Singh</surname> <given-names>A. K.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>Machine learning techniques for plant disease detection</article-title>,&#x201d; in <conf-name>Proceedings of the 5th International Conference on Trends in Electronics and Informatics, ICOEI 2021</conf-name>, <conf-loc>Tirunelveli, India</conf-loc>: <publisher-name>IEEE</publisher-name>. <fpage>1574</fpage>&#x2013;<lpage>1581</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/ICOEI51242.2021.9453053</pub-id>
</citation>
</ref>
<ref id="B41">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Vaswani</surname> <given-names>A.</given-names>
</name>
<name>
<surname>Brain</surname> <given-names>G.</given-names>
</name>
<name>
<surname>Shazeer</surname> <given-names>N.</given-names>
</name>
<name>
<surname>Parmar</surname> <given-names>N.</given-names>
</name>
<name>
<surname>Uszkoreit</surname> <given-names>J.</given-names>
</name>
<name>
<surname>Jones</surname> <given-names>L.</given-names>
</name>
<etal/>
</person-group>. (<year>2017</year>)<article-title>Attention is all you need</article-title>. In: <source>31st conference on neural information processing systems</source> (<publisher-loc>California, USA</publisher-loc>: <publisher-name>Curran Associates, Inc</publisher-name>). Available at: <uri xlink:href="https://proceedings.neurips.cc/paper/2017/file/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf">https://proceedings.neurips.cc/paper/2017/file/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf</uri> (Accessed <access-date>March 30, 2022</access-date>).</citation>
</ref>
<ref id="B42">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Wu</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Huang</surname> <given-names>H.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>Multi-granularity feature extraction based on vision transformer for tomato leaf disease recognition</article-title>,&#x201d; in <conf-name>2021 3rd International Academic Exchange Conference on Science and Technology Innovation (IAECST)</conf-name>, <conf-loc>Guangzhou, China</conf-loc>: <publisher-name>IEEE</publisher-name>. <fpage>387</fpage>&#x2013;<lpage>390</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/IAECST54258.2021.9695688</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xiang</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Liang</surname> <given-names>Q.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>W.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>D.</given-names>
</name>
<name>
<surname>Wang</surname> <given-names>Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>L-CSMS: novel lightweight network for plant disease severity recognition</article-title>. <source>J. Plant Dis. Prot.</source> <volume>128</volume>, <fpage>557</fpage>&#x2013;<lpage>569</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1007/S41348-020-00423-W/TABLES/6</pub-id>
</citation>
</ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Wa</surname> <given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname> <given-names>L.</given-names>
</name>
<name>
<surname>Lv</surname> <given-names>C.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Automatic plant disease detection based on tranvolution detection network with GAN modules using leaf images</article-title>. <source>Front. Plant Sci.</source> <volume>13</volume>. doi:&#xa0;<pub-id pub-id-type="doi">10.3389/fpls.2022.875693</pub-id>
</citation>
</ref>
<ref id="B45">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname> <given-names>Y.</given-names>
</name>
<name>
<surname>Sun</surname> <given-names>C.</given-names>
</name>
<name>
<surname>Xu</surname> <given-names>X.</given-names>
</name>
<name>
<surname>Chen</surname> <given-names>J.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>RIC-net: a plant disease classification model based on the fusion of inception and residual structure and embedded attention mechanism</article-title>. <source>Comput. Electron Agric.</source> <volume>193</volume>, <elocation-id>106644</elocation-id>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/J.COMPAG.2021.106644</pub-id>
</citation>
</ref>
</ref-list>
<app-group>
<app id="app1">
<title>Appendix</title>
<p>
<bold>Asymptomatic analysis on the number of weight parameters used by the Inception module</bold>
</p>
<p>Let the input to the Inception module is <inline-formula>
<mml:math display="inline" id="im234">
<mml:mrow>
<mml:mi>I</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>&#x211d;</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> containing <inline-formula>
<mml:math display="inline" id="im235">
<mml:mi>M</mml:mi>
</mml:math>
</inline-formula> patches, and each patch is of size <inline-formula>
<mml:math display="inline" id="im236">
<mml:mi>N</mml:mi>
</mml:math>
</inline-formula>. Since the Inception module uses two-dimensional convolution operations, therefore <inline-formula>
<mml:math display="inline" id="im237">
<mml:mi>I</mml:mi>
</mml:math>
</inline-formula> must be reshaped to <inline-formula>
<mml:math display="inline" id="im238">
<mml:mrow>
<mml:msup>
<mml:mi>I</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>&#x211d;</mml:mi>
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, assuming that the value of <inline-formula>
<mml:math display="inline" id="im239">
<mml:mi>N</mml:mi>
</mml:math>
</inline-formula> is a perfect square (i.e., <inline-formula>
<mml:math display="inline" id="im240">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>). The asymptomatic analysis is done on each operation present in the Inception module (shown by numbers in <xref ref-type="fig" rid="f13">
<bold>Figure&#xa0;A1</bold>
</xref>).</p>
<fig id="f13" position="float">
<label>Figure&#xa0;A1</label>
<caption>
<p>Block diagram of the Inception module.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fpls-14-1221557-g013.tif"/>
</fig>
<p>The number of weight parameters used in convolution operation can be expressed by equation (7) (<xref ref-type="bibr" rid="B15">Goodfellow et&#xa0;al., 2016</xref>).</p>
<disp-formula>
<label>(7)</label>
<mml:math display="block" id="M7">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:math>
</disp-formula>
<p>where:</p>
<p>
<inline-formula>
<mml:math display="inline" id="im241">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>:</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> number of weight parameters used in convolution operation</p>
<p>
<inline-formula>
<mml:math display="inline" id="im242">
<mml:mrow>
<mml:msub>
<mml:mi>I</mml:mi>
<mml:mi>F</mml:mi>
</mml:msub>
<mml:mo>:</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> number of filters applied</p>
<p>
<inline-formula>
<mml:math display="inline" id="im243">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mo>:</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> depth of input feature map</p>
<p>
<inline-formula>
<mml:math display="inline" id="im244">
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>:</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> convolution filter&#x2019;s size</p>
<p>Let the number of filters used in operation <inline-formula>
<mml:math display="inline" id="im245">
<mml:mi>i</mml:mi>
</mml:math>
</inline-formula> is <inline-formula>
<mml:math display="inline" id="im246">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula>
<mml:math display="inline" id="im247">
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>=</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mn>7</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> (shown in <xref ref-type="fig" rid="f13">
<bold>Figure&#xa0;A1</bold>
</xref>). Then the number of weight parameters used in each operation is computed in <xref ref-type="table" rid="T7">
<bold>Table&#xa0;A1</bold>
</xref>.</p>
<table-wrap id="T7" position="float">
<label>Table&#xa0;A1</label>
<caption>
<p>Asymptomatic computation of weight parameters used by an inexpensive version of the Inception module.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="top" align="left">Operation number</th>
<th valign="top" align="center">Input shape</th>
<th valign="top" align="center">Output shape</th>
<th valign="top" align="center">Number of weight parameters (asymptomatically)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">
<bold>Operation 1</bold>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im248">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im249">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im250">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mo>=</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mi>M</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Operation 2</bold>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im251">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im252">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im253">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mi>M</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Operation 3</bold>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im254">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im255">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im256">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mi>M</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Operation 4</bold>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im257">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im258">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">0 (max-pooling operation does not require any weight parameters)</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Operation 5</bold>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im259">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im260">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im261">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>9</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Operation 6</bold>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im262">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im263">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>6</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im264">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>6</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>5</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>5</mml:mn>
<mml:mo>=</mml:mo>
<mml:mn>25</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>6</mml:mn>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>6</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
<tr>
<td valign="top" align="left">
<bold>Operation 7</bold>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im265">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im266">
<mml:mrow>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msqrt>
<mml:mi>N</mml:mi>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>7</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
<td valign="top" align="left">
<inline-formula>
<mml:math display="inline" id="im267">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>7</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>=</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>7</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>7</mml:mn>
</mml:msub>
<mml:mi>M</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>By combining the number of weight parameters used in each operation of the Inception module (given in <xref ref-type="table" rid="T7">
<bold>Table&#xa0;A1</bold>
</xref>), the total number of weight parameters used in this module can be calculated as <inline-formula>
<mml:math display="inline" id="im268">
<mml:mrow>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mi>M</mml:mi>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mi>M</mml:mi>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mi>M</mml:mi>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>6</mml:mn>
</mml:msub>
<mml:mo>+</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>7</mml:mn>
</mml:msub>
<mml:mi>M</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. If <inline-formula>
<mml:math display="inline" id="im269">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mo>=</mml:mo>
<mml:mi>max</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>6</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mn>7</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, then the above expression can be simplified to <inline-formula>
<mml:math display="inline" id="im270">
<mml:mrow>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mn>4</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mi>M</mml:mi>
<mml:mo>+</mml:mo>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>&#x21d2;</mml:mo>
<mml:mi mathvariant="script">O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>M</mml:mi>
<mml:mo>+</mml:mo>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>Hence, the total number of trainable weight parameters required to implement an inexpensive Inception module can be expressed by <inline-formula>
<mml:math display="inline" id="im271">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>I</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> in equation (8).</p>
<disp-formula>
<label>(8)</label>
<mml:math display="block" id="M8">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>I</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>=</mml:mo>
<mml:mi>max</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>M</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>=</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>M</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>&lt;</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>F</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mo>&#xa0;</mml:mo>
<mml:mi>F</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
</app>
</app-group>
</back>
</article>