Total Variation Reconstruction

Total Variation β€” Preserving Edges in Imaging

Total variation (TV) regularization promotes piecewise-constant images β€” ideal for scenes with extended targets that have sharp boundaries. TV penalizes the β„“1\ell_1 norm of the image gradient, encouraging sparsity in the gradient domain rather than the image domain. This section develops TV reconstruction for RF imaging, building on the optimization framework of RFI Ch 04 and Telecom Ch 03.

Definition:

Total Variation for 2D Images

For a 2D image c∈RNxΓ—Ny\mathbf{c} \in \mathbb{R}^{N_x \times N_y} (vectorized as c∈RN\mathbf{c} \in \mathbb{R}^N), the isotropic TV semi-norm is:

βˆ₯cβˆ₯TV=βˆ‘i,j(ci+1,jβˆ’ci,j)2+(ci,j+1βˆ’ci,j)2,\|\mathbf{c}\|_{\text{TV}} = \sum_{i,j} \sqrt{(c_{i+1,j} - c_{i,j})^2 + (c_{i,j+1} - c_{i,j})^2},

and the anisotropic TV is:

βˆ₯cβˆ₯ATV=βˆ‘i,j(∣ci+1,jβˆ’ci,j∣+∣ci,j+1βˆ’ci,j∣).\|\mathbf{c}\|_{\text{ATV}} = \sum_{i,j} \left(|c_{i+1,j} - c_{i,j}| + |c_{i,j+1} - c_{i,j}|\right).

In operator notation: βˆ₯cβˆ₯TV=βˆ₯βˆ‡Dcβˆ₯2,1\|\mathbf{c}\|_{\text{TV}} = \|\nabla_D \mathbf{c}\|_{2,1} and βˆ₯cβˆ₯ATV=βˆ₯βˆ‡Dcβˆ₯1\|\mathbf{c}\|_{\text{ATV}} = \|\nabla_D \mathbf{c}\|_1, where βˆ‡D\nabla_D is the discrete gradient operator.

TV-regularized RF imaging:

c^TV=arg⁑min⁑c12βˆ₯yβˆ’Acβˆ₯22+Ξ»βˆ₯cβˆ₯TV.\hat{\mathbf{c}}_{\text{TV}} = \arg\min_{\mathbf{c}} \frac{1}{2}\|\mathbf{y} - \mathbf{A}\mathbf{c}\|_2^2 + \lambda\|\mathbf{c}\|_{\text{TV}}.

Theorem: ADMM for TV-Regularized Imaging

The TV-regularized imaging problem can be solved efficiently by ADMM with the auxiliary variable z=βˆ‡Dc\mathbf{z} = \nabla_D\mathbf{c}:

c(t+1)=(AHA+Οβˆ‡DHβˆ‡D)βˆ’1(AHy+Οβˆ‡DH(z(t)βˆ’u(t))),\mathbf{c}^{(t+1)} = (\mathbf{A}^{H}\mathbf{A} + \rho\nabla_D^H\nabla_D)^{-1} (\mathbf{A}^{H}\mathbf{y} + \rho\nabla_D^H (\mathbf{z}^{(t)} - \mathbf{u}^{(t)})),

z(t+1)=proxΞ»/ρ βˆ₯β‹…βˆ₯2,1(βˆ‡Dc(t+1)+u(t)),\mathbf{z}^{(t+1)} = \text{prox}_{\lambda/\rho\,\|\cdot\|_{2,1}} (\nabla_D\mathbf{c}^{(t+1)} + \mathbf{u}^{(t)}),

u(t+1)=u(t)+βˆ‡Dc(t+1)βˆ’z(t+1).\mathbf{u}^{(t+1)} = \mathbf{u}^{(t)} + \nabla_D\mathbf{c}^{(t+1)} - \mathbf{z}^{(t+1)}.

ADMM decouples the data fidelity (involving A\mathbf{A}) from the TV penalty (involving βˆ‡D\nabla_D). Each subproblem is simpler: the c\mathbf{c}-update is a linear system, the z\mathbf{z}-update is block soft-thresholding.

Definition:

TV for Complex-Valued RF Images

RF images are complex-valued (magnitude + phase). For complex TV, we have two options:

Option 1: Magnitude TV. Apply TV to ∣c∣|\mathbf{c}| β€” ignores phase structure.

Option 2: Complex TV (recommended).

βˆ₯cβˆ₯CTV=βˆ‘i,j∣ci+1,jβˆ’ci,j∣2+∣ci,j+1βˆ’ci,j∣2,\|\mathbf{c}\|_{\text{CTV}} = \sum_{i,j} \sqrt{|c_{i+1,j} - c_{i,j}|^2 + |c_{i,j+1} - c_{i,j}|^2},

