The Hyper-spectral Image Compression Based on K-Means Clustering and Parallel Prediction Algorithm*

• Main Authors: Wenbin Wu, Wu Yue, Li Jintao
• Format: Article
• Language: English
• Published: EDP Sciences 2018-01-01
• Series: MATEC Web of Conferences
• Online Access: https://doi.org/10.1051/matecconf/201817303071

In this paper, we propose a lossless compression algorithm for hyper-spectral images with the help of the K-Means clustering and parallel prediction. We use K-Means clustering algorithm to classify hyper-spectral images, and we obtain a number of two dimensional sub images. We use the adaptive prediction compression algorithm based on the absolute ratio to compress the two dimensional sub images. The traditional prediction algorithm is adopted in the serial processing mode, and the processing time is long. So we improve the efficiency of the parallel prediction compression algorithm, to meet the needs of the rapid compression. In this paper, a variety of hyper-spectral image compression algorithms are compared with the proposed method. The experimental results show that the proposed algorithm can effectively improve the compression ratio of hyper-spectral images and reduce the compression time effectively.