Learning Weakly Convex Regularizers for Convergent Image-Reconstruction Algorithms
We propose to learn non-convex regularizers with a prescribed upper bound on their weak-convexity modulus. Such regularizers give rise to variational denoisers that minimize a convex energy. They rely on few parameters (less than 15,000) and offer a signal-processing interpretation as they mimic handcrafted sparsity-promoting regularizers. Through numerical experiments, we show that such denoisers outperform convex-regularization methods as well as the popular BM3D denoiser. Additionally, the learned regularizer can be deployed to solve inverse problems with iterative schemes that provably converge. For both CT and MRI reconstruction, the regularizer generalizes well and offers an excellent tradeoff between performance, number of parameters, guarantees, and interpretability when compared to other data-driven approaches.
Code (2)
Tasks
Image ReconstructionMRI ReconstructionSimilar Papers 제목 키워드 기반
Learned Alternating Minimization Algorithm for Dual-domain Sparse-View CT Reconstruction
We propose a novel Learned Alternating Minimization Algorithm (LAMA) for dual-domain sparse-view CT image reconstruction. LAMA is naturally induced by a variational model for CT reconstruction with learnable nonsmooth no…
CT ReconstructionImage ReconstructionLearning Difference-of-Convex Regularizers for Inverse Problems: A Flexible Framework with Theoretical Guarantees
Learning effective regularization is crucial for solving ill-posed inverse problems, which arise in a wide range of scientific and engineering applications. While data-driven methods that parameterize regularizers using …
Computed Tomography (CT)CT ReconstructionWEEP: A Differentiable Nonconvex Sparse Regularizer via Weakly-Convex Envelope
Sparse regularization is fundamental in signal processing and feature extraction but often relies on non-differentiable penalties, conflicting with gradient-based optimizers. We propose WEEP (Weakly-convex Envelope of Pi…
Compressive SensingImage DenoisingWeakly Convex Regularisers for Inverse Problems: Convergence of Critical Points and Primal-Dual Optimisation
Variational regularisation is the primary method for solving inverse problems, and recently there has been considerable work leveraging deeply learned regularisation for enhanced performance. However, few results exist a…
Computed Tomography (CT)CT ReconstructionProvably Convergent Plug-and-Play Quasi-Newton Methods
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, with applications in invers…
DeblurringImage DeblurringSuper-Resolution