Memory efficient scalable line-based image coding

Erik Ordentlich, David Taubman, Marcelo Weinberger, Gadiel Seroussi, Michael Marcellin

Research output: Chapter in Book/Report/Conference proceedingChapter


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 languageEnglish (US)
Title of host publicationHP Laboratories Technical Report
PublisherHwelett Packard Lab
Number of pages12
StatePublished - Jan 1 1999
Externally publishedYes


ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Ordentlich, E., Taubman, D., Weinberger, M., Seroussi, G., & Marcellin, M. (1999). Memory efficient scalable line-based image coding. In HP Laboratories Technical Report (HPL-1999-1 ed., pp. 1-12). Hwelett Packard Lab.