Hyperspectral images exhibit significant spectral correlation, whose exploitation is crucial for compression. In this paper, we investigate the problem of predicting a given band of a hyperspectral image using more than one previous band. We present an information-theoretic analysis based on the concept of conditional entropy, which is used to assess the available amount of correlation and the potential compression gain. Then, we propose a new lossless compression algorithm that employs a Kalman filter in the prediction stage. Simulation results are presented on Airborne Visible Infrared Imaging Spectrometer, Hyperspectral Digital Imagery Collection Experiment, and Hyperspectral Mapper scenes, showing competitive performance with other state-of-the-art compression algorithms.
Raffaele PizzolanteBruno Carpentieri
Bruno AiazziStefano BarontiLuciano Alparone
Agnieszka MiguelJenny LiuDane K. BarneyRichard E. LadnerE.A. Riskin