Table of Contents
Fetching ...

A Semi-Convergent Stage-Wise Framework with Provable Global Convergence for Adaptive Total Variation Regularization

Liang Luo, Lei Zhang

TL;DR

This work tackles image restoration under blur and noise by introducing a semi-convergent stage-wise framework that alternates between first-order TV ($TV_1(u)=\phi(Du)$) and higher-order TV ($TV_2(u)=\phi(DDu)$) regularizers within an ADMM scheme. A PSNR-based select-and-propagate strategy leverages stage-wise semi-convergence to choose the locally best iterate and initialize the next stage, effectively translating local semi-convergence into global convergence. The authors prove that the stage-wise iterates remain bounded and the objective decreases monotonically, yielding convergence to a neighborhood of the ground truth. Extensive denoising and deblurring experiments show improved quantitative and perceptual performance over classical TV-based methods and several learning-based approaches, while preserving interpretability and algorithmic simplicity. The framework offers a flexible, theoretically grounded path to balance edge preservation and artifact suppression and invites extension to additional regularizers and imaging models.

Abstract

Image restoration requires a careful balance between noise suppression and structure preservation. While first-order total variation (TV) regularization effectively preserves edges, it often introduces staircase artifacts, whereas higher-order TV removes such artifacts but oversmooths fine details. To reconcile these competing effects, we propose a semi-convergent stage-wise framework that sequentially integrates first- and higher-order TV regularizers within an iterative restoration process implemented via ADMM. Each stage exhibits semi-convergence behavior, i.e., the iterates initially approach the ground truth before being degraded by over-regularization. By monitoring this evolution, the algorithm adaptively selects the locally optimal iterate (e.g., with the highest PSNR) and propagates it as the initial point for the next stage. This select-and-propagate mechanism effectively transfers local semi-convergence into a globally convergent iterative process. We establish theoretical guarantees showing that the sequence of stage-wise iterates is bounded, the objective values decrease monotonically. Extensive numerical experiments on denoising and deblurring benchmarks confirm that the proposed method achieves superior quantitative and perceptual performance compared with conventional first-, higher-order, hybrid TV methods, and learning based methods, while maintaining theoretical interpretability and algorithmic simplicity.

A Semi-Convergent Stage-Wise Framework with Provable Global Convergence for Adaptive Total Variation Regularization

TL;DR

This work tackles image restoration under blur and noise by introducing a semi-convergent stage-wise framework that alternates between first-order TV () and higher-order TV () regularizers within an ADMM scheme. A PSNR-based select-and-propagate strategy leverages stage-wise semi-convergence to choose the locally best iterate and initialize the next stage, effectively translating local semi-convergence into global convergence. The authors prove that the stage-wise iterates remain bounded and the objective decreases monotonically, yielding convergence to a neighborhood of the ground truth. Extensive denoising and deblurring experiments show improved quantitative and perceptual performance over classical TV-based methods and several learning-based approaches, while preserving interpretability and algorithmic simplicity. The framework offers a flexible, theoretically grounded path to balance edge preservation and artifact suppression and invites extension to additional regularizers and imaging models.

Abstract

Image restoration requires a careful balance between noise suppression and structure preservation. While first-order total variation (TV) regularization effectively preserves edges, it often introduces staircase artifacts, whereas higher-order TV removes such artifacts but oversmooths fine details. To reconcile these competing effects, we propose a semi-convergent stage-wise framework that sequentially integrates first- and higher-order TV regularizers within an iterative restoration process implemented via ADMM. Each stage exhibits semi-convergence behavior, i.e., the iterates initially approach the ground truth before being degraded by over-regularization. By monitoring this evolution, the algorithm adaptively selects the locally optimal iterate (e.g., with the highest PSNR) and propagates it as the initial point for the next stage. This select-and-propagate mechanism effectively transfers local semi-convergence into a globally convergent iterative process. We establish theoretical guarantees showing that the sequence of stage-wise iterates is bounded, the objective values decrease monotonically. Extensive numerical experiments on denoising and deblurring benchmarks confirm that the proposed method achieves superior quantitative and perceptual performance compared with conventional first-, higher-order, hybrid TV methods, and learning based methods, while maintaining theoretical interpretability and algorithmic simplicity.

Paper Structure

This paper contains 9 sections, 4 theorems, 33 equations, 9 figures, 4 tables, 4 algorithms.

Key Result

Lemma 3.1

Assume that H is Lipschitz continuous with associated Lipschitz constant L, $u^*$ is the solution of problem J(u), $u^{k}$ is the solution of the problem 2. If, for each $M \in R$ there exists a constant $\sigma(M)>0$ such that for each $\bar{v}$ satisfying $(\mathcal{J}+H)(u)\le M$ and $\bar{v}$,$R(\bar{v})$ and $T(\bar{v})$ defined by then ${u^{k}}$ converges linearly to the unique minimizer $

Figures (9)

  • Figure 1: The flow diagram of the graphical convergence process
  • Figure 1: The test images. (a) Cameraman (b) Einstein (c) Woman (d) Peppers (e) Butterfly (f) Starfish (g) Boat (h) House (i) Text (j) Logan (k) Stadium (l) Brain
  • Figure 2: A visual representation of convergence analysis.(a) PSNR curves for the Peppers, Cameraman, and Einstein images; (b) SSIM curves for the same images.
  • Figure 3: Relative error curve for the Peppers, Cameraman, and Einstein images.
  • Figure 4: Restored Peppers. (a)Original, (b)Degraded, (c)ROF model, (d)LLT model, (e)TGV model, (f)DBC-TV model, (g)Nesterov's method, and (h)Proposed method.
  • ...and 4 more figures

Theorems & Definitions (5)

  • Lemma 3.1
  • Lemma 3.2
  • Lemma 3.3
  • Theorem 3.4
  • Proof 1: Proof