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

arXiv cs.CV / 3/26/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper proposes a variational plug-and-play majorization-minimization (MM) algorithm tailored to Poisson inverse problems, combining a Kullback–Leibler data fidelity term with a regularizer driven by a pre-trained neural network denoiser.
  • It integrates classical likelihood maximization with gradient-based denoisers in a way that maintains convergence guarantees, with the method shown to converge to a stationary point within the MM framework.
  • Experiments on deconvolution and tomography indicate state-of-the-art results under moderate noise, with especially strong gains in high-noise scenarios.
  • The authors highlight nuclear medicine deconvolution/tomography as a key application where the algorithm’s robustness to noise could be particularly beneficial.

Abstract

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 moderate noise, and demonstrate clear superiority in high-noise conditions, making this method particularly valuable for nuclear medicine applications.