A fast minimization method for blur and multiplicative noise removal
DOI10.1080/00207160.2012.688821zbMath1278.94013OpenAlexW2135678277MaRDI QIDQ2868155
Publication date: 23 December 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.688821
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items
Cites Work
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- Inexact Alternating Direction Methods for Image Recovery
- A Nonlinear Inverse Scale Space Method for a Convex Multiplicative Noise Model
- A New Total Variation Method for Multiplicative Noise Removal
- The Split Bregman Method for L1-Regularized Problems
- A Variational Approach to Removing Multiplicative Noise
- Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Numerical Optimization
- Multiplicative Noise Removal with Spatially Varying Regularization Parameters
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Multiplicative Noise Removal Using L1 Fidelity on Frame Coefficients