Scanning order strategies for bitplane image coding

Francesc Aulí-Llinàs, Michael W. Marcellin

Research output: Contribution to journalArticleResearchpeer-review

29 Citations (Scopus)

Abstract

Scanning orders of bitplane image coding engines are commonly envisaged from theoretical or experimental insights and assessed in practice in terms of coding performance. This paper evaluates classic scanning strategies of modern bitplane image codecs using several theoretical-practical mechanisms conceived from rate-distortion theory. The use of these mechanisms allows distinguishing those features of the bitplane coder that are essential from those that are not. This discernment can aid the design of new bitplane coding engines with some special purposes and/or requirements. To emphasize this point, a low-complexity scanning strategy is proposed. Experimental evidence illustrates, assesses, and validates the proposed mechanisms and scanning orders. © 2011 IEEE.
Original languageEnglish
Article number6086618
Pages (from-to)1920-1933
JournalIEEE Transactions on Image Processing
Volume21
Issue number4
DOIs
Publication statusPublished - 1 Apr 2012

Keywords

  • Bitplane image coding
  • JPEG2000
  • probability models
  • scanning orders

Fingerprint Dive into the research topics of 'Scanning order strategies for bitplane image coding'. Together they form a unique fingerprint.

  • Cite this

    Aulí-Llinàs, F., & Marcellin, M. W. (2012). Scanning order strategies for bitplane image coding. IEEE Transactions on Image Processing, 21(4), 1920-1933. [6086618]. https://doi.org/10.1109/TIP.2011.2176953