English

Learning Cocoercive Conservative Denoisers via Helmholtz Decomposition for Poisson Inverse Problems

Computer Vision and Pattern Recognition 2025-10-21 v2 Machine Learning Functional Analysis Optimization and Control

Abstract

Plug-and-play (PnP) methods with deep denoisers have shown impressive results in imaging problems. They typically require strong convexity or smoothness of the fidelity term and a (residual) non-expansive denoiser for convergence. These assumptions, however, are violated in Poisson inverse problems, and non-expansiveness can hinder denoising performance. To address these challenges, we propose a cocoercive conservative (CoCo) denoiser, which may be (residual) expansive, leading to improved denoising. By leveraging the generalized Helmholtz decomposition, we introduce a novel training strategy that combines Hamiltonian regularization to promote conservativeness and spectral regularization to ensure cocoerciveness. We prove that CoCo denoiser is a proximal operator of a weakly convex function, enabling a restoration model with an implicit weakly convex prior. The global convergence of PnP methods to a stationary point of this restoration model is established. Extensive experimental results demonstrate that our approach outperforms closely related methods in both visual quality and quantitative metrics.

Cite

@article{arxiv.2505.08909,
  title  = {Learning Cocoercive Conservative Denoisers via Helmholtz Decomposition for Poisson Inverse Problems},
  author = {Deliang Wei and Peng Chen and Haobo Xu and Jiale Yao and Fang Li and Tieyong Zeng},
  journal= {arXiv preprint arXiv:2505.08909},
  year   = {2025}
}

Comments

31 pages. This paper has been accepted by NeurIPs 2025

R2 v1 2026-06-28T23:32:09.594Z