← 研踪 PaperTrailarXiv:2611.09845 · v1
AdaptivePnP: Fast Auto-Tuned Plug-and-Play for Deconvolution
AdaptivePnP:用于反卷积的快速自适应调参即插即用方法
首次提交 2026-11-07 02:29
版本更新 2026-11-07 02:29
雷达观测 2026-11-09 13:22
摘要
Plug-and-play (PnP) methods reconstruct images by alternating a data-fitting step with an image denoiser. Their performance depends on two parameters: the step size and the measurement noise level . In practice, is often tuned by grid search over validation images and must be retuned whenever the problem setting changes, and is assumed known or estimated separately. We propose AdaptivePnP, a PnP framework that jointly estimates and at every iteration from the data-fitting residual. To do so, we apply the PnP virtual model to the data-fitting proximal map and show that the residual is zero-mean Gaussian with covariance parameterized by and . However, when one parameter is much larger than the other, the residual carries little information about the smaller one and using the maximum likelihood (ML) estimator can degrade the PnP iterations. We therefore introduce the identifiable maximum likelihood (IML) estimator, which restricts the ML estimator to an identifiable window in which the normalized Cramér--Rao bound of every parameter is bounded by a user-specified tolerance. For the virtual model, this window is an interval of ratios , so computing the IML estimate reduces to a one-dimensional search over . We apply AdaptivePnP to two standard PnP methods, yielding algorithms that require neither a tuned nor a known . On image deblurring and super-resolution, AdaptivePnP matches or outperforms PnP baselines tuned with the true . Code is available at https://github.com/hdubasullivan/AdaptivePnP.
作者备注:Submitted to IEEE Transactions on Computational Imaging
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-07 02:29 · 最新观测版本
AdaptivePnP: Fast Auto-Tuned Plug-and-Play for Deconvolution
Plug-and-play (PnP) methods reconstruct images by alternating a data-fitting step with an image denoiser. Their performance depends on two parameters: the step size and the measurement noise level . In practice, is often tuned by grid search over validation images and must be retuned whenever the problem setting changes, and is assumed known or estimated separately. We propose AdaptivePnP, a PnP framework that jointly estimates and at every iteration from the data-fitting residual. To do so, we apply the PnP virtual model to the data-fitting proximal map and show that the residual is zero-mean Gaussian with covariance parameterized by and . However, when one parameter is much larger than the other, the residual carries little information about the smaller one and using the maximum likelihood (ML) estimator can degrade the PnP iterations. We therefore introduce the identifiable maximum likelihood (IML) estimator, which restricts the ML estimator to an identifiable window in which the normalized Cramér--Rao bound of every parameter is bounded by a user-specified tolerance. For the virtual model, this window is an interval of ratios , so computing the IML estimate reduces to a one-dimensional search over . We apply AdaptivePnP to two standard PnP methods, yielding algorithms that require neither a tuned nor a known . On image deblurring and super-resolution, AdaptivePnP matches or outperforms PnP baselines tuned with the true . Code is available at https://github.com/hdubasullivan/AdaptivePnP.
查看此版本解读 →查看此版本原文 ↗