Divide, Ensemble and Conquer: The Last Mile on Unsupervised Domain Adaptation for Semantic Segmentation

2024-06-27 · Tao Lian, Jose L. Gómez, Antonio M. López

The last mile of unsupervised domain adaptation (UDA) for semantic segmentation is the challenge of solving the syn-to-real domain gap. Recent UDA methods have progressed significantly, yet they often rely on strategies customized for synthetic single-source datasets (e.g., GTA5), which limits their generalisation to multi-source datasets. Conversely, synthetic multi-source datasets hold promise for advancing the last mile of UDA but remain underutilized in current research. Thus, we propose DEC, a flexible UDA framework for multi-source datasets. Following a divide-and-conquer strategy, DEC simplifies the task by categorizing semantic classes, training models for each category, and fusing their outputs by an ensemble model trained exclusively on synthetic datasets to obtain the final segmentation mask. DEC can integrate with existing UDA methods, achieving state-of-the-art performance on Cityscapes, BDD100K, and Mapillary Vistas, significantly narrowing the syn-to-real domain gap.

📄 PDF Abstract BibTeX arXiv:2406.18809

Code (0)

등록된 구현이 없습니다.

Tasks

Domain Adaptation Semantic Segmentation Unsupervised Domain Adaptation

Divide-and-Conquer Reinforcement Learning

2017-11-27 · ICLR 2018 1 · Dibya Ghosh, Avi Singh, Aravind Rajeswaran, Vikash Kumar 외

Standard model-free deep reinforcement learning (RL) algorithms sample a new initial state for each trial, allowing them to optimize policies that can perform well even in highly stochastic environments. However, problem…

Deep Reinforcement Learning Policy Gradient Methods reinforcement-learning Reinforcement Learning+1

Divide-and-Conquer for Enhancing Unlabeled Learning, Stability, and Plasticity in Semi-supervised Continual Learning

2025-08-07 · Yue Duan, Taicai Chen, Lei Qi, Yinghuan Shi arxiv

Semi-supervised continual learning (SSCL) seeks to leverage both labeled and unlabeled data in a sequential learning setup, aiming to reduce annotation costs while managing continual data arrival. SSCL introduces complex…

Continual Learning

$DC^2$: A Divide-and-conquer Algorithm for Large-scale Kernel Learning with Application to Clustering

2019-11-16 · Ke Alexander Wang, Xinran Bian, Pan Liu, Donghui Yan

Divide-and-conquer is a general strategy to deal with large scale problems. It is typically applied to generate ensemble instances, which potentially limits the problem size it can handle. Additionally, the data are ofte…

Clustering

Divide-and-Conquer based Ensemble to Spot Emotions in Speech using MFCC and Random Forest

2016-10-05 · Abdul Malik Badshah, Jamil Ahmad, Mi Young Lee, Sung Wook Baik

Besides spoken words, speech signals also carry information about speaker gender, age, and emotional state which can be used in a variety of speech analysis applications. In this paper, a divide and conquer strategy for …

Emotion Recognition

Deep Manifold Hashing: A Divide-and-Conquer Approach for Semi-Paired Unsupervised Cross-Modal Retrieval

2022-09-26 · Yufeng Shi, Xinge You, Jiamiao Xu, Feng Zheng 외

Hashing that projects data into binary codes has shown extraordinary talents in cross-modal retrieval due to its low storage usage and high query speed. Despite their empirical success on some scenarios, existing cross-m…

Cross-Modal Retrieval Retrieval