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.
|Journal||IEEE Transactions on Image Processing|
|Publication status||Published - 1 Apr 2012|
- Bitplane image coding
- probability models
- scanning orders
Aulí-Llinàs, F., & Marcellin, M. W. (2012). Scanning order strategies for bitplane image coding. IEEE Transactions on Image Processing, 21(4), 1920-1933. . https://doi.org/10.1109/TIP.2011.2176953