Javascript must be enabled to continue!
A note on precision-preserving compression of scientific data
View through CrossRef
Abstract. Lossy compression of scientific data arrays is a powerful tool to save network bandwidth and storage space. Properly applied lossy compression can reduce the size of a dataset by orders of magnitude keeping all essential information, whereas a wrong choice of lossy compression parameters leads to the loss of valuable data. The paper considers statistical properties of several lossy compression methods implemented in "NetCDF operators" (NCO), a popular tool for handling and transformation of numerical data in NetCDF format. We compare the effects of imprecisions and artifacts resulting from use of a lossy compression of floating-point data arrays. In particular, we show that a popular Bit Grooming algorithm (default in NCO) has sub-optimal accuracy and produces substantial artifacts in multipoint statistics. We suggest a simple implementation of two algorithms that are free from these artifacts and have twice higher precision. Besides that, we suggest a way to rectify the data already processed with Bit Grooming. The algorithm has been contributed to NCO mainstream. The supplementary material contains the implementation of the algorithm in Python 3.
Title: A note on precision-preserving compression of scientific data
Description:
Abstract.
Lossy compression of scientific data arrays is a powerful tool to save network bandwidth and storage space.
Properly applied lossy compression can reduce the size of a dataset by orders of magnitude keeping all essential information, whereas a wrong choice of lossy compression parameters leads to the loss of valuable data.
The paper considers statistical properties of several lossy compression methods implemented in "NetCDF operators" (NCO), a popular tool for handling and transformation of numerical data in NetCDF format.
We compare the effects of imprecisions and artifacts resulting from use of a lossy compression of floating-point data arrays.
In particular, we show that a popular Bit Grooming algorithm (default in NCO) has sub-optimal accuracy and produces substantial artifacts in multipoint statistics.
We suggest a simple implementation of two algorithms that are free from these artifacts and have twice higher precision.
Besides that, we suggest a way to rectify the data already processed with Bit Grooming.
The algorithm has been contributed to NCO mainstream.
The supplementary material contains the implementation of the algorithm in Python 3.
Related Results
Ary Scheffer, een Nederlandse Fransman
Ary Scheffer, een Nederlandse Fransman
AbstractAry Scheffer (1795-1858) is so generally included in the French School (Note 2)- unsurprisingly, since his career was confined almost entirely to Paris - that the fact that...
Differential Diagnosis of Neurogenic Thoracic Outlet Syndrome: A Review
Differential Diagnosis of Neurogenic Thoracic Outlet Syndrome: A Review
Abstract
Thoracic outlet syndrome (TOS) is a complex and often overlooked condition caused by the compression of neurovascular structures as they pass through the thoracic outlet. ...
Pieter Saenredam: zijn boekenbezit en zijn relatie met de landmeter Pieter Wils
Pieter Saenredam: zijn boekenbezit en zijn relatie met de landmeter Pieter Wils
AbstractAn earlier article on Saenredam's construction drawings (Note, 1 ) left open the question of how he obtained his knowledge of perspective. His teacher Frans de Grebber (Not...
Een serie tekeningen van Johannes Stradanus met scènes uit het leven van de Heilige Giovanni Gualberto
Een serie tekeningen van Johannes Stradanus met scènes uit het leven van de Heilige Giovanni Gualberto
AbstractAmong the extensive collection of pen sketches by Johannes Stradanus (Bruges 1523-Florence 1605) in the Cooper-Hewitt Museum of Design and the Pierpont Morgan Library in Ne...
Practical notes on lossy compression of scientific data
Practical notes on lossy compression of scientific data
<p>Lossy compression methods are extremely efficient in terms of space and performance and allow for reduction of network bandwidth and disk space needed to store dat...
Improving the performance of 3D image model compression based on optimized DEFLATE algorithm
Improving the performance of 3D image model compression based on optimized DEFLATE algorithm
AbstractThis study focuses on optimizing and designing the Delayed-Fix-Later Awaiting Transmission Encoding (DEFLATE) algorithm to enhance its compression performance and reduce th...
Survey on Various Image Compression Techniques Used in Image Processing to Improve the Quality of Image
Survey on Various Image Compression Techniques Used in Image Processing to Improve the Quality of Image
This paper presents study of assorted lossy compression techniques. the 2 techniques are Wavelet Difference Reduction (WDR) based compression and Singular Value Decomposition (SVD)...
Lossless Compression Method for Medical Image Sequences Using Super-Spatial Structure Prediction and Inter-frame Coding
Lossless Compression Method for Medical Image Sequences Using Super-Spatial Structure Prediction and Inter-frame Coding
Space research organizations, hospitals and military air surveillance activities, among others, produce a huge amount of data in the form of images hence a large storage space is r...

