A primal-dual gradient method for image decomposition based on \((BV, H ^{ - 1})\)
From MaRDI portal
Publication:655963
DOI10.1007/s11045-011-0146-3zbMath1252.65111MaRDI QIDQ655963
Publication date: 26 January 2012
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11045-011-0146-3
variational inequalities; numerical experiments; primal-dual algorithm; image decomposition; structure; texture
49J40: Variational inequalities
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
65K15: Numerical methods for variational inequalities and related problems
Related Items
Cites Work
- Nonlinear total variation based noise removal algorithms
- Iteratively solving linear inverse problems under general convex constraints
- Image recovery via total variation minimization and related problems
- Modeling textures with total variation minimization and oscillating patterns in image processing
- An algorithm for total variation minimization and applications
- Some recent advances in projection-type methods for variational inequalities
- Image restoration with discrete constrained total variation. II: Levelable functions, convex priors and non-convex cases
- Dual norms and image decomposition models
- Image decomposition via the combination of sparse representations and a variational approach
- A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
- Analysis of bounded variation penalty methods for ill-posed problems
- Convergence of an Iterative Method for Total Variation Denoising
- Image Decomposition and Restoration Using Total Variation Minimization and theH1
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Unnamed Item
- Unnamed Item