Memory-efficient scalable line-based image coding
- 1 January 1999
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 218-227
- https://doi.org/10.1109/dcc.1999.755671
Abstract
We study the problem of memory-efficient scalable image compression and investigate some tradeoffs in the complexity versus coding efficiency space. The focus is on a low-complexity algorithm centered around the use of sub-bit-planes, scan-causal modeling, and a simplified arithmetic coder. This algorithm approaches the lowest possible memory usage for scalable wavelet-based image compression and demonstrates that the generation of a scalable bit-stream is not incompatible with a low-memory architecture.Keywords
This publication has 7 references indexed in Scilit:
- Line based reduced memory, wavelet image compressionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A low-complexity modeling approach for embedded coding of wavelet coefficientsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- CREW: Compression with Reversible Embedded WaveletsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A new, fast, and efficient image codec based on set partitioning in hierarchical treesIEEE Transactions on Circuits and Systems for Video Technology, 1996
- Multirate 3-D subband coding of videoIEEE Transactions on Image Processing, 1994
- Embedded image coding using zerotrees of wavelet coefficientsIEEE Transactions on Signal Processing, 1993
- A simple general binary source code (Corresp.)IEEE Transactions on Information Theory, 1982