Abstract

Recycling is one of the most important approaches to safeguard the environment since it aims to reduce waste in landfills while conserving natural resources. Using deep Learning networks, this group of wastes may be automatically classified on the belts of a waste sorting plant. However, a basic set of connected layers may not be adequate to give satisfactory accuracy for such multi output classifier tasks. To optimize the gradient flow and enable deeper training for network design with multi label classifier, this study suggests a residual-based deep learning convolutional neural network. For network training, ten classes have been explored. The Directed Acyclic Graph (DAG) is a structure with hidden layers that have inputs, outputs, and other layers. The DAG network's residual-based architecture features shortcut connections that bypass some levels of the network, allowing gradients of network parameters to travel freely among the network output layers for deeper training. The methodology includes: 1) preparing the data and creating an augmented image data store; 2) defining the main serially-connected branches of the network architecture; 3) defining the residual interconnections that bypass the main branch layers; 4) defining layers, and finally; 5) creating a residual-based deeper layer graph. The concept is to split down the multiclass classification problem into minor binary states, where every classifier performs as an expert by concentrating on discriminating between only two labels, improving total accuracy. The results achieve (2.861 %) training error and (9.76 %) a validation error. The training results of this classifier are evaluated by finding the training error, validation error, and showing the confusion matrix of validation data

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.