Fast algorithm for over-complete wavelets
Ngai-Fong Law, Wan-Chi Siu · Electronics Letters · 2001
The computational complexity of the over-complete wavelet representation is studied. It is found that the inverse transform is nearly three times more costly in computation than the forward transform. By exploiting the redundancy between the lowpass and the bandpass outputs, the computation is greatly simplified, resulting in an efficient inverse.