Memory efficient scalable line-based image coding

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

Research output: Chapter in Book/Report/Conference proceedingChapter

11 Citations (Scopus)

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)
Title of host publicationData Compression Conference Proceedings
PublisherIEEE
Pages218-227
Number of pages10
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 Data Compression Conference, DCC-99 - Snowbird, UT, USA
Duration: Mar 29 1999Mar 31 1999

Other

OtherProceedings of the 1999 Data Compression Conference, DCC-99
CitySnowbird, UT, USA
Period3/29/993/31/99

Fingerprint

Image compression
Image coding
Data storage equipment
Memory architecture

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

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

Memory efficient scalable line-based image coding. / Ordentlich, Erik; Taubman, David; Weinberger, Marcelo; Seroussi, Gadiel; Marcellin, Michael W.

Data Compression Conference Proceedings. IEEE, 1999. p. 218-227.

Research output: Chapter in Book/Report/Conference proceedingChapter

Ordentlich, E, Taubman, D, Weinberger, M, Seroussi, G & Marcellin, MW 1999, Memory efficient scalable line-based image coding. in Data Compression Conference Proceedings. IEEE, pp. 218-227, Proceedings of the 1999 Data Compression Conference, DCC-99, Snowbird, UT, USA, 3/29/99.
Ordentlich E, Taubman D, Weinberger M, Seroussi G, Marcellin MW. Memory efficient scalable line-based image coding. In Data Compression Conference Proceedings. IEEE. 1999. p. 218-227
Ordentlich, Erik ; Taubman, David ; Weinberger, Marcelo ; Seroussi, Gadiel ; Marcellin, Michael W. / Memory efficient scalable line-based image coding. Data Compression Conference Proceedings. IEEE, 1999. pp. 218-227
@inbook{8c55b84c9f694187ac3a5b244f95bffb,
title = "Memory efficient scalable line-based image coding",
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.",
author = "Erik Ordentlich and David Taubman and Marcelo Weinberger and Gadiel Seroussi and Marcellin, {Michael W}",
year = "1999",
language = "English (US)",
pages = "218--227",
booktitle = "Data Compression Conference Proceedings",
publisher = "IEEE",

}

TY - CHAP

T1 - Memory efficient scalable line-based image coding

AU - Ordentlich, Erik

AU - Taubman, David

AU - Weinberger, Marcelo

AU - Seroussi, Gadiel

AU - Marcellin, Michael W

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032630517&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032630517&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0032630517

SP - 218

EP - 227

BT - Data Compression Conference Proceedings

PB - IEEE

ER -