TY - JOUR
T1 - An analysis of some common scanning techniques for lossless image coding
AU - Memon, Nasir
AU - Neuhoff, David L.
AU - Shende, Sunil
N1 - Funding Information:
Manuscript received March 18, 1999; revised March 9, 2000. This work was supported by the NSF under Grants NCR-9996145 and NCR-9415754. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Touradj Ebrahimi. N. Memon is with the Department of Computer Science, Polytechnic University, Brooklyn, NY 11201 USA (e-mail: memon@poly.edu). D. L. Neuhoff is with the Department of Computer Engineering, University of Michigan, Ann Arbor, MI 48109 USA S. Shende is with the Department of Computer Science, Rutgers University, Camden, NJ 08102 USA. Publisher Item Identifier S 1057-7149(00)09394-5.
PY - 2000
Y1 - 2000
N2 - Though most image coding techniques use a raster scan to order pixels prior to coding, Hilbert and other scans have been proposed as having better performance due to their superior locality preserving properties. However, a general understanding of the merits of various scans has been lacking. This paper develops an approach for quantitatively analyzing the effect of pixel scan order for context-based, predictive lossless image compression and uses it to compare raster, Hilbert, random and hierarchical scans. Specifically, for a quantized-Gaussian image model and a given scan order, it shows how the encoding rate can be estimated from the frequencies with which various pixel configurations are available as previously scanned contexts, and from the corresponding conditional differential entropies. Formulas are derived for such context frequencies and entropies. Assuming an isotropic image model and contexts consisting of previously scanned adjacent pixels, it is found that the raster scan is better than the Hilbert scan which is often used in compression applications due to its locality preserving properties. The hierarchical scan is better still, though it is based on nonadjacent contexts. The random scan is the worst of the four considered. Extensions and implications of the results to lossy coding are also discussed.
AB - Though most image coding techniques use a raster scan to order pixels prior to coding, Hilbert and other scans have been proposed as having better performance due to their superior locality preserving properties. However, a general understanding of the merits of various scans has been lacking. This paper develops an approach for quantitatively analyzing the effect of pixel scan order for context-based, predictive lossless image compression and uses it to compare raster, Hilbert, random and hierarchical scans. Specifically, for a quantized-Gaussian image model and a given scan order, it shows how the encoding rate can be estimated from the frequencies with which various pixel configurations are available as previously scanned contexts, and from the corresponding conditional differential entropies. Formulas are derived for such context frequencies and entropies. Assuming an isotropic image model and contexts consisting of previously scanned adjacent pixels, it is found that the raster scan is better than the Hilbert scan which is often used in compression applications due to its locality preserving properties. The hierarchical scan is better still, though it is based on nonadjacent contexts. The random scan is the worst of the four considered. Extensions and implications of the results to lossy coding are also discussed.
UR - http://www.scopus.com/inward/record.url?scp=0034315911&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034315911&partnerID=8YFLogxK
U2 - 10.1109/83.877207
DO - 10.1109/83.877207
M3 - Article
C2 - 18262921
AN - SCOPUS:0034315911
SN - 1057-7149
VL - 9
SP - 1837
EP - 1848
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 11
ER -