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

  • Wu, Jiaji
  • Wang, Minli
  • Fang, Yong
  • Jeong, Jechang
  • Jiao, Licheng
Citations

SCOPUS

2

초록

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.

키워드

Arithmetic codingDistributed arithmetic codingDistributed source codingHyperspectral imageryLDPC codesLossless adaptive-distributed arithmetic codingSlepian-wolf codingArithmetic CodingDistributed arithmeticDistributed source codingHyperspectral imageryLDPC codesLosslessSlepian-Wolf codingData compressionData processingError correctionFilter banksImage compressionIndependent component analysisRemote sensingThree dimensionalWavelet transformsImage coding
제목
Hyperspectral image compression using distributed arithmetic coding and bit-plane coding
저자
Wu, JiajiWang, MinliFang, YongJeong, JechangJiao, Licheng
DOI
10.1117/12.860546
발행일
2010-08
유형
Conference Paper
저널명
Proceedings of SPIE - The International Society for Optical Engineering
7810
페이지
1 ~ 8