Math 2.0

Information and communication theory, circuits Example

Total variation denoising

Builds on Total variationLp spaceConvex function

Example

Let Ω⊆ℝn\Omega \subseteq \R^n be a bounded open set, let f∈L2(Ω)f \in L^2(\Omega) be a noisy image, and let λ>0\lambda > 0. For u∈L2(Ω)u \in L^2(\Omega) let TV(u)=sup⁡{∫Ωudiv⁡φ dx:φ∈Cc1(Ω;ℝn), ∣φ(x)∣≤1 for all x},TV(u) = \sup \Big\{ \int_\Omega u \operatorname{div} \varphi \, dx : \varphi \in C^1_c(\Omega; \R^n), \ \abs{\varphi(x)} \le 1 \text{ for all } x \Big\}, the total variation of uu, which equals ∫Ω∣∇u∣ dx\int_\Omega \abs{\nabla u} \, dx for smooth uu. Total variation denoising, in the model of Rudin, Osher and Fatemi, replaces ff by the minimizer of E(u)=TV(u)+λ2∫Ω(u−f)2 dx,u∈L2(Ω).E(u) = TV(u) + \frac{\lambda}{2} \int_\Omega (u - f)^2 \, dx, \qquad u \in L^2(\Omega). The functional EE is lower semicontinuous, coercive and strictly convex on the Lp space L2(Ω)L^2(\Omega), so it has exactly one minimizer.

A worked case on Ω=(0,1)\Omega = (0, 1): let h>0h > 0 and f=hf = h on (0,12)(0, \tfrac12), f=0f = 0 on (12,1)(\tfrac12, 1), a single edge of height hh. Assume λ≥4/h\lambda \ge 4/h and set δ=2/λ\delta = 2/\lambda. The minimizer is u=h−δu = h - \delta on (0,12)(0, \tfrac12) and u=δu = \delta on (12,1)(\tfrac12, 1).

Check: let w(x)=2xw(x) = 2x on [0,12][0, \tfrac12] and w(x)=2−2xw(x) = 2 - 2x on [12,1][\tfrac12, 1]. Then ∣w∣≤1\abs{w} \le 1, w(0)=w(1)=0w(0) = w(1) = 0, w′=λ(f−u)w' = \lambda (f - u), and ∫01uw′ dx=h−2δ=TV(u)\int_0^1 u w' \, dx = h - 2\delta = TV(u). For every vv one has TV(v)≥∫01vw′ dxTV(v) \ge \int_0^1 v w' \, dx, and expanding the squares gives E(v)−E(u)≥λ2∫01(v−u)2 dx≥0E(v) - E(u) \ge \frac{\lambda}{2} \int_0^1 (v - u)^2 \, dx \ge 0.

Remarks

The edge survives at the same place, and its height drops from hh to h−4/λh - 4/\lambda. A quadratic penalty ∫∣∇u∣2\int \abs{\nabla u}^2 instead of TV(u)TV(u) would smear the jump into a smooth ramp. If λ<4/h\lambda < 4/h, the minimizer is the constant h/2h/2, so a weak fidelity term erases small edges.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convex function concept
  2. Lp space concept
  3. Total variation concept
  4. Total variation denoising example

Further reading

  1. Web https://en.wikipedia.org/wiki/Total_variation_denoising
About this page
TagM4RJHZ3KNA
URIm2://M4RJHZ3KNA
Kindexample
WritingW0 stub
MSC94A08, 68U10, 49J45
IllustratesTotal variation
UsesTotal variation, Lp space, Convex function
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.