DocumentCode :
827060
Title :
Lossless compression of hyperspectral images using lookup tables
Author :
Mielikainen, Jarno
Author_Institution :
Dept. of Inf. Technol., Lappeenranta Univ. of Technol., Finland
Volume :
13
Issue :
3
fYear :
2006
fDate :
3/1/2006 12:00:00 AM
Firstpage :
157
Lastpage :
160
Abstract :
In this letter, we propose a new algorithm for lossless compression of hyperspectral images. The proposed method searches the previous band for a pixel of equal value to the pixel co-located to the one to be coded. The pixel in the same position as the obtained pixel in the current band is used as the predictor. Lookup tables are used to speed up the search. The algorithm is suitable for compression of hyperspectral image data in the band-interleaved-by-line (BIL) format. The method outperforms other state-of-the-art compression algorithms for the BIL data, at a lower time complexity level. Moreover, its compression ratios for the band sequential format data are within a few percentage points of the current state-of-the-art methods.
Keywords :
data compression; image coding; image sequences; interleaved codes; prediction theory; search problems; table lookup; BIL; band-interleaved-line format; hyperspectral image data; image coding; lookup table; lossless compression; predictor; search problem; sequential data format; state-of-art method; Compression algorithms; Hyperspectral imaging; Hyperspectral sensors; Image coding; Image storage; Minerals; Pixel; Signal processing algorithms; Spectroscopy; Table lookup; Hyperspectral data; image coding; lossless compression; remote sensing;
fLanguage :
English
Journal_Title :
Signal Processing Letters, IEEE
Publisher :
ieee
ISSN :
1070-9908
Type :
jour
DOI :
10.1109/LSP.2005.862604
Filename :
1593626
Link To Document :
بازگشت