Command Palette
Search for a command to run...
ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentation
Tuan-Hung Vu; Himalaya Jain; Maxime Bucher; Matthieu Cord; Patrick Pérez

Abstract
Semantic segmentation is a key problem for many computer vision tasks. While approaches based on convolutional neural networks constantly break new records on different benchmarks, generalizing well to diverse testing environments remains a major challenge. In numerous real world applications, there is indeed a large gap between data distributions in train and test domains, which results in severe performance loss at run-time. In this work, we address the task of unsupervised domain adaptation in semantic segmentation with losses based on the entropy of the pixel-wise predictions. To this end, we propose two novel, complementary methods using (i) entropy loss and (ii) adversarial loss respectively. We demonstrate state-of-the-art performance in semantic segmentation on two challenging "synthetic-2-real" set-ups and show that the approach can also be used for detection.
Code Repositories
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| domain-adaptation-on-panoptic-synthia-to | ADVENT | mPQ: 28.1 |
| domain-adaptation-on-panoptic-synthia-to-1 | ADVENT | mPQ: 18.3 |
| domain-adaptation-on-synthia-to-cityscapes | ADVENT (ResNet-101) | mIoU: 41.2 |
| image-to-image-translation-on-gtav-to | ADVENT | mIoU: 44.8 |
| image-to-image-translation-on-synthia-to | ADVENT | mIoU (13 classes): 48 |
| synthetic-to-real-translation-on-gtav-to | AdvEnt(with MinEnt) | mIoU: 45.5 |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.