Papers › Resource Constrained Semantic Segmentation for Waste Sorting

Resource Constrained Semantic Segmentation for Waste Sorting

30 Oct 2023arXiv:2310.19407archive 2025-07-28

Elisa Cascina, Andrea Pellegrino, Lorenzo Tozzi

This work addresses the need for efficient waste sorting strategies in Materials Recovery Facilities to minimize the environmental impact of rising waste. We propose resource-constrained semantic segmentation models for segmenting recyclable waste in industrial settings. Our goal is to develop models that fit within a 10MB memory constraint, suitable for edge applications with limited processing capacity. We perform the experiments on three networks: ICNet, BiSeNet (Xception39 backbone), and ENet. Given the aforementioned limitation, we implement quantization and pruning techniques on the broader nets, achieving positive results while marginally impacting the Mean IoU metric. Furthermore, we propose a combination of Focal and Lov\'asz loss that addresses the implicit class imbalance resulting in better performance compared with the Cross-entropy loss function.

PaperPDFCode

Code

anubis09/resource_constrained_semantic_segmentation_for_waste_sorting officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

QuantizationSemantic Segmentation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

1x1 ConvolutionBatch NormalizationConvolutionDilated ConvolutionENetENet BottleneckENet Dilated BottleneckENet Initial BlockMax PoolingPReLUPruningSpatialDropout

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections