2017
DOI: 10.48550/arxiv.1704.02510
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

DualGAN: Unsupervised Dual Learning for Image-to-Image Translation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
75
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 105 publications
(78 citation statements)
references
References 1 publication
1
75
0
Order By: Relevance
“…But it is not suitable for tasks where paired images are not available. To alleviate the burden of obtaining data pairs, unsupervised image-to-image translation approaches have been proposed [7], [33], [34], [35], which resort to the cycle consistency constraint for additional supervision. Similar ideas can also be found in [35], [36], [37].…”
Section: Related Workmentioning
confidence: 99%
“…But it is not suitable for tasks where paired images are not available. To alleviate the burden of obtaining data pairs, unsupervised image-to-image translation approaches have been proposed [7], [33], [34], [35], which resort to the cycle consistency constraint for additional supervision. Similar ideas can also be found in [35], [36], [37].…”
Section: Related Workmentioning
confidence: 99%
“…The existing solutions often assume a one to one mapping between the domains, i.e., that there exists a function y such that given a sample a in domain A, maps it to an analog sample in domain B. In fact, the circularity based constraints by ; ; Yi et al (2017) are based on this assumption, since going from one domain to the other and back, it is assumed that the original sample is obtained, which requires no loss of information. However, to employ an example made popular by , when going from a zebra to a horse, the stripes are lost, which results in an ambiguity when mapping in the other direction.…”
Section: Previous Workmentioning
confidence: 99%
“…In the problem of unsupervised domain translation, the algorithm receives two sets of samples, one from each domain, and learns a function that maps between a sample in one domain to the analogous sample in the other domain Yi et al, 2017;Benaim & Wolf, 2017;Liu & Tuzel, 2016;Liu et al, 2017;Choi et al, 2017;Conneau et al, 2017;Zhang et al, 2017a;b;Lample et al, 2018). The term unsupervised means, in this context, that the two sets are unpaired.…”
Section: Introductionmentioning
confidence: 99%
“…This problem is inherently ill-posed, as multiple analogous solutions may exist. In a number of different approaches [39,18,33] a circularity constraint is used to reduce this ambiguity. COGAN [24] and UNIT [23] enforce a shared latent representation between the two domains.…”
Section: Previous Workmentioning
confidence: 99%