Fast integral wavelet transform on a dense set of the time-scale domain
The authors introduce a very efficient algorithm, based on real-time optimal-order spline interpolation for computing the integral wavelet transform on a dense subset of the time-scale domain with a compactly supported spline-wavelet as the analyzing wavelet. We remark that in this work the semi-orthogonality property of the spline-wavelet is essential, and the computational complexity of their fast integral wavelet transform (FIWT) algorithm does not increase with the increasing number of values of the scale parameter. In the last section they present a few examples to elucidate the applications of their FIWT algorithm.
- scientific article; zbMATH DE number 1839859
- Wavelets on the interval and fast wavelet transforms
- A Painless and Direct Way from Integral to Discrete Fast Wavelet Transforms
- scientific article; zbMATH DE number 434618
- scientific article; zbMATH DE number 224208
- Fast continuous wavelet transform: A least-squares formulation
- Fast algorithms for discrete and continuous wavelet transforms
- Fast wavelet transforms and numerical algorithms I
- scientific article; zbMATH DE number 67278
- Fast wavelet transform for discrete periodic signals and patterns.
- Wavelet regression for random or irregular design.
- Affine frames, quasi-affine frames, and their duals
- Continuous wavelet transform with arbitrary scales and O(N) complexity
- A wavelet filter enhancement scheme with a fast integral B-wavelet transform and pyramidal multi-B-wavelet algorithm
- scientific article; zbMATH DE number 1839859 (Why is no real title available?)
This page was built for publication: Fast integral wavelet transform on a dense set of the time-scale domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893491)