Abstract
This paper examines the various variable-length encoders that provide integer encoding to hyperspectral scene data within a k 2 -raster compact data structure. This compact data structure leads to a compression ratio similar to that produced by some of the classical compression techniques. This compact data structure also provides direct access for query to its data elements without requiring any decompression. The selection of the integer encoder is critical for obtaining a competitive performance considering both the compression ratio and access time. In this research, we show experimental results of different integer encoders such as Rice, Simple9, Simple16, PForDelta codes, and DACs. Further, a method to determine an appropriate k value for building a k 2 -raster compact data structure with competitive performance is discussed.
Highlights
Hyperspectral scenes [1,2,3,4,5,6,7,8,9,10] are data taken from the air by sensors such as AVIRIS (AirborneVisible/Infrared Imaging Spectrometer) or by satellite instruments such as Hyperion and IASI (InfraredAtmospheric Sounding Interferometer)
We are interested in lossless compression of hyperspectral scenes through compact data structures
The rest of the paper is organized as follows: In Section 2, we describe the k2 -raster structure, followed by the various variable-length integer encoders such as Elias, Rice, PForDelta, and Directly Addressable Codes (DACs)
Summary
Hyperspectral scenes [1,2,3,4,5,6,7,8,9,10] are data taken from the air by sensors such as AVIRIS (AirborneVisible/Infrared Imaging Spectrometer) or by satellite instruments such as Hyperion and IASI (InfraredAtmospheric Sounding Interferometer). Other applications include weather prediction [13] and wildfire soil studies [14], to name a few Due to their sizes, hyperspectral scenes are usually compressed to facilitate their transmission and reduce storage size. Compact data structures [15] are a type of data structure where data are stored efficiently while at the same time providing real-time processing and compression of the data. They can be loaded into main memory and accessed directly by means of the rank and select functions [16] in the structures.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
