FlashPapers
CVPR 2022 Oral Paper Explanation

High-Resolution Image Synthesis with Latent Diffusion Models

Robin Rombach*, Andreas Blattmann*, Dominik Lorenz, Patrick Esser, Björn Ommer

TL;DR

By training diffusion models in the lower-dimensional latent space of pretrained autoencoders instead of raw pixel space, Latent Diffusion Models (LDMs) achieve state-of-the-art image synthesis quality while drastically reducing computational requirements and enabling flexible multi-modal conditioning via cross-attention.

Latent Diffusion Perceptual Compression Cross-Attention Text-to-Image

1. Why This Matters

Generative models like GANs and autoregressive transformers have achieved incredible visual fidelity. However, their computational demands are staggering. Pixel-space Diffusion Models (DMs), while offering robust mode coverage and stable training, typically operate directly on raw RGB pixels.

This means training must spend massive representation capacity modeling imperceptible, high-frequency details (like individual strands of hair or complex textures) before learning the actual semantic structure of the scene. Consequently, training these models often consumes hundreds of GPU days, locking out researchers without massive industrial compute budgets.

2. The Big Idea

The core breakthrough of Latent Diffusion Models is the explicit separation of the image generation process into two distinct phases:

1. Perceptual Compression

An autoencoder ($\mathcal{E}, \mathcal{D}$) learns a low-dimensional, perceptually equivalent latent space. This strips away high-frequency pixel noise while preserving vital spatial and structural details.

2. Semantic Generation

A Diffusion Model (U-Net) is trained exclusively within this compact latent space. This allows the model to focus its capacity entirely on learning conceptual layout and semantic relationships.

By transitioning from pixel space to latent space, training and inference become significantly more efficient, democratizing high-resolution synthesis.

Interactive Walkthrough: LDM Architecture

Click on the components of the diagram to explore how data flows through the Latent Diffusion Model.

Pixel Space Input $x$ $H \times W \times 3$ Output $\tilde{x}$ Reconstructed $\mathcal{E}$ Latent Space ($z$) Latent $z$ $h \times w \times c$ Denoising U-Net $\epsilon_\theta$ Cross-Attention $\mathcal{D}$ Conditioning Encoder $\tau_\theta$ Text / Layout / Image

Select a component above

Click on any colored block in the system diagram to reveal details about its mathematical framework, operational dimensions, and exact role in the generation process.

3. How It Works

3.1 Perceptual Compression

The first stage trains an autoencoder on a massive collection of images. The encoder $\mathcal{E}$ maps an image $x \in \mathbb{R}^{H \times W \times 3}$ to a latent representation $z = \mathcal{E}(x) \in \mathbb{R}^{h \times w \times c}$, downsampling the spatial dimension by a factor $f = H/h = W/w$.

To prevent highly high-variance latent spaces, the authors experiment with two regularization techniques:

  • KL-reg: Imposes a mild Kullback-Leibler penalty toward a standard normal distribution, similar to a standard VAE.
  • VQ-reg: Integrates a vector quantization layer within the decoder, acting as a VQGAN but mapping the quantization directly into the decoder.

3.2 Latent Diffusion Models

Once the latent space is established, a time-conditional U-Net $\epsilon_\theta$ is trained to reverse a forward diffusion process. The objective function simplifies to predicting the noise added to the latent representation:

$$L_{LDM} := \mathbb{E}_{\mathcal{E}(x), \epsilon \sim \mathcal{N}(0,1), t} \left[ \left\| \epsilon - \epsilon_\theta(z_t, t) \right\|_2^2 \right]$$

3.3 Conditioning via Cross-Attention

To turn diffusion models into highly flexible generators driven by multi-modal inputs (like text prompts, semantic layout maps, or bounding boxes), the authors augment the U-Net backbone with a cross-attention mechanism.

The input conditioning $y$ (e.g., text) is mapped via a domain-specific encoder $\tau_\theta(y)$ to an intermediate representation. This is then projected into the U-Net layers using:

$$\text{Attention}(Q, K, V) = \text{softmax}\left(\frac{Q K^T}{\sqrt{d}}\right) \cdot V$$ $$\text{where } Q = W_Q^{(i)} \cdot \phi_i(z_t), \quad K = W_K^{(i)} \cdot \tau_\theta(y), \quad V = W_V^{(i)} \cdot \tau_\theta(y)$$

Interactive Tool: Compression Trade-offs ($f$)

Adjust the spatial downsampling factor $f$ to observe how the choice of latent grid size impacts reconstruction quality, training speed, and computational efficiency.

Pixel (f=1) f=2 f=4 f=8 f=16
Reconstruction Quality 27.43 dB PSNR (Higher is better)
Training Throughput 0.97 samples/s Throughput (Higher is better)
FID Score 0.58 Reconstruction FID (Lower is better)
Analysis:

At $f=4$, the model strikes an optimal balance. It reduces spatial dimensions sufficiently for rapid training while preserving fine-grained details.

Interactive Demo: Latent Denoising Process

Simulate the reverse diffusion process. Choose a text prompt, then slide the timestep from pure Gaussian noise ($t=1000$) down to a clean reconstructed image ($t=0$).

Latent Space Grid ($z_t$)
Decoded Pixel Output ($\mathcal{D}(z_t)$)
t = 0 (Clean Image) t = 500 t = 1000 (Pure Noise)

4. Results & Benchmarks

Latent Diffusion Models achieve state-of-the-art results across various synthesis tasks while requiring significantly fewer parameters and training resources than pixel-space baselines.

Dataset Method FID ($\downarrow$) Compute / Params
CelebA-HQ 256x256 LDM-4 (Ours) 5.11 274M params
CelebA-HQ 256x256 LSGM [93] 7.22 Joint latent training
FFHQ 256x256 LDM-4 (Ours) 4.98 274M params
FFHQ 256x256 ImageBART [21] 9.57 Autoregressive
LSUN-Churches LDM-8 (Ours) 4.02 256M params
LSUN-Churches DDPM [30] 7.89 Pixel-space baseline

5. Limitations & Societal Impact

Limitations

While LDMs significantly reduce computational requirements, their sequential sampling process during inference remains slower than single-pass generative models like GANs. Additionally, when high precision is required, the lossy nature of the autoencoder's reconstruction can become a bottleneck for tasks requiring pixel-perfect accuracy.

Societal Impact

By reducing the cost of training and deploying powerful generative models, this work democratizes access to advanced AI media tools. However, it also lowers the barrier to creating highly realistic manipulated imagery, raising concerns about misinformation, deepfakes, and intellectual property rights.

6. Glossary

Perceptual Compression

The process of mapping high-dimensional image pixels into a lower-dimensional latent space using an autoencoder. This step filters out imperceptible high-frequency noise while retaining essential structural layout and geometry.

Cross-Attention

An attention mechanism that allows a model to combine information from different modalities (e.g., text prompts and latent image representations) by mapping queries from one domain to keys and values of another.

FID (Fréchet Inception Distance)

A metric used to evaluate the quality of images created by a generative model. It measures the distance between feature vectors of real and generated images; lower scores indicate higher visual quality and realism.

7. Citation

@inproceedings{rombach2022high,
  title={High-resolution image synthesis with latent diffusion models},
  author={Rombach, Robin and Blattmann, Andreas and Lorenz, Dominik and Esser, Patrick and Ommer, Bj{\"o}rn},
  booktitle={Proceedings of the IEEE/CVF conference on computer vision and pattern recognition},
  pages={10684--10695},
  year={2022}
}
Made with Flash Papers — make your own