Domain decomposition methods with graph cuts algorithms for total variation minimization

DOI10.1007/S10444-011-9213-4zbMath1242.65123OpenAlexW2109377842MaRDI QIDQ421368

Yuping Duan, Xue-Cheng Tai

Publication date: 23 May 2012

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-011-9213-4

zbMATH Keywords

algorithmsdomain decompositionnumerical experimentstotal variation minimizationgraph cutssuccessive subspace correctionvariational image restoration

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Decomposition methods (49M27) Existence theories for optimal control problems involving partial differential equations (49J20)

Related Items (12)

Parareal method for anisotropic diffusion denoising ⋮ Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework ⋮ Domain decomposition methods for nonlocal total variation image restoration ⋮ Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition ⋮ Convergent non-overlapping domain decomposition methods for variational image segmentation ⋮ Non-overlapping domain decomposition methods for dual total variation based image denoising ⋮ Domain decomposition for non-smooth (in particular TV) minimization ⋮ Modular proximal optimization for multidimensional total-variation regularization ⋮ RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION ⋮ 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 ⋮ Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization

Uses Software

• MAXFLOW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Augmented Lagrangian method for total variation restoration with non-quadratic fidelity
• A fast algorithm for the total variation model of image denoising
• 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
• Image restoration with discrete constrained total variation. II: Levelable functions, convex priors and non-convex cases
• Image restoration with discrete constrained total variation. I: Fast and exact optimization
• A nonlinear multigrid method for total variation minimization from image restoration
• Global and uniform convergence of subspace correction methods for some convex optimization problems
• Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
• The Split Bregman Method for L1-Regularized Problems
• Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
• Augmented Lagrangian Method, Dual Methods and Split Bregman Iteration for ROF Model
• An Efficient Primal-Dual Method for $L^1$TV Image Restoration
• A new approach to the maximum-flow problem
• Digital filters as absolute norm regularizers
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
• Image Decomposition and Restoration Using Total Variation Minimization and theH¹
• A Fast Parametric Maximum Flow Algorithm and Applications
• Iterative Methods for Total Variation Denoising
• Aspects of Total Variation RegularizedL¹Function Approximation
• Nonlinear evolution equations as fast and exact solvers of estimation problems
• Efficient Total Variation Minimization Methods for Color Image Restoration
• An improved and accelerated non-linear multigrid method for total-variation denoising
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• Image Processing and Analysis

This page was built for publication: Domain decomposition methods with graph cuts algorithms for total variation minimization