A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations

DOI10.1007/s10915-019-01085-zzbMath1434.65265arXiv1901.00682WikidataQ126866233 ScholiaQ126866233MaRDI QIDQ2291912

Jong Ho Park, Chang-Ock Lee

Publication date: 31 January 2020

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.00682

zbMATH Keywords

total variation; Lagrange multipliers; image processing; domain decomposition; parallel computation

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

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

65Y05: Parallel numerical computation

49M27: Decomposition methods

Related Items

Additive Schwarz Methods for Convex Optimization as Gradient Methods, RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION, Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem, Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization, An overlapping domain decomposition framework without dual formulation for variational imaging problems, Accelerated additive Schwarz methods for convex optimization with adaptive restart

Uses Software

• RecPF

Cites Work

• Nonlinear total variation based noise removal algorithms
• A convergent overlapping domain decomposition method for total variation minimization
• A variational approach to remove outliers and impulse noise
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Convergent non-overlapping domain decomposition methods for variational image segmentation
• 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
• Non-overlapping domain decomposition methods for dual total variation based image denoising
• 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
• Total Variation Minimization with Finite Elements: Convergence and Iterative Solution
• An Upwind Finite-Difference Method for Total Variation–Based Image Smoothing
• Subspace Correction Methods for Total Variation and $\ell_1$-Minimization
• Error Bounds for Finite-Difference Methods for Rudin–Osher–Fatemi Image Smoothing
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• 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
• 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
• 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
• Domain decomposition methods for linear inverse problems with sparsity constraints
• Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition
• An introduction to continuous optimization for imaging