Comparative analysis of the prox penalty and Bregman algorithms for image denoising
From MaRDI portal
Publication:6535666
DOI10.1155/2023/6689311zbMATH Open1541.9401MaRDI QIDQ6535666
Nourreddine Daili, Soulef Bougueroua
Publication date: 1 February 2024
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal and dual Bregman methods with application to optical nanoscopy
- Convergence analysis of the Bregman method for the variational model of image denoising
- A fast algorithm for the total variation model of image denoising
- An iterative row-action method for interval convex programming
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems
- Totally convex functions for fixed points computation and infinite dimensional optimization
- Proximity algorithms for image models: denoising
- The Split Bregman Method for L1-Regularized Problems
- Nonlinear iterative methods for linear ill-posed problems in Banach spaces
- Split Bregman Methods and Frame Based Image Restoration
- A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
- Bregman Monotone Optimization Algorithms
- The Robustness of Proximal penalty algorithms in Restoration of noisy Image
- An Iterative Regularization Method for Total Variation-Based Image Restoration
This page was built for publication: Comparative analysis of the prox penalty and Bregman algorithms for image denoising
