Abstract
Iteratively Reweighted Least Squares (IRLS) is a well-established method of optimizing lp norm problems such as Total Variation (TV) regularization. Within this general framework, there are several possible ways of constructing the weights and the form of the linear system that is iteratively solved as part of the algorithm. Many of these choices are equally reasonable from a theoretical perspective, and there has, thus far, been no systematic comparison between them. In this paper we provide such a comparison between the main choices in IRLS algorithms for l1- and l2-TV denoising, finding that there is a significant variation in the computational cost and reconstruction quality of the different variants.
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.
