Block decomposition methods for total variation by primal-dual stitching

DOI10.1007/s10915-015-0138-9zbMath1343.49046MaRDI QIDQ2631053

Jongho Lee, Sangwoon Yun, Chang-Ock Lee, Hyenkyun Woo

Publication date: 28 July 2016

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

Full work available at URL: https://doi.org/10.1007/s10915-015-0138-9

zbMATH Keywords

image processing; domain decomposition; total variation model; primal-dual optimization; block decomposition method; primal-dual stitching; pseudo explicit method

Mathematics Subject Classification ID

49M29: Numerical methods involving duality

65K10: Numerical optimization and variational techniques

68U10: Computing methodologies for image processing

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

65Y05: Parallel numerical computation

49M27: Decomposition methods

Related Items

A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods, Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model, RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION, Dual-Primal Domain Decomposition Methods for the Total Variation Minimization, Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition, Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem, 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, Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A two-level domain decomposition method for image restoration
• Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
• A unified primal-dual algorithm framework based on Bregman iteration
• A convergent overlapping domain decomposition method for total variation minimization
• A coordinate gradient descent method for nonsmooth separable minimization
• A new inexact alternating directions method for monotone variational inequalities
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Bregmanized domain decomposition for image restoration
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Pathwise coordinate optimization
• Non-overlapping domain decomposition methods for dual total variation based image denoising
• Two-Level Convex Relaxed Variational Model for Multiplicative Denoising
• A Variational Approach for Image Stitching I
• 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
• The Split Bregman Method for L1-Regularized Problems
• Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
• Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
• Aspects of Nonlinear Block Successive Overrelaxation
• Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation
• Proximal Linearized Alternating Direction Method for Multiplicative Denoising
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Domain decomposition methods for linear inverse problems with sparsity constraints
• Signal Recovery by Proximal Forward-Backward Splitting
• Image Processing and Analysis
• Convergence of a block coordinate descent method for nondifferentiable minimization