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.
Related Articles
Regulating Prompt Markets: Securities Law, Intellectual Property, and the Trading of Prompt Assets
Dev.to
Mercor competitor Deccan AI raises $25M, sources experts from India
Dev.to
How We Got Local MCP Servers Working in Claude Cowork (The Missing Guide)
Dev.to
How Should Students Document AI Usage in Academic Work?
Dev.to
They Did Not Accidentally Make Work the Answer to Who You Are
Dev.to