ECCV 2026

BiSLW: Bi-Spectral Latent Watermarking for Generative Diffusion Models

PDPM Indian Institute of Information Technology, Jabalpur, India

23bec023@iiitdmj.ac.in

BiSLW embeds a shared watermark identity across complementary semantic and textural frequency bands of diffusion latents, improving robustness to regeneration and common distortions while preserving high visual fidelity.

BiSLW architecture showing the full pipeline: prompt and random noise enter a Latent Diffusion Model, the generated latent z₀ undergoes channel-wise DCT decomposition into low-frequency semantic and high-frequency textural bands, a shared watermark message w is embedded into both via spectral encoders E_L and E_H, the bands are recombined via spectral recombination and inverse DCT, and the watermarked latent z̃₀ is decoded by the VAE into the final watermarked image.
BiSLW decomposes diffusion latents into low-frequency semantic and high-frequency textural components, embeds the same watermark identity into both, and recombines them before VAE decoding.

Overview

Diffusion models have made synthetic imagery increasingly realistic, creating a growing need for reliable provenance and attribution mechanisms. Invisible watermarking offers one approach, but existing methods often operate after image generation, treat latent representations primarily as spatial feature maps, or rely on fixed frequency-domain patterns. These signals can weaken when generated images undergo compression, geometric transformations, or diffusion-based regeneration.

BiSLW introduces a trainable bi-spectral latent watermarking framework that explicitly uses the internal frequency structure of diffusion latents. A channel-wise Discrete Cosine Transform separates the latent representation into complementary low-frequency and high-frequency components. The low-frequency band captures coarse semantic structure, while the high-frequency band represents finer textural information.

A shared watermark message is independently embedded into both spectral regions using lightweight learned networks. Dual spectral decoders recover the identity from both pathways, while a cross-band consistency objective encourages the two representations to encode the same watermark. This creates structured redundancy across complementary generative modes.

Key Contributions

01

Bi-Spectral Latent Watermarking

BiSLW jointly embeds a watermark across low-frequency semantic and high-frequency textural components of diffusion latents using learned spectral encoders and decoders.

02

Cross-Band Identity Binding

A consistency objective aligns watermark representations recovered from both spectral pathways, creating redundancy across complementary latent structures.

03

Robustness with Minimal Overhead

BiSLW improves robustness to common distortions and diffusion regeneration while preserving high perceptual fidelity and introducing approximately 1 ms of embedding overhead.

One Identity, Two Spectral Anchors

BiSLW is motivated by the frequency hierarchy of diffusion latents. Low-frequency coefficients encode broad semantic structure, while higher-frequency coefficients capture local texture and detail. Instead of storing the watermark in only one representational mode, BiSLW anchors the same identity in both.

The DCT frequency domain of diffusion latents contains a low-frequency region encoding global semantics and a high-frequency region capturing texture details. BiSLW injects the same watermark into both via independent spectral pathways.

LOW FREQUENCY

Global semantics · stronger distortion survival

HIGH FREQUENCY

Fine texture · complementary identity signal

The two bands act as complementary anchors: if an attack disrupts one spectral region more strongly, the second pathway retains additional identity evidence.

Framework

BiSLW embeds watermark information directly into the latent representation produced by the reverse diffusion process, before VAE decoding.

Spectral Decomposition

The generated latent z₀ is transformed using a channel-wise two-dimensional Discrete Cosine Transform. Channel-wise z-score normalization compensates for the large magnitude difference between DC and higher-frequency AC coefficients before the spectrum is partitioned.

The spectral mask radius r separates the representation into low-frequency and high-frequency regions. The decomposition is lossless because the two components reconstruct the complete frequency representation.

Z_freq  =  DCT(z₀)

Z_low   =  Z_freq ⊙ M

Z_high  =  Z_freq ⊙ (1 − M)

Selected operating point: r = 0.25

Bi-Spectral Embedding

The watermark message is injected independently into both bands using lightweight perturbation networks ΔL and ΔH.

Z̃_low   =  Z_low  +  αL · ΔL(Z_low,  w)

Z̃_high  =  Z_high +  αH · ΔH(Z_high, w)

The modified spectral components are recombined and transformed back into latent space using the inverse DCT. The resulting latent is then decoded by the frozen VAE.

αL = 0.8

Stronger low-frequency embedding — low-frequency perturbations survive common distortions more reliably.

αH = 0.3

Lighter high-frequency signal provides complementary redundancy without unnecessarily affecting fine visual detail.

Watermark Extraction

A potentially distorted image is encoded back into latent space and decomposed using the same spectral transformation. Dedicated low- and high-frequency decoders independently estimate the watermark.

