Table of Contents
Fetching ...

Multigrid methods for total variation

Felipe Guerra, Tuomo Valkonen

TL;DR

The paper develops a two-grid forward-backward splitting framework to accelerate nonsmooth convex optimization with TV regularization by alternating fine- and coarse-grid updates. A key contribution is the nonsmooth coherence condition that guides the construction of coarse-grid problems from the fine-grid subgradient information, enabling descent directions on the fine grid. The authors derive a detailed dual formulation for TV and provide explicit constructions of the coarse proximal operator and the Fenchel conjugate for complex data terms, including MRI, as well as convergence guarantees for FBMG. Numerical results on TV denoising and MRI demonstrate meaningful speedups, particularly in MRI where the coarse grid reduces the dominance of expensive transforms, illustrating the practical impact of truly cheaper coarse problems in nonsmooth multigrid optimization.

Abstract

Based on a nonsmooth coherence condition, we construct and prove the convergence of a forward-backward splitting method that alternates between steps on a fine and a coarse grid. Our focus is a total variation regularised inverse imaging problems, specifically, their dual problems, for which we develop in detail the relevant coarse-grid problems. We demonstrate the performance of our method on total variation denoising and magnetic resonance imaging.

Multigrid methods for total variation

TL;DR

The paper develops a two-grid forward-backward splitting framework to accelerate nonsmooth convex optimization with TV regularization by alternating fine- and coarse-grid updates. A key contribution is the nonsmooth coherence condition that guides the construction of coarse-grid problems from the fine-grid subgradient information, enabling descent directions on the fine grid. The authors derive a detailed dual formulation for TV and provide explicit constructions of the coarse proximal operator and the Fenchel conjugate for complex data terms, including MRI, as well as convergence guarantees for FBMG. Numerical results on TV denoising and MRI demonstrate meaningful speedups, particularly in MRI where the coarse grid reduces the dominance of expensive transforms, illustrating the practical impact of truly cheaper coarse problems in nonsmooth multigrid optimization.

Abstract

Based on a nonsmooth coherence condition, we construct and prove the convergence of a forward-backward splitting method that alternates between steps on a fine and a coarse grid. Our focus is a total variation regularised inverse imaging problems, specifically, their dual problems, for which we develop in detail the relevant coarse-grid problems. We demonstrate the performance of our method on total variation denoising and magnetic resonance imaging.

Paper Structure

This paper contains 16 sections, 10 theorems, 41 equations, 5 figures, 1 table, 1 algorithm.

Key Result

Lemma 2.4

If ass:coarse:basic holds, and we apply eq:coarse:alg for any $\zeta ^{k,0} \in X_H$, then

Figures (5)

  • Figure 1: Illustration of the middle case of \ref{['eq:tv:prox1']} (left) and \ref{['eq:tv:prox2']} (right).
  • Figure 2: Relative error \ref{['eq:relerror']} versus iteration count and CPU time for denoising.
  • Figure 3: Denoising data and results at relative error $\rho= 0.001$.
  • Figure 4: Relative error \ref{['eq:relerror']} versus both iteration count and CPU time for MRI.
  • Figure 5: MRI data and results at relative error $\rho=0.01$. (\ref{['fig:noisy:transform:sample:mri']}) is the backprojection of the Fourier line sample (\ref{['fig:noisy:line:sample:mri']}). There are altogether $t=100$ such samples.

Theorems & Definitions (22)

  • Example 2.3
  • Lemma 2.4
  • proof
  • Corollary 2.5
  • proof
  • Theorem 2.6
  • proof
  • Theorem 3.2: Sublinear convergence
  • proof
  • Lemma 4.1
  • ...and 12 more