Generalized One-shot Domain Adaption of Generative Adversarial Networks
- URL: http://arxiv.org/abs/2209.03665v1
- Date: Thu, 8 Sep 2022 09:24:44 GMT
- Title: Generalized One-shot Domain Adaption of Generative Adversarial Networks
- Authors: Zicheng Zhang, Yinglu Liu, Congying Han, Tiande Guo, Ting Yao, Tao Mei
- Abstract summary: The adaption of Generative Adversarial Network (GAN) aims to transfer a pre-trained GAN to a given domain with limited training data.
We consider that the adaptation from source domain to target domain can be decoupled into two parts: the transfer of global style like texture and color, and the emergence of new entities that do not belong to the source domain.
Our core objective is to constrain the gap between the internal distributions of the reference and syntheses by sliced Wasserstein distance.
- Score: 72.84435077616135
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The adaption of Generative Adversarial Network (GAN) aims to transfer a
pre-trained GAN to a given domain with limited training data. In this paper, we
focus on the one-shot case, which is more challenging and rarely explored in
previous works. We consider that the adaptation from source domain to target
domain can be decoupled into two parts: the transfer of global style like
texture and color, and the emergence of new entities that do not belong to the
source domain. While previous works mainly focus on the style transfer, we
propose a novel and concise
framework\footnote{\url{https://github.com/thevoidname/Generalized-One-shot-GAN-Adaption}}
to address the \textit{generalized one-shot adaption} task for both style and
entity transfer, in which a reference image and its binary entity mask are
provided. Our core objective is to constrain the gap between the internal
distributions of the reference and syntheses by sliced Wasserstein distance. To
better achieve it, style fixation is used at first to roughly obtain the
exemplary style, and an auxiliary network is introduced to the original
generator to disentangle entity and style transfer. Besides, to realize
cross-domain correspondence, we propose the variational Laplacian
regularization to constrain the smoothness of the adapted generator. Both
quantitative and qualitative experiments demonstrate the effectiveness of our
method in various scenarios.
Related papers
- Adaptive Semantic Consistency for Cross-domain Few-shot Classification [27.176106714652327]
Cross-domain few-shot classification (CD-FSC) aims to identify novel target classes with a few samples.
We propose a simple plug-and-play Adaptive Semantic Consistency framework, which improves cross-domain robustness.
The proposed ASC enables explicit transfer of source domain knowledge to prevent the model from overfitting the target domain.
arXiv Detail & Related papers (2023-08-01T15:37:19Z) - Bidirectional Domain Mixup for Domain Adaptive Semantic Segmentation [73.3083304858763]
This paper systematically studies the impact of mixup under the domain adaptaive semantic segmentation task.
In specific, we achieve domain mixup in two-step: cut and paste.
We provide extensive ablation experiments to empirically verify our main components of the framework.
arXiv Detail & Related papers (2023-03-17T05:22:44Z) - Cyclically Disentangled Feature Translation for Face Anti-spoofing [61.70377630461084]
We propose a novel domain adaptation method called cyclically disentangled feature translation network (CDFTN)
CDFTN generates pseudo-labeled samples that possess: 1) source domain-invariant liveness features and 2) target domain-specific content features, which are disentangled through domain adversarial training.
A robust classifier is trained based on the synthetic pseudo-labeled images under the supervision of source domain labels.
arXiv Detail & Related papers (2022-12-07T14:12:34Z) - Continual Unsupervised Domain Adaptation for Semantic Segmentation using
a Class-Specific Transfer [9.46677024179954]
segmentation models do not generalize to unseen domains.
We propose a light-weight style transfer framework that incorporates two class-conditional AdaIN layers.
We extensively validate our approach on a synthetic sequence and further propose a challenging sequence consisting of real domains.
arXiv Detail & Related papers (2022-08-12T21:30:49Z) - Towards Diverse and Faithful One-shot Adaption of Generative Adversarial
Networks [54.80435295622583]
One-shot generative domain adaption aims to transfer a pre-trained generator on one domain to a new domain using one reference image only.
We present a novel one-shot generative domain adaption method, i.e., DiFa, for diverse generation and faithful adaptation.
arXiv Detail & Related papers (2022-07-18T16:29:41Z) - Connecting adversarial attacks and optimal transport for domain
adaptation [116.50515978657002]
In domain adaptation, the goal is to adapt a classifier trained on the source domain samples to the target domain.
In our method, we use optimal transport to map target samples to the domain named source fiction.
Our main idea is to generate a source fiction by c-cyclically monotone transformation over the target domain.
arXiv Detail & Related papers (2022-05-30T20:45:55Z) - 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)
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.