Translator Disclaimer
4 December 2000 Minimum memory implementations of the lifting scheme
Author Affiliations +
All publications on the lifting scheme up to now consider non-casual systems, where the assumption is that the whole input signal is buffered. This is problematic if we want to use lifting gin a low memory scenario. In this paper we present an analysis for making a lifting implementation of a filter bank causal, while at the same time reducing the amount of delay needed for the whole system. The amount of memory needed for the lifting implementation of any filter bank can br shown to be always smaller than the corresponding convolution implementation. The amount of memory saving sis filter bank dependent, it ranges form no savings for the Haar transform to 40 percent for a 2-10 filter bank. The amount of savings depends on the number of lifting steps as well as the length of the lifting steps used. We will also elaborate on the use of boundary extensions on each lifting step instead of the whole signal. This leads to lower memory requirements as well as simpler implementations.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Christos G. Chrysafis and Antonio Ortega "Minimum memory implementations of the lifting scheme", Proc. SPIE 4119, Wavelet Applications in Signal and Image Processing VIII, (4 December 2000);


Some contributions to wavelet-based image coding
Proceedings of SPIE (June 28 2000)
Adaptive boxcar/wavelet transform
Proceedings of SPIE (January 19 2009)
Discrete wavelet transform ASIC for image compressor
Proceedings of SPIE (November 21 2002)

Back to Top