Overlapping domain decomposition methods for total variation denoising
From MaRDI portal
convergence analysisconvex optimizationdomain decompositionimage restorationlocally weighted total variationsubspace correctiontotal variation minimization
Decomposition methods (49M27) Numerical optimization and variational techniques (65K10) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Computing methodologies for image processing (68U10) Large-scale problems in mathematical programming (90C06) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Recommendations
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- A convergent overlapping domain decomposition method for total variation minimization
- Dual-primal domain decomposition methods for the total variation minimization
- Recent advances in domain decomposition methods for total variation minimization
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
Cites work
- A convergent overlapping domain decomposition method for total variation minimization
- A coordinate gradient descent method for nonsmooth separable minimization
- A Fast Multilevel Algorithm for Wavelet-Regularized Image Restoration
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A new variational model for removal of combined additive and multiplicative noise and a fast algorithm for its numerical approximation
- A nonlinear multigrid method for total variation minimization from image restoration
- A two-level domain decomposition method for image restoration
- A variational approach to remove outliers and impulse noise
- A Variational Approach to Removing Multiplicative Noise
- Active contours without edges
- An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration
- An introduction to total variation for image analysis
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Analysis of bounded variation penalty methods for ill-posed problems
- Automated parameter selection for total variation minimization in image restoration
- Automated parameter selection in the ${L}^{1} \mbox{-} {L}^{2}$-TV model for removing Gaussian plus impulse noise
- Bregmanized domain decomposition for image restoration
- Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
- Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
- Convergent non-overlapping domain decomposition methods for variational image segmentation
- Domain decomposition methods for linear inverse problems with sparsity constraints
- Domain decomposition methods with graph cuts algorithms for total variation minimization
- First order algorithms in variational image processing
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- scientific article; zbMATH DE number 3868094 (Why is no real title available?)
- scientific article; zbMATH DE number 1313105 (Why is no real title available?)
- scientific article; zbMATH DE number 671790 (Why is no real title available?)
- scientific article; zbMATH DE number 1138069 (Why is no real title available?)
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- scientific article; zbMATH DE number 1448982 (Why is no real title available?)
- Image denoising: learning the noise model via nonsmooth PDE-constrained optimization
- Infimal convolution of data discrepancies for mixed noise removal
- Iteratively solving linear inverse problems under general convex constraints
- Locally adaptive total variation for removing mixed Gaussian–impulse noise
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- Minimizing Certain Convex Functions
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- Nonlinear total variation based noise removal algorithms
- Numerical methods for nonlinear partial differential equations
- On the density of classes of closed convex sets with pointwise constraints in Sobolev spaces
- Optimal selection of the regularization function in a weighted total variation model. I: Modelling and theory
- Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Signal Recovery by Proximal Forward-Backward Splitting
- Subspace correction methods for a class of nonsmooth and nonadditive convex variational problems with mixed \(L^1/L^2\) data-fidelity in image processing
- Subspace correction methods for total variation and _1-minimization
- Surrogate functional based subspace correction methods for image processing
- The Split Bregman Method for L1-Regularized Problems
- Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
- Wavelet decomposition method for L₂/TV-image deblurring
Cited in
(19)- An efficient multi-grid method for TV minimization problems
- Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization
- Additive Schwarz methods for convex optimization with backtracking
- An overlapping domain decomposition framework without dual formulation for variational imaging problems
- A parallel domain decomposition algorithm for large scale image denoising
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- Subspace correction methods for total variation and _1-minimization
- Overlapping domain decomposition methods for ptychographic imaging
- Recent advances in domain decomposition methods for total variation minimization
- Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
- Dual-primal domain decomposition methods for the total variation minimization
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Accelerated non-overlapping domain decomposition method for total variation minimization
- Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem
- Domain decomposition for non-smooth (in particular TV) minimization
- Domain decomposition for integer optimal control with total variation regularization
- A convergent overlapping domain decomposition method for total variation minimization
- A general decomposition method for a convex problem related to total variation minimization
- Randomized subspace correction methods for convex optimization
This page was built for publication: Overlapping domain decomposition methods for total variation denoising
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232292)
