{'fraction_non_alphanumeric': 0.02155688622754491, 'fraction_numerical': 0.004790419161676647, 'mean_word_length': 5.634920634920635, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Lossless Compression of Hyperspectral Images Using Clustered Linear Prediction With Adaptive Prediction Length

This letter explores the use of adaptive prediction length in clustered differential pulse code modulation (C-DPCM) lossless compression method for hyperspectral images. In the C-DPCM method, linear prediction is performed using coefficients optimized for each spectral cluster separately. The difference between the predicted and original values is entropy coded using an adaptive range coder for each cluster. The results show that the C-DPCM-with-adaptive-prediction-length method has lower bit-per-pixel value than the original C-DPCM method for Consultative Committee for Space Data Systems 2006 AVIRIS test images. Both calibrated and uncalibrated image compression results are improved by adaptive prediction length.