Share Email Print
cover

Proceedings Paper

Hyperspectral image data compression based on DSP
Author(s): Jiming Fan; Jiankang Zhou; Xinhua Chen; Weimin Shen
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

The huge data volume of hyperspectral image challenges its transportation and store. It is necessary to find an effective method to compress the hyperspectral image. Through analysis and comparison of current various algorithms, a mixed compression algorithm based on prediction, integer wavelet transform and embedded zero-tree wavelet (EZW) is proposed in this paper. We adopt a high-powered Digital Signal Processor (DSP) of TMS320DM642 to realize the proposed algorithm. Through modifying the mixed algorithm and optimizing its algorithmic language, the processing efficiency of the program was significantly improved, compared the non-optimized one. Our experiment show that the mixed algorithm based on DSP runs much faster than the algorithm on personal computer. The proposed method can achieve the nearly real-time compression with excellent image quality and compression performance.

Paper Details

Date Published: 9 November 2010
PDF: 10 pages
Proc. SPIE 7850, Optoelectronic Imaging and Multimedia Technology, 78500H (9 November 2010); doi: 10.1117/12.870307
Show Author Affiliations
Jiming Fan, Soochow Univ. (China)
Key Lab. of Modern Optical Technology of Jiangsu Province (China)
Jiankang Zhou, Soochow Univ. (China)
Key Lab. of Modern Optical Technology of Jiangsu Province (China)
Xinhua Chen, Soochow Univ. (China)
Key Lab. of Modern Optical Technology of Jiangsu Province (China)
Weimin Shen, Soochow Univ. (China)
Key Lab. of Modern Optical Technology of Jiangsu Province (China)


Published in SPIE Proceedings Vol. 7850:
Optoelectronic Imaging and Multimedia Technology
Toru Yoshizawa; Ping Wei; Jesse Zheng; Tsutomu Shimura, Editor(s)

© SPIE. Terms of Use
Back to Top