Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Functional Analysis and Parallel Domain Decomposition for the TV-Stokes Model

Andreas Langer, Marc Runft, Talal Rahman, Xue-Cheng Tai, Bin Wu

TL;DR

Although the divergence-free constraint gives rise to a global projection operator in the continuous model, it is shown that it becomes locally computable in the discrete setting and enables a fully parallelizable algorithm suitable for large-scale image processing in memory-constrained environments.

Abstract

The TV-Stokes model is a two-step variational method for image denoising that combines the estimation of a divergence-free tangent field with total variation regularization in the first step and then uses that to reconstruct the image in the second step. Although effective in practice, its mathematical structure and potential for parallelization have remained unexplored. In this work, we establish a rigorous functional-analytic foundation for the TV-Stokes model. We formulate both steps in appropriate infinite-dimensional function spaces, derive their dual formulations, and analyze the compatibility and mathematical consistency of the coupled system. In particular, we identify analytical inconsistencies in the original formulation and demonstrate how an alternative model resolves them. We also examine the orthogonal projection onto the divergence-free subspace, proving its existence in a continuous setting and establishing consistency with its discrete counterpart. Building on this theoretical framework, we develop the first domain decomposition method for TV-Stokes by applying overlapping Schwarz-type iterations to the duals of both steps. Although the divergence-free constraint gives rise to a global projection operator in the continuous model, we show that it becomes locally computable in the discrete setting. This insight enables a fully parallelizable algorithm suitable for large-scale image processing in memory-constrained environments. Numerical experiments demonstrate the correctness of the domain decomposition approach and its usability in parallel image reconstruction.

Functional Analysis and Parallel Domain Decomposition for the TV-Stokes Model

TL;DR

Although the divergence-free constraint gives rise to a global projection operator in the continuous model, it is shown that it becomes locally computable in the discrete setting and enables a fully parallelizable algorithm suitable for large-scale image processing in memory-constrained environments.

Abstract

The TV-Stokes model is a two-step variational method for image denoising that combines the estimation of a divergence-free tangent field with total variation regularization in the first step and then uses that to reconstruct the image in the second step. Although effective in practice, its mathematical structure and potential for parallelization have remained unexplored. In this work, we establish a rigorous functional-analytic foundation for the TV-Stokes model. We formulate both steps in appropriate infinite-dimensional function spaces, derive their dual formulations, and analyze the compatibility and mathematical consistency of the coupled system. In particular, we identify analytical inconsistencies in the original formulation and demonstrate how an alternative model resolves them. We also examine the orthogonal projection onto the divergence-free subspace, proving its existence in a continuous setting and establishing consistency with its discrete counterpart. Building on this theoretical framework, we develop the first domain decomposition method for TV-Stokes by applying overlapping Schwarz-type iterations to the duals of both steps. Although the divergence-free constraint gives rise to a global projection operator in the continuous model, we show that it becomes locally computable in the discrete setting. This insight enables a fully parallelizable algorithm suitable for large-scale image processing in memory-constrained environments. Numerical experiments demonstrate the correctness of the domain decomposition approach and its usability in parallel image reconstruction.
Paper Structure (28 sections, 14 theorems, 130 equations, 8 figures, 5 tables, 5 algorithms)

This paper contains 28 sections, 14 theorems, 130 equations, 8 figures, 5 tables, 5 algorithms.

Table of Contents

  1. Introduction
  2. Fundamentals
  3. Discussion on TV-Stokes Model
  4. Step 1 - Tangent Field Smoothing (TFS)
  5. Analytic Discussion
  6. Projection on Subspace with Zero Divergence
  7. Construction of the orthogonal projection
  8. Dual Formulation
  9. Step 2 - Image Reconstruction
  10. Constrained versus Unconstrained
  11. Dual Formulation
  12. Alternative Formulation of Step 2 and its Dualization
  13. Discretization
  14. Notations
  15. Iteration for Discrete Dual Problems
  16. ...and 13 more sections

Key Result

Lemma 1

Let $X$ and $Y$ be real Hilbert spaces and $A:X\rightarrow Y$ be a linear bounded operator. Then the following statements for $f\in X$ and $g\in Y$ are equivalent:

Figures (8)

  • Figure 1: Primal and dual coordinate systems for $N_2=N_1=3$.
  • Figure 2: Phantom images used for tests. Image 00 (left) and Image 01 (right).
  • Figure 3: Real world images used for tests, which are ordered left to right according to the IDs listed in the first column.
  • Figure 4: Denoising example for light noise, $\sigma^2=0.0025$.
  • Figure 5: Denoising example for heavy noise, $\sigma^2=0.09$
  • ...and 3 more figures

Theorems & Definitions (29)

  • Lemma 1: rieder:2003
  • Corollary 2: Dualization of Tangent Field Smoothing
  • proof
  • Theorem 3
  • proof
  • Proposition 4
  • proof
  • Theorem 5
  • proof
  • Remark 1
  • ...and 19 more