<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">41523</article-id>
<article-id pub-id-type="doi">10.32604/csse.2023.041523</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Entropy Based Feature Fusion Using Deep Learning for Waste Object Detection and Classification Model</article-title>
<alt-title alt-title-type="left-running-head">Entropy Based Feature Fusion Using Deep Learning for Waste Object Detection and Classification Model</alt-title>
<alt-title alt-title-type="right-running-head">Entropy Based Feature Fusion Using Deep Learning for Waste Object Detection and Classification Model</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Ashary</surname><given-names>Ehab Bahaudien</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Jambi</surname><given-names>Sahar</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Ashari</surname><given-names>Rehab B.</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Ragab</surname><given-names>Mahmoud</given-names></name><xref ref-type="aff" rid="aff-3">3</xref><xref ref-type="aff" rid="aff-4">4</xref><email>mragab@kau.edu.sa</email></contrib>
<aff id="aff-1"><label>1</label><institution>Electrical and Computer Engineering Department, Faculty of Engineering, King Abdulaziz University</institution>, <addr-line>Jeddah, 21589</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Information Systems Department, Faculty of Computing and Information Technology, King Abdulaziz University</institution>, <addr-line>Jeddah, 21589</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Information Technology Department, Faculty of Computing and Information Technology, King Abdulaziz University</institution>, <addr-line>Jeddah, 21589</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Mathematics, Faculty of Science, Al-Azhar University</institution>, <addr-line>Naser City, Cairo, 11884</addr-line>, <country>Egypt</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Mahmoud Ragab. Email: <email>mragab@kau.edu.sa</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic"><year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>09</day><month>11</month><year>2023</year></pub-date>
<volume>47</volume>
<issue>3</issue>
<fpage>2953</fpage>
<lpage>2969</lpage>
<history>
<date date-type="received"><day>26</day><month>4</month><year>2023</year></date>
<date date-type="accepted"><day>13</day><month>6</month><year>2023</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Ashary et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Ashary et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CSSE_41523.pdf"></self-uri>
<abstract>
<p>Object Detection is the task of localization and classification of objects in a video or image. In recent times, because of its widespread applications, it has obtained more importance. In the modern world, waste pollution is one significant environmental problem. The prominence of recycling is known very well for both ecological and economic reasons, and the industry needs higher efficiency. Waste object detection utilizing deep learning (DL) involves training a machine-learning method to classify and detect various types of waste in videos or images. This technology is utilized for several purposes recycling and sorting waste, enhancing waste management and reducing environmental pollution. Recent studies of automatic waste detection are difficult to compare because of the need for benchmarks and broadly accepted standards concerning the employed data and metrics. Therefore, this study designs an Entropy-based Feature Fusion using Deep Learning for Waste Object Detection and Classification (EFFDL-WODC) algorithm. The presented EFFDL-WODC system inherits the concepts of feature fusion and DL techniques for the effectual recognition and classification of various kinds of waste objects. In the presented EFFDL-WODC system, two major procedures can be contained, such as waste object detection and waste object classification. For object detection, the EFFDL-WODC technique uses a YOLOv7 object detector with a fusion-based backbone network. In addition, entropy feature fusion-based models such as VGG-16, SqueezeNet, and NASNet models are used. Finally, the EFFDL-WODC technique uses a graph convolutional network (GCN) model performed for the classification of detected waste objects. The performance validation of the EFFDL-WODC approach was validated on the benchmark database. The comprehensive comparative results demonstrated the improved performance of the EFFDL-WODC technique over recent approaches.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Object detection</kwd>
<kwd>object classification</kwd>
<kwd>waste management</kwd>
<kwd>deep learning</kwd>
<kwd>feature fusion</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Institutional Fund Projects</funding-source>
<award-id>557-135-1443</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Object detection is an easy task for humans. Children can start identifying typical objects, but teaching them to use the computer has been a challenging task for the past few years [<xref ref-type="bibr" rid="ref-1">1</xref>]. It identifies and localizes each instance of an object (like street signs, cars, persons, etc.,) within the field of view. Object detection aims at identifying the object in the images [<xref ref-type="bibr" rid="ref-2">2</xref>]. Object detection intends to identify each sample of the predefined classes and deliver its coarse localization in images by axis-aligned boxes [<xref ref-type="bibr" rid="ref-3">3</xref>]. It is seen as a supervised learning issue. Modern object detection methods have access to large labelled images for training and were assessed on different canonical benchmarks. Likewise, other tasks like motion prediction, classification, scene understanding, segmentation, etc. [<xref ref-type="bibr" rid="ref-4">4</xref>]. Were the basic issues in computer vision. Initial object detection techniques were constructed as an ensemble of handcrafted feature extractors like Histogram of Oriented Gradients (HOG), Viola-Jones detector, etc. Such techniques are inaccurate, slow, and poorly performed on unknown datasets [<xref ref-type="bibr" rid="ref-5">5</xref>].</p>
<p>Conversely, pollution relevant to solid waste mismanagement becomes a global concern [<xref ref-type="bibr" rid="ref-6">6</xref>]. In the past, the enormous production of disposable goods has led to a significant rise in waste; the European household waste report stated that 5.2 tonnes of waste are produced per inhabitant [<xref ref-type="bibr" rid="ref-7">7</xref>]. Also, by the year 2050, the World Bank predicts that it may exceed 3 billion tons per annum. These principles detail that various kinds of litter were dispersed freely in environments. Plastic waste is a main concern since it presents long-term environmental harm [<xref ref-type="bibr" rid="ref-8">8</xref>]. To prevent environmental pollution and, consequently, protect wild organisms and human life, immediate measures are necessary to enable wise segregation and collection of garbage. Machine learning (ML) is one way to support waste sorting [<xref ref-type="bibr" rid="ref-9">9</xref>]. Recently ML-related systems that can support sorting processes have been applied, hastening this procedure a result. After the success of implementing deep convolutional neural networks (DCNN) for image classification, object detection reached significant progress depending on deep learning (DL) methods [<xref ref-type="bibr" rid="ref-10">10</xref>]. The new DL-based techniques outperformed the conventional detection techniques by huge margins. Deep CNN is a biologically inspired structure for calculating hierarchical features.</p>
<p>This study designs an Entropy-based Feature Fusion using Deep Learning for Waste Object Detection and Classification (EFFDL-WODC) model. In the presented EFFDL-WODC system, two major procedures can be involved, such as waste object detection and waste object classification. For object detection, the EFFDL-WODC technique uses a YOLOv7 object detector with a fusion-based backbone network. In addition, entropy feature fusion-based models such as VGG-16, SqueezeNet, and NASNet models are used. Finally, the EFFDL-WODC technique uses a graph convolutional network (GCN) model executed for the classification of detected waste objects. The performance validation of the EFFDL-WODC algorithm was validated on the benchmark dataset.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Review</title>
<p>Majchrowska et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] introduced an innovative benchmark dataset to <italic>classify waste and detect waste</italic> were merged collections from the aforementioned open-source dataset with unified annotations that cover almost every waste category: <italic>non-recyclable, bio, plastic and metal, other, glass, paper</italic>, and <italic>unknown</italic>. Eventually, presented a 2-stage detector for classification and litter localization. To categorize the detected waste into 7 categories, EfficientDet-D2 was utilized for localizing EfficientNet-B2 and litter. In [<xref ref-type="bibr" rid="ref-12">12</xref>], a smart waste management system was developed using TensorFlow and LoRa communication protocol-related DL method. This object detection technique was trained with waste images to make frozen inference graphs utilized for detecting an object that is done using cameras. Rahman et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] introduced a method that presents an astute way to sort indigestible and digestible waste utilizing a CNN, a common DL paradigm.</p>
<p>In [<xref ref-type="bibr" rid="ref-14">14</xref>], devised ABRM-MGWODL approach targets to efficiently categorize and identify the waste materials to allow effective biomass recycling. The projected system follows 2 major procedures it can be waste object classification and waste object detection. The YOLOv4 approach was utilized in this study for the waste object detection and recognition procedure. Then, to classify recognized waste materials, the GCN approach was utilized. Lastly, with the modified grey wolf optimization approach, hyperparameter tuning of the GCN method was executed effectually, thereby enhancing the method&#x2019;s classifier outcome. Melinte et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] presented a study to enrich the performance of CNN object detectors used to identify municipal wastes. To gain a precise and fast CNN structure, many kinds of Regional Proposal Networks (RPN) and Single Shot Detectors (SSD) were fine-tuned on the TrashNet database.</p>
<p>Niu et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] modelled an innovative DL technique for solid waste mapping in higher resolution images. By incorporating a Swin-Transformer and a multi-scale dilated CNN, both global and local features have been aggregated. Reference [<xref ref-type="bibr" rid="ref-17">17</xref>] introduced a custom-built test rig to simulate real waste-gathered trucks that might be utilized to build the datasets and test different sensors. For the classifier task, CNNs were trained to 100% achieve accuracy.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>The Proposed Model</title>
<p>In this article, we have presented a novel EFFDL-WODC technique for accurate and automated detection and classification of waste objects. The projected EFFDL-WODC technique inherits the concepts of feature fusion and DL approaches for the effectual recognition and classification of various kinds of waste objects. In the projected EFFDL-WODC system, two major procedures can be contained, such as YOLOv7-based waste object detection and GCN-based waste object classification. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates the workflow of the EFFDL-WODC system.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Workflow of EFFDL-WODC approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-1.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Object Detector: YOLO-v7 Model</title>
<p>In the presented EFFDL-WODC technique, the YOLO-v7 object detector is used in this study. YOLOv7 recommends a re-parameterized convolution that contained concatenation or residual connections [<xref ref-type="bibr" rid="ref-18">18</xref>]; its RepConv could not take the same connection. RepConvN, which does not have any identity connections, serves as a proper replacement for it under this condition. Within the single convolution layer, RepConv exploits a fusion of identity connections, 3 &#x00D7; 3, and 1 &#x00D7; 1 convolutions. To design the structure of re-parameterized convolutional, the author applied RepConv without identity connections (RepConvN) after carrying out the study on the fusion of RepConv with several structures and the resultant efficiency of individual combinations. Based on the outcomes of the research work, it must not be some identity connection if the convolution layer, which comprises residual or concatenation, can be exchanged by re-parameterized convolutional. According to the structural diagram, the YOLOv7 network can be broken down into 3 various elements such as input, backbone, and head networks. The length and width of the mapping feature can be continually cut in half by Conv, BatchNorm and a SiLU (CBS) composite element, the efficient layer aggregation network (ELAN), and MP elements. Simultaneously, the count of output channels can be increased, equivalent to twice the count of input channels. The CBS combined element applied the convolutional &#x002B; BN &#x002B; activation function on the input mapping feature. It is proposed that utilize the ELAN element. At last, the output in the ELAN element takes twice as several channels as input. Afterwards, in the 1st convolutional, the breadth and length of the mapping feature can be cut in half by the lower branch, but the kernel size and stride can be improved by 1 and 2, correspondingly. The 2 levels of trees can be combined as one.</p>
<p>Most explanation programs&#x2019; output it is determining in the YOLO design that generates a single text document with annotation for every image. All the text files have annotations containing a bounding box called &#x201C;BBox&#x201D; for every graphical element which are demonstrated in the image. The scale of annotations is changed to it can be proportional to images, and its values differ from 0 in every system up to 1. <xref ref-type="disp-formula" rid="eqn-1">Eqs. (1)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-6">(6)</xref> is assisted as the basis for the adjustment method utilized in the computation utilizing the YOLO format.</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mi>d</mml:mi><mml:mi>w</mml:mi><mml:mspace width="thinmathspace" /><mml:mo>=</mml:mo><mml:mspace width="thinmathspace" /><mml:mfrac><mml:mn>1</mml:mn><mml:mi>W</mml:mi></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mi>x</mml:mi><mml:mspace width="thinmathspace" /><mml:mo>=</mml:mo><mml:mspace width="thinmathspace" /><mml:mfrac><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mo>+</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mfrac><mml:mspace width="thinmathspace" /><mml:mo>&#x00D7;</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>d</mml:mi><mml:mi>w</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mi>d</mml:mi><mml:mi>h</mml:mi><mml:mspace width="thinmathspace" /><mml:mo>=</mml:mo><mml:mspace width="thinmathspace" /><mml:mfrac><mml:mn>1</mml:mn><mml:mi>H</mml:mi></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mi>y</mml:mi><mml:mspace width="thinmathspace" /><mml:mo>=</mml:mo><mml:mspace width="thinmathspace" /><mml:mfrac><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mo>+</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mfrac><mml:mspace width="thinmathspace" /><mml:mo>&#x00D7;</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>d</mml:mi><mml:mi>h</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mi>w</mml:mi><mml:mspace width="thinmathspace" /><mml:mo>=</mml:mo><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mo>&#x2212;</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mo>&#x00D7;</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>d</mml:mi><mml:mi>w</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mi>h</mml:mi><mml:mspace width="thinmathspace" /><mml:mo>=</mml:mo><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mo>&#x2212;</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mo>&#x00D7;</mml:mo><mml:mi>d</mml:mi><mml:mi>h</mml:mi></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>H</mml:mi></mml:math></inline-formula> signifies the height of images, <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>d</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> denotes the absolute height of images, <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>W</mml:mi></mml:math></inline-formula> implies the width of images, and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>d</mml:mi><mml:mi>w</mml:mi></mml:math></inline-formula> stands for the absolute width of pictures.</p>
<fig id="fig-10">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-10.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Backbone Network: Feature Fusion-Based DL Model</title>
<p>In the backbone network of the YOLO-v7 model, the entropy-based feature fusion process is employed. Entropy-based feature fusion is a method used in ML to fuse features from various sources or models. The objective of feature fusion is to greater the robustness and accuracy of the method through additional data from various sources. In the entropy-based feature fusion method, the extracted feature from the models is estimated based on their entropy, a measure of the sum of randomness or uncertainty in the feature set. The feature with the lowest entropy contains more predictable and structured information, whereas the feature with high entropy contains more unpredictable or random data. The entropy of all the feature sets is evaluated, and the value is normalized to guarantee that they are on a similar scale. Then, the normalized entropy value is weighted dependent on the importance and summed to construct the weighted entropy value. The feature set with the lower weighted entropy value is selected as the combined feature set and utilized as input to the last model for the classification model. The sum of weights is equal to 1, (i.e., weight1 &#x002B; weight2 &#x002B; weight3 &#x003D; 1).</p>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>VGG-16 Model</title>
<p>VGG16 network is the first model applied for extracting feature sequences from the image. The structure of the convolution layer is similar to the VGG16 model [<xref ref-type="bibr" rid="ref-19">19</xref>], but a further block with 2 convolution and max pooling layers is used for downsampling the height of feature maps to <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mn>1</mml:mn></mml:math></inline-formula> and extracting additional abstract features. To downsample the feature map, all the convolutional layers are followed by the Maxpooling layer. The typical VGG16 model exploits 2 &#x00D7; 2 max pooling through the entire network and 3 <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mo>&#x00D7;</mml:mo></mml:math></inline-formula> 3 kernels in the convolution layer. VGG16 is a successive feature extraction that exploits a stack of max pooling and convolution layers for extracting the feature from the topmost layer to the bottommost layer. As mentioned before, the maximum depth of the VGG16 model degrades the network performance while it is training and causes the problem of disappearing gradients. This is because carrying out repetitive multiplication on the gradient makes their values very smaller while back propagated to the initial layer. To overcome these problems, a novel VGG16 model is developed, which integrates shortcut connections. The difference between the structure of convolution layers of the VGG16 and the new VGG16 model with shortcut connection. The output feature vector of typical VGG16 architecture was determined as follows:</p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mi>o</mml:mi><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>W</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>From the expression, W indicates the weight parameter of the learned feature, and <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>x</mml:mi></mml:math></inline-formula> denotes the input vector of the earlier layer. <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>f</mml:mi></mml:math></inline-formula> refers to the mapping function that learns the better value of W and maps <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>x</mml:mi></mml:math></inline-formula> into <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>o</mml:mi></mml:math></inline-formula>. Furthermore, <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>x</mml:mi></mml:math></inline-formula> is added afterwards to the <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>f</mml:mi></mml:math></inline-formula> function. Therefore, in the presented VGG16 model, the output feature vector <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>o</mml:mi></mml:math></inline-formula> can be formulated as follows:</p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:mi>o</mml:mi><mml:mo>=</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mo>}</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>In the above equation, <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the resultant feature vector of the initial convolution layer at <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>l</mml:mi></mml:math></inline-formula>-<inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> blocks, and <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the weight parameter of <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>i</mml:mi></mml:math></inline-formula>-<inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> convolutional layers.</p>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>SqueezeNet Model</title>
<p>The SqueezeNet model function as a feature extracted and allows the input image to progress forward; it still attains a layer which is previously set (extraction feature layer) [<xref ref-type="bibr" rid="ref-20">20</xref>]. The procedure ends now, with the final layer output applied as a feature. The SqueezeNet of pretrained CNN-DL can be utilized. The SqueezeNet aims to construct a small NN with any parameters that are appropriate to computer memory and is very simply transferred through a computer network. The key component of SqueezeNet is named the fire module. A fire module includes the convolutional layer with &#x201C;squeeze&#x201D; and &#x201C;expand&#x201D; layers. Firstly, the input images are passed through an individual convolution layer termed &#x201C;conv1&#x201D;. A squeeze convolution layer has a single filter and is provided as an expanded layer that contains a fusion of 1 &#x00D7; 1 and 3 &#x00D7; 3 convolutions that capture spatial data (feature extraction) at different scales. This layer and eight &#x201C;fire modules&#x201D; are totalled &#x201C;fire2&#x201D; via &#x201C;fire9&#x201D;. Afterwards, in layers fire4, conv1, conv10, and fire8, max-pooling is implemented with the stride of 2. A dropout layer is added later in the Fire9 model to decrease over-fitting.</p>
<fig id="fig-11">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-11.tif"/>
</fig>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>NASNet Model</title>
<p>NASNet (Neural Architecture Search Network) is a family of DNNs that was proposed by a reinforcement learning method to find an optimum NN structure [<xref ref-type="bibr" rid="ref-21">21</xref>]. The objective of NASNet is to automatically design NN architecture that performs better than human-designed architecture. NASNet has two building blocks: a search algorithm and a search space. The search space determines the set of potential NN architecture, and the search algorithm examines this space to search for a better structure. The search space in NASNet can be determined by the key components, a small NN module merged to form large architecture. These key components are intended to be both efficient and flexible, allowing them to be fused in many dissimilar ways to construct a broad range of structures. The search algorithm in NASNet exploits an RL method, where a NN agent is trained to construct new architecture and estimate their performance. The agent learns to explore the search space by producing new architecture that is the same as before. The agent is trained by a reward signal that is based on the performance of all the architectures.</p>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Object Classification: GCN Model</title>
<p>For the automated classification of detected objects, the GCN model is exploited in this work. A typical CNN utilizes convolutional functions on a (multi-dimensional) array(s) containing a spatial meaning [<xref ref-type="bibr" rid="ref-22">22</xref>]. The CNN can be generally utilized to classifier drives like image recognition, while the images are realized as matrices from the Euclidean space. CNNs are demonstrated great efficiency in signal processing and visual analytics because of their innate ability to manage these types of structures, extracting meaningful features shared with data and utilized in various studies. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> represents the framework of GCN. Afterwards, classification of appropriate functions and/or data transformation. During this case, the purpose of GCN is to offer a representation of nodes utilizing similar node features, among them the neighbour&#x2019;s node features. The outcome of the GCN technique is usually calculated as:</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Architecture of GCN</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-2.tif"/>
</fig>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mi>Y</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mi>X</mml:mi><mml:mi>W</mml:mi></mml:math></disp-formula></p>
<p>Whereas <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>X</mml:mi></mml:math></inline-formula> denotes the input data (that is, the water demand), the term <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>Y</mml:mi></mml:math></inline-formula> signifies the output, but <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>W</mml:mi></mml:math></inline-formula> defines the matrix <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mrow><mml:mover><mml:mi>o</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> with model parameters. Additionally, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> represents the normalization adjacent matrix that is expressed as:</p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:mover><mml:mi>A</mml:mi><mml:mo stretchy="false">&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mover><mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:msup><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>With <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mover><mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mi>A</mml:mi><mml:mo>+</mml:mo><mml:mi>I</mml:mi></mml:math></inline-formula>, and whereas <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>A</mml:mi></mml:math></inline-formula> represents the adjacent matrix relying on the graph but the connects signifies the correlation among the various time series, <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>I</mml:mi></mml:math></inline-formula> denotes the identity matrix, and <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:mover><mml:mi>D</mml:mi><mml:mo>&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> represents the diagonal degree matrix of <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mover><mml:mrow><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Performance Validation</title>
<p>The proposed model is simulated using Python 3.6.5 tool on PC i5-8600k, GeForce 1050Ti 4 GB, 16 GB RAM, 250 GB SSD and 1 TB HDD. The parameter settings are given as follows: learning rate: 0.01, dropout: 0.5, batch size: 5, epoch count: 50, and activation: ReLU.</p>
<p>In this section, the waste object detection and classification performance of the EFFDL-WODC technique is examined on a database in the Kaggle repository [<xref ref-type="bibr" rid="ref-23">23</xref>], comprising 2467 instances with 6 class labels as represented in <xref ref-type="table" rid="table-1">Table 1</xref>. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> represents the sample images. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> demonstrates the sample visualization outcomes.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Details of the database</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Class</th>
<th>No. of instances</th>
</tr>
</thead>
<tbody>
<tr>
<td>Cardboard</td>
<td>393</td>
</tr>
<tr>
<td>Glass</td>
<td>491</td>
</tr>
<tr>
<td>Metal</td>
<td>400</td>
</tr>
<tr>
<td>Paper</td>
<td>584</td>
</tr>
<tr>
<td>Plastic</td>
<td>472</td>
</tr>
<tr>
<td>Trash</td>
<td>127</td>
</tr>
<tr>
<td>Total no. of instances</td>
<td>2467</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Sample images (cardboard, glass, metal, paper, plastic, trash)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-3.tif"/>
</fig><fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Sample visualization results</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-4a.tif"/>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-4b.tif"/>
</fig>
<p>The confusion matrices of the EFFDL-WODC algorithm are represented in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. The outcomes imply that the EFFDL-WODC technique identifies six types of objects proficiently.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Confusion matrices of EFFDL-WODC system (a) Epoch500, (b) Epoch1000, (c) Epoch1500, and (d) Epoch2000</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-5.tif"/>
</fig>
<p>In <xref ref-type="table" rid="table-2">Table 2</xref>, an overall classifier outcome of the EFFDL-WODC technique with different epochs is given. The results imply the effectual results of the EFFDL-WODC technique under each epoch. For instance, with 500 epochs, the EFFDL-WODC technique gains <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.70%, <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 95.94%, <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 94.87%, <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 95.37%, and <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>A</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 97.03%. Meanwhile, with 1000 epochs, the EFFDL-WODC system gains <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.30%, <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.72%, <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.08%, <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 97.39%, and <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>A</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 98.33%. Concurrently, with 1500 epochs, the EFFDL-WODC approach reaches <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.49%, <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.25%, <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.84%, <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 98.04%, and <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>A</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 98.76%. At last, with 2000 epochs, the EFFDL-WODC methodology attains <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.34%, <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.88%, <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.05%, <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 97.44%, and <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>A</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 98.32%.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Classification outcome of EFFDL-WODC approach with varying epochs</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Class</th>
<th><inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:msub><mml:mrow><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msub><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msub><mml:mrow><mml:mi>A</mml:mi><mml:mi>U</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td align="center" colspan="6">Epoch&#x2014;500</td>
</tr>
<tr>
<td>Cardboard</td>
<td>98.62</td>
<td>96.38</td>
<td>94.91</td>
<td>95.64</td>
<td>97.12</td>
</tr>
<tr>
<td>Glass</td>
<td>98.74</td>
<td>96.00</td>
<td>97.76</td>
<td>96.87</td>
<td>98.37</td>
</tr>
<tr>
<td>Metal</td>
<td>98.62</td>
<td>95.07</td>
<td>96.50</td>
<td>95.78</td>
<td>97.77</td>
</tr>
<tr>
<td>Paper</td>
<td>98.42</td>
<td>95.95</td>
<td>97.43</td>
<td>96.69</td>
<td>98.08</td>
</tr>
<tr>
<td>Plastic</td>
<td>98.74</td>
<td>97.42</td>
<td>95.97</td>
<td>96.69</td>
<td>97.69</td>
</tr>
<tr>
<td>Trash</td>
<td>99.07</td>
<td>94.83</td>
<td>86.61</td>
<td>90.53</td>
<td>93.18</td>
</tr>
<tr>
<td>Average</td>
<td>98.70</td>
<td>95.94</td>
<td>94.87</td>
<td>95.37</td>
<td>97.03</td>
</tr>
<tr>
<td align="center" colspan="6">Epoch&#x2014;1000</td>
</tr>
<tr>
<td>Cardboard</td>
<td>99.23</td>
<td>97.95</td>
<td>97.20</td>
<td>97.57</td>
<td>98.41</td>
</tr>
<tr>
<td>Glass</td>
<td>99.43</td>
<td>98.57</td>
<td>98.57</td>
<td>98.57</td>
<td>99.11</td>
</tr>
<tr>
<td>Metal</td>
<td>99.31</td>
<td>97.28</td>
<td>98.50</td>
<td>97.89</td>
<td>98.98</td>
</tr>
<tr>
<td>Paper</td>
<td>99.03</td>
<td>97.95</td>
<td>97.95</td>
<td>97.95</td>
<td>98.65</td>
</tr>
<tr>
<td>Plastic</td>
<td>99.39</td>
<td>97.90</td>
<td>98.94</td>
<td>98.42</td>
<td>99.22</td>
</tr>
<tr>
<td>Trash</td>
<td>99.39</td>
<td>96.67</td>
<td>91.34</td>
<td>93.93</td>
<td>95.58</td>
</tr>
<tr>
<td>Average</td>
<td>99.30</td>
<td>97.72</td>
<td>97.08</td>
<td>97.39</td>
<td>98.33</td>
</tr>
<tr>
<td align="center" colspan="6">Epoch&#x2014;1500</td>
</tr>
<tr>
<td>Cardboard</td>
<td>99.47</td>
<td>98.97</td>
<td>97.71</td>
<td>98.34</td>
<td>98.76</td>
</tr>
<tr>
<td>Glass</td>
<td>99.68</td>
<td>99.39</td>
<td>98.98</td>
<td>99.18</td>
<td>99.41</td>
</tr>
<tr>
<td>Metal</td>
<td>99.39</td>
<td>97.77</td>
<td>98.50</td>
<td>98.13</td>
<td>99.03</td>
</tr>
<tr>
<td>Paper</td>
<td>99.27</td>
<td>98.13</td>
<td>98.80</td>
<td>98.46</td>
<td>99.11</td>
</tr>
<tr>
<td>Plastic</td>
<td>99.59</td>
<td>98.53</td>
<td>99.36</td>
<td>98.95</td>
<td>99.51</td>
</tr>
<tr>
<td>Trash</td>
<td>99.51</td>
<td>96.75</td>
<td>93.70</td>
<td>95.20</td>
<td>96.76</td>
</tr>
<tr>
<td>Average</td>
<td>99.49</td>
<td>98.25</td>
<td>97.84</td>
<td>98.04</td>
<td>98.76</td>
</tr>
<tr>
<td align="center" colspan="6">Epoch&#x2014;2000</td>
</tr>
<tr>
<td>Cardboard</td>
<td>99.27</td>
<td>98.70</td>
<td>96.69</td>
<td>97.69</td>
<td>98.23</td>
</tr>
<tr>
<td>Glass</td>
<td>99.55</td>
<td>99.38</td>
<td>98.37</td>
<td>98.87</td>
<td>99.11</td>
</tr>
<tr>
<td>Metal</td>
<td>99.31</td>
<td>97.28</td>
<td>98.50</td>
<td>97.89</td>
<td>98.98</td>
</tr>
<tr>
<td>Paper</td>
<td>99.03</td>
<td>97.14</td>
<td>98.80</td>
<td>97.96</td>
<td>98.95</td>
</tr>
<tr>
<td>Plastic</td>
<td>99.51</td>
<td>98.12</td>
<td>99.36</td>
<td>98.74</td>
<td>99.46</td>
</tr>
<tr>
<td>Trash</td>
<td>99.35</td>
<td>96.64</td>
<td>90.55</td>
<td>93.50</td>
<td>95.19</td>
</tr>
<tr>
<td>Average</td>
<td>99.34</td>
<td>97.88</td>
<td>97.05</td>
<td>97.44</td>
<td>98.32</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> scrutinizes the accuracy of the EFFDL-WODC approach during the training and validation process on varying epochs. The figure notifies that the EFFDL-WODC technique gains maximal accuracy values over enhancing epochs. In addition, the higher validation accuracy over training accuracy depicts that the EFFDL-WODC system learns efficiently on varying epochs.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Accuracy curve of EFFDL-WODC approach (a) Epoch500, (b) Epoch1000, (c) Epoch1500, and (d) Epoch2000</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-6.tif"/>
</fig>
<p>The loss investigation of the EFFDL-WODC algorithm at the time of training and validation is exhibited on varying epochs in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The outcomes stated that the EFFDL-WODC algorithm gains closer values of training and validation loss. It can be inferred that the EFFDL-WODC method learns efficiently on varying epochs.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Loss curve of EFFDL-WODC approach (a) Epoch500, (b) Epoch1000, (c) Epoch1500, and (d) Epoch2000</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-7.tif"/>
</fig>
<p>A brief precision-recall (PR) curve of the EFFDL-WODC system is established on varying epochs in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The results state that the EFFDL-WODC approach results in maximal values of PR. Also, the EFFDL-WODC methodology can obtain superior PR values in all classes.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>PR curve of EFFDL-WODC approach (a) Epoch500, (b) Epoch1000, (c) Epoch1500, and (d) Epoch2000</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-8.tif"/>
</fig>
<p>A comprehensive comparative analysis of the EFFDL-WODC system with other DL techniques is given in <xref ref-type="table" rid="table-3">Table 3</xref> [<xref ref-type="bibr" rid="ref-5">5</xref>]. The results depicted the ineffectual outcomes of the AlexNet model, whereas the ResNet50 and VGG16 approaches have gained somewhat improvised results. Then, the MLH-CNN, ARBM-MGWODL, and DLSODC-GWM techniques have portrayed considerable performance. However, the EFFDL-WODC and technique shows maximum outcomes with <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 99.49%, <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 98.25%, <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.84%, and <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 98.04%. These results pointed out the enhanced classification outcomes of the EFFDL-WODC technique.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparative outcome of EFFDL-WODC methodology with other DL systems [<xref ref-type="bibr" rid="ref-5">5</xref>,<xref ref-type="bibr" rid="ref-14">14</xref>]</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th><inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msub><mml:mrow><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msub><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:msub><mml:mrow><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td>EFFDL-WODC</td>
<td>99.49</td>
<td>98.25</td>
<td>97.84</td>
<td>98.04</td>
</tr>
<tr>
<td>DLSODC-GWM</td>
<td>98.32</td>
<td>94.67</td>
<td>94.66</td>
<td>94.61</td>
</tr>
<tr>
<td>ABRM-MGWODL</td>
<td>99.01</td>
<td>96.85</td>
<td>96.81</td>
<td>96.82</td>
</tr>
<tr>
<td>MLH-CNN</td>
<td>92.37</td>
<td>90.81</td>
<td>91.36</td>
<td>90.78</td>
</tr>
<tr>
<td>AlexNet</td>
<td>52.59</td>
<td>41.91</td>
<td>49.86</td>
<td>43.39</td>
</tr>
<tr>
<td>RestNet50</td>
<td>75.12</td>
<td>71.82</td>
<td>71.92</td>
<td>71.155</td>
</tr>
<tr>
<td>VGG16</td>
<td>73.13</td>
<td>68.76</td>
<td>68.39</td>
<td>68.06</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, a ROC study of the EFFDL-WODC approach is revealed on the test database. The outcome stated that the EFFDL-WODC method led to improved ROC values. Besides, it can be clear that the EFFDL-WODC algorithm can extend improved ROC values on all classes.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>ROC curve of the EFFDL-WODC approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_41523-fig-9.tif"/>
</fig>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>In this study, we have presented a novel EFFDL-WODC system for accurate and automated detection and classification of waste objects. The presented EFFDL-WODC technique inherits the concepts of feature fusion and DL approaches for the effectual recognition and classification of various kinds of waste objects. In the projected EFFDL-WODC system, two major procedures are contained, such as YOLOv7-based waste object detection and GCN-based waste object classification. For object detection, the EFFDL-WODC technique uses a YOLOv7 object detector with a fusion-based backbone network. In addition, entropy feature fusion-based models such as VGG-16, SqueezeNet, and NASNet models are used. Finally, the EFFDL-WODC technique uses a GCN model is carried out for the classification of detected waste objects. The performance validation of the EFFDL-WODC system was validated on the benchmark dataset. The comprehensive comparison outcomes highlighted the improved performance of the EFFDL-WODC technique over recent approaches.</p>
</sec>
</body>
<back>
<ack><p>The authors gratefully acknowledge the technical and financial support provided by the Ministry of Education and Deanship of Scientific Research (DSR), King Abdulaziz University (KAU), Jeddah, Saudi Arabia.</p></ack>
<sec><title>Funding Statement</title>
<p>This research work was funded by Institutional Fund Projects under Grant No. (IFPIP: 557-135-1443).</p>
</sec>
<sec><title>Author Contributions</title>
<p>Conceptualization, E.B.A. and M.R.; Methodology, E.B.A., S.J. and R.B.A.; Software, E.B.A. and S.J.; Validation, E.B.A. and S.J.; Formal analysis, E.B.A. and M.R.; Investigation, E.B.A., M.R. and R.B.A.; Data curation, E.B.A. and S.J.; Writing&#x2013;original draft, E.B.A. and M.R.; Writing&#x2013;review &#x0026; editing, E.B.A. and S.J.; Supervision, E.B.A.; Project administration, M.R.; Funding acquisition, E.B.A. All authors have read and agreed to the published version of the manuscript.</p>
</sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>The data presented in this study are available in this article.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Bobulski</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Kubanek</surname></string-name></person-group>, &#x201C;<article-title>Deep learning for plastic waste classification system</article-title>,&#x201D; <source>Applied Computational Intelligence and Soft Computing</source>, vol. <volume>2021</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>7</lpage>, <year>2021</year>. </mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Azadnia</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Fouladi</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Jahanbakhshi</surname></string-name></person-group>, &#x201C;<article-title>Intelligent detection and waste control of hawthorn fruit based on ripening level using machine vision system and deep learning techniques</article-title>,&#x201D; <source>Results in Engineering</source>, vol. <volume>17</volume>, no. <issue>1</issue>, pp. <fpage>100891</fpage>, <year>2023</year>. </mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Panwar</surname></string-name>, <string-name><given-names>P. K.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>M. K.</given-names> <surname>Siddiqui</surname></string-name>, <string-name><given-names>R. M.</given-names> <surname>Menendez</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Bhardwaj</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>AquaVision: Automating the detection of waste in water bodies using deep transfer learning</article-title>,&#x201D; <source>Case Studies in Chemical and Environmental Engineering</source>, vol. <volume>2</volume>, no. <issue>57</issue>, pp. <fpage>100026</fpage>, <year>2020</year>. </mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Yadav</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>O. P.</given-names> <surname>Verma</surname></string-name>, <string-name><given-names>I. A.</given-names> <surname>Ansari</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A novel YOLOv3 algorithm-based deep learning approach for waste segregation: Towards smart waste management</article-title>,&#x201D; <source>Electronics</source>, vol. <volume>10</volume>, no. <issue>1</issue>, pp. <fpage>14</fpage>, <year>2020</year>. </mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. S.</given-names> <surname>Alsubaei</surname></string-name>, <string-name><given-names>F. N.</given-names> <surname>Al-Wesabi</surname></string-name> and <string-name><given-names>A. M.</given-names> <surname>Hilal</surname></string-name></person-group>, &#x201C;<article-title>Deep learning-based small object detection and classification model for garbage waste management in smart cities and iot environment</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>12</volume>, no. <issue>5</issue>, pp. <fpage>2281</fpage>, <year>2022</year>. </mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Qin</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Qu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Ran</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Liu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A smart municipal waste management system based on deep-learning and Internet of Things</article-title>,&#x201D; <source>Waste Management</source>, vol. <volume>135</volume>, no. <issue>3</issue>, pp. <fpage>20</fpage>&#x2013;<lpage>29</lpage>, <year>2021</year>.; <pub-id pub-id-type="pmid">34461487</pub-id></mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Alshammari</surname></string-name> and <string-name><given-names>R. C.</given-names> <surname>Chabaan</surname></string-name></person-group>, &#x201C;<article-title>Sppn-Rn101: Spatial pyramid pooling network with resnet101-based foreign object debris detection in airports</article-title>,&#x201D; <source>Mathematics</source>, vol. <volume>11</volume>, no. <issue>4</issue>, pp. <fpage>841</fpage>, <year>2023</year>. </mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Kang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>An automatic garbage classification system based on deep learning</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>140019</fpage>&#x2013;<lpage>140029</lpage>, <year>2020</year>. </mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Tian</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Ju</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Learning fusion feature representation for garbage image classification model in human-robot interaction</article-title>,&#x201D; <source>Infrared Physics &#x0026; Technology</source>, vol. <volume>128</volume>, no. <issue>1</issue>, pp. <fpage>104457</fpage>, <year>2023</year>. </mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. P.</given-names> <surname>Saputra</surname></string-name> and <string-name><surname>Kusrini</surname></string-name></person-group>, &#x201C;<article-title>Waste object detection and classification using deep learning algorithm: YOLOv4 and YOLOv4-tiny</article-title>,&#x201D; <source>Turkish Journal of Computer and Mathematics Education</source>, vol. <volume>12</volume>, no. <issue>14</issue>, pp. <fpage>1666</fpage>&#x2013;<lpage>1677</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Majchrowska</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Miko&#x0142;ajczyk</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ferlin</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Klawikowska</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Plantykow</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Deep learning-based waste detection in natural and urban environments</article-title>,&#x201D; <source>Waste Management</source>, vol. <volume>138</volume>, no. <issue>6</issue>, pp. <fpage>274</fpage>&#x2013;<lpage>284</lpage>, <year>2022</year>; <pub-id pub-id-type="pmid">34920243</pub-id></mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T. J.</given-names> <surname>Sheng</surname></string-name>, <string-name><given-names>M. S.</given-names> <surname>Islam</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Misran</surname></string-name>, <string-name><given-names>M. H.</given-names> <surname>Baharuddin</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Arshad</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>An internet of things based smart waste management system using lora and tensorflow deep learning model</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>148793</fpage>&#x2013;<lpage>148811</lpage>, <year>2020</year>. </mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. W.</given-names> <surname>Rahman</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Islam</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Hasan</surname></string-name>, <string-name><given-names>N. I.</given-names> <surname>Bithi</surname></string-name>, <string-name><given-names>M. M.</given-names> <surname>Hasan</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Intelligent waste management system using deep learning with IoT</article-title>,&#x201D; <source>Journal of King Saud University&#x2014;Computer and Information Sciences</source>, vol. <volume>34</volume>, no. <issue>5</issue>, pp. <fpage>2072</fpage>&#x2013;<lpage>2087</lpage>, <year>2022</year>. </mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. A.</given-names> <surname>Althubiti</surname></string-name>, <string-name><given-names>S. K.</given-names> <surname>Sen</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Ahmed</surname></string-name>, <string-name><given-names>E. L.</given-names> <surname>Lydia</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alharbi</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Automated biomass recycling management system using modified grey wolf optimization with deep learning model</article-title>,&#x201D; <source>Sustainable Energy Technologies and Assessments</source>, vol. <volume>55</volume>, no. <issue>6</issue>, pp. <fpage>102936</fpage>, <year>2023</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D. O.</given-names> <surname>Melinte</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Travediu</surname></string-name> and <string-name><given-names>D. N.</given-names> <surname>Dumitriu</surname></string-name></person-group>, &#x201C;<article-title>Deep convolutional neural networks object detector for real-time waste identification</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>10</volume>, no. <issue>20</issue>, pp. <fpage>7301</fpage>, <year>2020</year>. </mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Niu</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Feng</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Gao</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Solid waste mapping based on very high resolution remote sensing imagery and a novel deep learning approach</article-title>,&#x201D; <source>Geocarto International</source>, vol. <volume>38</volume>, no. <issue>1</issue>, pp. <fpage>2164361</fpage>, <year>2023</year>. </mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>O. I.</given-names> <surname>Funch</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Marhaug</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Kohtala</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Steinert</surname></string-name></person-group>, &#x201C;<article-title>Detecting glass and metal in consumer trash bags during waste collection using convolutional neural networks</article-title>,&#x201D; <source>Waste Management</source>, vol. <volume>119</volume>, pp. <fpage>30</fpage>&#x2013;<lpage>38</lpage>, <year>2021</year>; <pub-id pub-id-type="pmid">33039979</pub-id></mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Dewi</surname></string-name>, <string-name><given-names>A. P. S.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>H. J.</given-names> <surname>Christanto</surname></string-name></person-group>, &#x201C;<article-title>Deep learning for highly accurate hand recognition based on YOLOv7 model</article-title>,&#x201D; <source>Big Data and Cognitive Computing</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>53</fpage>, <year>2023</year>. </mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Ni</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Han</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Luan</surname></string-name></person-group>, &#x201C;<article-title>A novel method for peanut variety identification and classification by improved VGG16</article-title>,&#x201D; <source>Scientific Reports</source>, vol. <volume>11</volume>, no. <issue>1</issue>, pp. <fpage>15756</fpage>, <year>2021</year>.; <pub-id pub-id-type="pmid">34344983</pub-id></mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Alhichri</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Bazi</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Alajlan</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Bin Jdira</surname></string-name></person-group>, &#x201C;<article-title>Helping the visually impaired see via image multi-labeling based on squeezeNet CNN</article-title>,&#x201D; <source>Applied Sciences</source>, vol. <volume>9</volume>, no. <issue>21</issue>, pp. <fpage>4656</fpage>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Cano</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Mendoza-Avil&#x00E9;s</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Areiza</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Guerra</surname></string-name>, <string-name><given-names>J. L.</given-names> <surname>Mendoza-Vald&#x00E9;s</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Multi skin lesions classification using fine-tuning and data-augmentation applying NASNet</article-title>,&#x201D; <source>PeerJ Computer Science</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>e371</fpage>, <year>2021</year>; <pub-id pub-id-type="pmid">34150994</pub-id></mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Zanfei</surname></string-name>, <string-name><given-names>B. M.</given-names> <surname>Brentan</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Menapace</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Righetti</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Herrera</surname></string-name></person-group>, &#x201C;<article-title>Graph convolutional recurrent neural networks for water demand forecasting</article-title>,&#x201D; <source>Water Resources Research</source>, vol. <volume>58</volume>, no. <issue>7</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>14</lpage>, <year>2022</year>. </mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="other"><ext-link ext-link-type="uri" xlink:href="https://www.kaggle.com/datasets/asdasdasasdas/garbage-classification">https://www.kaggle.com/datasets/asdasdasasdas/garbage-classification</ext-link></mixed-citation></ref>
</ref-list>
</back></article>