![]() |
![]() |
University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems
Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse ProblemsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Sergey Sergeev. Plug-and-Play (PnP) methods are a class of efficient iterative methods that aim to combine data fidelity terms and deep denoisers using classical optimization algorithms, such as ISTA or ADMM . Existing provable PnP methods impose heavy restrictions on the denoiser or fidelity function, such as nonexpansiveness or strict convexity. In this work, we propose a provable PnP method that imposes relatively light conditions based on proximal denoisers, and introduce a quasi-Newton step to greatly accelerate convergence. By specially parameterizing the deep denoiser as a gradient step, we further characterize the fixed-points of the quasi-Newton PnP algorithm. We demonstrate the effectiveness of our scheme in applications such as image deblurring, inpainting and superresolution, observing order-of-magnitude acceleration over state-of-the-art PnP algorithms. This talk is part of the Optimisation and Numerical Analysis Seminars series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listshttp://talks.bham.ac.uk/show/index/1942 computer sience SERENE Group Seminar SeriesOther talksSignatures of structural criticality and universality in the cellular anatomy of the brain The percolating cluster is invisible to image recognition with deep learning [Friday seminar]: Irradiated brown dwarfs in the desert |