A new hyperspectral image compression algorithm based on bit plane transform is proposed. The main idea of the bit plane transform is to decompose the hyperspectral image into a series of bi-level images which can be compressed more efficient. The gray code and band sequence optimization techniques are adopted to improve the compression performance in the preprocess stage. The main advantages of the algorithm are low complexity and easy realization.
A new hyperspectral image compression algorithm-NMST (Near Min Spanning Tree) is proposed. The near minimum spanning tree is constructed according to the image structure and is taken as a prediction tree in image compression. The result shows the NMST algorithm can improve the compression speed with little decrease of compression ratio.