Iterative Reweighted Least Squares Networks With Convergence Guarantees for Solving Inverse Imaging Problems
Iaroslav Koshelev, Stamatios Lefkimmiatis

TL;DR
This paper introduces a novel IRLS-based optimization method with convergence guarantees for inverse imaging problems, enabling learned regularizers that improve image reconstruction tasks like deblurring and super-resolution.
Contribution
It extends IRLS to analysis-based regularization with convergence guarantees and proposes a bilevel learning framework for parameter optimization in image reconstruction.
Findings
Converges linearly to a stationary point under mild conditions.
Outperforms existing unrolled networks in image reconstruction tasks.
Efficiently learns regularizer parameters from training data.
Abstract
In this work we present a novel optimization strategy for image reconstruction tasks under analysis-based image regularization, which promotes sparse and/or low-rank solutions in some learned transform domain. We parameterize such regularizers using potential functions that correspond to weighted extensions of the -vector and Schatten-matrix quasi-norms with . Our proposed minimization strategy extends the Iteratively Reweighted Least Squares (IRLS) method, typically used for synthesis-based and norm and analysis-based and nuclear norm regularization. We prove that under mild conditions our minimization algorithm converges linearly to a stationary point, and we provide an upper bound for its convergence rate. Further, to select the parameters of the regularizers that deliver the best results for the problem at…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Microwave Imaging and Scattering Analysis · Photoacoustic and Ultrasonic Imaging
