Abstract
The discrete wavelet transform (DWT) has gained a wide acceptance in denoising and compression coding of images and signals.
In this work we introduce a discrete lattice wavelet transform (DLWT). In the analysis part, the lattice structure contains two parallel transmission channels, which exchange information via two crossed lattice filters. For the synthesis part we show that the similar lattice structure yields a perfect reconstruction (PR) property.
The PR condition can be used to design half-band filters, which effectively eliminate aliasing in decimated tree structured wavelet transform.
The DLWT can be implemented directly to any of the existing DWT algorithms
In this work we introduce a discrete lattice wavelet transform (DLWT). In the analysis part, the lattice structure contains two parallel transmission channels, which exchange information via two crossed lattice filters. For the synthesis part we show that the similar lattice structure yields a perfect reconstruction (PR) property.
The PR condition can be used to design half-band filters, which effectively eliminate aliasing in decimated tree structured wavelet transform.
The DLWT can be implemented directly to any of the existing DWT algorithms
| Original language | English |
|---|---|
| Pages (from-to) | 71-75 |
| Journal | IEEE Transactions on Circuits and Systems II: Express Briefs |
| Volume | 54 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2007 |
| MoE publication type | A1 Journal article-refereed |
Keywords
- FIR filters
- data compression
- discrete wavelet transforms
- filtering theory
- image coding
- lattice filters
- QMF
- finite-impulse response filters
- image denoising
- lattice structure
- parallel transmission channels
- perfect reconstruction property
- quadrature mirror filters
- signal denoising