On the convergence of the IRLS algorithm in Non-Local Patch Regression
Kunal N. Chaudhury

TL;DR
This paper analyzes the convergence properties of the IRLS algorithm used in Non-Local Patch Regression for image denoising, demonstrating global convergence in convex cases and local convergence in non-convex cases, explained via a majorize-minimize framework.
Contribution
It provides a theoretical explanation for the IRLS algorithm's convergence behavior in NLPR, extending understanding to both convex and non-convex regimes.
Findings
IRLS is globally convergent for 1 ≤ p ≤ 2.
IRLS is locally convergent for 0 < p < 1.
Majorize-minimize framework explains convergence observations.
Abstract
Recently, it was demonstrated in [CS2012,CS2013] that the robustness of the classical Non-Local Means (NLM) algorithm [BCM2005] can be improved by incorporating regression into the NLM framework. This general optimization framework, called Non-Local Patch Regression (NLPR), contains NLM as a special case. Denoising results on synthetic and natural images show that NLPR consistently performs better than NLM beyond a moderate noise level, and significantly so when is close to zero. An iteratively reweighted least-squares (IRLS) algorithm was proposed for solving the regression problem in NLPR, where the NLM output was used to initialize the iterations. Based on exhaustive numerical experiments, we observe that the IRLS algorithm is globally convergent (for arbitrary initialization) in the convex regime , and locally convergent (fails very…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
