Algorithm 5. Pseudocode for the compressor part of the proposed near-lossless compression.

Input: $x$ // hyperspectral data. Outputs: vecSeed, vecUnary. Initialization: $n\leftarrow$$\mathrm{the} \mathrm{number} \mathrm{of} \mathrm{bits} \mathrm{required} \mathrm{to} \mathrm{represent} x$. For all $x_i$$\mathrm{in} x$ Do         1. Seed generation         $MSH \leftarrow$$\mathrm{the} \mathrm{leftmost} \lceil n/2\rceil$$\mathrm{bits} \mathrm{of} x_i$         $Q\leftarrow 2^{⌊n/2⌋}$         $seed \leftarrow (MSH+Q)\gg 1$         2. Quadrature-based square rooting         $BC\leftarrow seed$         $CD\leftarrow x⁄BC$         $M\leftarrow 0.5\cdot (BC+CD)$         $CM\leftarrow BC-M$         $\sin \theta \leftarrow CM/M$         3. Preparing the compressed stream         $index\leftarrow {10}^2\cdot \sin \theta$         $order \leftarrow$ the corresponding order of the seed value within the lookup table of the index (Table A1).         $m \leftarrow$ the number of bits that correspond to index (Table 4).         $varCode\leftarrow$$\mathrm{the} \mathrm{least} \mathrm{significant} m$$\mathrm{bits} \mathrm{of} order$.         $\mathrm{vecSeed}.\mathrm{add}(varCode$) // add the encoded seed to vecSeed vector.         $unary \leftarrow$ the corresponding unary code of the index value.         $\mathrm{vecUnary}.\mathrm{add}(unary$) // add unary code to vecUnary vector. End Do