Orthogonal wavelet

Orthogonal wavelet

An orthogonal wavelet is a wavelet where the associated wavelet transform is orthogonal. That is the inverse wavelet transform is the adjoint of the wavelet transform. If this condition is weakened you may end up with biorthogonal wavelets.

Basics

The scaling function is a refinable function. That is, it is a fractal functional equation, called the refinement equation (twin-scale relation or dilation equation):

\phi(x)=\sum_{k=0}^{N-1} a_k\phi(2x-k),

where the sequence (a_0,\dots, a_{N-1}) of real numbers is called a scaling sequence or scaling mask. The wavelet proper is obtained by a similar linear combination,

\psi(x)=\sum_{k=0}^{M-1} b_k\phi(2x-k),

where the sequence (b_0,\dots, b_{M-1}) of real numbers is called a wavelet sequence or wavelet mask.

A necessary condition for the orthogonality of the wavelets is that the scaling sequence is orthogonal to any shifts of it by an even number of coefficients:

\sum_{n\in\Z} a_n a_{n+2m}=2\delta_{m,0}

In this case there is the same number M=N of coefficients in the scaling as in the wavelet sequence, the wavelet sequence can be determined as bn = ( − 1)naN − 1 − n. In some cases the opposite sign is chosen.

Vanishing moments, polynomial approximation and smoothness

A necessary condition for the existence of a solution to the refinement equation is that some power (1+Z)A, A>0, divides the polynomial a(Z):=a_0+a_1Z+\dots+a_{N-1}Z^{N-1} (see Z-transform). The maximally possible power A is called polynomial approximation order (or pol. app. power) or number of vanishing moments. It describes the ability to represent polynomials up to degree A-1 with linear combinations of integer translates of the scaling function.

In the biorthogonal case, an approximation order A of ϕ corresponds to A vanishing moments of the dual wavelet \tilde\psi, that is, the scalar products of \tilde\psi with any polynomial up to degree A-1 are zero. In the opposite direction, the approximation order à of \tilde\phi is equivalent to à vanishing moments of ψ. In the orthogonal case, A and à coincide.

A sufficient condition for the existence of a scaling function is the following: if one decomposes a(Z) = 21 − A(1 + Z)Ap(Z), and the estimate holds

1\le\sup_{t\in[0,2\pi]}|p(e^{it})|<2^{A-1-n} for some n\in\N,

holds, then the refinement equation has a n times continuously differentiable solution with compact support.

Examples:

  • a(Z) = 21 − A(1 + Z)A, that is p(Z)=1, has n=A-2. The solutions are Schoenbergs B-splines of order A-1, where the (A-1)-th derivative is piecewise constant, thus the (A-2)-th derivative is Lipschitz-continuous. A=1 corresponds to the index function of the unit interval.
  • A=2 and p linear may be written as a(Z)=\frac14(1+Z)^2\,((1+Z)+c(1-Z)). Expansion of this degree 3 polynomial and insertion of the 4 coefficients into the orthogonality condition results in c²=3. The positive root gives the scaling sequence of the D4-wavelet, see below.

References

  • Ingrid Daubechies: Ten Lectures on Wavelets, SIAM 1992,

Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Wavelet — A wavelet is a mathematical function used to divide a given function or continuous time signal into different frequency components and study each component with a resolution that matches its scale. A wavelet transform is the representation of a… …   Wikipedia

  • Orthogonal Frequency Division Multiplex — OFDM Signal im Frequenzbereich. Die einzelnen Trägersignale sind in unterschiedlichen Farben dargestellt. OFDM Signalspektrum, die Summe der einzelnen Trägersignale OFDM (O …   Deutsch Wikipedia

  • Orthogonal Frequency Division Multiplexing — OFDM Signal im Frequenzbereich. Die einzelnen Trägersignale sind in unterschiedlichen Farben dargestellt. OFDM Signalspektrum, die Summe der einzelnen Trägersignale OFDM (O …   Deutsch Wikipedia

  • Wavelet de Haar — En matemáticas, el wavelet de Haar es una cierta secuencia de funciones. Ahora se le reconoce como el primer wavelet conocido. Esta secuencia fue propuesta en 1909 por Alfred Haar. Haar usó estas funciones para dar un ejemplo de un sistema… …   Wikipedia Español

  • Daubechies wavelet — Daubechies 20 2 d wavelet (Wavelet Fn X Scaling Fn) Named after Ingrid Daubechies, the Daubechies wavelets are a family of orthogonal wavelets defining a discrete wavelet transform and characterized by a maximal number of vanishing moments for… …   Wikipedia

  • Dual wavelet — In mathematics, a dual wavelet is the dual to a wavelet. In general, the wavelet series generated by a square integrable function will have a dual series, in the sense of the Riesz representation theorem. However, the dual series is not in… …   Wikipedia

  • Biorthogonal wavelet — A biorthogonal wavelet is a wavelet where the associated wavelet transform is invertible but not necessarily orthogonal.Designing biorthogonal wavelets allows more degrees of freedoms than orthogonal wavelets.One additional degree of freedom is… …   Wikipedia

  • Continuous wavelet transform — of frequency breakdown signal. Used symlet with 5 vanishing moments. A continuous wavelet transform (CWT) is used to divide a continuous time function into wavelets. Unlike Fourier transform, the continuous wavelet transform possesses the ability …   Wikipedia

  • Discrete wavelet transform — An example of the 2D discrete wavelet transform that is used in JPEG2000. The original image is high pass filtered, yielding the three large images, each describing local changes in brightness (details) in the original image. It is then low pass… …   Wikipedia

  • Fast wavelet transform — The Fast Wavelet Transform is a mathematical algorithm designed to turn a waveform or signal in the time domain into a sequence of coefficients based on an orthogonal basis of small finite waves, or wavelets. The transform can be easily extended… …   Wikipedia

Share the article and excerpts

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