Abstract
The necessary and sufficient conditions for the (non orthogonal) wavelet multiresolution analysis with arbitrary (for example B-spline) scaling function are established.
The following results are obtained:
-
1
the general theorem which declares necessary and sufficient conditions for the possibility of multiresolution analysis in the case of arbitrary scaling function;
-
2
the reformulation of this theorem for the case of B-spline scaling function from W \(_{\rm 2}^{m}\);
-
3
the complete description of the family of wavelet bases generated by B-spline scaling function;
-
4
the concrete construction of the unconditional wavelet bases (with minimal supports of wavelets) generated by B-spline scaling functions which belongs to W \(_{\rm 2}^{m}\).
These wavelet basesare simple and convenient for applications. In spite of their nonorthogonality, these bases possess the following advantages: 1) compactness of set \(\mbox{supp\,}\psi\) and minimality of its measure; 2) simple explicit formulas for the change of level. These advantages compensate the nonorthogonality of described bases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Daubechies, I.: Ten lectures on wavelets. In: SIAM, Philadelphia, Pennsylvania (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Strelkov, N. (2005). B–Splines and Nonorthogonal Wavelets. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_68
Download citation
DOI: https://doi.org/10.1007/11424857_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25862-9
Online ISBN: 978-3-540-32045-6
eBook Packages: Computer ScienceComputer Science (R0)