25 September 2003 Low-complexity hyperspectral image compression algorithm based on bit plan transform
Author Affiliations +
Proceedings Volume 5286, Third International Symposium on Multispectral Image Processing and Pattern Recognition; (2003) https://doi.org/10.1117/12.538775
Event: Third International Symposium on Multispectral Image Processing and Pattern Recognition, 2003, Beijing, China
Abstract
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.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
HengShu Liu, Liping Zhang, LianQing Huang, "Low-complexity hyperspectral image compression algorithm based on bit plan transform", Proc. SPIE 5286, Third International Symposium on Multispectral Image Processing and Pattern Recognition, (25 September 2003); doi: 10.1117/12.538775; https://doi.org/10.1117/12.538775
PROCEEDINGS
6 PAGES


SHARE
Back to Top