This Article 
 Bibliographic References 
 Add to: 
Band Ordering in Lossless Compression of Multispectral Images
April 1997 (vol. 46 no. 4)
pp. 477-483

Abstract—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.

We present an efficient algorithm for computing the optimal band ordering for a multispectral image. This algorithm has time complexity O(n2) for an n-band image, while the naive algorithm takes time Ω(n!). 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.

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.

[1] B.R. Epstein, R. Hingorani, J.M. Shapiro, and M. Czigler, "Multispectral KLT-Wavelet Data Compression for Landsat Thematic Mapper Images," Proc. Data Compression Conf., pp. 200-208, 1992.
[2] S. Gupta and A. Gersho, "Feature Predictive Vector Quantization of Multispectral Images," IEEE Trans. Geoscience and Remote Sensing, vol. 30, no. 3, May 1992.
[3] T. Markas and J. Reif, "Multispectral Image Compression Algorithms," Proc. Data Compression Conf., pp. 391-400, 1993.
[4] R.E. Roger and M.C. Cavenor, "Lossless Compression of Imaging Spectometer Data," technical report, Dept. of Electrical Eng., Australian Defence Force Academy, Canberra AACT 2600, Australia, 1993, This report may be obtained by anonymous FTP from in directory /pub/reports/remsen.
[5] R.E. Roger and J.F. Arnold, "Reversible Image Compression Bounded by Noise," IEEE Trans. Geoscience and Remote Sensing, vol. 32, no. 1, pp. 19-24, Jan. 1994.
[6] G.K. Wallace, "The JPEG Still Compression Standard," Comm. ACM, vol. 34, no. 4, pp. 30-44, Apr. 1991.
[7] R.E. Tarjan, "Finding Optimum Branchings," Networks, vol. 7, pp. 25-35, 1977.
[8] P.M. Camerini, L. Fratta, and F. Maffioli, "A Note on Finding Optimum Branchings," Networks, vol. 9, pp. 309-312, 1979.
[9] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[10] H.N. Gabow, "An Efficient Implementation of Edmond's Algorithm for Maximum Matching on Graphs," J. ACM, vol. 23, no. 2, pp. 221-234, 1976.
[11] H.N. Gabow and R. E. Tarjan, "Faster Scaling Algorithms for General Graph-Matching Problems," J. ACM, vol. 38, no. 4, pp. 815-853, 1991.
[12] P.G. Howard and J.S. Vitter, "New Methods for Lossless Image Compression Using Arithmetic Coding," Information Processing and Management, vol. 26, no. 6, pp. 765-779, Nov. 1992.
[13] J. Makhoul, "Linear Prediction: A Tutorial Review," Proc. IEEE, vol. 63, no. 4, pp. 561-580, Apr. 1975.
[14] T.C. Bell, J.G. Cleary, and I.H. Witten, Text Compression.Englewood Cliffs, N.J.: Prentice Hall, 1990.
[15] R.F. Rice, "Some Practical Universal Noiseless Coding Techniques," Technical Report Publication 79-22, Jet Propulsion Laboratory, Mar. 1979.
[16] R.G. Gallager and D.C. Van Voorhis, "Optimal Source Codes for Geometrically Distributed Integer Alphabets," IEEE Trans. Information Theory, vol. 21, pp. 228-230, Mar. 1975.
[17] S. Todd, G. Langdon, and J. Rissanen, "Parameter Reduction and Context Selection for Compression of Gray-Scale Images," IBM J. Research and Development, vol. 29, no. 2, pp. 188-193, Mar. 1985.

Index Terms:
Compression, lossless compression, image compression, multispectral images, satellite data, NP-completeness.
Stephen R. Tate, "Band Ordering in Lossless Compression of Multispectral Images," IEEE Transactions on Computers, vol. 46, no. 4, pp. 477-483, April 1997, doi:10.1109/12.588062
Usage of this product signifies your acceptance of the Terms of Use.