Multispectral loss-less compression using approximation methods

The large size of multispectral data files is currently a major issue in multispectral imaging. The transmission of multispectral data over networks, as well as the storage of large archives, are strongly limited, so that a clear need for good compression methods arises. In this paper, we explore the possibility of loss-less compression for multispectral data through a number of approximation methods that operate on the spectral domain. To evaluate the performance of these methods, we apply them to a representative spectra database, and consider the corresponding decrease in information entropy as well as the classical file size ratio.

[1]  Tassos Markas,et al.  Multispectral image compression algorithms , 1993, [Proceedings] DCC `93: Data Compression Conference.

[2]  Carl de Boor,et al.  A Practical Guide to Splines , 1978, Applied Mathematical Sciences.

[3]  Giovanni Poggi,et al.  Compression of multispectral images by three-dimensional SPIHT algorithm , 2000, IEEE Trans. Geosci. Remote. Sens..

[4]  Giovanni Poggi,et al.  Compression of multispectral images by address-predictive vector quantization , 1997, Signal Process. Image Commun..

[5]  C. R. Deboor,et al.  A practical guide to splines , 1978 .

[6]  R. E. Carlson,et al.  Monotone Piecewise Cubic Interpolation , 1980 .

[7]  Michel Barlaud,et al.  Multispectral image coding using lattice VQ and the wavelet transform , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[8]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

[9]  Giacinto Gelli,et al.  Compression of multispectral images by spectral classification and transform coding , 1999, IEEE Trans. Image Process..

[10]  Hans Brettel,et al.  Multispectral image capture using a tunable filter , 1999, Electronic Imaging.