Near-lossless Compression Research Articles

Deep Lossy Plus Residual Coding for Lossless and Near-Lossless Image Compression.

Lossless and near-lossless image compression is of paramount importance to professional users in many technical fields, such as medicine, remote sensing, precision engineering and scientific research. But despite rapidly growing research interests in learning-based image compression, no published method offers both lossless and near-lossless modes. In this paper, we propose a unified and powerful deep lossy plus residual (DLPR) coding framework for both lossless and near-lossless image compression. In the lossless mode, the DLPR coding system first performs lossy compression and then lossless coding of residuals. We solve the joint lossy and residual compression problem in the approach of VAEs, and add autoregressive context modeling of the residuals to enhance lossless compression performance. In the near-lossless mode, we quantize the original residuals to satisfy a given ℓ∞ error bound, and propose a scalable near-lossless compression scheme that works for variable ℓ∞ bounds instead of training multiple networks. To expedite the DLPR coding, we increase the degree of algorithm parallelization by a novel design of coding context, and accelerate the entropy coding with adaptive residual interval. Experimental results demonstrate that the DLPR coding system achieves both the state-of-the-art lossless and near-lossless image compression performance with competitive coding speed.

How Much Storage Precision Can Be Lost: Guidance for Near-Lossless Compression of Untargeted Metabolomics Mass Spectrometry Data.

Several lossy compressors have achieved superior compression rates for mass spectrometry (MS) data at the cost of storage precision. Currently, the impacts of precision losses on MS data processing have not been thoroughly evaluated, which is critical for the future development of lossy compressors. We first evaluated different storage precision (32 bit and 64 bit) in lossless mzML files. We then applied 10 truncation transformations to generate precision-lossy files: five relative errors for intensities and five absolute errors for m/z values. MZmine3 and XCMS were used for feature detection and GNPS for compound annotation. Lastly, we compared Precision, Recall, F1 - score, and file sizes between lossy files and lossless files under different conditions. Overall, we revealed that the discrepancy between 32 and 64 bit precision was under 1%. We proposed an absolute m/z error of 10-4 and a relative intensity error of 2 × 10-2, adhering to a 5% error threshold (F1 - scores above 95%). For a stricter 1% error threshold (F1 - scores above 99%), an absolute m/z error of 2 × 10-5 and a relative intensity error of 2 × 10-3 were advised. This guidance aims to help researchers improve lossy compression algorithms and minimize the negative effects of precision losses on downstream data processing.

Lossless and Near-Lossless Compression Algorithms for Remotely Sensed Hyperspectral Images.

Rapid and continuous advancements in remote sensing technology have resulted in finer resolutions and higher acquisition rates of hyperspectral images (HSIs). These developments have triggered a need for new processing techniques brought about by the confined power and constrained hardware resources aboard satellites. This article proposes two novel lossless and near-lossless compression methods, employing our recent seed generation and quadrature-based square rooting algorithms, respectively. The main advantage of the former method lies in its acceptable complexity utilizing simple arithmetic operations, making it suitable for real-time onboard compression. In addition, this near-lossless compressor could be incorporated for hard-to-compress images offering a stabilized reduction at nearly 40% with a maximum relative error of 0.33 and a maximum absolute error of 30. Our results also show that a lossless compression performance, in terms of compression ratio, of up to 2.6 is achieved when testing with hyperspectral images from the Corpus dataset. Further, an improvement in the compression rate over the state-of-the-art k2-raster technique is realized for most of these HSIs by all four variations of our proposed lossless compression method. In particular, a data reduction enhancement of up to 29.89% is realized when comparing their respective geometric mean values.

Near-Lossless Compression of Point Cloud Attribute Using Quantization Parameter Cascading and Rate-Distortion Optimization

Near-Lossless Compression of Point Cloud Attribute Using Quantization Parameter Cascading and Rate-Distortion Optimization

Multilevel Adaptive Near-Lossless Compression in Edge Collaborative Wireless Sensor Networks for Mechanical Vibration Monitoring

