Learning weakly convex regularizers for convergent image-reconstruction algorithms
From MaRDI portal
Convexity of real functions of several variables, generalizations (26B25) Linear operators and ill-posed problems, regularization (47A52) Inverse problems in optimal control (49N45) Numerical computation using splines (65D07) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Nonconvex programming, global optimization (90C26)
Cites work
- A characterization of proximity operators
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Adaptive restart for accelerated gradient schemes
- Adaptive wavelet thresholding for image denoising and compression
- Approximation of Lipschitz Functions Using Deep Spline Neural Networks
- Compressed sensing
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- De-noising by soft-thresholding
- Energy Minimization Methods
- Fields of experts
- First-order methods almost always avoid strict saddle points
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- Insights Into Analysis Operator Learning: From Patch-Based Sparse Models to Higher Order MRFs
- iPiano: inertial proximal algorithm for nonconvex optimization
- Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- NETT: solving inverse problems with deep neural networks
- Nonlinear total variation based noise removal algorithms
- Parseval proximal neural networks
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
Cited in
(18)- Iteratively Refined Image Reconstruction with Learned Attentive Regularizers
- Theoretical characterization of effect of masks in snapshot compressive imaging
- Joint structure-texture low-dimensional modeling for image decomposition with a plug-and-play framework
- Stability of data-dependent ridge-regularization for inverse problems
- Deep learning for PDE-based inverse problems. Abstracts from the workshop held October 27 -- November 1, 2024
- Error estimates for weakly convex frame-based regularization including learned filters
- Controlled learning of pointwise nonlinearities in neural-network-like architectures
- Short communication: FISTA iterates converge linearly for denoiser-driven regularization
- Efficient image restoration via non-convex total variation regularization and ADMM optimization
- A primal-dual algorithm for image reconstruction with input-convex neural network regularizers
- Data-driven regularization with weak convexity for robust image reconstruction
- Universal architectures for the learning of polyhedral norms and convex regularizers
- Efficient Bayesian computation using plug-and-play priors for Poisson inverse problems
- Latent space inference via paired autoencoders
- Inertial proximal difference-of-convex algorithm with convergent Bregman plug-and-play for nonconvex imaging
- Poisson noise removal via a non-convex log total variation regularization
- You KAN do it in a single shot: plug-and-play methods with single-instance priors
- Multilevel Monte Carlo for Zeroth-Order Stochastic Bilevel Optimization with Inexact Lower Level Solves
This page was built for publication: Learning weakly convex regularizers for convergent image-reconstruction algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541905)
