Hyperspectral image compression using distributed arithmetic coding and bit-plane coding

Abstract

Hyperspectral images are of very large data size and highly correlated in neighboring bands, therefore, it is necessary to realize the efficient compression performance on the condition of low encoding complexity. In this paper, we propose a method based on both partitioning embedded block and lossless adaptive-distributed arithmetic coding (LADAC). Combined with three-dimensional wavelet transform and SW-SPECK algorithm, LADAC is adopted according to the correlation between the adjacent bit-plane. Experimental results show that our proposed algorithm outperforms 3D-SPECK, furthermore, our method need not take the inter-band prediction or transform into account, so the complexity is small relatively.