TY - JOUR
T1 - Scanning order strategies for bitplane image coding
AU - Aulí-Llinàs, Francesc
AU - Marcellin, Michael W.
N1 - Funding Information:
Manuscript received April 13, 2011; revised September 07, 2011; accepted November 06, 2011. Date of publication November 22, 2011; date of current version March 21, 2012. This work was supported in part by the European Union, the Spanish Government (MICINN), FEDER, and the Catalan Government under Grants RYC-2010-05671, FP7-PEOPLE-2009-IIF-250420, TIN2009-14426-C02-01, and 2009-SGR-1224. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Xiaolin Wu.
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
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 -