Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
From MaRDI portal
Publication:2420690
DOI10.1007/s10915-018-0791-xzbMath1417.65217MaRDI QIDQ2420690
Jong Ho Park, Changmin Nam, Chang-Ock Lee
Publication date: 6 June 2019
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-018-0791-x
65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs
68U10: Computing methodologies for image processing
49J40: Variational inequalities
65N15: Error bounds for boundary value problems involving PDEs
49J35: Existence of solutions for minimax problems
65Y05: Parallel numerical computation
49M27: Decomposition methods
Related Items
Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model, RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION, Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization, Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem, An efficient multi-grid method for TV minimization problems, An overlapping domain decomposition framework without dual formulation for variational imaging problems, A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations
Uses Software
Cites Work
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- On the ergodic convergence rates of a first-order primal-dual algorithm
- A two-level domain decomposition method for image restoration
- A high-performance, portable implementation of the MPI message passing interface standard
- A convergent overlapping domain decomposition method for total variation minimization
- An algorithm for total variation minimization and applications
- A variational approach to remove outliers and impulse noise
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- Domain decomposition method for image deblurring
- Block decomposition methods for total variation by primal-dual stitching
- Mathematical Models for Local Nontexture Inpaintings
- 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 $\ell_1$-Minimization
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
- An Efficient Primal-Dual Method for $L^1$TV Image Restoration
- Edge-preserving and scale-dependent properties of total variation regularization
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation
- Aspects of Total Variation RegularizedL1Function Approximation
- Domain decomposition methods for linear inverse problems with sparsity constraints
- Scale Space and PDE Methods in Computer Vision
- Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition
- An introduction to continuous optimization for imaging
