Wiener deconvolution

Wiener deconvolution

In mathematics, Wiener deconvolution is an application of the Wiener filter to the noise problems inherent in deconvolution. It works in the frequency domain, attempting to minimize the impact of deconvoluted noise at frequencies which have a poor signal-to-noise ratio.

The Wiener deconvolution method has widespread use in image deconvolution applications, as the frequency spectrum of most visual images is fairly well behaved and may be estimated easily.

Wiener deconvolution is named after Norbert Wiener.

Definition

Given a system:

: y(t) = h(t)*x(t) + v(t)

where * denotes convolution. and:

* x(t) is some input signal (unknown) at time t .
* h(t) is the known impulse response of a linear time-invariant system
* v(t) is some unknown additive noise, independent of x(t)
* y(t) is our observed signal

Our goal is to find some g(t) so that we can estimate x(t) as follows:

: hat{x}(t) = g(t)*y(t)

where hat{x}(t) is an estimate of x(t) that minimises the mean square error.

The Wiener deconvolution filter provides such a g(t). The filter is most easily described in the frequency domain:

: G(f) = frac{H^*(f)S(f)}{ |H(f)|^2 S(f) + N(f) }

where:

* G(f) and H(f) are the Fourier transforms of g and h, respectively at frequency f .
* S(f) is the mean power spectral density of the input signal x(t)
* N(f) is the mean power spectral density of the noise v(t)
* the superscript * denotes complex conjugation.

The filtering operation may either be carried out in the time-domain, as above, or in the frequency domain:

: hat{X}(f) = G(f)Y(f)

(where hat{X}(f) is the Fourier transform of hat{x}(t)) and then performing an inverse Fourier transform on hat{X}(f) to obtain hat{x}(t).

Note that in the case of images, the arguments t and f above become two-dimensional; however the result is the same.

Interpretation

The operation of the Wiener filter becomes apparent when the filter equation above is rewritten:

