TY - JOUR
T1 - Scanning order strategies for bitplane image coding
AU - Aulí-Llinàs, Francesc
AU - Marcellin, Michael W.
PY - 2012/4/1
Y1 - 2012/4/1
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. © 2011 IEEE.
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. © 2011 IEEE.
KW - Bitplane image coding
KW - JPEG2000
KW - probability models
KW - scanning orders
U2 - 10.1109/TIP.2011.2176953
DO - 10.1109/TIP.2011.2176953
M3 - Article
SN - 1057-7149
VL - 21
SP - 1920
EP - 1933
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 4
M1 - 6086618
ER -