Pith. sign in

REVIEW 2 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1703.05192 v2 pith:DK4HZXOO submitted 2017-03-15 cs.CV

Learning to Discover Cross-Domain Relations with Generative Adversarial Networks

classification cs.CV
keywords relationsdiscoveradversarialcross-domaindatadifferentdiscogandomains
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

While humans easily recognize relations between data from different domains without any supervision, learning to automatically discover them is in general very challenging and needs many ground-truth pairs that illustrate the relations. To avoid costly pairing, we address the task of discovering cross-domain relations given unpaired data. We propose a method based on generative adversarial networks that learns to discover relations between different domains (DiscoGAN). Using the discovered relations, our proposed network successfully transfers style from one domain to another while preserving key attributes such as orientation and face identity. Source code for official implementation is publicly available https://github.com/SKTBrain/DiscoGAN

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Co-Evolutionary Compression for Unpaired Image Translation

    cs.CV 2019-07 unverdicted novelty 6.0

    A co-evolutionary compression technique reduces parameters and FLOPs in unpaired image-to-image translation GAN generators while maintaining translation quality on benchmarks.

  2. Multivariate-Information Adversarial Ensemble for Scalable Joint Distribution Matching

    cs.LG 2019-07 unverdicted novelty 5.0

    MMI-ALI extends pairwise ALI models into an m-domain ensemble by maximizing MMI on joint variables to achieve scalable joint distribution matching with linear scaling in m.