To address the difficulties of severe lack of storage and computational resources and high delay of transmitting massive vibration data in wireless sensor networks (WSN) for mechanical vibration monitoring (MVM), this paper proposes a novel multilevel adaptive near-lossless compression in edge collaborative WSN (MANLC-ECWSN) for MVM, which could effectively solve the above problems. On the one hand, the sparse pattern of mechanical fault signals is analyzed. A multi-level adaptive near-lossless compression (MANLC) method is proposed to characterize mechanical fault feature information with high accuracy in low storage space, and the proposed method is implemented on the self-developed acquisition node (AN), which effectively improves the storage space and transmission efficiency. On the other hand, the edge computing (EC) technique is integrated into WSN, and data reconstruction and high-precision feature detection are efficiently implemented on the self-developed edge computing node (ECN), which effectively reduces the storage and computing pressure of the data center server. The comprehensive experiments demonstrate that high precision data reconstruction and feature detection could be achieved in the proposed approach from measurements that occupy a little storage space of the AN. The computational power and transmission efficiency of WSN are significantly improved, which provides a potential solution for practical engineering applications.

An Empirical Selection of Wavelet for Near-Lossless Medical Image Compression.

Wavelets are defined as mathematical functions that segment the data into different frequency levels. We can easily capture the fine and coarse details of an image or signal referred to as a subband. And it also helps in subband thresholding to achieve good compression performance. In recent days in telemedicine services, the handling of medical images is prominently increasing and it leads to the demand for medical image compression. While compressing the medical images, we have to concentrate on the data that holds important information, and at the same time, it must retain the image quality. Near-Lossless compression plays an essential role to achieve a better compression ratio than lossy compression and provides better quality than lossless compression. In this paper, we analyzed the sub-banding of Discrete Wavelet Transform (DWT) using different types of wavelets and made an optimal selection of wavelets for subband thresholding to attain a good compression performance with an application to medical images. We used Set Partitioning In Hierarchical Trees (SPIHT) compression scheme to test the compression performance of different wavelets. The Peak Signal to Noise Ratio (PSNR), Bits Per Pixel (BPP), Compression Ratio, and percentage of number of zeros are used as metrics to assess the performance of all the selected wavelets. And to find out its efficiency in possessing the essential information of medical images, the subband of the selected wavelets is further utilized to devise the near-lossless compression scheme for medical images.

Near-lossless Compression of Tc-99 m DMSA Scan Images Using Discrete Cosine Transformation.

The objective of this study was to optimize the threshold for discrete cosine transform (DCT) coefficients for near-lossless compression of Tc-99 m Dimercaptosuccinic acid (DMSA) scan images using discrete cosine transformation. Two nuclear medicine (NM) Physicians after reviewing several Tc-99 m DMSA scan images provided 242 Tc-99 m DMSA scan images that had scar. These Digital imaging and communication in medicine (DICOM) images were converted in the Portable Network Graphics (PNG) format. DCT was applied on these PNG images, which resulted in DCT coefficients corresponding to each pixel of the image. Four different thresholds equal to 5, 10, 15, and 20 were applied and then inverse discrete cosine transformation was applied to get the compressed Tc-99 m DMSA scan images. Compression factor was calculated as the ratio of the number of nonzero elements after thresholding DCT coefficients to the number of nonzero elements before thresholding DCT coefficients. Two NM physicians who had provided the input images visually compared the compressed images with its input image, and categorized the compressed images as either acceptable or unacceptable. The quality of compressed images was also assessed objectively using the following eight image quality metrics: perception-based image quality evaluator, structural similarity index measure (SSIM), multiSSIM, feature similarity indexing method, blur, global contrast factor, contrast per pixel, and brightness. Pairwise Wilcoxon signed-rank sum tests were applied to find the statistically significant difference between the value of image quality metrics of the compressed images obtained at different thresholds and the value of the image quality metrics of its input images at the level of significance = 0.05. At threshold 5, (1) all compressed images (242 out of 242 Tc-99 m DMSA scan images) were acceptable to both the NM Physicians, (2) Compressed image looks identical to its original image and no loss of clinical details was noticed in compressed images, (3) Up to 96.65% compression (average compression: 82.92%) was observed, and (4) Result of objective assessment supported the visual assessment. The quality of compressed images at thresholds 10, 15, and 20 was significantly better than that of input images at P < 0.0001. However, the number of unacceptable compressed images at thresholds 10, 15, and 20 was 6, 38, and 70, respectively. Up to 96.65%, near-losses compression of Tc-99 m DMSA images was found using DCT by thresholding DCT coefficients at a threshold value equal to 5.

