Constraint-selected and search-optimized families of Daubechies wavelet filters computable by spectral factorization (Q1587402)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constraint-selected and search-optimized families of Daubechies wavelet filters computable by spectral factorization |
scientific article |
Statements
Constraint-selected and search-optimized families of Daubechies wavelet filters computable by spectral factorization (English)
0 references
27 February 2001
0 references
The survey paper reviews the development of a systematized collection of (real and complex orthogonal and biorthogonal) Daubechies wavelets computable by the spectral factorization of a symmetric positive polynomial. It is based on previous work of the author (see www.toolsmith.com). The spectral factors are found for search-optimized families by examining a desired criterion over combinatorial subsets of roots indexed by binary codes, and for constraint-selected families by imposing sufficient constraints on the roots without any optimizing search for an extremal property. Numerical examples are presented.
0 references
filter bank design
0 references
numerical examples
0 references
survey paper
0 references
Daubechies wavelets
0 references
spectral factorization
0 references