Abstract
We study the problem of memory-efficient scalable image compression and investigate some tradeoffs in the complexity vs. 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.
Original language | English (US) |
---|---|
Pages (from-to) | 218-227 |
Number of pages | 10 |
Journal | Data Compression Conference Proceedings |
DOIs | |
State | Published - 1999 |
Externally published | Yes |
Event | Proceedings of the 1999 Data Compression Conference, DCC-99 - Snowbird, UT, USA Duration: Mar 29 1999 → Mar 31 1999 |
ASJC Scopus subject areas
- Computer Networks and Communications