Convergent non-overlapping domain decomposition methods for variational image segmentation
type: Item
instance of: scholarly article
title: Convergent non-overlapping domain decomposition methods for variational image segmentation
zbMATH Open document ID: 1409.68313
author: Yuping Duan
author: Huibin Chang
author: Xue-Cheng Tai
published in: Journal of Scientific Computing
publication date: 2017-08-10T00:00:00Z
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 68T45
Mathematics Subject Classification ID: 94A08
zbMATH DE Number: 6759214
zbMATH Keywords: Chan-Vese model
zbMATH Keywords: non-overlapping domain decomposition methods
zbMATH Keywords: image segmentation
zbMATH Keywords: primal-dual algorithm
describes a project that uses: RecPF
MaRDI profile type: Publication
full work available at URL: s10915-016-0207-8
OpenAlex ID: W2339257204
cites work: Constraints on deformable models: Recovering 3D shape and nonrigid motion
cites work: A geometric model for active contours in image processing
cites work: Geodesic active contours
cites work: Optimal approximations by piecewise smooth functions and associated variational problems
cites work: Active contours without edges
cites work: Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
cites work: Nonlinear total variation based noise removal algorithms
cites work: Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
cites work: A multiphase level set framework for image segmentation using the Mumford and Shah model
cites work: Global minimization for continuous multiphase partitioning problems using a dual approach
cites work: Completely convex formulation of the Chan-Vese image segmentation model
cites work: A Convex Approach to Minimal Partitions
cites work: Handbook of Mathematical Methods in Imaging
cites work: Analysis of bounded variation penalty methods for ill-posed problems
cites work: Explicit Algorithms for a New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal
cites work: Q4845251
cites work: Computational Methods for Inverse Problems
cites work: Iterative Methods for Total Variation Denoising
cites work: Fast, robust total variation-based reconstruction of noisy, blurred images
cites work: The Split Bregman Method for L1-Regularized Problems
cites work: A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
cites work: Q3995612
cites work: Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
cites work: An algorithm for total variation minimization and applications
cites work: Globally optimal geodesic active contours
cites work: Q3266142
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
cites work: Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities
cites work: Q4241706
cites work: Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
cites work: Global and uniform convergence of subspace correction methods for some convex optimization problems
cites work: Domain decomposition methods in image denoising using Gaussian curvature
cites work: Domain decomposition methods with graph cuts algorithms for total variation minimization
cites work: Q3085555
cites work: A two-level domain decomposition method for image restoration
cites work: Domain decomposition method for image deblurring
cites work: Domain decomposition methods for nonlocal total variation image restoration
cites work: Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation
cites work: Subspace Correction Methods for Total Variation and $\ell_1$-Minimization
cites work: A convergent overlapping domain decomposition method for total variation minimization
cites work: Subspace correction methods for a class of nonsmooth and nonadditive convex variational problems with mixed \(L^1/L^2\) data-fidelity in image processing
cites work: Bregmanized domain decomposition for image restoration
cites work: Non-overlapping domain decomposition methods for dual total variation based image denoising
cites work: Block decomposition methods for total variation by primal-dual stitching
cites work: Sequential and Parallel Splitting Methods for Bilinear Control Problems in Hilbert Spaces
cites work: Q3484315
DOI: 10.1007/S10915-016-0207-8
description: scientific article; zbMATH DE number 6759214