Research the Performance of a Recursive Algorithm of the Local Discrete Wavelet Transform

Abstract

We experimentally compare the performance of two fast algorithms for computing the local discrete wavelet transform of one-dimensional signals: the Mallatalgorithm and a recursive algorithm. For the comparison purposes, we analyze Haar wavelet bases for one and two-dimensional signals, an extension of the Haar basis with the scale coefficient 3, and biorthogonal polynomial spline wavelets with finite support.