GAN Theory
Theoretical foundations of Generative Adversarial Networks for Earth observation.
Adversarial Learning
Minimax Objective
\min_G \max_D V(D, G) = \mathbb{E}_{x \sim p_{data}}[\log D(x)] + \mathbb{E}_{z \sim p_z}[\log(1 - D(G(z)))]
Reference: Goodfellow, I., et al. (2014). Generative Adversarial Nets. NeurIPS. arXiv:1406.2661
Loss Functions
LSGAN (Least Squares)
Reference: Mao, X., et al. (2017). Least Squares Generative Adversarial Networks. ICCV. DOI: 10.1109/ICCV.2017.304
WGAN
Reference: Arjovsky, M., et al. (2017). Wasserstein GAN. ICML. arXiv:1701.07875
Image Translation
Pix2Pix
Reference: Isola, P., et al. (2017). Image-to-Image Translation with Conditional Adversarial Networks. CVPR. DOI: 10.1109/CVPR.2017.632
CycleGAN
Cycle consistency loss:
Reference: Zhu, J.Y., et al. (2017). Unpaired Image-to-Image Translation. ICCV. DOI: 10.1109/ICCV.2017.244
Super-Resolution
Perceptual Loss
Reference: Ledig, C., et al. (2017). Photo-Realistic Single Image Super-Resolution Using a Generative Adversarial Network. CVPR. DOI: 10.1109/CVPR.2017.19
Training Stability
Spectral Normalization
Reference: Miyato, T., et al. (2018). Spectral Normalization for Generative Adversarial Networks. ICLR. arXiv:1802.05957
Gradient Penalty
Reference: Gulrajani, I., et al. (2017). Improved Training of Wasserstein GANs. NeurIPS. arXiv:1704.00028