Context-Aware Lossless and Lossy Compression of Radio Frequency Signals

We propose an algorithm based on linear prediction that can perform both the lossless and near-lossless compression of RF signals. The proposed algorithm is coupled with two signal detection methods to determine the presence of relevant signals and apply varying levels of loss as needed. The first method uses spectrum sensing techniques, while the second one takes advantage of the error computed in each iteration of the Levinson-Durbin algorithm. These algorithms have been integrated as a new pre-processing stage into FAPEC, a data compressor first designed for space missions. We test the lossless algorithm using two different datasets. The first one was obtained from OPS-SAT, an ESA CubeSat, while the second one was obtained using a SDRplay RSPdx in Barcelona, Spain. The results show that our approach achieves compression ratios that are 23% better than gzip (on average) and very similar to those of FLAC, but at higher speeds. We also assess the performance of our signal detectors using the second dataset. We show that high ratios can be achieved thanks to the lossy compression of the segments without any relevant signal.

Information loss and run time from practical application of quantum data compression

We examine information loss, resource costs, and run time from practical application of quantum data compression. Compressing quantum data to fewer qubits enables efficient use of resources, as well as applications for quantum communication and denoising. In this context, we provide a description of the quantum and classical components of the hybrid quantum autoencoder algorithm, implemented using IBMs Qiskit language. Utilizing our own data sets, we encode bitmap images as quantum superposition states, which correspond to linearly independent vectors with density matrices of discrete values. We successfully compress this data with near-lossless compression using simulation, and then run our algorithm on an IBMQ quantum chip. We describe conditions and run times for training and compressing our data on quantum devices, and relate trainability to specific characteristics and performance metrics of our parametric quantum circuits.

Nearly-lossless-to-lossy medical image compression by the optimized JPEGXT and JPEG algorithms through the anatomical regions of interest

Currently, plenty of image data is generated that complicate storage and image transmission. Great efforts have been attempted on how to increase compression ratio (CR) without loss of critical diagnostic information. In this study, we designed two optimized JPEGXT (JPEGXT_OPT) and JPEG (JPEG_OPT) approaches by amplifying discrete cosine transform coefficients and using the entire anatomical region as ROI (region of interest). We found that ROI percentages have a great impact CR: smaller ROI percentages (10–30 %) could obtain a larger CR. Under the near-lossless compression, JPEGXT_OPT could have CRs up to 4.0 under small ROI percentages (10–30 %), while only ∼ 1.2 for large ROI percentages (90–100 %). JPEG_OPT could obtain a much higher CR: up to over 20.0 for both CT and MRI images under small ROI percentages (10 %-30 %), and over 10.0 in CT and 5.0 in MRI under large ROI percentages (90 %). Both of them show a compression efficiency than the DICOM-recommended JPEGXT and JEPG_2000. From the distortion analysis, MSSIM (Multiscale Structural Similarity) and PRD (percent ratio of distortion) indicate our methods have a less image distortion than DICOM-recommended JPEGXT (PDR > 20 %) and JPEG_2000: approximately 3.0 % PRD were seen under JPEG_OPT, while<0.15 % PRD were observed under JPEGXT_OPT. MSSIM > 0.98 was found in JPEG_OPT, which the reconstructed images have almost no changes in luminance, contrast, and structure, and this was confirmed by low PRD (about 3.0 %). Overall, our two methods could provide a high compression ratio of medical images without significant loss of important diagnostic information in reconstructed images.

Near-lossless compression scheme using hamming codes for non-textual important regions in document images

Working at Bell Labs in 1950, irritated with error-prone punched card readers, R W Hamming began working on error-correcting codes, which became the most used error-detecting and correcting approach in the field of channel coding in the future. Using this parity-based coding, two-bit error detection and one-bit error correction was achievable. Channel coding was expanded further to correct burst errors in data. Depending upon the use of the number of data bits ‘d’ and parity bits ‘k’ the code is specified as (n, k) code, here ‘n’ is the total length of the code (d+k). It means that 'k' parity bits are required to protect 'd' data bits, which also means that parity bits are redundant if the code word contains no errors. Due to the framed relationship between data bits and parity bits of the valid codewords, the parity bits can be easily computed, and hence the information represented by 'n' bits can be represented by 'd' bits. By removing these unnecessary bits, it is possible to produce the optimal (i.e., shortest length) representation of the image data. This work proposes a digital image compression technique based on Hamming codes. Lossless and near-lossless compression depending upon need can be achieved using several code specifications as mentioned here. The achieved compression ratio, computational cost, and time complexity of the suggested approach with various specifications are evaluated and compared, along with the quality of decompressed images.

