TL;DR
This paper demonstrates that a broad class of linear denoisers, including non-symmetric kernel denoisers, can be expressed as proximal maps of convex regularizers, enabling convergence guarantees in plug-and-play image reconstruction.
Contribution
It extends the class of linear denoisers that can be represented as proximal maps, including non-symmetric kernel denoisers, and proposes modified PnP algorithms with convergence guarantees.
Findings
Broader class of linear denoisers can be expressed as proximal maps.
Modified PnP algorithms ensure convergence to a minimum.
Modified algorithms produce high-quality image restorations.
Abstract
In plug-and-play (PnP) regularization, the knowledge of the forward model is combined with a powerful denoiser to obtain state-of-the-art image reconstructions. This is typically done by taking a proximal algorithm such as FISTA or ADMM, and formally replacing the proximal map associated with a regularizer by nonlocal means, BM3D or a CNN denoiser. Each iterate of the resulting PnP algorithm involves some kind of inversion of the forward model followed by denoiser-induced regularization. A natural question in this regard is that of optimality, namely, do the PnP iterations minimize some f+g, where f is a loss function associated with the forward model and g is a regularizer? This has a straightforward solution if the denoiser can be expressed as a proximal map, as was shown to be the case for a class of linear symmetric denoisers. However, this result excludes kernel denoisers such as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsAlternating Direction Method of Multipliers
