Block decomposition methods for total variation by primal-dual stitching
From MaRDI portal
Publication:2631053
block decomposition methoddomain decompositionimage processingprimal-dual optimizationprimal-dual stitchingpseudo explicit methodtotal variation model
Decomposition methods (49M27) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Parallel numerical computation (65Y05) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Recommendations
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
- Bregmanized domain decomposition for image restoration
- A primal-dual gradient method for image decomposition based on \((BV, H ^{ - 1})\)
- Dual-primal domain decomposition methods for the total variation minimization
Cites work
- A convergent overlapping domain decomposition method for total variation minimization
- A coordinate gradient descent method for nonsmooth separable minimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A new inexact alternating directions method for monotone variational inequalities
- A two-level domain decomposition method for image restoration
- A unified primal-dual algorithm framework based on Bregman iteration
- A variational approach for image stitching. I
- Aspects of Nonlinear Block Successive Overrelaxation
- Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
- Bregmanized domain decomposition for image restoration
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
- Domain decomposition methods for linear inverse problems with sparsity constraints
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1138069 (Why is no real title available?)
- Image Processing and Analysis
- Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- Nonlinear total variation based noise removal algorithms
- Pathwise coordinate optimization
- Proximal linearized alternating direction method for multiplicative denoising
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- 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 Split Bregman Method for L1-Regularized Problems
- Two-level convex relaxed variational model for multiplicative denoising
Cited in
(12)- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
- Convergent non-overlapping domain decomposition methods for variational image segmentation
- 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
- Parallel Block Sequential Closed-Form Matting With Fan-Shaped Partitions
- A finite element approach for the dual Rudin-Osher-Fatemi model and its nonoverlapping domain decomposition methods
- Fast nonoverlapping block Jacobi method for the dual Rudin-Osher-Fatemi model
- Recent advances in domain decomposition methods for total variation minimization
- Dual-primal domain decomposition methods for the total variation minimization
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem
- Domain decomposition for non-smooth (in particular TV) minimization
This page was built for publication: Block decomposition methods for total variation by primal-dual stitching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631053)
