Sign inGet started
Paper · arXiv

A convergent Plug-and-Play Majorization-Minimization algorithm for Poisson inverse problems

In this paper, we present a novel variational plug-and-play algorithm for Poisson inverse problems. Our approach minimizes an explicit functional which is the sum of a Kullback-Leibler data fidelity term and a regularization term based on a pre-trained neural network. By combining classical likelihood maximization methods with recent advances in gradient-based denoisers, we allow the use of pre-trained Gaussian denoisers without sacrificing convergence guarantees. The algorithm is formulated in the majorization-minimization framework, which guarantees convergence to a stationary point. Numerical experiments confirm state-of-the-art performance in deconvolution and tomography under moderat...

AuthorsThibaut Modrzyk, Ane Etxebeste, Élie Bretin et al.
Primary categorycs.CV
Published25 March 2026
Last updated at source25 March 2026
cs.CV
Embed this entry
<iframe src="https://silytics.si/embed/item/fc44c3a7-fe1f-4d21-b971-768ad0741626" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.