Algorithms for spline wavelet packets on an interval
The authors generate wavelet packets spaces of dyadic dimensions by modifying the construction of spline wavelets on the interval introduced by \textit{C. K. Chui} and \textit{E. Quak} [Numerical methods in approximation theory 9, \textit{D. Braess} (ed.) et al., Int. Ser. Numer. Math. 105, 53-75 (1992; Zbl 0815.42016)] and by \textit{E. Quak} and \textit{N. Weyrich} [Appl. Comput. Harmon. Anal. 1, No. 3, 217-231 (1994; Zbl 0804.65143)]. They describe the corresponding decomposition and reconstruction algorithms and present a numerical study of the behaviour of their spline wavelet packets as well as a comparison with other wavelet packet approaches.
decomposition and reconstruction algorithms
scientific article; zbMATH DE number 1000365
scientific article