Paper
24 August 2010 Hyperspectral image compression using distributed arithmetic coding and bit-plane coding
Jiaji Wu, Minli Wang, Yong Fang, Jechang Jeong, Licheng Jiao
Author Affiliations +
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.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jiaji Wu, Minli Wang, Yong Fang, Jechang Jeong, and Licheng Jiao "Hyperspectral image compression using distributed arithmetic coding and bit-plane coding", Proc. SPIE 7810, Satellite Data Compression, Communications, and Processing VI, 781018 (24 August 2010); https://doi.org/10.1117/12.860546
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Image compression

Hyperspectral imaging

Signal to noise ratio

Binary data

Wavelet transforms

Image processing

Back to Top