Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem
From MaRDI portal
Publication:6087825
DOI10.1007/s10915-023-02382-4MaRDI QIDQ6087825
Huibin Chang, Yuping Duan, Zhenwei Zhang
Publication date: 16 November 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
non-overlapping domain decompositiondual model\(O(1/n^2)\) convergence ratemulti-phase labeling problem
Numerical methods for partial differential equations, boundary value problems (65Nxx) Communication, information (94Axx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Global minimization for continuous multiphase partitioning problems using a dual approach
- A convergent overlapping domain decomposition method for total variation minimization
- Preconditioned Douglas-Rachford algorithms for TV- and TGV-regularized variational imaging problems
- An efficient iterative thresholding method for image segmentation
- A `no-threshold' histogram-based image segmentation method
- Bregmanized domain decomposition for image restoration
- An efficient multi-grid method for TV minimization problems
- Convergent non-overlapping domain decomposition methods for variational image segmentation
- A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation
- Additive Schwarz methods for convex optimization with backtracking
- An overlapping domain decomposition framework without dual formulation for variational imaging problems
- Analysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spaces
- 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
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- Block decomposition methods for total variation by primal-dual stitching
- Accelerated additive Schwarz methods for convex optimization with adaptive restart
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- Subspace Correction Methods for a Class of Nonsmooth and Nonadditive Convex Variational Problems with Mixed $L^1/L^2$ Data-Fidelity in Image Processing
- Optimal approximations by piecewise smooth functions and associated variational problems
- Subspace Correction Methods for Total Variation and $\ell_1$-Minimization
- Generalizing Mumford-Shah Model for Multiphase Piecewise Smooth Image Segmentation
- Efficient and Convergent Preconditioned ADMM for the Potts Models
- Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model
- 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
- Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems
- Multiscale Segmentation via Bregman Distances and Nonlinear Spectral Analysis
- A Direct Approach Toward Global Minimization for Multiphase Labeling and Segmentation Problems
- Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition
- Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
This page was built for publication: Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem