Often, the Discrete Wavelet Transform is performed and implemented with the Daubechies wavelets, the Battle-Lemarie wavelets or the splines wavelets whereas in continuous time wavelet decomposition a much larger variety of mother wavelets are used. Maintaining the dyadic time-frequency sampling and the recursive pyramidal computational structure, we present various methods to obtain any chosen analyzing wavelet (psi) w, with some desired shape and properties and which is associated with a semi-orthogonal multiresolution analysis or to a pair of bi-orthogonal multiresolutions. We explain in details how to design one's own wavelet, starting from any given Multiresolution Analysis or any pair of bi-orthogonal multiresolutions. We also explicitly derive, in a very general oblique (or bi-orthogonal) framework, the formulae of the filter bank structure that implements the designed wavelet. We illustrate these wavelet design, techniques with examples that we have programmed with Matlab routines, available upon request.
[1]
A. Aldroubi,et al.
Designing Multiresolution Analysis-type Wavelets and Their
Fast Algorithms
,
1995
.
[2]
Michael Unser,et al.
A family of polynomial spline wavelet transforms
,
1993,
Signal Process..
[3]
Thomas P. Barnwell,et al.
The flexible design of compactly supported wavelets
,
1992,
[1992] Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis.
[4]
Bruno Torrésani,et al.
Pyramidal algorithms for Littlewood-Paley decompositions
,
1995
.
[5]
Stéphane Mallat,et al.
A Theory for Multiresolution Signal Decomposition: The Wavelet Representation
,
1989,
IEEE Trans. Pattern Anal. Mach. Intell..
[6]
I. Daubechies,et al.
Biorthogonal bases of compactly supported wavelets
,
1992
.
[7]
A. Aldroubi,et al.
Families of multiresolution and wavelet spaces with optimal properties
,
1993
.