Memory constrained wavelet based image coding
- 1 September 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 5 (9) , 221-223
- https://doi.org/10.1109/97.712104
Abstract
We present a method for ordering the wavelet coefficient information in a compressed bitstream that allows an image to be sequentially decoded, with lower memory requirements than conventional wavelet decompression schemes. We also introduce a hybrid filtering scheme that uses different horizontal and vertical filters, each with different depths of wavelet decomposition. This reduces decoder memory requirements by reducing the instantaneous number of wavelet coefficients needed for inverse filtering.Keywords
This publication has 6 references indexed in Scilit:
- Quadtree-guided wavelet image codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Line based reduced memory, wavelet image compressionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Image compression for memory constrained printersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Memory constrained wavelet based image codingIEEE Signal Processing Letters, 1998
- A new, fast, and efficient image codec based on set partitioning in hierarchical treesIEEE Transactions on Circuits and Systems for Video Technology, 1996
- Embedded image coding using zerotrees of wavelet coefficientsIEEE Transactions on Signal Processing, 1993