An Efficient Architecture and High-Throughput Implementation of CCSDS-123.0-B-2 Hybrid Entropy Coder Targeting Space-Grade SRAM FPGA Technology

Nowadays, hyperspectral imaging is recognized as cornerstone remote sensing technology. The explosive growth in image data volume and instrument data rates, compete with limited on-board storage resources and downlink bandwidth, making hyperspectral image data compression a mission critical on-board processing task. The Consultative Committee for Space Data Systems (CCSDS) extended the previous issue of the CCSDS-123.0 Recommended Standard for multi- and hyperspectral image compression to provide with Near-Lossless compression functionality. A key feature of the CCSDS-123.0-B-2 is the improved Hybrid Entropy Coder, which at low bit rates, provides substantially better compression performance than the Issue 1 entropy coders. In this paper, we introduce a high-throughput hardware implementation of the CCSDS-123.0-B-2 Hybrid Entropy Coder. The introduced architecture exploits the systolic design pattern to provide modularity and latency insensitivity in a deep and elastic pipeline achieving a constant throughput of 1 sample/cycle with a small FPGA resource footprint. This architecture is described in portable VHDL RTL and is implemented, validated and demonstrated on a commercially available Xilinx KCU105 development board hosting a Xilinx Kintex Ultrascale XCKU040 SRAM FPGA, and thus, is directly transferable to Xilinx Radiation Tolerant Kintex UltraScale XQRKU060 space-grade devices for space deployments. Moreover, state-of-the-art SpaceFibre (ECSS-E-ST-50-11C) serial link interface and test equipment were used in the validation platform to emulate an on-board deployment. The introduced CCSDS-123.0-B-2 Hybrid Entropy Encoder achieves a constant throughput performance of 305 MSamples/s. To the best of our knowledge, this is the first published fully-compliant architecture and high-throughput implementation of the CCSDS-123.0-B-2 Hybrid Entropy Coder, targeting space-grade FPGA technology.

Near-lossless compression of PET/CT images using singular value decomposition.

The aim of the study is to compare the single matrix approach and slice-by-slice approach for computing singular value decomposition (SVD) to achieve near-lossless compression of PET/CT images. The parameters used for comparison were SVD computation time, percentage compression and percentage difference between ROI counts on compressed and original images. SVD of 49 F-18-FDG PET/CT studies (33 370 PET/CT images) was computed using both approaches. The smaller singular values contributing insignificant information to the image were truncated, and then, the compressed image was reconstructed. A mask (101 × 101pixels) was used to extract the ROI counts from compressed and original images. Two nuclear medicine physicians compared compressed images with their corresponding original images for loss of clinical details and the presence of generated artifacts. Structural Similarity Index Measure, blur, brightness, contrast per pixel and global contrast factor were used for objective assessment of image quality. Wilcoxon test was applied to find a statistically significant difference between the parameters used for comparison at alpha = 0.05. Nuclear medicine physicians found compressed image identical to the corresponding original image. The values of comparation parameters were significantly larger for the single matrix approach in comparison with the slice-by-slice approach. The maximum percentage error between the compressed image and original image was less than 5%. Up to 64 % and 44% near-lossless compression of PET and CT images were achieved, respectively using the slice-by-slice approach, and up to 58 and 53% near-lossless compression of PET and CT images were achieved respectively using the single matrix approach.

A linear regression data compression algorithm for an islanded DC microgrid

