Robust Unsupervised Domain Adaptation by Retaining Confident Entropy via
Edge Concatenation
- URL: http://arxiv.org/abs/2310.07149v1
- Date: Wed, 11 Oct 2023 02:50:16 GMT
- Title: Robust Unsupervised Domain Adaptation by Retaining Confident Entropy via
Edge Concatenation
- Authors: Hye-Seong Hong, Abhishek Kumar, Dong-Gyu Lee
- Abstract summary: Unsupervised domain adaptation can mitigate the need for extensive pixel-level annotations to train semantic segmentation networks.
We introduce a novel approach to domain adaptation, leveraging the synergy of internal and external information within entropy-based adversarial networks.
We devised a probability-sharing network that integrates diverse information for more effective segmentation.
- Score: 7.953644697658355
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The generalization capability of unsupervised domain adaptation can mitigate
the need for extensive pixel-level annotations to train semantic segmentation
networks by training models on synthetic data as a source with
computer-generated annotations. Entropy-based adversarial networks are proposed
to improve source domain prediction; however, they disregard significant
external information, such as edges, which have the potential to identify and
distinguish various objects within an image accurately. To address this issue,
we introduce a novel approach to domain adaptation, leveraging the synergy of
internal and external information within entropy-based adversarial networks. In
this approach, we enrich the discriminator network with edge-predicted
probability values within this innovative framework to enhance the clarity of
class boundaries. Furthermore, we devised a probability-sharing network that
integrates diverse information for more effective segmentation. Incorporating
object edges addresses a pivotal aspect of unsupervised domain adaptation that
has frequently been neglected in the past -- the precise delineation of object
boundaries. Conventional unsupervised domain adaptation methods usually center
around aligning feature distributions and may not explicitly model object
boundaries. Our approach effectively bridges this gap by offering clear
guidance on object boundaries, thereby elevating the quality of domain
adaptation. Our approach undergoes rigorous evaluation on the established
unsupervised domain adaptation benchmarks, specifically in adapting SYNTHIA
$\rightarrow$ Cityscapes and SYNTHIA $\rightarrow$ Mapillary. Experimental
results show that the proposed model attains better performance than
state-of-the-art methods. The superior performance across different
unsupervised domain adaptation scenarios highlights the versatility and
robustness of the proposed method.
Related papers
- Generalizing to Unseen Domains with Wasserstein Distributional Robustness under Limited Source Knowledge [22.285156929279207]
Domain generalization aims at learning a universal model that performs well on unseen target domains.
We propose a novel domain generalization framework called Wasserstein Distributionally Robust Domain Generalization (WDRDG)
arXiv Detail & Related papers (2022-07-11T14:46:50Z) - Labeling Where Adapting Fails: Cross-Domain Semantic Segmentation with
Point Supervision via Active Selection [81.703478548177]
Training models dedicated to semantic segmentation require a large amount of pixel-wise annotated data.
Unsupervised domain adaptation approaches aim at aligning the feature distributions between the labeled source and the unlabeled target data.
Previous works attempted to include human interactions in this process under the form of sparse single-pixel annotations in the target data.
We propose a new domain adaptation framework for semantic segmentation with annotated points via active selection.
arXiv Detail & Related papers (2022-06-01T01:52:28Z) - OTAdapt: Optimal Transport-based Approach For Unsupervised Domain
Adaptation [10.485172090696642]
This paper presents a novel approach to unsupervised domain adaptations based on the optimal transport-based distance.
Our approach allows aligning target and source domains without the requirement of meaningful metrics across domains.
The proposed method is evaluated on different datasets in various problems.
arXiv Detail & Related papers (2022-05-22T04:25:24Z) - Unsupervised Domain Adaptation for Semantic Segmentation via Low-level
Edge Information Transfer [27.64947077788111]
Unsupervised domain adaptation for semantic segmentation aims to make models trained on synthetic data adapt to real images.
Previous feature-level adversarial learning methods only consider adapting models on the high-level semantic features.
We present the first attempt at explicitly using low-level edge information, which has a small inter-domain gap, to guide the transfer of semantic information.
arXiv Detail & Related papers (2021-09-18T11:51:31Z) - Coarse to Fine: Domain Adaptive Crowd Counting via Adversarial Scoring
Network [58.05473757538834]
This paper proposes a novel adversarial scoring network (ASNet) to bridge the gap across domains from coarse to fine granularity.
Three sets of migration experiments show that the proposed methods achieve state-of-the-art counting performance.
arXiv Detail & Related papers (2021-07-27T14:47:24Z) - AFAN: Augmented Feature Alignment Network for Cross-Domain Object
Detection [90.18752912204778]
Unsupervised domain adaptation for object detection is a challenging problem with many real-world applications.
We propose a novel augmented feature alignment network (AFAN) which integrates intermediate domain image generation and domain-adversarial training.
Our approach significantly outperforms the state-of-the-art methods on standard benchmarks for both similar and dissimilar domain adaptations.
arXiv Detail & Related papers (2021-06-10T05:01:20Z) - Domain Adaptation by Class Centroid Matching and Local Manifold
Self-Learning [8.316259570013813]
We propose a novel domain adaptation approach, which can thoroughly explore the data distribution structure of target domain.
We regard the samples within the same cluster in target domain as a whole rather than individuals and assigns pseudo-labels to the target cluster by class centroid matching.
An efficient iterative optimization algorithm is designed to solve the objective function of our proposal with theoretical convergence guarantee.
arXiv Detail & Related papers (2020-03-20T16:59:27Z) - Bi-Directional Generation for Unsupervised Domain Adaptation [61.73001005378002]
Unsupervised domain adaptation facilitates the unlabeled target domain relying on well-established source domain information.
Conventional methods forcefully reducing the domain discrepancy in the latent space will result in the destruction of intrinsic data structure.
We propose a Bi-Directional Generation domain adaptation model with consistent classifiers interpolating two intermediate domains to bridge source and target domains.
arXiv Detail & Related papers (2020-02-12T09:45:39Z) - Contradictory Structure Learning for Semi-supervised Domain Adaptation [67.89665267469053]
Current adversarial adaptation methods attempt to align the cross-domain features.
Two challenges remain unsolved: 1) the conditional distribution mismatch and 2) the bias of the decision boundary towards the source domain.
We propose a novel framework for semi-supervised domain adaptation by unifying the learning of opposite structures.
arXiv Detail & Related papers (2020-02-06T22:58:20Z) - Unsupervised Domain Adaptation in Person re-ID via k-Reciprocal
Clustering and Large-Scale Heterogeneous Environment Synthesis [76.46004354572956]
We introduce an unsupervised domain adaptation approach for person re-identification.
Experimental results show that the proposed ktCUDA and SHRED approach achieves an average improvement of +5.7 mAP in re-identification performance.
arXiv Detail & Related papers (2020-01-14T17:43:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.