Find in Library
Search millions of books, articles, and more
Indexed Open Access Databases
Using Predictive and Differential Methods with K<sup>2</sup>-Raster Compact Data Structure for Hyperspectral Image Lossless Compression <xref rid="fn1-remotesensing-596063" ref-type="fn">†</xref>
oleh: Kevin Chow, Dion Eustathios Olivier Tzamarias, Ian Blanes, Joan Serra-Sagristà
Format: | Article |
---|---|
Diterbitkan: | MDPI AG 2019-10-01 |
Deskripsi
This paper proposes a lossless coder for real-time processing and compression of hyperspectral images. After applying either a predictor or a differential encoder to reduce the bit rate of an image by exploiting the close similarity in pixels between neighboring bands, it uses a compact data structure called <inline-formula> <math display="inline"> <semantics> <msup> <mi>k</mi> <mn>2</mn> </msup> </semantics> </math> </inline-formula>-raster to further reduce the bit rate. The advantage of using such a data structure is its compactness, with a size that is comparable to that produced by some classical compression algorithms and yet still providing direct access to its content for query without any need for full decompression. Experiments show that using <inline-formula> <math display="inline"> <semantics> <msup> <mi>k</mi> <mn>2</mn> </msup> </semantics> </math> </inline-formula>-raster alone already achieves much lower rates (up to 55% reduction), and with preprocessing, the rates are further reduced up to 64%. Finally, we provide experimental results that show that the predictor is able to produce higher rates reduction than differential encoding.