TY - JOUR
T1 - Smooth Wavelet Tight Frames with Zero Moments
AU - Selesnick, Ivan W.
N1 - Funding Information:
1 Research supported by NSF under CAREER Grant CCR-987452.
Funding Information:
The author thanks Nick Kingsbury for helpful conversations about the dual-tree DWT and anonymous reviewers for valuable comments. The author also gratefully acknowledges support by the NSF under CAREER Grant CCR-987452.
PY - 2001/3
Y1 - 2001/3
N2 - This paper considers the design of wavelet tight frames based on iterated oversampled filter banks. The greater design freedom available makes possible the construction of wavelets with a high degree of smoothness, in comparison with orthonormal wavelet bases. In particular, this paper takes up the design of systems that are analogous to Daubechies orthonormal wavelets - that is, the design of minimal length wavelet filters satisfying certain polynomial properties, but now in the oversampled case. Gröbner bases are used to obtain the solutions to the nonlinear design equations. Following the dual-tree DWT of Kingsbury, one goal is to achieve near shift invariance while keeping the redundancy factor bounded by 2, instead of allowing it to grow as it does for the undecimated DWT (which is exactly shift invariant). Like the dual tree, the overcomplete DWT described in this paper is less shift-sensitive than an orthonormal wavelet basis. Like the examples of Chui and He, and Ron and Shen, the wavelets are much smoother than what is possible in the orthonormal case.
AB - This paper considers the design of wavelet tight frames based on iterated oversampled filter banks. The greater design freedom available makes possible the construction of wavelets with a high degree of smoothness, in comparison with orthonormal wavelet bases. In particular, this paper takes up the design of systems that are analogous to Daubechies orthonormal wavelets - that is, the design of minimal length wavelet filters satisfying certain polynomial properties, but now in the oversampled case. Gröbner bases are used to obtain the solutions to the nonlinear design equations. Following the dual-tree DWT of Kingsbury, one goal is to achieve near shift invariance while keeping the redundancy factor bounded by 2, instead of allowing it to grow as it does for the undecimated DWT (which is exactly shift invariant). Like the dual tree, the overcomplete DWT described in this paper is less shift-sensitive than an orthonormal wavelet basis. Like the examples of Chui and He, and Ron and Shen, the wavelets are much smoother than what is possible in the orthonormal case.
KW - Overcomplete signal expansions; wavelets; frames
UR - http://www.scopus.com/inward/record.url?scp=0035276530&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035276530&partnerID=8YFLogxK
U2 - 10.1006/acha.2000.0332
DO - 10.1006/acha.2000.0332
M3 - Editorial
AN - SCOPUS:0035276530
SN - 1063-5203
VL - 10
SP - 163
EP - 181
JO - Applied and Computational Harmonic Analysis
JF - Applied and Computational Harmonic Analysis
IS - 2
ER -