The Binomial Qmf-Wavelet Transform for Multiresolution Signal Decomposition

Authors

Ali N. Akansu, Newark College of Engineering
Richard A. Haddad, NYU Tandon School of Engineering
Hakan Caglar, New Jersey Institute of Technology

Document Type

Article

Publication Date

1-1-1993

Abstract

This paper describes a class of orthogonal binomial filters that provide a set of basis functions for a bank of perfect reconstruction (PR) finite impulse response quadrature mirror filters (FIR QMF). These binomial QMF’s are shown to be the same filters as those derived from a discrete orthonormal wavelet transform approach by Daubechies. These filters are the unique maximally flat magnitude square PR QMF's. It is shown that the binomial QMF outperforms the discrete cosine transform objectively for AR(1) sources and test images considered. © 1993 IEEE

Identifier

0027274183 (Scopus)

Publication Title

IEEE Transactions on Signal Processing

External Full Text Location

https://doi.org/10.1109/TSP.1993.193123

e-ISSN

19410476

ISSN

1053587X

First Page

13

Last Page

19

Issue

1

Volume

41

Recommended Citation

Akansu, Ali N.; Haddad, Richard A.; and Caglar, Hakan, "The Binomial Qmf-Wavelet Transform for Multiresolution Signal Decomposition" (1993). Faculty Publications. 17197.
https://digitalcommons.njit.edu/fac_pubs/17197