An Ensemble Learning Approach towards Waste Segmentation in Cluttered Environment
- URL: http://arxiv.org/abs/2602.13681v1
- Date: Sat, 14 Feb 2026 09:07:00 GMT
- Title: An Ensemble Learning Approach towards Waste Segmentation in Cluttered Environment
- Authors: Maimoona Jafar, Syed Imran Ali, Ahsan Saadat, Muhammad Bilal, Shah Khalid,
- Abstract summary: This study focuses on waste segregation, a crucial step in recycling processes to obtain raw material.<n>Recent advancements in computer vision have significantly contributed to waste classification and recognition.<n>In waste segregation, segmentation masks are essential for robots to accurately localize and pick objects from conveyor belts.
- Score: 2.723394443506285
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Environmental pollution is a critical global issue, with recycling emerging as one of the most viable solutions. This study focuses on waste segregation, a crucial step in recycling processes to obtain raw material. Recent advancements in computer vision have significantly contributed to waste classification and recognition. In waste segregation, segmentation masks are essential for robots to accurately localize and pick objects from conveyor belts. The complexity of real-world waste environments, characterized by deformed items without specific patterns and overlapping objects, further complicates waste segmentation tasks. This paper proposes an Ensemble Learning approach to improve segmentation accuracy by combining high performing segmentation models, U-Net and FPN, using a weighted average method. U-Net excels in capturing fine details and boundaries in segmentation tasks, while FPN effectively handles scale variation and context in complex environments, and their combined masks result in more precise predictions. The dataset used closely mimics real-life waste scenarios, and preprocessing techniques were applied to enhance feature learning for deep learning segmentation models. The ensemble model, referred to as EL-4, achieved an IoU value of 0.8306, an improvement over U-Net's 0.8065, and reduced Dice loss to 0.09019 from FPN's 0.1183. This study could contribute to the efficiency of waste sorting at Material Recovery Facility, facilitating better raw material acquisition for recycling with minimal human intervention and enhancing the overall throughput.
Related papers
- Towards Accurate and Efficient Waste Image Classification: A Hybrid Deep Learning and Machine Learning Approach [0.05599792629509228]
This study provides a comprehensive comparison of three paradigms: (1) machine learning algorithms using handcrafted features, (2) deep learning architectures, including ResNet variants and EfficientNetV2S, and (3) a hybrid approach that utilizes deep models for feature extraction combined with classical classifiers such as Support Vector Machine and Logistic Regression to identify the most effective strategy.<n>Experiments on three public datasets - TrashNet, Garbage Classification, and a refined Household Garbage dataset- demonstrate that the hybrid method consistently outperforms the others, achieving up to 100% accuracy on TrashNet and the refined Household set, and 99.87% on Garbage Classification, thereby surpassing state-of-the
arXiv Detail & Related papers (2025-10-22T08:32:51Z) - Textile Analysis for Recycling Automation using Transfer Learning and Zero-Shot Foundation Models [6.932314083921248]
This paper investigates the use of standard RGB imagery, a cost-effective sensing modality, for key pre-processing tasks in an automated system.<n>We present computer vision components designed for a conveyor belt setup to perform (a) classification of four common textile types and (b) segmentation of non- textile features such as buttons and zippers.
arXiv Detail & Related papers (2025-06-06T22:49:53Z) - Advancing Recycling Efficiency: A Comparative Analysis of Deep Learning Models in Waste Classification [0.0]
The research tackles the pressing issue of waste classification for recycling by analyzing various deep learning models.
The results indicate the method significantly boosts accuracy in complex waste categories.
The research paves the way for future advancements in multi-category waste recycling.
arXiv Detail & Related papers (2024-11-05T03:44:54Z) - COSNet: A Novel Semantic Segmentation Network using Enhanced Boundaries in Cluttered Scenes [9.970265640589966]
We introduce an efficacious segmentation network, named COSNet, that uses boundary cues along with multi-contextual information to accurately segment the objects in cluttered scenes.
Our COSNet achieves a significant gain of 1.8% on ZeroWaste-f and 2.1% on SpectralWaste datasets respectively in terms of mIoU metric.
arXiv Detail & Related papers (2024-10-31T17:03:38Z) - WasteGAN: Data Augmentation for Robotic Waste Sorting through Generative Adversarial Networks [7.775894876221921]
We introduce a data augmentation method based on a novel GAN architecture called wasteGAN.
The proposed method allows to increase the performance of semantic segmentation models, starting from a very limited bunch of labeled examples.
We then leverage the higher-quality segmentation masks predicted from models trained on the wasteGAN synthetic data to compute semantic-aware grasp poses.
arXiv Detail & Related papers (2024-09-25T15:04:21Z) - SpectralWaste Dataset: Multimodal Data for Waste Sorting Automation [46.178512739789426]
We present SpectralWaste, the first dataset collected from an operational plastic waste sorting facility.
This dataset contains labels for several categories of objects that commonly appear in sorting plants.
We propose a pipeline employing different object segmentation architectures and evaluate the alternatives on our dataset.
arXiv Detail & Related papers (2024-03-26T18:39:38Z) - SIRST-5K: Exploring Massive Negatives Synthesis with Self-supervised
Learning for Robust Infrared Small Target Detection [53.19618419772467]
Single-frame infrared small target (SIRST) detection aims to recognize small targets from clutter backgrounds.
With the development of Transformer, the scale of SIRST models is constantly increasing.
With a rich diversity of infrared small target data, our algorithm significantly improves the model performance and convergence speed.
arXiv Detail & Related papers (2024-03-08T16:14:54Z) - Filling the Missing: Exploring Generative AI for Enhanced Federated
Learning over Heterogeneous Mobile Edge Devices [72.61177465035031]
We propose a generative AI-empowered federated learning to address these challenges by leveraging the idea of FIlling the MIssing (FIMI) portion of local data.
Experiment results demonstrate that FIMI can save up to 50% of the device-side energy to achieve the target global test accuracy.
arXiv Detail & Related papers (2023-10-21T12:07:04Z) - IFOR: Iterative Flow Minimization for Robotic Object Rearrangement [92.97142696891727]
IFOR, Iterative Flow Minimization for Robotic Object Rearrangement, is an end-to-end method for the problem of object rearrangement for unknown objects.
We show that our method applies to cluttered scenes, and in the real world, while training only on synthetic data.
arXiv Detail & Related papers (2022-02-01T20:03:56Z) - ZeroWaste Dataset: Towards Automated Waste Recycling [51.053682077915546]
We present the first in-the-wild industrial-grade waste detection and segmentation dataset, ZeroWaste.
This dataset contains over1800fully segmented video frames collected from a real waste sorting plant.
We show that state-of-the-art segmentation methods struggle to correctly detect and classify target objects.
arXiv Detail & Related papers (2021-06-04T22:17:09Z) - Learning by Minimizing the Sum of Ranked Range [58.24935359348289]
We introduce the sum of ranked range (SoRR) as a general approach to form learning objectives.
A ranked range is a consecutive sequence of sorted values of a set of real numbers.
We explore two applications in machine learning of the minimization of the SoRR framework, namely the AoRR aggregate loss for binary classification and the TKML individual loss for multi-label/multi-class classification.
arXiv Detail & Related papers (2020-10-05T01:58:32Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.