SegDA: Maximum Separable Segment Mask with Pseudo Labels for Domain Adaptive Semantic Segmentation
Anant Khandelwal

TL;DR
SegDA introduces a novel domain adaptation approach for semantic segmentation that leverages maximum separable segment representations and pseudo label noise correction, significantly improving performance across various benchmarks.
Contribution
The paper proposes a new architecture using ETF classifiers and noise estimation to enhance domain adaptation in semantic segmentation, addressing class confusion and label noise.
Findings
Outperforms existing methods with +2.2 mIoU on GTA to Cityscapes
Achieves +2.0 mIoU on Synthia to Cityscapes
Improves +5.9 mIoU on Cityscapes to DarkZurich
Abstract
Unsupervised Domain Adaptation (UDA) aims to solve the problem of label scarcity of the target domain by transferring the knowledge from the label rich source domain. Usually, the source domain consists of synthetic images for which the annotation is easily obtained using the well known computer graphics techniques. However, obtaining annotation for real world images (target domain) require lot of manual annotation effort and is very time consuming because it requires per pixel annotation. To address this problem we propose SegDA module to enhance transfer performance of UDA methods by learning the maximum separable segment representation. This resolves the problem of identifying visually similar classes like pedestrian/rider, sidewalk/road etc. We leveraged Equiangular Tight Frame (ETF) classifier inspired from Neural Collapse for maximal separation between segment classes. This causes…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Multimodal Machine Learning Applications
