Algorithms for spline wavelet packets on an interval (Q678214)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1000365
Language Label Description Also known as
default for all languages
No label defined
    English
    Algorithms for spline wavelet packets on an interval
    scientific article; zbMATH DE number 1000365

      Statements

      Algorithms for spline wavelet packets on an interval (English)
      0 references
      0 references
      0 references
      0 references
      20 October 1997
      0 references
      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.
      0 references
      decomposition and reconstruction algorithms
      0 references
      spline wavelet packets
      0 references
      comparison
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references