The exchange of data between energy stakeholders will play an important role in future smart energy systems. A key component of smart energy systems is the smart meter, which enables the utility provider to obtain energy consumption readings of customers at regular intervals. When smart meters are fully deployed, it is expected that several billions of data points will be generated per annum, which makes it necessary to compress the data to a suitable size, while preserving vital energy information. In this paper, we present a technique for data compression, which jointly compresses current and voltage time series data by substituting data points with linear regression coefficients. Given a set of input parameters, we demonstrate that the algorithm can also be invoked iteratively to autonomously improve the compression result. We apply the algorithm to load profiles obtained from an islanded DC microgrid laboratory experiment, and we demonstrate that our technique has a near-lossless compression performance and a high compression ratio of more than 50-to-1 for most of the datasets considered. As a proof of concept, we also apply the algorithm to energy data from an AC-grid-connected household and the results suggest that the developed algorithm is potentially applicable to more conventional energy systems. We compare our results with a similar linear-regression-based algorithm and our proposed technique demonstrates a better energy error performance on average for a given compression ratio and a 30-fold reduction in the data compression time.

Aird: a computation-oriented mass spectrometry data format enables a higher compression ratio and less decoding time

BackgroundWith the precision of the mass spectrometry (MS) going higher, the MS file size increases rapidly. Beyond the widely-used open format mzML, near-lossless or lossless compression algorithms and formats emerged in scenarios with different precision requirements. The data precision is often related to the instrument and subsequent processing algorithms. Unlike storage-oriented formats, which focus more on lossless compression rate, computation-oriented formats concentrate as much on decoding speed as the compression rate.ResultsHere we introduce “Aird”, an opensource and computation-oriented format with controllable precision, flexible indexing strategies, and high compression rate. Aird provides a novel compressor called Zlib-Diff-PforDelta (ZDPD) for m/z data. Compared with Zlib only, m/z data size is about 55% lower in Aird average. With the high-speed decoding and encoding performance of the single instruction multiple data technology used in the ZDPD, Aird merely takes 33% decoding time compared with Zlib. We have downloaded seven datasets from ProteomeXchange and Metabolights. They are from different SCIEX, Thermo, and Agilent instruments. Then we convert the raw data into mzML, mgf, and mz5 file formats by MSConvert and compare them with Aird format. Aird uses JavaScript Object Notation for metadata storage. Aird-SDK is written in Java, and AirdPro is a GUI client for vendor file converting written in C#. They are freely available at https://github.com/CSi-Studio/Aird-SDK and https://github.com/CSi-Studio/AirdPro.ConclusionsWith the innovation of MS acquisition mode, MS data characteristics are also constantly changing. New data features can bring more effective compression methods and new index modes to achieve high search performance. The MS data storage mode will also become professional and customized. ZDPD uses multiple MS digital features, and researchers also can use it in other formats like mzML. Aird is designed to become a computing-oriented data format with high scalability, compression rate, and fast decoding speed.

Reducing Data Dependencies in the Feedback Loop of the CCSDS 123.0-B-2 Predictor

On-board multi- and hyperspectral instruments acquire large volumes of data that need to be processed with the limited computational and storage resources. In this context, the CCSDS 123.0-B-2 standard emerges as an interesting option to compress multi- and hyperspectral images on-board satellites, supporting both lossless and near-lossless compression with low complexity and reduced power consumption. Nonetheless, the inclusion of a feedback loop in the CCSDS 123.0-B-2 predictor to support near-lossless compression introduces significant data dependencies that hinder real-time processing, particularly due to the presence of a quantization stage within this loop. This work provides an analysis of the aforementioned data dependencies and proposes two strategies aiming at maximizing throughput in hardware implementations and thus enabling real-time processing. In particular, through an elaborate mathematical derivation, the quantization stage is removed completely from the feedback loop. This reduces the critical path, which allows for shorter initiation intervals in a pipelined hardware implementation and higher throughput. This is achieved without any impact in the compression performance, which is identical to the one obtained by the original data flow of the predictor.

Adaptation of the CCSDS 123.0-B-2 Standard for RGB Video Compression

The integration of video sensors on-board satellites is becoming a trend in the space industry, since they provide extra information in the temporal domain when compared with traditional remote sensing imaging acquisition equipment. The inclusion of the temporal dimension together with the constant increase in the sensor resolution supposes a challenge for on-board processing, taking into account the limited computational and storage resources on-board satellites and that it is unfeasible to directly transmit raw video to ground, due to downlink bandwidth limitations. For these reasons, on-board video compression is needed. However, the inherent complexity of the video encoders used on ground limits their implementation on environments with high constraints in terms of computational burden, area, and power consumption. This article proposes an extended compression chain that implements as compression core the CCSDS 123.0-B-2 standard, originally developed for near-lossless compression of multi- and hyperspectral images. In addition, some preprocessing stages are included to manage the temporal dimension of RGB videos efficiently. The proposed solution guarantees low complexity and flexibility to compress both multi- and hyperspectral images and panchromatic and RGB videos by using a single compression instance, which is adapted by adding or removing the appropriate stages. Results demonstrate the viability of this solution to be implemented on space payloads, since high compression ratios are achieved without incurring in a penalty in terms of video quality.

