Scanning order strategies for bitplane image coding

Francesc Aulí-Llinàs, Michael W Marcellin

Research output: Contribution to journalArticle

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

Original languageEnglish (US)
Article number6086618
Pages (from-to)1920-1933
Number of pages14
JournalIEEE Transactions on Image Processing
Volume21
Issue number4
DOIs
StatePublished - Apr 2012

Fingerprint

Image coding
Scanning
Engines

Keywords

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

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Medicine(all)

Cite this

Scanning order strategies for bitplane image coding. / Aulí-Llinàs, Francesc; Marcellin, Michael W.

In: IEEE Transactions on Image Processing, Vol. 21, No. 4, 6086618, 04.2012, p. 1920-1933.

Research output: Contribution to journalArticle

@article{6fcf9d9263dc4d6688be218312044203,
title = "Scanning order strategies for bitplane image coding",
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.",
keywords = "Bitplane image coding, JPEG2000, probability models, scanning orders",
author = "Francesc Aul{\'i}-Llin{\`a}s and Marcellin, {Michael W}",
year = "2012",
month = "4",
doi = "10.1109/TIP.2011.2176953",
language = "English (US)",
volume = "21",
pages = "1920--1933",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Scanning order strategies for bitplane image coding

AU - Aulí-Llinàs, Francesc

AU - Marcellin, Michael W

PY - 2012/4

Y1 - 2012/4

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

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

KW - Bitplane image coding

KW - JPEG2000

KW - probability models

KW - scanning orders

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

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

U2 - 10.1109/TIP.2011.2176953

DO - 10.1109/TIP.2011.2176953

M3 - Article

C2 - 22128007

AN - SCOPUS:84859023852

VL - 21

SP - 1920

EP - 1933

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 4

M1 - 6086618

ER -