mlsanityData to 7 Oct 2026

VisDA 2022 Challenge: Domain Adaptation for Industrial Waste Sorting

arXiv 2303.14828 ↗First posted 26 Mar 2023cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Label-efficient and reliable semantic segmentation is essential for many real-life applications, especially for industrial settings with high visual diversity, such as waste sorting. In industrial waste sorting, one of the biggest challenges is the extreme diversity of the input stream depending on factors like the location of the sorting facility, the equipment available in the facility, and the time of year, all of which significantly impact the composition and visual appearance of the waste stream. These changes in the data are called ``visual domains'', and label-efficient adaptation of models to such domains is needed for successful semantic segmentation of industrial waste. To test the abilities of computer vision models on this task, we present the VisDA 2022 Challenge on Domain Adaptation for Industrial Waste Sorting. Our challenge incorporates a fully-annotated waste sorting dataset, ZeroWaste, collected from two real material recovery facilities in different locations and seasons, as well as a novel procedurally generated synthetic waste sorting dataset, SynthWaste. In this competition, we aim to answer two questions: 1) can we leverage domain adaptation techniques to minimize the domain gap? and 2) can synthetic data augmentation improve performance on this task and help adapt to changing data distributions? The results of the competition show that industrial waste detection poses a real domain adaptation problem, that domain generalization techniques such as augmentations, ensembling, etc., improve the overall performance on the unlabeled target domain examples, and that leveraging synthetic data effectively remains an open problem. See https://ai.bu.edu/visda-2022/

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 15 of its 27 references that are in the map. First posted on arXiv 26 Mar 2023.

Builds on

15 of 27 references.

References · 15

  1. 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,427
  2. 2022A ConvNet for the 2020scited by 3,545
  3. 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,239
  4. 2021SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformerscited by 2,923
  5. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  6. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
  7. 2016Playing for Data: Ground Truth from Computer Gamescited by 816
  8. 2021Robust fine-tuning of zero-shot modelscited by 785
  9. 2021DAFormer: Improving Network Architectures and Training Strategies for Domain-Adaptive Semantic Segmentationcited by 299
  10. 2020DACS: Domain Adaptation via Cross-domain Mixed Samplingcited by 226
  11. 2022HRDA: Context-Aware High-Resolution Domain-Adaptive Semantic Segmentationcited by 163
  12. 2017Using Simulation and Domain Adaptation to Improve Efficiency of Deep Robotic Graspingcited by 138
3 more
  1. 2022SePiCo: Semantic-Guided Pixel Contrast for Domain Adaptive Semantic Segmentationcited by 87
  2. 2021ZeroWaste Dataset: Towards Deformable Object Segmentation in Cluttered Scenescited by 47
  3. 2021Domain-Aware Universal Style Transfercited by 40

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 3; 2025: 1.

6 papers.