Lookup tables are widely used in hardware to store arrays of constant values. For instance, complex mathematical functions in hardware are typically implemented through table-based methods such as plain tabulation, piecewise linear approximation, and ...

The scene graph is a novel data structure describing objects and their pairwise relationship within image scenes. As the size of scene graphs in vision and multimedia applications increases, the need for lossless storage and transmission of such data ...

IEEE 754 doubles do not exactly represent most real values, introducing rounding errors in computations and [de]serialization to text. These rounding errors inhibit the use of existing lightweight compression schemes such as Delta and Frame Of Reference (...

Optical Coherence Tomography (OCT) is a fast and non-destructive technology for bacterial biofilm imaging. However, OCT generates approximately 100 GB per flow cell, which complicates storage and data sharing. Data reduction reduces data complications ...

The Lempel-Ziv (LZ) 77 factorization of a string is a widely-used algorithmic tool that plays a central role in compression and indexing. For a length-n string over a linearly-sortable alphabet, e.g., with , it can be computed in time. It is ...

The Lempel-Ziv (LZ77) factorization of a string is a widely-used algorithmic tool that plays a central role in data compression and indexing. For a length-n string over integer alphabet with , and on a word RAM of width , it can be computed in ...

Today's graphics processing unit (GPU) applications produce vast volumes of data, which are challenging to store and transfer efficiently. Thus, data compression is becoming a critical technique to mitigate the storage burden and communication cost. LZSS ...

Compression is an effective technique for fitting data in available memory, reducing I/O, and increasing instruction parallelism. While data systems primarily rely on lossless compression, modern machine learning (ML) systems exploit the approximate ...

In 1957, the FORTRAN language and compiler introduced multidimensional dense arrays or dense tensors. Subsequent programming languages added a myriad of data structures from lists, sets, hash tables, trees, to graphs. Still, when dealing with extremely ...

This paper shows how to extend sparse tensor algebra compilers to support lossless compression techniques, including variants of run-length encoding and Lempel-Ziv compression. We develop new abstractions to represent losslessly compressed data as a ...

This document defines FFV1, a lossless, intra-frame video encoding format. FFV1 is designed to efficiently compress video data in a variety of pixel formats. Compared to uncompressed video, FFV1 offers storage compression, frame fixity, and self-...

Many image datasets are available on the Internet, contributing to the development of computer vision. While huge datasets are useful for research, they are time-consuming to transfer due to their large data volume. In particular, lossless compression ...

At present, governments and private business operations are highly dependent on relational data applications such as bank accounts, citizen registration, etc. These relational data dependent operations require reliable integrity protection while utilising ...

We propose a method to reduce the footprint of compressed data by using modified virtual address translation to permit random access to the data. This extends our prior work on using page translation to perform automatic decompression and deswizzling ...

We describe how to modify hardware page translation to enable CPU software access to compressed and swizzled GPU data arrays as if they were decompressed and stored in row-major order. In a shared memory system, this allows CPU to directly access the ...

In this world of evolution, the utilization of the medical technology and huge data generation by the different medical modalities, the storage, transmission and handling of the digital data requires data compression. In past few years, several ...

In order to deal with the context dilution problem introduced in the lossless compression of M-ary sources, a lossless compression algorithm based on a context tree model is proposed. By making use of the principle that conditioning reduces entropy, the ...

With the rapid development of data-driven animation technologies, huge motion capture data has been accumulated. Motion capture data is a kind of spatio-temporal high dimensional data, which needs a lot of storage space. Efficient compression and ...

We propose to replace the background data in finger vein imagery by uniform gray data and implications on (i) achieved lossless compression performance and (ii) obtained recognition accuracy in case of lossy compression are determined to employ 2 public ...

Image compression is a process that reduces memory space required to store an image. The image compression techniques are broadly classified into two categories a) Lossless technique b) Lossy technique. Lossy compression technique achieves higher result, ...