← sakibchowdhury131.github.io

Heat Dissipation Image Generation: Diffusion by Reversing the Heat Equation

Sakib Chowdhury
Stevens Institute of Technology
Independent Research · Unpublished

Standard diffusion corrupts an image with i.i.d. Gaussian noise. This model corrupts it with the heat equation instead — a deterministic, physically grounded blur that dissolves fine detail first and coarse structure last — then trains a U-Net to reverse that blur and recover the original image.

û(k, t) = û(k, 0) · exp(−2π²σ(t)²|k|²) Forward corruption in Fourier space — a Gaussian low-pass filter whose bandwidth shrinks as t grows
1.0000
Mass-conservation ratio at every blur level tested — the forward process only redistributes pixel intensity, never adds or removes it
0.0178→0.0013
Training MSE loss over 100 epochs, 6.2M-parameter U-Net, 5,000 synthetic images
0.00
Remaining energy in the top 4 of 5 frequency bands at the final blur level — high frequencies are destroyed completely, not just attenuated
Code (GitHub) Generation results ↓

Replacing Gaussian Noise With the Heat Equation

Standard diffusion models corrupt an image with independent Gaussian noise at every pixel, destroying every spatial frequency at the same rate. The heat equation corrupts an image differently: it is equivalent to convolving with a Gaussian kernel whose width grows with time, which in frequency space is a low-pass filter that gets progressively narrower. High-frequency detail (edges, texture) is attenuated fastest; low-frequency structure (overall color, rough shape) survives the longest. Run forward far enough, and any image converges to a single flat field — not to random noise.

clean image u0—heat blur→flat field uT
utmodel predictsû0—re-blur to t−1→ut−1
Forward heat dissipation process applied to synthetic shape images across increasing blur levels, converging to a flat field
Eight sample images (columns) blurred at six increasing timesteps (rows, top to bottom). By the last row, every image has converged to a near-uniform flat color — the deterministic endpoint the heat equation always reaches.
AspectStandard diffusionHeat dissipation (this work)
Forward corruptionadd i.i.d. Gaussian noiseblur with the heat kernel (FFT multiply)
Frequency treatmentevery frequency corrupted equallyhigh frequencies die first, low frequencies survive longest
Network predictsnoise ε, then u0 = ut − εclean image u0 directly
Mass conservationnot applicableexact — the zero-frequency (mean color) term is untouched by construction
Endpoint at t=Tpure random noisea deterministic flat field (the image's own average color)

A U-Net That Predicts the Clean Image, Not the Noise

A time-conditioned U-Net fθ(ut, t) takes the blurred image and a sinusoidal embedding of the blur level t, and predicts the original clean image u0 directly — unlike standard diffusion policies, which predict the noise that was added and subtract it out. The network uses residual blocks with GroupNorm and time-conditioning at every stage, encoder/decoder skip connections, and is trained with a single MSE loss between the prediction and the ground-truth image at a randomly sampled blur level per batch.

SettingValue
Dataset5,000 synthetic 32×32 images — geometric shapes with gradient backgrounds
Model size6,231,363 parameters
Blur schedule30 timesteps, log-spaced σ from 0.01 to 10
OptimizerAdamW, lr 2e-4, cosine annealed, gradient-clipped at 1.0
Training100 epochs, batch size 64
LossMSE between predicted and ground-truth clean image
Training loss curve over 100 epochs on a log scale, decreasing from about 0.018 to 0.0013
MSE loss (log scale) over 100 epochs: 0.0178 → 0.0013, a smooth and fully converged descent with no instability — despite each batch seeing a different randomly sampled blur level.

Reconstruction: Recovering a Real Image From Its Blurred Version

The most direct test of fθ is reconstruction: take a real image, blur it to a given timestep, and check whether the network can recover the original in a single forward pass.

Grid comparing original images (row 1) to single-pass reconstructions from five increasing blur levels (rows 2-6)
Row 1: originals. Rows 2–6: single-pass reconstructions from progressively heavier blur (t = 2, 7, 15, 22, 29 of 30). Reconstruction stays visually near-perfect through most of the schedule and only degrades noticeably at the final, almost-flat blur level — exactly where the least information remains to reconstruct from.

Generation: Iteratively Reversing the Blur

Reconstruction predicts u0 in one shot; generation instead walks backward through the schedule — predict u0, re-blur that prediction to t−1, feed it back in, and repeat down to t=0. Two starting points were tested: a real image blurred all the way to the maximum timestep, and a synthetic near-flat field with no information about any specific image at all.

Images generated by iteratively sharpening maximally-blurred versions of real images
Images generated by iteratively sharpening a near-uniform flat field with no seed image information
Left — generated by iteratively sharpening real images blurred to the maximum timestep: shapes and colors are largely recovered, close to the true seed. Right — generated from a near-uniform flat field with a small symmetry-breaking perturbation: the model still produces plausible blob-like shapes, but colors are muted and per-pixel speckle noise is visible — this is genuine synthesis, not reconstruction, and it shows.
The honest limitation

Because the forward process is deterministic, there is no built-in source of randomness to seed sample diversity the way Gaussian noise does in standard diffusion. Starting from a flat field with only a tiny random perturbation gives the reverse process very little to work with, and the result is visibly noisier and lower-fidelity than reconstruction from a real (if heavily blurred) image. This is a structural property of "cold" deterministic corruption processes, not a bug in this particular network — and it's the reason later work in this space (e.g. Cold Diffusion, Bansal et al. 2022) pairs a deterministic forward process with an explicit source of seed diversity.

Detail Builds Up Coarse-to-Fine

Stopping the reverse process early, at different timesteps, exposes the same coarse-to-fine hierarchy the forward process created — early stops give abstract color blobs, later stops progressively add shape and edge detail.

Grid showing the reverse process stopped at five different timesteps, from abstract flat colors to full detail
Same seeds, reverse process stopped at five points from most-blurred (top) to fully sharpened (bottom). Coarse color and rough shape appear first; fine edges and boundaries resolve last — the mirror image of how the forward process destroyed them.

Verifying the Physics: Mass Conservation and Frequency Decay

Two numerical checks confirm the forward process behaves exactly as the heat-equation math predicts.

Mass conservation

Total pixel intensity summed over the whole image, before and after blurring:

Blur level (t)Original massBlurred massRatio
01448.711448.711.0000
101448.711448.711.0000
151448.711448.711.0000
29 (max)1448.711448.711.0000
Exact to the precision shown, at every blur level — the zero-frequency (DC) component is untouched by the Gaussian filter by construction, so total intensity can never drift.

High frequencies die first

Average FFT magnitude in five concentric frequency bands (band 1 = lowest frequencies, band 5 = highest), at increasing blur levels:

tBand 1Band 2Band 3Band 4Band 5
019.663.031.631.170.99
519.663.031.631.170.99
1019.643.001.591.110.91
1519.442.701.200.650.39
29 (max)7.400.000.000.000.00
By the final timestep, bands 2–5 have been destroyed completely (0.00), while band 1 (the lowest frequencies, closest to the mean color) still retains ~38% of its original energy — exactly the "fine detail dies first, coarse structure survives" hierarchy the forward process is designed to produce.

Extending to Real Datasets

Everything above trains on a small synthetic shapes dataset chosen for fast iteration and clean, interpretable structure. The repository also includes a more general, CLI-configurable version of the same method — a deeper U-Net with optional self-attention at low resolution, an optional stochastic perturbation during sampling, and out-of-the-box support for CIFAR-10, CIFAR-100, and CelebA. That script is provided as a documented starting point for scaling the method up; it has not yet been run to completion on a real photographic dataset, so no results are claimed for it here.