{'fraction_non_alphanumeric': 0.013524936601859678, 'fraction_numerical': 0.0, 'mean_word_length': 5.614525139664805, '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}}
Compression technique for compressed sensing hyperspectral images

The compressed sensing (CS) theorem is a novel sampling approach that breaks through the conventional Nyquist sampling limit and brings a revolution in the field of signal processing. This article investigates the compression technique for CS hyperspectral images so as to illustrate the superiority provided by this new theorem. First, several comparative experiments are used to reveal that the drawback of prior compression techniques, designed for the data acquired by the conventional hyperspectral imaging system, is either low compression ratio or a waste of sampling resource. After a condensed analysis, we state that the CS theorem provides the probability of avoiding such defects. Then a straightforward scheme, which takes advantage of spectral correlation, is proposed to compress the CS hyperspectral images to reduce the data size further. Moreover, a flexible recovery strategy is designed to speed up the reconstruction of original bands from the corresponding CS images. The experimental results based on the actual hyperspectral images have demonstrated the efficiency of this proposed technique.