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) |
---|---|
Title of host publication | HP Laboratories Technical Report |
Publisher | Hwelett Packard Lab |
Pages | 1-12 |
Number of pages | 12 |
Edition | HPL-1999-1 |
State | Published - Jan 1999 |
Externally published | Yes |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications