Skip to content

A Relaxed Gradient Step Denoiser for Splitting Methods in Poisson Inverse Problems

Jul 2026 · arXiv.org · Vol abs/2607.26864 · 0 citations · 43 references
Computer Science Mathematics

TL;DR

GSDSplit+ is introduced, a splitting method built upon PnPSplit+, in which the generic denoising block is replaced by a relaxed Gradient Step Denoiser, which retains explicit Poisson fidelity updates.

Abstract

Plug and Play methods combine classical variational models with learned denoisers and have achieved strong results in imaging inverse problems. Their convergence has been widely studied for Gaussian data, whereas Poisson models require additional care because of the nonquadratic Kullback-Leibler fidelity. This work introduces GSDSplit+ , a splitting method built upon PnPSplit+, in which the generic denoising block is replaced by a relaxed Gradient Step Denoiser. The resulting method retains explicit Poisson fidelity updates. The denoiser is defined through the gradient of a learned convex potential parameterized by an Input Convex Neural Network. Its architecture and training promote both blind denoising capability and a smoothness condition sufficient for firm nonexpansiveness. Empirical smoothness estimates are used to select a relaxation parameter compatible with the convergence assumptions of PnPSplit+. Numerical experiments provide evidence that the trained denoiser operates in an FNE-compatible regime on the considered validation data. GSDSplit+ also yields stable reconstructions outside the empirically supported range and shows substantially lower sensitivity to the ADMM parameter, while remaining effective for different blur operators and Poisson noise levels.

View source

Similar papers

Jul 2026

PnP-IPA: A Provably Convergent Plug-and-Play Inexact Proximal Algorithm for Nonconvex Imaging Problems

This paper proposes a new splitting strategy that evaluates the proximal operator of the scaled implicit regularizer inexactly, and establishes global convergence to a stationary point of the nonconvex objective without imposing any assumption on the regularization parameter.

Cristiano Parenti, S. Bonettini, M. Prato · 1 citation
Open access Aug 2026

Adaptive Momentum Langevin Dynamics for Efficient Posterior Sampling

Adaptive Momentum Langevin Dynamics (AMLD), a practical stochastic correction kernel that introduces a momentum variable into the annealed posterior sampling framework and equips it with an annealing-aware momentum retention schedule, is proposed.

Zhengbo Li, Jian Xu, Ding-Tao Peng et al. · 0 citations
Open access Jul 2026

Learned spherical ADMM for Rician MRI denoising

This paper proposes a novel learned spherical alternating direction method of multipliers (LSADMMs) for effective Rician noise removal under spherical constraints, and incorporates a noise-level estimation prefix that provides adaptive guidance across noise levels.

Jun Shi, Zhifang Liu, Chunlin Wu et al. · 0 citations
Open access Aug 2026

Provably convergent proximal gradient methods with tailored input convex neural networks regularization for inverse problems

This study presents a novel Deep Proximal Gradient Descent framework for ill-posed problems by employing a tailored second-order differentiable Input-Convex Neural Networks (ICNNs) as a learned regularizer, and introduces an innovative formulation that employs the learned residual to guide gradient descent.

Tian-Yi Ye, Guang-Yu Gao, Yang Li et al. · 0 citations
Jul 2026

Domain Adaptation of Mismatched Proximal Denoiser for Plug-and-Play Image Reconstruction

Experiments on Gaussian deblurring and super-resolution under substantial domain shift show that proximal matching adaptation improves reconstruction quality significantly over MSE-based adaptation, yielding the largest numerical gains in the few-shot regime.

Guixian Xu, Jinglai Li, Junqi Tang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.