arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.02458math.NAcs.NA
收藏

用于非凸逆问题的深度块近端线性化最小化算法

Deep Block Proximal Linearised Minimisation Algorithm for Non-convex Inverse Problems

Chaoyan Huang, Zhongming Wu, Yanqi Cheng, Tieyong Zeng, Carola-Bibiane Schönlieb, Angelica I. Aviles-Rivero

AI总结:

针对图像恢复中的非凸逆问题,提出统一Jacobi与Gauss-Seidel更新规则的惯性块近端线性化最小化算法(iBPLM)及其即插即用变体(PnP-iBPLM),通过集成深度梯度去噪器加速收敛,理论证明全局收敛性并在去噪和去模糊任务中显著提升性能。

摘要:

图像恢复通常通过非凸逆问题来解决,这些问题通常使用一阶块分裂方法求解。在本文中,我们考虑一种捕捉许多图像逆问题的通用非凸优化模型,并提出了一种惯性块近端线性化最小化(iBPLM)算法。我们的新方法统一了Jacobi型并行和Gauss-Seidel型交替更新规则,并超越了这些方法。惯性技术也被纳入每个块级子问题更新中,这可以加速数值收敛。此外,我们通过集成深度梯度去噪器的即插即用变体(PnP-iBPLM)扩展了该框架,为复杂成像任务提供了灵活且稳健的解决方案。我们提供了全面的理论分析,证明了所提出算法的子序列收敛性和全局收敛性。为了验证我们的方法,我们将它们应用于图像去噪和去模糊中的多块字典学习问题。实验结果表明,iBPLM和PnP-iBPLM在这些应用中显著增强了数值性能和稳健性。

英文摘要:

Image restoration is typically addressed through non-convex inverse problems, which are often solved using first-order block-wise splitting methods. In this paper, we consider a general type of non-convex optimisation model that captures many inverse image problems and present an inertial block proximal linearised minimisation (iBPLM) algorithm. Our new method unifies the Jacobi-type parallel and the Gauss-Seidel-type alternating update rules, and extends beyond these approaches. The inertial technique is also incorporated into each block-wise subproblem update, which can accelerate numerical convergence. Furthermore, we extend this framework with a plug-and-play variant (PnP-iBPLM) that integrates deep gradient denoisers, offering a flexible and robust solution for complex imaging tasks. We provide comprehensive theoretical analysis, demonstrating both subsequential and global convergence of the proposed algorithms. To validate our methods, we apply them to multi-block dictionary learning problems in image denoising and deblurring. Experimental results show that both iBPLM and PnP-iBPLM significantly enhance numerical performance and robustness in these applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