arXiv Computer Vision

Provably Contractive and High-Quality Denoisers for Convergent Restoration

The paper introduces denoiser networks that are provably contractive, meaning their global Lipschitz constant is less than one. By combining proximal layers from unfolding techniques with Lipschitz‑controlled convolutional refinements, the authors ensure that small input perturbations produce at most equally small output changes, unlike many strong unconstrained baselines. The proposed denoisers achieve high restoration quality on image denoising tasks, close to that of powerful unconstrained models, and when used as priors in Plug‑and‑Play frameworks, they guarantee convergence and strong empirical performance.

arXiv Computer Vision
Sep 15

Restore What Matters: Lessons from Joint Restoration and Recognition

arXiv:2609.13791v1 Announce Type: new Abstract: Recognition pipelines typically adopt a restore-then-recognize workflow, yet decades of experience show that generating visually pleasing images seldom...

By Lanqing Guo, Xijun Wang, Minchul Kim, Yu Yuan, Wes Robbins, Xingguang Zhang, Nicholas Chimitt, Stanley H. Chan, Zhangyang Wang, Xiaoming Liu
Hugging Face Trending Papers
Jun 30

MG-SpaIR: Multi-grade Sparse-guided Implicit Representation for Training-Data-Free Image Restoration

MG-SpaIR is a training-data-free framework for restoring a clean image from a single observation corrupted by a mixture of blur, downsampling, noise, and missing pixels. Building on implicit neural representations (INRs), we introduce a multi-grade coarse-to-fine residual hierarchy that progressively refines the reconstruction across resolution grades, improving representational fidelity and mitigating spectral limitations.

arXiv Machine Learning
Oct 3

Convergent Plug-and-Play Image Restoration with Annealed Noise Levels

The paper presents convergence guarantees for Plug-and-Play (PnP) image restoration algorithms that use annealed noise levels, covering both deterministic and stochastic methods. It identifies explicit nonconvex objectives linked to the final denoising level and proves that iterates become asymptotically stationary with respect to these objectives, without requiring a specific noise decay schedule. The authors validate their theory experimentally on tasks such as inpainting, super‑resolution, demosaicing, and tomography.

By Samuel Hurault
arXiv Computer Vision
Oct 21

Efficient One-Step Diffusion Restoration Model with Compact Token Compression and Linear Attention

The paper introduces SANA‑SR, an efficient one‑step diffusion restoration framework for real‑world image super‑resolution. It uses a deep compression autoencoder to reduce latent tokens by a 32× ratio, preserving essential structures and textures, and applies a linear‑attention DiT with LoRA fine‑tuning for linear‑complexity token mixing. Experiments show competitive or superior performance on benchmark datasets, and the pruned model runs in 0.019 s with 407.95 G MACs and 344 M parameters, indicating strong potential for mobile deployment.

By Bingtian Qiao, Yue Shi, Yingjie Zhou, Yong Guo, Guangtao Zhai, Jiezhang Cao
arXiv Computer Vision
Sep 15

Sparsity-Adaptive Sharpness-Aware Minimization

The paper introduces Sparsity-Adaptive Sharpness-Aware Minimization (SA‑SAM), a method that adjusts the perturbation radius in sharpness-aware training to remain consistent as model sparsity increases. It also evaluates a Magnitude‑Weighted Hessian (MWH) importance metric derived from second‑order analysis. Experiments on CIFAR‑10‑C, CIFAR‑100‑C, and ImageNet‑100‑C show that SA‑SAM improves corruption robustness at 80–90% sparsity while maintaining clean accuracy, and the study reports inference throughput at deployment‑relevant sparsity levels.

By Shiryu Ueno, Yoshikazu Hayashi, Kunihito Kato