RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION

DOI10.12941/jksiam.2020.24.161zbMath1453.65429MaRDI QIDQ5149918

Chang-Ock Lee, Jong Ho Park

Publication date: 9 February 2021

Full work available at URL: http://www.koreascience.or.kr:80/article/JAKO202019854294101.pdf

zbMATH Keywords

total variation; parallel computation; domain decomposition methods; mathematical imaging

Mathematics Subject Classification ID

65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs

65K10: Numerical optimization and variational techniques

68U10: Computing methodologies for image processing

65Y05: Parallel numerical computation

Related Items

Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization, An Optimized Dynamic Mode Decomposition Model Robust to Multiplicative Noise, Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem

Uses Software

• RecPF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
• On the ergodic convergence rates of a first-order primal-dual algorithm
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Domain decomposition methods with graph cuts algorithms for total variation minimization
• A convergent overlapping domain decomposition method for total variation minimization
• A dual iterative substructuring method with a penalty term
• An algorithm for total variation minimization and applications
• A variational approach to remove outliers and impulse noise
• Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Bregmanized domain decomposition for image restoration
• Convergent non-overlapping domain decomposition methods for variational image segmentation
• A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations
• Coordinate descent algorithms
• Discrete total variation with finite elements and applications to imaging
• Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
• One- and two-level Schwarz methods for variational inequalities of the second kind and their application to frictional contact
• Non-overlapping domain decomposition methods for dual total variation based image denoising
• Block decomposition methods for total variation by primal-dual stitching
• Global and uniform convergence of subspace correction methods for some convex optimization problems
• Subspace Correction Methods for a Class of Nonsmooth and Nonadditive Convex Variational Problems with Mixed $L^1/L^2$ Data-Fidelity in Image Processing
• Total Variation Minimization with Finite Elements: Convergence and Iterative Solution
• Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
• 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
• Balancing domain decomposition
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• The Split Bregman Method for L1-Regularized Problems
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• An Efficient Primal-Dual Method for $L^1$TV Image Restoration
• A method of finite element tearing and interconnecting and its parallel solution algorithm
• Iterative Methods by Space Decomposition and Subspace Correction
• Monotone Operators and the Proximal Point Algorithm
• Active contours without edges
• Analysis of total variation flow and its finite element approximations
• A Preconditioner for Substructuring Based on Constrained Energy Minimization
• Convergence Rate Analysis of a Multiplicative Schwarz Method for Variational Inequalities
• Edge-preserving and scale-dependent properties of total variation regularization
• A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods
• Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model
• On the Convergence of Primal-Dual Hybrid Gradient Algorithm
• Overlapping Domain Decomposition Methods for Total Variation Denoising
• Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation
• Aspects of Total Variation RegularizedL¹Function Approximation
• Convergence Rate of a Schwarz Multilevel Method for the Constrained Minimization of Nonquadratic Functionals
• Signal Recovery by Proximal Forward-Backward Splitting
• Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition
• An introduction to continuous optimization for imaging