To make Total Variation differentiable, the Euclidean norm is replaced by a smooth approximation with a small :

Charbonnier (pseudo-Huber) smoothing

Huber smoothing (quadratic near zero, linear far away)

Both converge to TV as . Huber is exactly linear above and preserves edges slightly better. Charbonnier is .

Gradient. The first variation of is, with natural boundary conditions,

In a finite element space this is assembled as the vector . No second derivatives of are needed.

Hessian. The Hessian has the structure of a weighted stiffness matrix with a rank-one correction. It is sparse but becomes very ill-conditioned as . A common alternative is the lagged diffusivity fixed-point iteration (Vogel & Oman), which freezes the weight at the previous iterate. Quasi-Newton methods such as L-BFGS avoid forming the Hessian altogether.

Choosing . If is too large, the result looks like -Tikhonov Regularization and edges blur. If it is too small, the problem becomes stiff and optimisers slow down. Continuation, decreasing during the iterations, is common.

In ModularEIT.jl: TotalVariationRegularizer, total_variation.

References

  1. P. Charbonnier, L. Blanc-Féraud, G. Aubert, M. Barlaud (1997). Deterministic edge-preserving regularization in computed imaging. IEEE Trans. Image Process. 6(2), 298–311. doi:10.1109/83.551699
  2. P. J. Huber (1964). Robust Estimation of a Location Parameter. Ann. Math. Statist. 35(1), 73–101. doi:10.1214/aoms/1177703732
  3. C. R. Vogel, M. E. Oman (1996). Iterative Methods for Total Variation Denoising. SIAM J. Sci. Comput. 17(1), 227–238. doi:10.1137/0917016
  4. A. Borsic, B. M. Graham, A. Adler, W. R. B. Lionheart (2010). In Vivo Impedance Imaging With Total Variation Regularization. IEEE Trans. Med. Imaging 29(1), 44–54. doi:10.1109/TMI.2009.2022540