Memory-efficient scalable line-based image coding

Author

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

Author_Institution

Hewlett-Packard Co., Palo Alto, CA, USA

fYear

1999

fDate

29-31 Mar 1999

Firstpage

218

Lastpage

227

Abstract

We study the problem of memory-efficient scalable image compression and investigate some tradeoffs in the complexity versus 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

Keywords

arithmetic codes; computational complexity; data compression; image coding; image resolution; memory architecture; transform coding; wavelet transforms; arithmetic coder; coding efficiency; line-based image coding; low-complexity algorithm; low-memory architecture; scalable bit-stream generation; scalable image coding; scan-causal modeling; sub-bit-planes; wavelet-based image compression; Arithmetic; Bandwidth; Computational complexity; Decoding; Image coding; Image resolution; Scalability; Space technology; Throughput; Wavelet transforms;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 1999. Proceedings. DCC '99

Conference_Location

Snowbird, UT

ISSN

1068-0314

Print_ISBN

0-7695-0096-X

Type

conf

DOI

10.1109/DCC.1999.755671

Filename

755671