Issue No. 04 - April (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.588062
<p><b>Abstract</b>—In this paper, we consider a model of lossless image compression in which each band of a multispectral image is coded using a prediction function involving values from a previously coded band of the compression, and examine how the ordering of the bands affects the achievable compression.</p><p>We present an efficient algorithm for computing the optimal band ordering for a multispectral image. This algorithm has time complexity <it>O</it>(<it>n</it><super>2</super>) for an <it>n</it>-band image, while the naive algorithm takes time Ω(<it>n</it>!). A slight variant of the optimal ordering problem that is motivated by some practical concerns is shown to be NP-hard, and hence, computationally infeasible, in all cases except for the most trivial possibility.</p><p>In addition, we report on our experimental findings using the algorithms designed in this paper applied to real multispectral satellite data. The results show that the techniques described here hold great promise for application to real-world compression needs.</p>
Compression, lossless compression, image compression, multispectral images, satellite data, NP-completeness.
S. R. Tate, "Band Ordering in Lossless Compression of Multispectral Images," in IEEE Transactions on Computers, vol. 46, no. , pp. 477-483, 1997.