where βˆ£β‹…βˆ£|\cdot| denotes the complex modulus. This penalizes variations in both magnitude and phase simultaneously.

For most RF imaging applications, complex TV provides the best results because magnitude and phase transitions co-occur at scatterer boundaries.

Definition:

Total Generalized Variation (TGV)

Standard TV promotes piecewise-constant images but produces staircase artifacts on smooth gradients. The Total Generalized Variation (TGV) of order 2 addresses this:

TGVΞ±0,Ξ±12(c)=min⁑pβ€…β€ŠΞ±1βˆ₯βˆ‡Dcβˆ’pβˆ₯1+Ξ±0βˆ₯E(p)βˆ₯1,\text{TGV}^2_{\alpha_0, \alpha_1}(\mathbf{c}) = \min_{\mathbf{p}} \; \alpha_1 \|\nabla_D \mathbf{c} - \mathbf{p}\|_1 + \alpha_0 \|\mathcal{E}(\mathbf{p})\|_1,

where p\mathbf{p} is an auxiliary vector field and E(p)\mathcal{E}(\mathbf{p}) is the symmetrized gradient.

TGV promotes piecewise-smooth images:

  • Constant regions: βˆ‡Dcβ‰ˆpβ‰ˆ0\nabla_D \mathbf{c} \approx \mathbf{p} \approx 0.
  • Linear gradients: βˆ‡Dcβ‰ˆp\nabla_D \mathbf{c} \approx \mathbf{p} (constant), E(p)β‰ˆ0\mathcal{E}(\mathbf{p}) \approx 0.
  • Edges: sharp transitions penalized by Ξ±1\alpha_1.

RF imaging use case: Scenes with smooth reflectivity variations (e.g., dielectric objects with gradual permittivity changes) in addition to sharp edges.

ADMM for TV-Regularized RF Imaging

Complexity: O(Tmax⁑(Nlog⁑N+MNCG))O(T_{\max}(N\log N + MN_{\text{CG}})) where NCGβ‰ˆ10N_{\text{CG}} \approx 10 is the number of CG iterations for the linear system.
Input: A\mathbf{A}, y\mathbf{y}, λ\lambda, ρ\rho, Tmax⁑T_{\max}
Initialize: c(0)=AHy\mathbf{c}^{(0)} = \mathbf{A}^{H}\mathbf{y},
z(0)=0\mathbf{z}^{(0)} = \mathbf{0}, u(0)=0\mathbf{u}^{(0)} = \mathbf{0}
for t=0,1,…,Tmaxβ‘βˆ’1t = 0, 1, \ldots, T_{\max}-1:
// Scene update (CG or FFT solve)
b←AHy+Οβˆ‡DH(z(t)βˆ’u(t))\mathbf{b} \gets \mathbf{A}^{H}\mathbf{y} + \rho\nabla_D^H(\mathbf{z}^{(t)} - \mathbf{u}^{(t)})
c(t+1)←(AHA+Οβˆ‡DHβˆ‡D)βˆ’1b\mathbf{c}^{(t+1)} \gets (\mathbf{A}^{H}\mathbf{A} + \rho\nabla_D^H\nabla_D)^{-1}\mathbf{b}
// Gradient update (block soft-thresholding)
vβ†βˆ‡Dc(t+1)+u(t)\mathbf{v} \gets \nabla_D\mathbf{c}^{(t+1)} + \mathbf{u}^{(t)}
for each pixel (i,j)(i,j):
zi,j(t+1)←proxΞ»/ρ βˆ₯β‹…βˆ₯2(vi,j)\mathbf{z}_{i,j}^{(t+1)} \gets \text{prox}_{\lambda/\rho\,\|\cdot\|_2}(\mathbf{v}_{i,j})
// Dual update
u(t+1)←u(t)+βˆ‡Dc(t+1)βˆ’z(t+1)\mathbf{u}^{(t+1)} \gets \mathbf{u}^{(t)} + \nabla_D\mathbf{c}^{(t+1)} - \mathbf{z}^{(t+1)}
// Adaptive ρ\rho (optional)
if primal residual >10Γ—> 10 \times dual residual: ρ←2ρ\rho \gets 2\rho
if dual residual >10Γ—> 10 \times primal residual: ρ←ρ/2\rho \gets \rho/2
Output: c^TV=c(Tmax⁑)\hat{\mathbf{c}}_{\text{TV}} = \mathbf{c}^{(T_{\max})}

When AHA\mathbf{A}^{H}\mathbf{A} admits FFT diagonalization (e.g., circulant or Kronecker with DFT factors), the c\mathbf{c}-update reduces to O(Nlog⁑N)O(N\log N), making each ADMM iteration very fast.