ŵ_L  =  D_L(Z'_low)

ŵ_H  =  D_H(Z'_high)

ŵ   =  ½ (ŵ_L + ŵ_H)

Simple averaging is used to fuse the two estimates, providing a parameter-free consensus between the semantic and textural pathways.

Cross-Band Consistency

Independent spectral embedding creates the possibility that the two pathways encode inconsistent identities. BiSLW addresses this using a cross-band consistency loss that encourages both decoders to recover aligned watermark representations.

ℒ_cons  =  ‖ ŵ_L − ŵ_H ‖²₂

This encourages identity information to remain consistent across both spectral regions.

BiSLW training framework showing the embedding pipeline (Phase 1), extraction under attack (Phase 2), and the four training objectives (Phase 3).

Lightweight by Design

The embedding modules ΔL and ΔH are lightweight convolutional encoder–decoder networks with residual connections. Each contains three convolutional blocks using 3×3 kernels and ReLU activations, with fewer than 2M parameters per module.

Watermark conditioning is implemented through Feature-wise Linear Modulation (FiLM). The binary watermark message is projected to per-channel scaling and bias parameters, allowing a single network to adapt its perturbation pattern to different watermark identities.

The extraction networks DL and DH use three convolutional blocks followed by global average pooling and a fully connected layer that predicts the watermark vector.

Training Configuration

Training epochs40
OptimizerAdamW
Learning rate6 × 10⁻⁵
Batch size8
λw (watermark)1.0
λcons (consistency)0.5
λz (fidelity)2.0
λrob (robustness)1.0
Mask radius r0.25
αL (low-freq strength)0.8
αH (high-freq strength)0.3
HardwareSingle NVIDIA A100

The diffusion backbone and VAE remain fully frozen. Only the four watermark embedding and extraction modules are optimized.

Dataset & Evaluation

BiSLW is trained using 100,000 images from MIRFLICKR-1M, a diverse collection of real-world photographs sourced from Flickr under Creative Commons licenses.

100,000
Training Images
MIRFLICKR-1M
256×256
Training Resolution
40
Training Epochs
48-bit
Extended Evaluation
Primary 32 & 48 bit

Evaluation Attacks

Robustness is evaluated against ten attack categories, including both common image distortions and diffusion-based regeneration:

Center cropRandom cropResize15° rotationGaussian blurContrast adjustmentBrightness adjustmentJPEG compressionCombined distortionsDiffusion regeneration

Results

BiSLW achieves a strong balance between perceptual fidelity, watermark robustness, generative quality, and computational efficiency.

37.40 dB
PSNR
32-bit · AI-generated
0.98
Combined Attack Acc.
AI-generated images
0.96
Regeneration Acc.
t* = 250
~1 ms
Embedding Overhead
In-generation variant

Comparison with Existing Methods

32-bit watermark · AI-generated images

* In-generation variant (1 ms embedding)

MethodPSNR ↑SSIM ↑Embed TimeClean Acc. ↑Combined Acc. ↑
DCT-DWT39.470.97139 ms0.910.51
HiDDeN32.590.9517 ms0.910.59
SSL33.230.89870 ms1.000.85
RoSteALS29.310.93144 ms1.000.50
RivaGAN40.530.9857 ms0.990.93
Tree-Ring33.640.9046 ms0.880.81
LaWa*34.250.891 ms1.000.97
BiSLW*37.400.911 ms1.000.98

BiSLW reaches 37.40 dB PSNR while maintaining 0.98 bit accuracy under the combined attack. Compared with LaWa, BiSLW improves perceptual quality by more than 3 dB while retaining strong robustness and the same approximately 1 ms in-generation embedding overhead. Note that RivaGAN reports higher PSNR (40.53 dB) but substantially lower combined-attack accuracy (0.93).

Robust Across Diverse Distortions

48-bit watermark · AI-generated images

MethodNoneC-CropR-CropResizeRotationBlurContrastBrightnessJPEGCombined
HiDDeN0.910.910.910.820.790.760.750.740.530.59
SSL1.000.740.720.990.991.000.960.950.990.85
Stable Signature0.990.950.930.960.810.780.970.960.920.92
LaWa1.000.950.910.990.960.991.001.001.000.97
BiSLW1.000.960.900.980.970.991.001.001.000.98

BiSLW achieves the highest or joint-highest accuracy across the evaluated distortions and reaches 0.98 accuracy under the combined attack. JPEG, contrast, and brightness transformations retain perfect bit accuracy in this evaluation. LaWa performs slightly better than BiSLW on random crop (0.91 vs 0.90) and resize (0.99 vs 0.98) individually — the strength of BiSLW lies in the overall robustness–fidelity trade-off rather than dominance on every individual distortion.

Preserving the Generative Distribution

Comparison of generation quality and distribution fidelity

MethodFID ↓CLIP ↑PSNR ↑KL Shift ↓Latent Shift ↓Regen. 250 ↑Regen. 500 ↑
Vanilla SD8.70.312
LaWa*9.80.30734.250.0210.0140.940.89
Tree-Ring9.90.30233.640.0240.0180.880.81
BiSLW*9.00.31137.400.0180.0110.960.92

BiSLW's FID of 9.0 remains close to vanilla Stable Diffusion at 8.7, while its CLIP similarity reaches 0.311. The comparatively small KL and latent shifts indicate that watermark embedding preserves the underlying latent distribution.

Surviving Diffusion Regeneration

Diffusion regeneration is particularly challenging because the image is re-encoded, perturbed with noise, and denoised again, potentially destroying embedded information. BiSLW degrades gradually as regeneration strength increases, outperforming representative watermarking baselines across the evaluated regeneration timesteps.

Bit accuracy as regeneration strength increases. BiSLW remains above 96% through t* = 250 and reaches 92% at t* = 500, outperforming LaWa, Stable Signature, and HiDDeN across all evaluated timesteps.

The result supports the use of complementary semantic and textural anchors rather than relying on a single latent representation. Low-frequency components are more resilient to the diffusion re-noising process, while high-frequency components contribute complementary evidence where the semantic signal is partially disrupted.

Invisible to the Eye, Recoverable After Attack

Across representative scenes, BiSLW preserves high visual fidelity. Residual maps amplified by ×10 reveal the embedded perturbation, while the corresponding watermarked generations remain visually consistent with the originals.

Original Generation

BiSLW Generation

Residual ×10

PSNR (dB) / SSIM

Original generation — Sample 1 — cityscape aerial view with golden hour lighting

Original

BiSLW watermarked generation — Sample 1 — cityscape aerial view with golden hour lighting

BiSLW

Residual map amplified ×10 revealing the embedded watermark perturbation — Sample 1 — cityscape aerial view with golden hour lighting

Residual ×10

40.24 / 0.98

Original generation — Sample 2

Original

BiSLW watermarked generation — Sample 2

BiSLW

Residual map amplified ×10 revealing the embedded watermark perturbation — Sample 2

Residual ×10

38.35 / 0.96

Original generation — Sample 3

Original

BiSLW watermarked generation — Sample 3

BiSLW

Residual map amplified ×10 revealing the embedded watermark perturbation — Sample 3

Residual ×10

39.11 / 0.96

Original generation — Sample 4

Original

BiSLW watermarked generation — Sample 4

BiSLW

Residual map amplified ×10 revealing the embedded watermark perturbation — Sample 4

Residual ×10

36.74 / 0.93

Analysis & Ablations

Beyond aggregate accuracy, the experiments examine why the bi-spectral design works and how its key parameters influence the quality–robustness trade-off.

Why Use Both Frequency Bands?

Embedding StrategyPSNR ↑SSIM ↑Combined Attack Acc. ↑
Low-frequency only38.960.920.88
High-frequency only37.120.890.90
BiSLW (Low + High)37.710.890.93

Low-frequency-only embedding provides the highest image quality but weaker combined-attack robustness. High-frequency-only embedding improves robustness slightly but reduces perceptual quality. Combining both bands reaches the strongest combined-attack accuracy, supporting the central hypothesis that semantic and textural pathways provide complementary identity information.

Finding the Spectral Split

Radius rPSNR ↑SSIM ↑Combined Acc. ↑
0.1536.940.870.89
0.2037.330.880.91
0.2537.710.890.93
0.3037.600.890.92
0.3537.420.880.90

Highlighted: selected r = 0.25

Bit accuracy vs. mask radius. Accuracy peaks at r=0.25.

The spectral mask controls how much of the DCT representation belongs to the semantic low-frequency pathway versus the textural high-frequency pathway. Combined-attack accuracy peaks at r=0.25.

An overly narrow low-frequency region provides insufficient semantic coverage, while an overly broad region reduces the capacity available to the high-frequency pathway. The intermediate split provides the best measured balance.

These two ablations capture the main design choices: a balanced low/high spectral split and a mask radius of r = 0.25. The remaining supplementary curves are omitted here to keep the page focused on the core method and headline results.

BibTeX

View the citation entry on GitHub

@inproceedings{pandit2026bislw,
  title     = {BiSLW: Bi-Spectral Latent Watermarking for Generative Diffusion Models},
  author    = {Pandit, Aryan},
  booktitle = {European Conference on Computer Vision (ECCV)},
  year      = {2026}
}

Please update with the final proceedings metadata once available. Do not fabricate DOI, volume, pages, or publisher metadata until the final publication record is issued.