A primal-dual gradient method for image decomposition based on \((BV, H ^{ - 1})\)
From MaRDI portal
Publication:655963
DOI10.1007/s11045-011-0146-3zbMath1252.65111OpenAlexW2056041156MaRDI 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 inequalitiesnumerical experimentsprimal-dual algorithmimage decompositionstructuretexture
Variational inequalities (49J40) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for variational inequalities and related problems (65K15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: A primal-dual gradient method for image decomposition based on \((BV, H ^{ - 1})\)