TV vs. β„“1\ell_1 Regularization for Imaging

Compares β„“1\ell_1, TV, and β„“1\ell_1+TV regularization on a scene with both point scatterers and extended targets.

  • β„“1\ell_1: Recovers point scatterers well but breaks extended targets into isolated points.
  • TV: Preserves edges of extended targets but may smooth point scatterers.
  • β„“1\ell_1 + TV: Best of both worlds.

Adjust Ξ»\lambda to balance data fidelity and regularization.

Parameters
0.05

Example: TV Reconstruction for Through-Wall Imaging

Setup: Through-wall radar imaging of a room interior. Radar: ULA with M=512M = 512 measurements. Scene: 64Γ—6464 \times 64 grid. Targets: 2 humans (extended, piecewise-constant) and 3 furniture items (rectangular shapes).

Results (SNR=15\text{SNR} = 15 dB):

Method NMSE (dB) SSIM Edge preservation
Matched filter βˆ’4.1-4.1 0.31 Poor
β„“1\ell_1 (FISTA) βˆ’12.3-12.3 0.72 Moderate
TV (ADMM) βˆ’17.8-17.8 0.88 Excellent
β„“1\ell_1 + TV (ADMM) βˆ’18.5-18.5 0.91 Excellent

TV dramatically outperforms β„“1\ell_1 for scenes with extended targets.

TV Variants for RF Imaging

VariantPenalizesBest forArtifacts
Anisotropic TVβˆ₯βˆ‡Dcβˆ₯1\|\nabla_D\mathbf{c}\|_1Axis-aligned edgesBlocky corners on diagonal edges
Isotropic TVβˆ₯βˆ‡Dcβˆ₯2,1\|\nabla_D\mathbf{c}\|_{2,1}Edges at any angleStaircase on smooth gradients
TGV (order 2)Ξ±1βˆ₯βˆ‡βˆ’pβˆ₯+Ξ±0βˆ₯E(p)βˆ₯\alpha_1\|\nabla-\mathbf{p}\|+\alpha_0\|\mathcal{E}(\mathbf{p})\|Smooth + sharp regionsMore parameters to tune
β„“1\ell_1 + TVΞ»1βˆ₯cβˆ₯1+Ξ»2βˆ₯cβˆ₯TV\lambda_{1}\|\mathbf{c}\|_1 + \lambda_{2}\|\mathbf{c}\|_{\text{TV}}Mixed scenesTwo parameters to tune

Common Mistake: TV Staircase Artifacts

Mistake:

Applying isotropic TV to scenes with smooth reflectivity gradients (e.g., dielectric objects with varying permittivity). TV promotes piecewise-constant reconstructions, so smooth gradients are approximated by staircase-like steps.

Correction:

Use TGV (Total Generalized Variation) for scenes with both sharp edges and smooth regions. TGV allows linear and higher-order polynomial variations within regions while preserving edge sharpness.

Quick Check

A scene consists of a single rectangular target with uniform reflectivity. Which regularizer will produce the best reconstruction?

TV (isotropic) β€” the scene is piecewise-constant with sharp edges.

β„“1\ell_1 β€” the scene has many nonzero pixels.

TGV β€” the scene has smooth variations.

Historical Note: Total Variation from Image Denoising to RF Imaging

1992--2011

Total variation regularization was introduced by Rudin, Osher, and Fatemi (1992) for image denoising β€” the ROF model. The key insight was that natural images often have sparse gradients (piecewise-constant regions separated by edges). Chambolle (2004) provided efficient algorithms, and the ADMM framework (Boyd et al., 2011) made TV tractable for large-scale inverse problems. Cetin and Karl (2001) pioneered the application of TV to SAR imaging, demonstrating its superiority over β„“1\ell_1 for extended targets.

,

Total Variation (TV)

Semi-norm measuring the β„“1\ell_1 norm of the image gradient. Promotes piecewise-constant images by penalizing edge magnitude while leaving constant regions free.

Related: Total Generalized Variation (TGV)

Total Generalized Variation (TGV)

Higher-order extension of TV that promotes piecewise-smooth (not just piecewise-constant) images by penalizing the second derivative of the image.

Key Takeaway

TV regularization is the natural choice for RF scenes with extended targets and sharp boundaries. ADMM splits the problem into an FFT-solvable linear system and block soft-thresholding. For mixed scenes (point + extended targets), β„“1\ell_1 + TV via ADMM handles both structures. Use TGV when smooth gradients are present to avoid staircase artifacts. Complex TV penalizes both magnitude and phase variations and is recommended for coherent imaging.