Compression and classification methods for hyperspectral images
Arto Kaarna, Pekka Toivanen, Pekka Keränen · Pattern Recognition and Image Analysis · 2006
In this article we present new lossless compression methods by combining existing methods and compare them using AVIRIS images. These methods include the Self-Organizing Map (SOM), Principal Component Analysis (PCA), and the three-dimensional Wavelet Transform combined with traditional lossless encoding methods. The two-dimensional JPEG2000 and SPIHT compression methods were applied to the eigenimages produced by the PCA. The bit allocation for the compression of eigenimages was based on the amount of information in each eigenimage. In bit rate calculation we used the exponential entropy formula, which gave better results than the original linear version. The information loss from the compression was measured by the Signal-to-Noise Ratio (SNR) and Peak-Signal-to-Noise Ratio (PSNR). To get more illustrative and practical error measures, classification of spectra was performed using unsupervised K-means clustering combined with spectral matching. Spectral matching methods include Euclidean distance, Spectral Similarity Value (SSV), and Spectral Angle Mapper (SAM). We used two test images, which both were AVIRIS images with 224 bands and 512 lines in 614 columns. The PCA in the spectral dimension combined with JPEG2000 or SPIHT in the spatial dimension was the best method in terms of the image quality and compression speed.