:egin{align} G(f) & = frac{1}{H(f)} left [ frac{ |H(f)|^2 }{ |H(f)|^2 + frac{N(f)}{S(f)} } ight] \ & = frac{1}{H(f)} left [ frac{ |H(f)|^2 }{ |H(f)|^2 + frac{1}{mathrm{SNR}(f) ight] end{align}

Here, 1/H(f) is the inverse of the original system, and mathrm{SNR}(f) = S(f)/N(f) is the signal-to-noise ratio. When there is zero noise (i.e. infinite signal-to-noise), the term inside the square brackets equals 1, which means that the Wiener filter is simply the inverse of the system, as we might expect. However, as the noise at certain frequencies increases, the signal-to-noise ratio drops, so the term inside the square brackets also drops. This means that the Wiener filter attenuates frequencies dependent on their signal-to-noise ratio.

The Wiener filter equation above requires us to know the spectral content of a typical image, and also that of the noise. Often, we do not have access to these exact quantities, but we may be in a situation where good estimates can be made. For instance, in the case of photographic images, the signal (the original image) typically has strong low frequencies and weak high frequencies, and in many cases the noise content will be relatively flat with frequency.

Derivation

As mentioned above, we want to produce an estimate of the original signal that minimises the mean square error, which may be expressed:

: epsilon(f) = mathbb{E} left| X(f) - hat{X}(f) ight|^2

where mathbb{E} denotes expectation.

If we substitute in the expression for hat{X}(f), the following rearrangements can be made:

:egin{align} epsilon(f) & = mathbb{E} left| X(f) - G(f)Y(f) ight|^2 \ & = mathbb{E} left| X(f) - G(f) left [ H(f)X(f) + V(f) ight] ight|^2 \ & = mathbb{E} ig| left [ 1 - G(f)H(f) ight] X(f) - G(f)V(f) ig|^2end{align}

If we expand the quadratic, we get the following:

:egin{align} epsilon(f) & = Big [ 1-G(f)H(f) Big] Big [ 1-G(f)H(f) Big] ^*, mathbb{E}|X(f)|^2 \ & {} + Big [ 1-G(f)H(f) Big] G^*(f), mathbb{E}Big{X(f)V^*(f)Big} \ & {} + G(f) Big [ 1-G(f)H(f) Big] ^*, mathbb{E}Big{V(f)X^*(f)Big} \ & {} + G(f) G^*(f), mathbb{E}|V(f)|^2end{align}

However, we are assuming that the noise is independent of the signal, therefore:

: mathbb{E}Big{X(f)V^*(f)Big} = mathbb{E}Big{V(f)X^*(f)Big} = 0

Also, we are defining the power spectral densities as follows:

: S(f) = mathbb{E}|X(f)|^2: N(f) = mathbb{E}|V(f)|^2

Therefore, we have:

:egin{align} epsilon(f) & = Big [ 1-G(f)H(f) Big] Big [ 1-G(f)H(f) Big] ^* S(f) \ & {} + G(f)G^*(f)N(f)end{align}

To find the minimum error value, we differentiate with respect to G(f) and set equal to zero. As this is a complex value, G^*(f) acts as a constant.

: frac{depsilon(f)}{dG(f)} = G^*(f)N(f) - H(f)Big [1 - G(f)H(f)Big] ^* S(f) = 0

This final equality can be rearranged to give the Wiener filter.

See also

* Deconvolution
* Wiener filter
* Point spread function
* Blind deconvolution
* Fourier transform

References

* Rafael Gonzalez, Richard Woods, and Steven Eddins. "Digital Image Processing Using Matlab". Prentice Hall, 2003.

External links

* [http://www.owlnet.rice.edu/~elec539/Projects99/BACH/proj2/blind/bd.html Comparison of different deconvolution methods.]
* [http://cnx.org/content/m13144/latest/ Deconvolution with a Wiener filter]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Deconvolution — In mathematics, deconvolution is an algorithm based process used to reverse the effects of convolution on recorded data.[1] The concept of deconvolution is widely used in the techniques of signal processing and image processing. Because these… …   Wikipedia

  • Déconvolution de Wiener — De gauche à droite: image d origine, image floue, l image défloutée (partiellement) par déconvolution de Wiener. La déconvolution de Wiener est une opération mathématique appliquant un filtre de Wiener pour éliminer ou atténuer une partie des… …   Wikipédia en Français

  • Wiener filter — In signal processing, the Wiener filter is a filter proposed by Norbert Wiener during the 1940s and published in 1949.ref|Wiener1949 Its purpose is to reduce the amount of noise present in a signal by comparison with an estimation of the desired… …   Wikipedia

  • Deconvolution — Dekonvolution Mit Dekonvolution (dt. »Entfaltung«) bezeichnet man die Umkehrung der sog. Faltungsoperation. Dabei handelt es sich um eine mathematische Transformation, die unter Anderem in der Signal und Bildverarbeitung Anwendung findet. Eine… …   Deutsch Wikipedia

  • Déconvolution — En mathematiques, la déconvolution est un procédé algorithmique destiné à inverser les effets de la convolution. Le concept de déconvolution est largement utilisé en traitement du signal et traitement d image, notamment en microscopie et… …   Wikipédia en Français

  • Blind deconvolution — In applied mathematics, blind deconvolution is a deconvolution technique that permits recovery of the target object from set of blurred images in the presence of a poorly determined or unknown point spread function (PSF). Regular linear and non… …   Wikipedia

  • Comparison of image processing software — The following table provides a comparison of image processing software. Functionality Matlab*[1] Mathematica[2] imageJ FIJI (software) Population Extract alpha channel No …   Wikipedia

  • Rückfaltung — Dekonvolution Mit Dekonvolution (dt. »Entfaltung«) bezeichnet man die Umkehrung der sog. Faltungsoperation. Dabei handelt es sich um eine mathematische Transformation, die unter Anderem in der Signal und Bildverarbeitung Anwendung findet. Eine… …   Deutsch Wikipedia

  • List of mathematics articles (W) — NOTOC Wad Wadge hierarchy Wagstaff prime Wald test Wald Wolfowitz runs test Wald s equation Waldhausen category Wall Sun Sun prime Wallenius noncentral hypergeometric distribution Wallis product Wallman compactification Wallpaper group Walrasian… …   Wikipedia

  • Motion blur — is the apparent streaking of rapidly moving objects in a still image or a sequence of images such as a movie or animation. It results when the image being recorded changes during the recording of a single frame, either due to rapid movement or… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”