GenGMM: Generalized Gaussian-Mixture-based Domain Adaptation Model for Semantic Segmentation

• URL: http://arxiv.org/abs/2410.16485v1
• Date: Mon, 21 Oct 2024 20:21:09 GMT
• Title: GenGMM: Generalized Gaussian-Mixture-based Domain Adaptation Model for Semantic Segmentation
• Authors: Nazanin Moradinasab, Hassan Jafarzadeh, Donald E. Brown,
• Abstract summary: We introduce the Generalized Gaussian-mixture-based (GenGMM) domain adaptation model, which harnesses the underlying data distribution in both domains. Experiments demonstrate the effectiveness of our approach.
• Score: 0.9626666671366837
• License:
• Abstract: Domain adaptive semantic segmentation is the task of generating precise and dense predictions for an unlabeled target domain using a model trained on a labeled source domain. While significant efforts have been devoted to improving unsupervised domain adaptation for this task, it is crucial to note that many models rely on a strong assumption that the source data is entirely and accurately labeled, while the target data is unlabeled. In real-world scenarios, however, we often encounter partially or noisy labeled data in source and target domains, referred to as Generalized Domain Adaptation (GDA). In such cases, we suggest leveraging weak or unlabeled data from both domains to narrow the gap between them, resulting in effective adaptation. We introduce the Generalized Gaussian-mixture-based (GenGMM) domain adaptation model, which harnesses the underlying data distribution in both domains to refine noisy weak and pseudo labels. The experiments demonstrate the effectiveness of our approach.

Related papers

• 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)
• Source-Free Domain Adaptation via Distribution Estimation [106.48277721860036]
  Domain Adaptation aims to transfer the knowledge learned from a labeled source domain to an unlabeled target domain whose data distributions are different. Recently, Source-Free Domain Adaptation (SFDA) has drawn much attention, which tries to tackle domain adaptation problem without using source data. In this work, we propose a novel framework called SFDA-DE to address SFDA task via source Distribution Estimation.
  arXiv  Detail & Related papers  (2022-04-24T12:22:19Z)
• Better Pseudo-label: Joint Domain-aware Label and Dual-classifier for Semi-supervised Domain Generalization [26.255457629490135]
  We propose a novel framework via joint domain-aware labels and dual-classifier to produce high-quality pseudo-labels. To predict accurate pseudo-labels under domain shift, a domain-aware pseudo-labeling module is developed. Also, considering inconsistent goals between generalization and pseudo-labeling, we employ a dual-classifier to independently perform pseudo-labeling and domain generalization in the training process.
  arXiv  Detail & Related papers  (2021-10-10T15:17:27Z)
• Source-Free Domain Adaptive Fundus Image Segmentation with Denoised Pseudo-Labeling [56.98020855107174]
  Domain adaptation typically requires to access source domain data to utilize their distribution information for domain alignment with the target data. In many real-world scenarios, the source data may not be accessible during the model adaptation in the target domain due to privacy issue. We present a novel denoised pseudo-labeling method for this problem, which effectively makes use of the source model and unlabeled target data.
  arXiv  Detail & Related papers  (2021-09-19T06:38:21Z)
• Unsupervised domain adaptation with non-stochastic missing data [0.6608945629704323]
  We consider unsupervised domain adaptation (UDA) for classification problems in the presence of missing data in the unlabelled target domain. Imputation is performed in a domain-invariant latent space and leverages indirect supervision from a complete source domain. We show the benefits of jointly performing adaptation, classification and imputation on datasets.
  arXiv  Detail & Related papers  (2021-09-16T06:37:07Z)
• Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation [74.71931918541748]
  We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA. We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process. We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-03T01:33:14Z)
• Domain Adaptation with Incomplete Target Domains [61.68950959231601]
  We propose an Incomplete Data Imputation based Adversarial Network (IDIAN) model to address this new domain adaptation challenge. In the proposed model, we design a data imputation module to fill the missing feature values based on the partial observations in the target domain. We conduct experiments on both cross-domain benchmark tasks and a real world adaptation task with imperfect target domains.
  arXiv  Detail & Related papers  (2020-12-03T00:07:40Z)
• Unsupervised Model Adaptation for Continual Semantic Segmentation [15.820660013260584]
  We develop an algorithm for adapting a semantic segmentation model that is trained using a labeled source domain to generalize well in an unlabeled target domain. We provide theoretical analysis and explain conditions under which our algorithm is effective. Experiments on benchmark adaptation task demonstrate our method achieves competitive performance even compared with joint UDA approaches.
  arXiv  Detail & Related papers  (2020-09-26T04:55:50Z)
• Towards Fair Cross-Domain Adaptation via Generative Learning [50.76694500782927]
  Domain Adaptation (DA) targets at adapting a model trained over the well-labeled source domain to the unlabeled target domain lying in different distributions. We develop a novel Generative Few-shot Cross-domain Adaptation (GFCA) algorithm for fair cross-domain classification.
  arXiv  Detail & Related papers  (2020-03-04T23:25:09Z)

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.