DAFD: Domain Adaptation via Feature Disentanglement for Image Classification

• URL: http://arxiv.org/abs/2301.13337v2
• Date: Tue, 9 Jan 2024 05:09:09 GMT
• Title: DAFD: Domain Adaptation via Feature Disentanglement for Image Classification
• Authors: Zhize Wu, Changjiang Du, Le Zou, Ming Tan, Tong Xu, Fan Cheng, Fudong Nian, and Thomas Weise
• Abstract summary: Unsupervised domain adaptation (UDA) reduces the domain shift by transferring the knowledge learned from a labeled source domain to an unlabeled target domain. We perform feature disentanglement for UDA by distilling category-relevant features and excluding category-irrelevant features from the global feature maps. This reduces the difficulty of domain alignment and improves the classification accuracy on the target domain.
• Score: 8.575537779033263
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: A good feature representation is the key to image classification. In practice, image classifiers may be applied in scenarios different from what they have been trained on. This so-called domain shift leads to a significant performance drop in image classification. Unsupervised domain adaptation (UDA) reduces the domain shift by transferring the knowledge learned from a labeled source domain to an unlabeled target domain. We perform feature disentanglement for UDA by distilling category-relevant features and excluding category-irrelevant features from the global feature maps. This disentanglement prevents the network from overfitting to category-irrelevant information and makes it focus on information useful for classification. This reduces the difficulty of domain alignment and improves the classification accuracy on the target domain. We propose a coarse-to-fine domain adaptation method called Domain Adaptation via Feature Disentanglement~(DAFD), which has two components: (1)the Category-Relevant Feature Selection (CRFS) module, which disentangles the category-relevant features from the category-irrelevant features, and (2)the Dynamic Local Maximum Mean Discrepancy (DLMMD) module, which achieves fine-grained alignment by reducing the discrepancy within the category-relevant features from different domains. Combined with the CRFS, the DLMMD module can align the category-relevant features properly. We conduct comprehensive experiment on four standard datasets. Our results clearly demonstrate the robustness and effectiveness of our approach in domain adaptive image classification tasks and its competitiveness to the state of the art.

Related papers

• I2F: A Unified Image-to-Feature Approach for Domain Adaptive Semantic Segmentation [55.633859439375044]
  Unsupervised domain adaptation (UDA) for semantic segmentation is a promising task freeing people from heavy annotation work. Key idea to tackle this problem is to perform both image-level and feature-level adaptation jointly. This paper proposes a novel UDA pipeline for semantic segmentation that unifies image-level and feature-level adaptation.
  arXiv  Detail & Related papers  (2023-01-03T15:19:48Z)
• Birds of A Feather Flock Together: Category-Divergence Guidance for Domain Adaptive Segmentation [35.63920597305474]
  Unsupervised domain adaptation (UDA) aims to enhance the generalization capability of a certain model from a source domain to a target domain. In this work, we propose an Inter-class Separation and Intra-class Aggregation (ISIA) mechanism. By measuring the align complexity of each category, we design an Adaptive-weighted Instance Matching (AIM) strategy to further optimize the instance-level adaptation.
  arXiv  Detail & Related papers  (2022-04-05T11:17:19Z)
• ToAlign: Task-oriented Alignment for Unsupervised Domain Adaptation [84.90801699807426]
  We study what features should be aligned across domains and propose to make the domain alignment proactively serve classification. We explicitly decompose a feature in the source domain intoa task-related/discriminative feature that should be aligned, and a task-irrelevant feature that should be avoided/ignored.
  arXiv  Detail & Related papers  (2021-06-21T02:17:48Z)
• Coarse-to-Fine Domain Adaptive Semantic Segmentation with Photometric Alignment and Category-Center Regularization [42.25246413410471]
  We propose a novel UDA pipeline that unifies image-level alignment and category-level feature distribution regularization in a coarse-to-fine manner. Experimental results show that our proposed pipeline improves the capability of the generalization of the final segmentation model.
  arXiv  Detail & Related papers  (2021-03-24T08:04:08Z)
• MeGA-CDA: Memory Guided Attention for Category-Aware Unsupervised Domain Adaptive Object Detection [80.24165350584502]
  We propose Memory Guided Attention for Category-Aware Domain Adaptation. The proposed method consists of employing category-wise discriminators to ensure category-aware feature alignment. The method is evaluated on several benchmark datasets and is shown to outperform existing approaches.
  arXiv  Detail & Related papers  (2021-03-07T01:08:21Z)
• Domain Adaptive Semantic Segmentation Using Weak Labels [115.16029641181669]
  We propose a novel framework for domain adaptation in semantic segmentation with image-level weak labels in the target domain. We develop a weak-label classification module to enforce the network to attend to certain categories. In experiments, we show considerable improvements with respect to the existing state-of-the-arts in UDA and present a new benchmark in the WDA setting.
  arXiv  Detail & Related papers  (2020-07-30T01:33:57Z)
• Joint Visual and Temporal Consistency for Unsupervised Domain Adaptive Person Re-Identification [64.37745443119942]
  This paper jointly enforces visual and temporal consistency in the combination of a local one-hot classification and a global multi-class classification. Experimental results on three large-scale ReID datasets demonstrate the superiority of proposed method in both unsupervised and unsupervised domain adaptive ReID tasks.
  arXiv  Detail & Related papers  (2020-07-21T14:31:27Z)
• Exploring Categorical Regularization for Domain Adaptive Object Detection [27.348272177261233]
  We propose a categorical regularization framework for domain adaptive object detection. It can be applied as a plug-and-play component on a series of Adaptive Domain Faster R-CNN methods. Our method obtains a significant performance gain over original Domain Adaptive Faster R-CNN detectors.
  arXiv  Detail & Related papers  (2020-03-20T08:53:10Z)
• Differential Treatment for Stuff and Things: A Simple Unsupervised Domain Adaptation Method for Semantic Segmentation [105.96860932833759]
  State-of-the-art approaches prove that performing semantic-level alignment is helpful in tackling the domain shift issue. We propose to improve the semantic-level alignment with different strategies for stuff regions and for things. In addition to our proposed method, we show that our method can help ease this issue by minimizing the most similar stuff and instance features between the source and the target domains.
  arXiv  Detail & Related papers  (2020-03-18T04:43:25Z)

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.