<< Chapter < Page | Chapter >> Page > |
A natural way to introduce wavelets is through the multiresolution analysis. Given a function , a multiresolution of will provide us with a sequence of spaces such that the projections of onto these spaces give finer and finer approximations (as ) of the function .
We will call `level' of a MRA one of the subspaces . From [link] , it follows that, for fixed , the set of scaled and translated versions of is a Riesz basis for . Since , we can express as a linear combination of :
[link] is called the two-scale equation or refinement equation . It is a fundamental equation in MRA since it tells us how to go from a fine level to a coarser level . The function is called the scaling function .
As said before, the spaces will be used to approximate general functions. This will be done by defining appropriate projections onto these spaces. Since the union of all the is dense in we are guaranteed that any given function of can be approximated arbitrarily close by such projections. As an example, define the space as
Then the scaling function , called the Haar scaling function, generates by translation and dilatation a MRA for the sequence of spaces defined in [link] , see [link] , [link] .
Rather than considering all the nested spaces it would be more efficient to code only the information needed to go from to Hence we consider the space which complements in :
The space is not necessarily orthogonal to , but it always contains the detail information needed to go from an approximation at resolution to an approximation at resolution Consequently, by using recursively the equation [link] , we have for any , the decomposition
With the notational convention that , we call the sequence
a multiscale decomposition ( MSD ).
We call a wavelet function whenever the set is a Riesz basis of . Since , there also exist a refinement equation for , similarly to [link] :
The collection of wavelet functions is then a Riesz basis for . One of the main features of the wavelet functions is that they possess a certain number of vanishing moments.
We now mention two interesting cases of wavelet bases.
In an orthogonal multiresolution analysis , the spaces are defined as the orthogonal complement of in . The following theorem tells us one of the main advantages of such a MRA.
Notification Switch
Would you like to follow the 'An introduction to wavelet analysis' conversation and receive update notifications?