2010

Algorithm for Lossless Compression of Calibrated Hyperspectral Imagery

NASA’s Jet Propulsion Laboratory, Pasadena, California

A two-stage predictive method was developed for lossless compression of calibrated hyperspectral imagery. The first prediction stage uses a conventional linear predictor intended to exploit spatial and/or spectral dependencies in the data. The compressor tabulates counts of the past values of the difference between this initial prediction and the actual sample value. To form the ultimate predicted value, in the second stage, these counts are combined with an adaptively updated weight function intended to capture information about data regularities introduced by the calibration process. Finally, prediction residuals are losslessly encoded using adaptive arithmetic coding.

Algorithms of this type are commonly tested on a readily available collection of images from the Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) hyperspectral imager. On the standard calibrated AVIRIS hyperspectral images that are most widely used for compression benchmarking, the new compressor provides more than 0.5 bits/sample improvement over the previous best compression results.

The algorithm has been implemented in Mathematica. The compression algorithm was demonstrated as beneficial on 12-bit calibrated AVIRIS images.

This work was done by Aaron B. Kiely and Matthew A. Klimesh of Caltech for NASA’s Jet Propulsion Laboratory. For more information, contact This email address is being protected from spambots. You need JavaScript enabled to view it.. NPO-46547

White Papers

Smoothing the Transition from Design to Manufacture: Best Practices
Sponsored by Sparton
The Benefits of Integrated Video Management
Sponsored by Curtiss Wright
Force Sensors for Design
Sponsored by Tekscan
Uncooled Infrared Imaging: Higher Performance, Lower Costs
Sponsored by Sofradir EC
Telematics: An Industry Game-Changer
Sponsored by SAP
3D Printing in Space: The Next Frontier
Sponsored by Stratasys

White Papers Sponsored By: