Stack-run image coding

Min-Jen Tsai*, J. D. Villasenor, F. Chen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

103 Scopus citations

Abstract

We describe a new image coding approach in which a 4-ary arithmetic coder is used to represent significant coefficient values and the lengths of zero runs between coefficients. This algorithm works by raster scanning within subbands, and therefore involves much lower addressing complexity than other algorithms such as zerotree coding that require the creation and maintenance of lists of dependencies across different decomposition levels. Despite its simplicity, and the fact that these dependencies are not explicitly utilized, the algorithm presented here is competitive with the best enhancements of zerotree coding. In addition, it performs comparably with adaptive subband splitting approaches that involve much higher implementation complexity.

Original languageEnglish
Pages (from-to)519-521
Number of pages3
JournalIEEE Transactions on Circuits and Systems for Video Technology
Volume6
Issue number5
DOIs
StatePublished - 1 Dec 1996

Fingerprint Dive into the research topics of 'Stack-run image coding'. Together they form a unique fingerprint.

Cite this