A Real-Time FPGA Implementation of the CCSDS 123.0-B-2 Standard

Hyperspectral images are a useful remote sensing tool that often reaches hundreds of megabytes in size. The CCSDS 123.0-B-2 is a recent algorithm that achieves lossless and near-lossless compression of hyperspectral images by introducing a configurable maximum error over its predecessor CCSDS 123.0-B-1. In this article, a field-programmable gate array (FPGA) implementation of the revised standard that works in real-time is presented. We have developed an extremely pipelined and fast core in VHDL, that is able to process a sample per cycle at over 250 MHz, working eight times faster than in real time for the Airborne Visible-Infrared Imaging Spectrometer-Next Generation (AVIRIS-NG) sensor. New dependencies in the revised standard are avoided by using a novel sample ordering called frame interleaved by diagonal. The predictor stage has been designed to work in this order, and two reorder buffers encapsulate it to be band interleaved by pixel compliant. Predictor data are encoded using a novel FPGA implementation of the CCSDS 123.0-B-2 hybrid coder. The modules are tested and verified on a Virtex-7 VC709 board. For medium (256 bands <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\times4096$ </tex-math></inline-formula> frames <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\times512$ </tex-math></inline-formula> samples) and large ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$512\times 4096\times 1024$ </tex-math></inline-formula> ) images, the core occupies, respectively, 14% and 50% of an XQRKU060 FPGA.

An FPGA-Based LOCO-ANS Implementation for Lossless and Near-Lossless Image Compression Using High-Level Synthesis

In this work, we present and evaluate a hardware architecture for the LOCO-ANS (Low Complexity Lossless Compression with Asymmetric Numeral Systems) lossless and near-lossless image compressor, which is based on JPEG-LS standard. The design is implemented in two FPGA generations, evaluating its performance for different codec configurations. The tests show that the design is capable of up to 40.5 MPixels/s and 124 MPixels/s per lane for Zynq 7020 and UltraScale+ FPGAs, respectively. Compared to the single thread LOCO-ANS software implementation running in a 1.2 GHz Raspberry Pi 3B, each hardware lane achieves 6.5 times higher throughput, even when implemented in an older and cost-optimized chip like the Zynq 7020. Results are also presented for a lossless only version, which achieves a lower footprint and approximately 50% higher performance than the version that supports both lossless and near-lossless. Interestingly, these great results were obtained applying High-Level Synthesis, describing the coder with C++ code, which tends to establish a trade-off between design time and quality of results. These results show that the algorithm is very suitable for hardware implementation. Moreover, the implemented system is faster and achieves higher compression than the best previously available near-lossless JPEG-LS hardware implementation.

Hardware Implementation of the CCSDS 123.0-B-2 Near-Lossless Compression Standard Following an HLS Design Methodology

The increment in the use of high-resolution imaging sensors on-board satellites motivates the use of on-board image compression, mainly due to restrictions in terms of both hardware (computational and storage resources) and downlink bandwidth with the ground. This work presents a compression solution based on the CCSDS 123.0-B-2 near-lossless compression standard for multi- and hyperspectral images, which deals with the high amount of data acquired by these next-generation sensors. The proposed approach has been developed following an HLS design methodology, accelerating design time and obtaining good system performance. The compressor is comprised by two main stages, a predictor and a hybrid encoder, designed in Band-Interleaved by Line (BIL) order and optimized to achieve a trade-off between throughput and logic resources utilization. This solution has been mapped on a Xilinx Kintex UltraScale XCKU040 FPGA and targeting AVIRIS images, reaching a throughput of 12.5 MSamples/s and consuming only the 7% of LUTs and around the 14% of dedicated memory blocks available in the device. To the best of our knowledge, this is the first fully-compliant hardware implementation of the CCSDS 123.0-B-2 near-lossless compression standard available in the state of the art.