Listless Block Cube Tree Coding for Low Resource Hyperspectral Image Compression Sensors

Hyperspectral (HS) image has rich spectral information content, which facilitates multiple applications including remote sensing. Due to the big data size of the HS image, compression is a required process for the efficiency of image storage and transmission. However, the complexity of the compression algorithms turns real-time compression into a very challenging task. A novel listless set partitioned hyperspectral image compression algorithm is proposed. The proposed compression algorithm uses zero block cube tree structure to exploit the inter and intra sub-band correlation to achieve the compression. From the result, it has been clear that the proposed compression algorithm has low coding complexity with at-par coding efficiency. Thus, it can be a suitable contender for low-resource hyperspectral image sensors.