Abstract
In this paper, we propose an effective iteration method for Huber variant of total variation based image restoration by exploiting the structure of the problem. We call the proposed method relaxed Newton–Picard like method. This method is easy to implement and cost-effective. We prove the convergence of the method by using the theory on semismooth functions. Experimental results show that the proposed method is more efficient than the alternating minimization method based on multiplicative half-quadratic reformulation and is competitive with the state of the art alternating direction method of multipliers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.