Generalized intersection algorithms with fixed points for image decomposition learning
From MaRDI portal
Abstract: In image processing, classical methods minimize a suitable functional that balances between computational feasibility (convexity of the functional is ideal) and suitable penalties reflecting the desired image decomposition. The fact that algorithms derived from such minimization problems can be used to construct (deep) learning architectures has spurred the development of algorithms that can be trained for a specifically desired image decomposition, e.g. into cartoon and texture. While many such methods are very successful, theoretical guarantees are only scarcely available. To this end, in this contribution, we formalize a general class of intersection point problems encompassing a wide range of (learned) image decomposition models, and we give an existence result for a large subclass of such problems, i.e. giving the existence of a fixpoint of the corresponding algorithm. This class generalizes classical model-based variational problems, such as the TV-l2 -model or the more general TV-Hilbert model. To illustrate the potential for learned algorithms, novel (non learned) choices within our class show comparable results in denoising and texture removal.
Recommendations
- Coupled dictionary learning method for image decomposition
- (Φ,Φ*) Image Decomposition Models and Minimization Algorithms
- Low patch-rank image decomposition using alternating minimization algorithms
- Learnable descent algorithm for nonsmooth nonconvex image reconstruction
- Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
Cites work
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A second-order model for image denoising
- Approximation of set valued functions and fixed point theorems
- Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
- Constrained and SNR-based solutions for TV-Hilbert space image denoising
- Convex analysis and monotone operator theory in Hilbert spaces
- Deep learning
- Edge-preserving and scale-dependent properties of total variation regularization
- Fast Cartoon + Texture Image Filters
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Image Decomposition and Restoration Using Total Variation Minimization and theH1
- Image decompositions using bounded variation and generalized homogeneous Besov spaces
- Image denoising and decomposition with total variation minimization and oscillatory functions
- Image restoration: total variation, wavelet frames, and beyond
- Mapping degree theory
- Modeling textures with total variation minimization and oscillating patterns in image processing
- Multiresolution Monogenic Signal Analysis Using the Riesz–Laplace Wavelet Transform
- Nonlinear total variation based noise removal algorithms
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Equivalence of Soft Wavelet Shrinkage, Total Variation Diffusion, Total Variation Regularization, and SIDEs
- Oscillating patterns in image processing and nonlinear evolution equations. The fifteenth Dean Jacqueline B. Lewis memorial lectures
- Solving ill-posed inverse problems using iterative deep neural networks
- Total Variation in Imaging
- Variational methods in imaging
- Variational, Geometric, and Level Set Methods in Computer Vision
- Wavelet Steerability and the Higher-Order Riesz Transform
This page was built for publication: Generalized intersection algorithms with fixed points for image decomposition learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5860364)
