Methods › Computer Vision › Generative Adversarial Networks › LAPGAN
LAPGAN
Introduced by Emily Denton et al. in Deep Generative Image Models using a Laplacian Pyramid of Adversarial Networks
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
A LAPGAN, or Laplacian Generative Adversarial Network, is a type of generative adversarial network that has a Laplacian pyramid representation. In the sampling procedure following training, we have a set of generative convnet models {G₀, …, G_K}, each of which captures the distribution of coefficients hₖ for natural images at a different level of the Laplacian pyramid. Sampling an image is akin to a reconstruction procedure, except that the generative models are used to produce the hₖ’s:
Ĩₖ = u(Ĩₖ₊₁) + h̃ₖ = u(Ĩₖ₊₁) + Gₖ(zₖ, u(Ĩₖ₊₁))
The recurrence starts by setting Ĩ_(K+1) = 0 and using the model at the final level G_K to generate a residual image Ĩ_K using noise vector z_K: Ĩ_K = G_K(z_K). Models at all levels except the final are conditional generative models that take an upsampled version of the current image Ĩₖ₊₁ as a conditioning variable, in addition to the noise vector zₖ.
The generative models {G₀, …, G_K} are trained using the CGAN approach at each level of the pyramid. Specifically, we construct a Laplacian pyramid from each training image I. At each level we make a stochastic choice (with equal probability) to either (i) construct the coefficients hₖ either using the standard Laplacian pyramid coefficient generation procedure or (ii) generate them using $G_{k}:
h̃ₖ = Gₖ(zₖ, u(Iₖ₊₁))
Here Gₖ is a convnet which uses a coarse scale version of the image lₖ = u(Iₖ₊₁) as an input, as well as noise vector zₖ. Dₖ takes as input hₖ or h̃ₖ, along with the low-pass image lₖ (which is explicitly added to hₖ or h̃ₖ before the first convolution layer), and predicts if the image was real or generated. At the final scale of the pyramid, the low frequency residual is sufficiently small that it can be directly modeled with a standard GAN: h̃_K = G_K(z_K) and D_K only has h_K or h̃_K as input.
Breaking the generation into successive refinements is the key idea. We give up any “global” notion of fidelity; an attempt is never made to train a network to discriminate between the output of a cascade and a real image and instead the focus is on making each step plausible.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 5 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 5 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 5 of 5, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Generative Adversarial Networks Bridging Art and Machine Intelligence 6 Feb 2025 · 0 repositories · arXiv:2502.04116
-
Medical Image Generation using Generative Adversarial Networks 19 May 2020 · 0 repositories · arXiv:2005.10687
-
Generating Highly Realistic Images of Skin Lesions with GANs 5 Sep 2018 · 0 repositories · arXiv:1809.01410
-
MelanoGANs: High Resolution Skin Lesion Synthesis with GANs 12 Apr 2018 · 0 repositories · arXiv:1804.04338
-
Deep Generative Image Models using a Laplacian Pyramid of Adversarial Networks 18 Jun 2015 · 1 repository · arXiv:1506.05751
Tasks archive 2025-07-28
18 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections