Memory efficient scalable line-based image coding

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

Research output: Contribution to journalConference article

12 Scopus citations

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 languageEnglish (US)
Pages (from-to)218-227
Number of pages10
JournalData Compression Conference Proceedings
StatePublished - Jan 1 1999
Externally publishedYes
EventProceedings of the 1999 Data Compression Conference, DCC-99 - Snowbird, UT, USA
Duration: Mar 29 1999Mar 31 1999

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Memory efficient scalable line-based image coding'. Together they form a unique fingerprint.

  • Cite this

    Ordentlich, E., Taubman, D., Weinberger, M., Seroussi, G., & Marcellin, M. W. (1999). Memory efficient scalable line-based image coding. Data Compression Conference Proceedings, 218-227.