Lossless Compression of Hyperspectral Imagery Via Lookup Tables and Classified Linear Spectral Prediction

This paper presents a novel algorithm suitable for the lossless compression of hyperspectral imagery. The algorithm generalizes two previous algorithms, in which the concept nearest neighbor (NN) prediction implemented through lookup tables (LUTs) was introduced. Here, the set of LUTs, two or more, say M, on each band are allowed to span more than one previous band, say N bands, and the decision among one of the NM possible prediction values is based on the closeness of the value contained in the LUT to an advanced prediction, spanning N previous bands as well, provided by a top-performing scheme recently developed by the authors and featuring a classified spectral prediction. Experimental results carried out on the AVIRIS ´97 dataset show improvements up to 15% over the baseline LUT-NN algorithm. However, preliminary results carried out on raw data show that all LUT-based methods are not suitable for on-board compression, since they take advantage uniquely of the sparseness of data histograms, which is originated by the on-ground calibration procedure.