Share Email Print
cover

Proceedings Paper

Low-complexity hyperspectral image compression algorithm based on bit plan transform
Author(s): HengShu Liu; Liping Zhang; LianQing Huang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 25 September 2003
PDF: 6 pages
Proc. SPIE 5286, Third International Symposium on Multispectral Image Processing and Pattern Recognition, (25 September 2003); doi: 10.1117/12.538775
Show Author Affiliations
HengShu Liu, Changchun Institute of Optics, Fine Mechanics, and Physics, CAS (China)
Liping Zhang, Changchun Institute of Optics, Fine Mechanics, and Physics, CAS (China)
LianQing Huang, Changchun Institute of Optics, Fine Mechanics, and Physics, CAS (China)


Published in SPIE Proceedings Vol. 5286:
Third International Symposium on Multispectral Image Processing and Pattern Recognition
Hanqing Lu; Tianxu Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top