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

Optimal Transport driven CycleGAN for Unsupervised Learning in Inverse Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
50
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
3

Relationship

3
4

Authors

Journals

citations
Cited by 17 publications
(51 citation statements)
references
References 38 publications
1
50
0
Order By: Relevance
“…It is also possible to train a GAN using model-based costs. In [75], an MBIR cost that embeds a generative network is used to formulate a training loss for the generator based on optimal transport [83]. Particularly, the generator takes measurements as inputs and outputs images, which models the inverse path of the imaging problem.…”
Section: Generative Adversarial Network (Gan) Based Methodsmentioning
confidence: 99%
“…It is also possible to train a GAN using model-based costs. In [75], an MBIR cost that embeds a generative network is used to formulate a training loss for the generator based on optimal transport [83]. Particularly, the generator takes measurements as inputs and outputs images, which models the inverse path of the imaging problem.…”
Section: Generative Adversarial Network (Gan) Based Methodsmentioning
confidence: 99%
“…Here we briefly review the OT-driven cycleGAN design in our companion paper [24], which is used for our unsupervised learning method.…”
Section: A Optimal Transport Driven Cycleganmentioning
confidence: 99%
“…where the minimum is taken over the joint distribution π(x, y) whose marginal distribution with respect to X and Y is µ and ν, respectively. Another important discovery in our companion paper [24] is that the resulting primal problem can be equivalently represented by the Kantorovich dual formulation [21], [22]:…”
Section: A Optimal Transport Driven Cycleganmentioning
confidence: 99%
See 2 more Smart Citations