Papers
Topics
Authors
Recent
Search
2000 character limit reached

LatentUnfold: Unified Blind Image Restoration

Updated 22 December 2025
  • LatentUnfold is a unified framework for blind image restoration that integrates interpretable optimization, nonparametric degradation modeling, and conditional latent diffusion priors.
  • It employs a multi-stage architecture featuring a Multi-Granularity Degradation-Aware module, a Degradation-Resistant Latent Diffusion Model, and an Over-Smoothing Correction Transformer.
  • Experimental results across benchmarks like SIDD, GoPro, and LOL-v2 demonstrate state-of-the-art performance in PSNR and SSIM, highlighting its robustness and efficacy.

LatentUnfold (formally UnfoldLDM) is a unified deep unfolding network for blind image restoration (BIR), integrating interpretable optimization principles, nonparametric degradation modeling, and conditional latent diffusion priors within a multi-stage architecture. Developed to address the dual limitations of degradation-specific dependency and over-smoothing bias inherent in classical Deep Unfolding Networks (DUNs), LatentUnfold introduces a three-part pipeline: Multi-Granularity Degradation-Aware modeling, Degradation-Resistant Latent Diffusion Priors, and Over-Smoothing Correction Transformers. This plug-and-play structure achieves state-of-the-art results across a wide spectrum of BIR tasks by jointly estimating the unknown degradation and restoring structured, high-frequency image details (He et al., 22 Nov 2025).

1. Blind Restoration Optimization Formulation

The blind restoration model observes a degraded image yRc×h×wy \in \mathbb{R}^{c \times h \times w} generated via an unknown linear process:

y=Dx+ny = D x + n

where xx is the latent clean image, DD is an unknown degradation matrix, and nn is additive noise. To capture structure and reduce complexity, DD is factorized as a Kronecker product:

D=MTWD = M^T \otimes W

with WRc×h×hW \in \mathbb{R}^{c \times h \times h} and MRc×w×wM \in \mathbb{R}^{c \times w \times w}. The energy minimization for restoration is

L(x)=12yDx22+12yWxM22+λϕ(x)L(x) = \frac{1}{2} \|y - D x\|_2^2 + \frac{1}{2} \|y - W x M\|_2^2 + \lambda \phi(x)

where y=Dx+ny = D x + n0 is a learned image prior and y=Dx+ny = D x + n1 weights regularization. The problem is solved via y=Dx+ny = D x + n2-stage proximal-gradient unfolding, applying block-coordinate descent over fidelity terms y=Dx+ny = D x + n3 and y=Dx+ny = D x + n4 followed by a learned proximal operator. Specifically, at each stage y=Dx+ny = D x + n5:

  • y=Dx+ny = D x + n6
  • y=Dx+ny = D x + n7
  • y=Dx+ny = D x + n8

2. Multi-Granularity Degradation-Aware (MGDA) Module

MGDA replaces analytic gradients with data-driven surrogates, enabling end-to-end handling of unknown degradations:

  • Holistic Degradation: Two Siamese Visual State Space (VSS) networks (y=Dx+ny = D x + n9, xx0) estimate xx1 and its transpose, producing

xx2

  • Structured Decomposition: Neural blocks xx3 and xx4 alternately estimate components xx5 and xx6, constructed via normalized outputs from concatenated feature maps. The structured fidelity update is

xx7

An intra-stage consistency loss

xx8

promotes alignment between holistic and structural branches.

3. Degradation-Resistant Latent Diffusion Model (DR-LDM)

The proximal operator in LatentUnfold is realized by a conditional latent diffusion model designed for degradation invariance:

  • Latent Prior Extraction: In Phase I, a Prior Inference (PI) network maps xx9 to a compact latent prior DD0.
  • Diffusion Forward: For DD1 steps,

DD2

with DD3, DD4.

  • Diffusion Reverse: A denoising network DD5 predicts noise given noisy latent prior and a conditioning vector DD6. The recursion is:

DD7

After T steps, the sampled prior DD8 is passed to the detail recovery module.

4. Over-Smoothing Correction Transformer (OCFormer)

OCFormer is a U-shaped network that fuses intermediate results and the diffusion posterior to restore high-frequency textures:

  • Degradation-Resistant Attention (DRA): Features from DD9 are enriched by learning self-attention weights through mixed nn0 and nn1 depthwise convolutions:

nn2

  • Prior-Guided Detail Recovery (PDR): The prior nn3 modulates normalized features:

nn4

nn5

The final output nn6 is generated by the U-net decoder.

5. Unified Iterative Restoration Algorithm

The end-to-end unfolding procedure, as summarized in the provided pseudocode, executes nn7 stages. Each stage alternates between MGDA steps to estimate both holistic and structured degradations, then applies DR-LDM to sample a latent prior, and finally invokes OCFormer for refined reconstruction. This approach is designed as plug-and-play; it can be integrated as a wrapper for existing DUN-based methods.

6. Training Procedures and Loss Functions

The training is phased:

  • Phase I: Pretrain PI and OCFormer with

nn8

where nn9.

  • Phase II: Train DR-LDM and fine-tune the entire framework with

DD0

DD1, DD2 in practice.

7. Experimental Results and Interpretation

Implemented in PyTorch on NVIDIA H200 (K=3 stages, T=3, DD3), LatentUnfold achieves the following on standard BIR benchmarks:

  • Blind denoising: SIDD (PSNR 40.02 dB, SSIM 0.961), DND (40.06 dB, 0.958)
  • Blind deblurring: GoPro (34.32 dB, 0.970), HIDE (31.85 dB, 0.948)
  • Underwater: UIEB (24.70 dB, 0.947)
  • Backlit: BAID (24.97 dB, 0.910)
  • Low-light: LOL-v2 real (23.58 dB, 0.886); synthetic (27.92 dB, 0.957)
  • Deraining: Five benchmarks, average PSNR ~39.5 dB, SSIM ~0.98

Across all cases, UnfoldLDM establishes new state-of-the-art results for blind restoration (He et al., 22 Nov 2025).

8. Significance of Latent Diffusion Priors in Blind Restoration

Standard DUNs exhibit a low-frequency bias due to the dominance of smooth components in gradient-driven updates, especially under severe or unknown degradations, leading to oversmoothing. The latent diffusion prior in DR-LDM is explicitly trained for degradation invariance, promoting generative recovery of natural high-frequency textures. Conditioning the diffusion prior on MGDA’s estimates prevents reintroduction of degraded patterns, while the bidirectional interplay—cleaner inputs aiding prior learning, and stronger priors enhancing restoration—enables sharp, artifact-free outputs for a wide variety of degradations.

In summary, LatentUnfold (UnfoldLDM) represents an advance in blind image restoration by combining interpretable model-based unfolding, neural degradation modeling, and strong generative priors, implemented in a modular, extensible framework (He et al., 22 Nov 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to LatentUnfold Framework.