Efficient 1D and 2D Daubechies Wavelet Transforms with Application to Signal Processing

Authors:
Piotr Lipinski;Mykhaylo Yatsymirskyy
Affiliations:
Division of Computer Networks, Technical University of Lodz, Stefanowskiego 18/22, Lodz, Poland;Department of Computer Science, Technical University of Lodz., Wolczanska 215, Lodz, Poland
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Year:
2007

Citing 7
Cited 1

Ten lectures on wavelets

Ten lectures on wavelets
Image Processing with Complex Daubechies Wavelets

Journal of Mathematical Imaging and Vision
The lifting scheme: a construction of second generation wavelets

SIAM Journal on Mathematical Analysis
An efficient architecture for lifting-based two-dimensional discrete wavelet transforms

Integration, the VLSI Journal - Special issue: ACM great lakes symposium on VLSI
Design and multiplier-less implementation of a class of two-channel PR FIR filterbanks and wavelets with low system delay

IEEE Transactions on Signal Processing
Efficient realizations of the discrete and continuous wavelettransforms: from single chip implementations to mappings on SIMD arraycomputers

IEEE Transactions on Signal Processing
Multiplierless PR quadrature mirror filters for subband image coding

IEEE Transactions on Image Processing

New approach to orthogonal multiplierless wavelet family synthesis

WAV'08 Proceedings of the 2nd WSEAS International Conference on Wavelets Theory and Applications in Applied Mathematics, Signal Processing and Modern Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we have introduced new, efficient algorithms for computing one- and two-dimensional Daubechies wavelet transforms of any order, with application to signal processing. These algorithms has been constructed by transforming Daubechies wavelet filters into weighted sum of trivial filters. The theoretical computational complexity of the algorithms has been evaluated and compared to pyramidal and ladder ones. In order to prove the correctness of the theoretical estimation of computational complexity of the algorithms, sample implementations has been supplied. We have proved that the algorithms introduced here are the most robust of all class of Daubechies transforms in terms of computational complexity, especially in two dimensional case.