An efficient multi-grid method for TV minimization problems

DOI10.3934/ipi.2021034OpenAlexW3157125155MaRDI QIDQ1983468

Ke Yin, Xue-Cheng Tai, Xue Li, Zhenwei Zhang, Yuping Duan

Publication date: 10 September 2021

Published in: Inverse Problems and Imaging (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/ipi.2021034

zbMATH Keywords

total variationdomain decompositionimage reconstructionimage denoisingsubspace correctionmulti-grid method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10)

Related Items (1)

Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem

Uses Software

• RecPF

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
• An accelerated algebraic multigrid algorithm for total-variation denoising
• An algorithm for total variation minimization and applications
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Convergent non-overlapping domain decomposition methods for variational image segmentation
• Fast dual minimization of the vectorial total variation norm and applications to color image processing
• A parallel domain decomposition algorithm for large scale image denoising
• Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
• A nonlinear multigrid method for total variation minimization from image restoration
• On a nonlinear multigrid algorithm with primal relaxation for the image total variation minimisation
• Non-overlapping domain decomposition methods for dual total variation based image denoising
• Domain decomposition method for image deblurring
• A parallel splitting up method and its application to Navier-Stokes equations
• Global and uniform convergence of subspace correction methods for some convex optimization problems
• Mathematical Models for Local Nontexture Inpaintings
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• A Multilevel Algorithm for Simultaneously Denoising and Deblurring Images
• Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• The Split Bregman Method for L1-Regularized Problems
• An Optimization‐Based Multilevel Algorithm for Total Variation Image Denoising
• Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
• Iterative Methods by Space Decomposition and Subspace Correction
• Analysis of bounded variation penalty methods for ill-posed problems
• Active contours without edges
• Fast, robust total variation-based reconstruction of noisy, blurred images
• Explicit Algorithms for a New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal
• Iterative Methods for Total Variation Denoising
• 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
• On High-Order Denoising Models and Fast Algorithms for Vector-Valued Images
• A Direct Approach Toward Global Minimization for Multiphase Labeling and Segmentation Problems
• An improved and accelerated non-linear multigrid method for total-variation denoising
• Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition
• An introduction to continuous optimization for imaging

This page was built for publication: An efficient multi-grid method for TV minimization problems