MathematicsComputer Science
I. Daubechies, W. Sweldens
tlooto Summary
It is shown how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which are also known as ladder structures, and the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two.
Abstract
Abstract is not available.
Citation format
DAUBECHIES, I.; SWELDENS, W. Factoring wavelet transforms into lifting steps. JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 1998, 4: 247–269.