Comparative analysis of the prox penalty and Bregman algorithms for image denoising

DOI10.1155/2023/6689311MaRDI QIDQ6535666zbMATH OpenFDO

Authors Soulef Bougueroua, Nourreddine Daili

Publication date 1 February 2024

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Restoration of the noised images by the proximal penalty algorithm
• Proximity algorithms for image models: denoising
• Dual norm based iterative methods for image restoration
• Comparison of formulations and solution methods for image restoration problems
• An Efficient Proximity Point Algorithm for Total-Variation-Based Image Restoration

Cites work

• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• scientific article; zbMATH DE number 7696312 (Why is no real title available?)
• A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
• A fast algorithm for the total variation model of image denoising
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• An iterative row-action method for interval convex programming
• Bregman Monotone Optimization Algorithms
• Convergence analysis of the Bregman method for the variational model of image denoising
• Epsilon-proximal point algorithms for nondifferentiable convex optimization problems and applications
• Iterative averaging of entropic projections for solving stochastic convex feasibility problems
• Nonlinear iterative methods for linear ill-posed problems in Banach spaces
• Primal and dual Bregman methods with application to optical nanoscopy
• Proximity algorithms for image models: denoising
• Restoration of the noised images by the proximal penalty algorithm
• Split Bregman methods and frame based image restoration
• The Robustness of Proximal penalty algorithms in Restoration of noisy Image
• The Split Bregman Method for L1-Regularized Problems
• Totally convex functions for fixed points computation and infinite dimensional optimization

This page was built for publication: Comparative analysis of the prox penalty and Bregman algorithms for image denoising

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535666)