Abstract
A generalized iterative regularization procedure based on the total variation penalization is introduced for image denoising models with non-quadratic convex fidelity terms. By using a suitable sequence of penalty parameters we solve the issue of solvability of minimization problems arising in each step of the iterative procedure, which has been encountered in a recently developed iterative total variation procedure Furthermore, we obtain rigorous convergence results for exact and noisy data. We test the behaviour of the algorithm on real images in several numerical experiments using L 1 and L 2 fitting terms. Moreover, we compare the results with other state-of-the art multiscale techniques for total variation based image restoration.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
