New Algorithm For Calculating Wavelet Transforms
In this article we introduce a new algorithm for computing Discrete Wavelet Transforms (DWT). The algorithm aims at reducing the number of multiplications, required to compute a DWT. The algorithm is general and can be used to compute a variety of wavelet transform (Daubechies and CDF). Here we focu...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
International Institute of Informatics and Cybernetics
2009-04-01
|
| Series: | Journal of Systemics, Cybernetics and Informatics |
| Subjects: | |
| Online Access: | http://www.iiisci.org/Journal/CV$/sci/pdfs/ZS372XE.pdf
|
| Summary: | In this article we introduce a new algorithm for computing Discrete Wavelet Transforms (DWT). The algorithm aims at reducing the number of multiplications, required to compute a DWT. The algorithm is general and can be used to compute a variety of wavelet transform (Daubechies and CDF). Here we focus on CDF 9/7 filters, which are used in JPEG2000 compression standard. We show that the algorithm outperforms convolution-based and lifting-based algorithms in terms of number of multiplications. |
|---|---|
| ISSN: | 1690-4524 |