arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.02388eess.IVcs.LG

Bregman Plug-and-Play Priors

New York University(纽约大学);Washington University in St. Louis(圣路易斯华盛顿大学);Tandon School of Engineering(坦登工程学院);Department of Electrical and Computer Engineering(电子与计算机工程系);Department of Computer Science and Engineering(计算机科学与工程系);Department of Electrical and Systems Engineering(电气与系统工程系)

Abdullah H. Al-Shabili, Xiaojian Xu, Ivan Selesnick, Ulugbek S. Kamilov

英文摘要:

The past few years have seen a surge of activity around integration of deep learning networks and optimization algorithms for solving inverse problems. Recent work on plug-and-play priors (PnP), regularization by denoising (RED), and deep unfolding has shown the state-of-the-art performance of such integration in a variety of applications. However, the current paradigm for designing such algorithms is inherently Euclidean, due to the usage of the quadratic norm within the projection and proximal operators. We propose to broaden this perspective by considering a non-Euclidean setting based on the more general Bregman distance. Our new Bregman Proximal Gradient Method variant of PnP (PnP-BPGM) and Bregman Steepest Descent variant of RED (RED-BSD) replace the traditional updates in PnP and RED from the quadratic norms to more general Bregman distance. We present a theoretical convergence result for PnP-BPGM and demonstrate the effectiveness of our algorithms on Poisson linear inverse problems.

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

↑