Multiresolution Analysis

A multiresolution analysis (MRA) or multiscale approximation (MSA) is the design method of most of the practically relevant discrete wavelet transforms (DWT) and the justification for the algorithm of the fast wavelet transform (FWT). It was introduced in this context in 1988/89 by Stephane Mallat and Yves Meyer and has predecessors in the microlocal analysis in the theory of differential equations (the ''ironing method'') and the pyramid methods of image processing as introduced in 1981/83 by Peter J. Burt, Edward H. Adelson an
James L. Crowley

Definition

A multiresolution analysis of the Lebesgue space $L^2(\mathbb)$ consists of a sequence of nested subspaces

::$\\subset \dots\subset V_1\subset V_0\subset V_\subset\dots\subset V_\subset V_\subset\dots\subset L^2(\R)$

that satisfies certain self-similarity relations in time-space and scale-frequency, as well as completeness and regularity relations.

* ''Self-similarity'' in ''time'' demands that each subspace ''V_k'' is invariant under shifts by integer multiples of ''2^k''. That is, for each $f\in V_k,\; m\in\Z$ the function ''g'' defined as $g(x)=f(x-m2^)$ also contained in $V_k$.
* ''Self-similarity'' in ''scale'' demands that all subspaces $V_k\subset V_l,\; k>l,$ are time-scaled versions of each other, with scaling respectively dilation factor 2^''k-l''. I.e., for each $f\in V_k$ there is a $g\in V_l$ with $\forall x\in\R:\;g(x)=f(2^x)$.
* In the sequence of subspaces, for ''k''>''l'' the space resolution 2^''l'' of the ''l''-th subspace is higher than the resolution 2^''k'' of the ''k''-th subspace.
* ''Regularity'' demands that the model subspace ''V₀'' be generated as the linear hull ( algebraically or even topologically closed) of the integer shifts of one or a finite number of generating functions $\phi$ or $\phi_1,\dots,\phi_r$. Those integer shifts should at least form a frame for the subspace $V_0\subset L^2(\R)$, which imposes certain conditions on the decay at infinity. The generating functions are also known as scaling functions or father wavelets. In most cases one demands of those functions to be piecewise continuous with compact support.
* ''Completeness'' demands that those nested subspaces fill the whole space, i.e., their union should be dense in $L^2(\R)$, and that they are not too redundant, i.e., their intersection should only contain the zero element.

Important conclusions

In the case of one continuous (or at least with bounded variation) compactly supported scaling function with orthogonal shifts, one may make a number of deductions. The proof of existence of this class of functions is due to Ingrid Daubechies.

Assuming the scaling function has compact support, then $V_0\subset V_$ implies that there is a finite sequence of coefficients $a_k=2 \langle\phi(x),\phi(2x-k)\rangle$ for $, k, \leq N$, and $a_k=0$ for $, k, >N$, such that

:$\phi(x)=\sum_^N a_k\phi(2x-k).$

Defining another function, known as mother wavelet or just the wavelet
:$\psi(x):=\sum_^N (-1)^k a_\phi(2x-k),$
one can show that the space $W_0\subset V_$, which is defined as the (closed) linear hull of the mother wavelet's integer shifts, is the orthogonal complement to $V_0$ inside $V_$. Or put differently, $V_$ is the orthogonal sum (denoted by $\oplus$) of $W_0$ and $V_0$. By self-similarity, there are scaled versions $W_k$ of $W_0$ and by completeness one has
:$L^2(\R)=\mbox\bigoplus_W_k,$
thus the set
:$\$
is a countable complete orthonormal wavelet basis in $L^2(\R)$.

See also

* Multigrid method
* Multiscale modeling
* Scale space
* Time–frequency analysis
* Wavelet

References

*
*
* Crowley, J. L., (1982)
A Representations for Visual Information
Doctoral Thesis, Carnegie-Mellon University, 1982.
*
* {{cite book, first=S.G., last=Mallat, url=http://www.cmap.polytechnique.fr/~mallat/book.html, title=A Wavelet Tour of Signal Processing, publisher=Academic Press, year=1999, isbn=0-12-466606-X

Time–frequency analysis
Wavelets