Binomial QMF

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A binomial QMF – properly an orthonormal binomial quadrature mirror filter – is an orthogonal wavelet developed in 1990.

The binomial QMF bank with perfect reconstruction (PR) was designed by Ali Akansu, et al. published in 1990, using the family of binomial polynomials for subband decomposition of discrete-time signals.[1][2][3]

Akansu and his fellow authors also showed that these binomial-QMF filters are identical to the wavelet filters designed independently by Ingrid Daubechies from compactly supported orthonormal wavelet transform perspective in 1988 (Daubechies wavelet). Later, it was shown that the magnitude square functions of low-pass and high-pass binomial-QMF filters are the unique maximally flat functions in a two-band PR-QMF design framework.[4]

References[edit]

  1. ^ A.N. Akansu, An Efficient QMF-Wavelet Structure (Binomial-QMF Daubechies Wavelets), Proc. 1st NJIT Symposium on Wavelets, April 1990
  2. ^ A.N. Akansu, R.A. Haddad and H. Caglar, Perfect Reconstruction Binomial QMF-Wavelet Transform, Proc. SPIE Visual Communications and Image Processing, pp. 609–618, Lausanne, Sept. 1990
  3. ^ A.N. Akansu, R.A. Haddad and H. Caglar, The Binomial QMF-Wavelet Transform for Multiresolution Signal Decomposition, IEEE Trans. Signal Processing, pp. 13–19, January 1993
  4. ^ H. Caglar and A.N. Akansu, A Generalized Parametric PR-QMF Design Technique Based on Bernstein Polynomial Approximation, IEEE Trans. Signal Processing, pp. 2314–2321, July 1993

External links[edit]