PATCHGAN PARADOX/ brats-2020
Dataset BraTS 2020 · 369 volumes Ablation Models A–D Runs 5 × 35 epochs Compute 12.2 GPU-h Author Dhruv Gupta · Bennett University
BraTS 2020 · brain tumour segmentation

Resolving the PatchGAN Paradox

A critic that got better at judging every local patch made the segmentation worse. Four conditional-GAN discriminators, 369 brain MRI volumes, one generator held fixed — and two failure modes you can predict from the kernel size alone.

Axial T2-FLAIR MRI slice of a brain with a large bright lesion in the right frontal lobe.
Input · T2-FLAIR
The expert consensus segmentation for the same slice: a large core region surrounded by a ring of edema.
Expert mask
Model D's predicted segmentation for the same slice, closely matching the expert mask in shape and position.
Model D output
Validation slice 41, unseen in training — the only critic geometry that survives both failure modes.
The setup

A U-Net hedges. A critic makes it commit.

A 2D U-Net trained on pixel-wise cross-entropy optimises every voxel independently. Faced with an ambiguous boundary voxel — and in glioma annotation almost every boundary voxel is ambiguous — it hedges, predicting the average of the plausible expert answers. The result is the signature failure of CNN segmentation: overly safe, over-smoothed boundaries that blur the line between necrotic core and healthy white matter.

A conditional GAN replaces part of that objective with a second network whose only job is to answer "given this MRI, was this mask drawn by a human?" That is a learned shape prior — something no per-pixel loss can express.

But a discriminator is not one thing. It has a kernel size, a stride, a downsampling strategy and a verdict geometry, and this study finds that two of those choices break it outright.

The research question. What architectural constraints does a PatchGAN discriminator have to satisfy before adversarial supervision helps rather than harms a multi-class medical segmentation model?

The ablation

Four models, three lessons

Same generator, same data, same 35 epochs. Only the critic changes — and two of the four fail in ways that are diagnosable before training starts.

Model A

No critic — baseline U-Net

Pixel-wise cross-entropy only. Segments the tumour reliably and scores 99.27 % pixel accuracy, but produces exactly the smoothed, low-confidence boundaries the study set out to fix.

25.38 dB · SSIM 0.9577 · 88 min

Model B · the artifact flaw

3×3 kernel, stride 2

A 3×3 window advancing 2 pixels at a time does not tile its input evenly: alternating columns are seen twice, then once. That asymmetric overlap imprints checkerboard artefacts straight into the predicted mask.

24.64 dB · SSIM 0.9510 · 148 min

Model C · the paradox

3×3 kernel, stride 1 + MaxPool

The tiling fix works — artefacts vanish and this model reaches the best local segmentation loss in the study, 0.035. Its global structural similarity then collapses to 0.9341, the worst result recorded.

21.62 dB · SSIM 0.9341 · 211 min

Model D · the goldilocks zone

4×4 kernel, stride 2

4 divides by 2. Every input column is seen by exactly two windows, so feature extraction is symmetric and no artefacts appear — while the verdict still covers enough of the slice to preserve global anatomy.

25.96 dB · SSIM 0.9583 · 137 min

Model D + CLAHE

The clinical pipeline — and the perception–distortion trade-off

Contrast-limited adaptive histogram equalisation makes tumour boundaries visibly crisper to a human reader and improves the segmentation loss, yet PSNR falls 1.2 dB. PSNR and SSIM read a deliberate contrast shift as distortion. Where diagnostic clarity and a distortion metric disagree, the study argues the clinician wins. 24.76 dB · SSIM 0.9582

The mechanism

Why 4 ÷ 2 works and 3 ÷ 2 does not

The whole ablation turns on one integer division. A convolution window of size k advancing by stride s covers each input position a number of times that is constant only when k is a multiple of s.

4×4 kernel, stride 2 — k / s = 2 Model D · uniform overlap windows input covered 222 222 constant → symmetric gradients 3×3 kernel, stride 2 — k / s = 1.5 Model B · alternating overlap 21 21 21 period-2 bias → checkerboard Every input column feeds the loss through a different number of paths on the right, so the critic’s gradient carries a fixed spatial rhythm. The generator learns that rhythm along with the anatomy — and stamps it into the tumour mask.
Interior coverage counts for a 10-pixel row. Verified numerically: k=4, s=2 → [2,2,2,2,2,2] against k=3, s=2 → [2,1,2,1,2,1]. Model C removes the asymmetry a different way — stride 1 gives uniform coverage of 3 — but pays for it with the paradox.
The central finding

The PatchGAN Paradox

Model C is the most interesting failure in the study because it fails while winning. Replacing strided convolutions with stride-1 convolutions and max-pooling made its discriminator an extremely capable local judge, and the generator's segmentation loss fell to 0.035 — the best figure any model in the ablation achieved. Its global structural similarity fell to 0.9341 — the worst.

The mechanism: the discriminator became so adept at penalising individual patches that the cheapest way for the generator to fool it was to inject high-frequency micro-texture into the mask. Every patch looked convincingly real. The mask as a whole stopped being a continuous anatomical object — the one property radiomics and surgical planning actually depend on.

Local realism and global coherence are separate objectives, and optimising hard for the first actively destroys the second. PatchGAN works for photographic translation because photographic realism is locally determined. A 4-class label map has almost no local information: a patch of pure "edema" is identical whether the mask is perfect or displaced by 40 pixels.

Model C also destabilised the adversarial game outright — its discriminator loss climbed from 9.06 to 12.48 across 35 epochs instead of settling near 1.0. See the divergence in the training curves →

Ablation results

The whole study in one table

Evaluated on tumour-bearing validation slices. Segmentation loss is the generator’s cross-entropy term at the final epoch.
ConfigurationKernel / strideArtefactsSeg lossPSNR (dB)SSIMVerdict
Model A — U-Netn/anone0.017725.38170.9577over-smoothed baseline
Model B — cGAN3×3, s2checkerboard0.037824.63950.9510structurally flawed
Model C — cGAN3×3, s1 + poolnone0.035521.61540.9341the PatchGAN Paradox
Model D — cGAN4×4, s2none0.019825.95560.9583the Goldilocks Zone
Model D + CLAHE4×4, s2none0.019424.76330.9582optimal clinical balance

Every figure is read from a printed cell output in the published notebooks. Where the accompanying paper quotes different values for Model D, the notebook-measured value is used here. See limitations for how tightly these gaps should be read.

Pixel accuracy
99.27%
Model A on 45 held-out patients
Dice · enhancing tumour
0.708
edema 0.700 · necrotic core 0.569
Shared generator
7.76M
identical across all five runs
Output

What the models actually predict

Unmodified output cells from the notebooks that produced them.

  • Necrotic / non-enhancing core
  • Peritumoral edema
  • GD-enhancing tumour

Every model side by side →