资源论文ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentation

ADVENT: Adversarial Entropy Minimization for Domain Adaptation in Semantic Segmentation

2019-09-11 | |  135 |   61 |   0

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) an entropy loss and (ii) an adversarial loss respectively. We demonstrate state-of-theart performance in semantic segmentation on two challenging “synthetic-2-real” set-ups1 and show that the approach can also be used for detection.

上一篇:FEELVOS: Fast End-to-End Embedding Learning for Video Object Segmentation

下一篇:Associatively Segmenting Instances and Semantics in Point Clouds

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...