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

DOI10.1007/S10915-023-02382-4MaRDI QIDQ6087825zbMATH OpenFDO

Authors Zhenwei Zhang, Huibin Chang, Yuping Duan

Publication date 16 November 2023

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

Full work available at URL https://doi.org/10.1007/S10915-023-02382-4

zbMATH Keywords

\(O(1/n^2)\) convergence ratedual modelmulti-phase labeling problemnon-overlapping domain decomposition

Mathematics Subject Classification ID

Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Numerical methods for partial differential equations, boundary value problems (65Nxx) Communication, information (94Axx)

Recommendations

• Accelerated non-overlapping domain decomposition method for total variation minimization
• Convergent non-overlapping domain decomposition methods for variational image segmentation
• Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
• An overlapping domain decomposition framework without dual formulation for variational imaging problems
• Parallel multi-block ADMM with \(o(1/k)\) convergence

Cites work

• A `no-threshold' histogram-based image segmentation method
• A convergent overlapping domain decomposition method for total variation minimization
• A Direct Approach Toward Global Minimization for Multiphase Labeling and Segmentation Problems
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations
• A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation
• Accelerated additive Schwarz methods for convex optimization with adaptive restart
• Accelerated non-overlapping domain decomposition method for total variation minimization
• Additive Schwarz methods for convex optimization with backtracking
• An efficient iterative thresholding method for image segmentation
• An efficient multi-grid method for TV minimization problems
• 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
• Block decomposition methods for total variation by primal-dual stitching
• Bregmanized domain decomposition for image restoration
• Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
• Convergent non-overlapping domain decomposition methods for variational image segmentation
• Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
• Efficient and convergent preconditioned ADMM for the Potts models
• Fast nonoverlapping block Jacobi method for the dual Rudin-Osher-Fatemi model
• Generalizing Mumford-Shah Model for Multiphase Piecewise Smooth Image Segmentation
• Global and uniform convergence of subspace correction methods for some convex optimization problems
• Global minimization for continuous multiphase partitioning problems using a dual approach
• scientific article; zbMATH DE number 1292132 (Why is no real title available?)
• scientific article; zbMATH DE number 3076589 (Why is no real title available?)
• Multiscale segmentation via Bregman distances and nonlinear spectral analysis
• Non-overlapping domain decomposition methods for dual total variation based image denoising
• Optimal approximations by piecewise smooth functions and associated variational problems
• Overlapping domain decomposition methods for total variation denoising
• Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems
• Preconditioned Douglas-Rachford algorithms for TV- and TGV-regularized variational imaging problems
• Primal domain decomposition methods for the total variation minimization, based on dual decomposition
• Recent advances in domain decomposition methods for total variation minimization
• 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 _1-minimization
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

Cited in

(1)

• A general decomposition method for a convex problem related to total variation minimization

This page was built for publication: Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087825)