Approach For Lossless Compression Research Articles

An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity.

We study practical approximations of Kolmogorov prefix complexity (K) using IMP2, a high-level programming language. Our focus is on investigating the optimality of the interpreter for this language as the reference machine for the Coding Theorem Method (CTM). This method is designed to address applications of algorithmic complexity that differ from the popular traditional lossless compression approach based on the principles of algorithmic probability. The chosen model of computation is proven to be suitable for this task, and a comparison to other models and methods is conducted. Our findings show that CTM approximations using our model do not always correlate with the results from lower-level models of computation. This suggests that some models may require a larger program space to converge to Levin's universal distribution. Furthermore, we compare the CTM with an upper bound on Kolmogorov complexity and find a strong correlation, supporting the CTM's validity as an approximation method with finer-grade resolution of K.

An Integrated Approach for Lossless Image Compression Using CLAHE, Two-Channel Encoding and Adaptive Arithmetic Coding

An Integrated Approach for Lossless Image Compression Using CLAHE, Two-Channel Encoding and Adaptive Arithmetic Coding

Comparative Analysis of Multimedia Compression Algorithms

Data compression reduces the amount of bits needed to encode information, conserving expensive resources like disc space and transmission bandwidth. By using data compression, an information block's real size is kept as little as possible. The compression process consists of two steps: encoding, which uses fewer bits to compress a message, and decoding, which uses the compressed representation to roughly resemble or replicate the original message. The two main types of data compression are lossless compression and lossy approaches. The Huffman, Lempel-Ziv, and Run Length encoding techniques were all examined in this research, along with three other commonly used compression techniques. According to the research, Run Length Encoding was the best method for reducing the size of text, web pages, images, and sound.

Analysis of the potential efficiency of post-filtering noisy images after lossy compression

An increase in the number of images and their average size is the general trend nowadays. This increase leads to certain problems with data storage and transfer via communication lines. A common way to solve this problem is to apply lossy compression that provides sufficiently larger compression ratios compared to lossless compression approaches. However, lossy compression has several peculiarities, especially if a compressed image is corrupted by quite intensive noise. First, a specific noise-filtering effect is observed. Second, an optimal operational point (OOP) might exist where the quality of a compressed image is closer to the corresponding noise-free image than the quality of the original image according to a chosen quality metric. In this case, it is worth compressing this image in the OOP or its closest neighborhood. These peculiarities have been earlier studied and their positive impact on image quality improvement has been demonstrated. Filtering of noisy images due to lossy compression is not perfect. Because of this, it is worth checking can additional quality improvement be reached using such an approach as post-filtering. In this study, we attempt to answer the questions: “is it worth to post-filter an image after lossy compression, especially in OOP’s neighborhood? And what benefit can it bring in the sense of image quality?”. The study is carried out for better portable graphics (BPG) coder and the DCT-based filter focusing mainly on one-component (grayscale) images. The quality of images is characterized by several metrics such as PSNR, PSNR-HVS-M, and FSIM. Possible image quality increasing via post-filtering is demonstrated and the recommendations for filter parameter setting are given.

Telemetry Data Compression Algorithm Using Balanced Recurrent Neural Network and Deep Learning.

Telemetric information is great in size, requiring extra room and transmission time. There is a significant obstruction of storing or sending telemetric information. Lossless data compression (LDC) algorithms have evolved to process telemetric data effectively and efficiently with a high compression ratio and a short processing time. Telemetric information can be packed to control the extra room and association data transmission. In spite of the fact that different examinations on the pressure of telemetric information have been conducted, the idea of telemetric information makes pressure incredibly troublesome. The purpose of this study is to offer a subsampled and balanced recurrent neural lossless data compression (SB-RNLDC) approach for increasing the compression rate while decreasing the compression time. This is accomplished through the development of two models: one for subsampled averaged telemetry data preprocessing and another for BRN-LDC. Subsampling and averaging are conducted at the preprocessing stage using an adjustable sampling factor. A balanced compression interval (BCI) is used to encode the data depending on the probability measurement during the LDC stage. The aim of this research work is to compare differential compression techniques directly. The final output demonstrates that the balancing-based LDC can reduce compression time and finally improve dependability. The final experimental results show that the model proposed can enhance the computing capabilities in data compression compared to the existing methodologies.

Soft Compression: An Approach to Shape Coding for Images

In this letter, we propose soft compression, an lossless compression approach to shape coding for images using location index and codebook of designed shapes with various sizes. This method is different from traditional image compression methods, as it aims at finding the basic shape blocks of pictures to improve the compression ratio from the perspective of information theory and frequency. In particular, the triplets including location and codeword are stored when encoding an image instead of the entire array. It is shown that soft compression can greatly reduce the bandwidth and storage space needed in the process of transmitting and storing the same kind of images.

A Lossless Compression Approach Based on Delta Encoding and T-RLE in WSNs

The sending/receiving of data (data communication) is the most power consuming in wireless sensor networks (WSN) since the sensor nodes are depending on batteries not generally rechargeable characterized by limited capacity. Data compression is among the techniques that can help to reduce the amount of the exchanged data between wireless sensor nodes resulting in power saving. Nevertheless, there is a lack of effective methods to improve the efficiency of data compression algorithms and to increase nodes’ energy efficiency. In this paper, we proposed a novel lossless compression approach based on delta encoding and two occurrences character solving (T-RLE) algorithms. T-RLE is an optimization of the RLE algorithm, which aims to improve the compression ratio. This method will lead to less storage cost and less bandwidth to transmit the data, which positively affects the sensor nodes’ lifetime and the network lifetime in general. We used real deployment data (temperature and humidity) from the sensor scope project to evaluate the performance of our approach. The results showed a significant improvement compared with some traditional algorithms.

Spatial bandwidth-optimized compression of image plane off-axis holograms with image and video codecs.

Image plane off-axis holograms (IP-OAH) are the most common data captured in digital holographic microscopy and tomography. Due to increasing storage and data transmission requirements, lossy compression of such holograms has been subject of earlier investigations. However, hologram compression can not be allowed to hinder the metrological capabilities of the measurement technique itself. In this work, we present lossy and lossless IP-OAH compression approaches that are based on conventional compression codecs, but optimized with regard to bandwidth of the signal. Both approaches outperform respective conventional codecs, while the lossy approach is shown to uphold the accuracy of holographic phase measurements.

Deep-Learning based Lossless Image Coding

This paper proposes a novel approach for lossless image compression. The proposed coding approach employs a deep-learning-based method to compute the prediction for each pixel, and a context-tree-based bit-plane codec to encode the prediction errors. First, a novel deep learning-based predictor is proposed to estimate the residuals produced by traditional prediction methods. It is shown that the use of a deep-learning paradigm substantially boosts the prediction accuracy compared with the traditional prediction methods. Second, the prediction error is modeled by a context modeling method and encoded using a novel context-tree-based bit-plane codec. Codec profiles performing either one or two coding passes are proposed, trading off complexity for compression performance. The experimental evaluation is carried out on three different types of data: photographic images, lenslet images, and video sequences. The experimental results show that the proposed lossless coding approach systematically and substantially outperforms the state-of-the-art methods for each type of data.

Adaptive lossless compression of skeleton sequences

The increasing importance of skeleton information in surveillance big data feature analysis demands significant storage space. The development of an effective and efficient solution for storage is still a challenging task. In this paper, we propose a new framework for the lossless compression of skeleton sequences by exploiting both spatial and temporal prediction and coding redundancies. Firstly, we propose a set of skeleton prediction modes, namely, spatial differential-based, motion vector-based, relative motion vector-based, and trajectory-based skeleton prediction mode. These modes can effectively handle both spatial and temporal redundancies present in the skeleton sequences. Secondly, we further enhance performance by introducing a novel approach to handle coding redundancy. Our proposed scheme is able to significantly reduce the size of skeleton data while maintaining exactly the same skeleton quality due to lossless compression approach. Experiments are conducted on standard surveillance and Posetrack action datasets containing challenging test skeleton sequences. Our method obviously outperforms the traditional direct coding methods by providing an average of 73% and 66% bit-savings on the two datasets.

An Efficient Data Compression Approach based on Entropic Codingfor Network Devices with Limited Resources

The expansion of sensitive dataderiving from a variety of applications has requiredthe need to transmit and/or archivethem with increased performance in terms of quality, transmission delay or storage volume.
 However, lossless compression techniques are almost unacceptable in the application fields where data does not allow alterations because of the fact that loss of crucial information can distort the analysis.
 This paper introduces MediCompress, a lightweight lossless data compression approach for irretrievable data like those from the medical or astronomy fields. The proposed approachis based on entropic Arithmetic coding, Run-length encoding, Burrows-wheeler transform and Move-to-front encoding. The results obtained on medical images have an interesting Compression Ratio (CR) in comparison with the lossless compressor SPIHT and a better Peak Signal to Noise Ratio (PSNR) and Mean Squared Error (MSE) than SPIHT and JPEG2000.

Lossless Compression of Data Tables in Mobile Devices by Using Co-clustering

Data tables have been widely used for storage of a collection of related records in a structured format in many mobile applications. The lossless compression of data tables not only brings benefits for storage, but also reduces network transmission latencies and energy costs in batteries. In this paper, we propose a novel lossless compression approach by combining co-clustering and information coding theory. It reorders table columns and rows simultaneously for shaping homogeneous blocks and further optimizes alignment within a block to expose redundancy, such that standard lossless encoders can significantly improve compression ratios. We tested the approach on a synthetic dataset and ten UCI real-life datasets by using a standard compressor 7Z. The extensive experimental results suggest that compared with the direct table compression without co-clustering and within-block alignment, our approach can boost compression rates at least 21% and up to 68%. The results also show that the compression time cost of the co-clustering approach is linearly proportional to a data table size. In addition, since the inverse transform of co-clustering is just exchange of rows and columns according to recorded indexes, the decompression procedure runs very fast and the decompression time cost is similar to the counterpart without using co-clustering. Thereby, our approach is suitable for lossless compression of data tables in mobile devices with constrained resources.

An object-based lossless compression approach for medical images using DPCM

In this paper, an object-based coding technique for the lossless compression of medical images has been introduced. Since the region of interest in medical images is generally the object in the centre of the image, it is extracted and encoded using a lossless DPCM coder. The non-image region is split into sub-regions and concatenated after pre-processing, and encoded using the same DPCM method. For performance analysis, the proposed method is applied to various medical images. Bits per pixel values are calculated and compared with those of the object based wavelet transform coder and the direct coders. The results show that the proposed coder yields improved bits per pixel value than the rest of the coders.

A New Semiparametric Finite Mixture Model-Based Adaptive Arithmetic Coding for Lossless Image Compression

In this paper, we propose a new approach for block-based lossless image compression by defining a new semiparametric finite mixture model-based adaptive arithmetic coding. Conventional adaptive arithmetic encoders start encoding a sequence of symbols with a uniform distribution, and they update the frequency of each symbol by incrementing its count after it has been encoded. When encoding an image row by row or block by block, conventional adaptive arithmetic encoders provide the same compression results. In addition, images are normally non-stationary signals, which means that different areas in an image have different probability distributions, so conventional adaptive arithmetic encoders which provide probabilities for the whole image are not very efficient. In the proposed compression scheme, an image is divided into non-overlapping blocks of pixels, which are separately encoded with an appropriate statistical model. Hence, instead of starting to encode each block with a uniform distribution, we propose to start with a probability distribution which is modeled by a semiparametric mixture obtained from the distributions of its neighboring blocks. The semiparametric model parameters are estimated through maximum likelihood using the expectation---maximization algorithm in order to maximize the arithmetic coding efficiency. The results of comparative experiments show that we provide significant improvements over conventional adaptive arithmetic encoders and the state-of-the-art lossless image compression standards.

Hybridized Approach for Lossless Image Compression

Hybridized Approach for Lossless Image Compression

A universal chain code compression method

This paper introduces a new approach for lossless chain code compression. Firstly, the chain codes are converted into the binary stream, independent on the input chain code. Then, the compression is done using three modes: RLE0,LZ770 and COPY. RLE0 compresses the runs of the 0-bits, LZ770 is a simplified version of LZ77 and handles the repetitions within the bit stream, whilst COPY is an escape mode used, when the other two methods are unsuccessful. This method has been tested on the Freeman chain code in eight and four directions, the Vertex chain code, the Three OrThogonal chain code, and the Normalized angle difference chain code. The experiments confirmed better compression ratios on various benchmark datasets in comparison to the state-of-the-art lossless chain code compression methods.

Use of symmetry in prediction-error field for lossless compression of 3D MRI images

Three dimensional MRI images which are powerful tools for diagnosis of many diseases require large storage space. A number of lossless compression schemes exist for this purpose. In this paper we propose a new approach for lossless compression of these images which exploits the inherent symmetry that exists in 3D MRI images. First, an efficient pixel prediction scheme is used to remove correlation between pixel values in an MRI image. Then a block matching routine is employed to take advantage of the symmetry within the prediction error image. Inter-slice correlations are eliminated using another block matching. Results of the proposed approach are compared with the existing standard compression techniques.

Lossless data compression for improving the performance of a GPU-based beamformer.

The powerful parallel computation ability of a graphics processing unit (GPU) makes it feasible to perform dynamic receive beamforming However, a real time GPU-based beamformer requires high data rate to transfer radio-frequency (RF) data from hardware to software memory, as well as from central processing unit (CPU) to GPU memory. There are data compression methods (e.g. Joint Photographic Experts Group (JPEG)) available for the hardware front end to reduce data size, alleviating the data transfer requirement of the hardware interface. Nevertheless, the required decoding time may even be larger than the transmission time of its original data, in turn degrading the overall performance of the GPU-based beamformer. This article proposes and implements a lossless compression-decompression algorithm, which enables in parallel compression and decompression of data. By this means, the data transfer requirement of hardware interface and the transmission time of CPU to GPU data transfers are reduced, without sacrificing image quality. In simulation results, the compression ratio reached around 1.7. The encoder design of our lossless compression approach requires low hardware resources and reasonable latency in a field programmable gate array. In addition, the transmission time of transferring data from CPU to GPU with the parallel decoding process improved by threefold, as compared with transferring original uncompressed data. These results show that our proposed lossless compression plus parallel decoder approach not only mitigate the transmission bandwidth requirement to transfer data from hardware front end to software system but also reduce the transmission time for CPU to GPU data transfer.

Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks

We show that numerical approximations of Kolmogorov complexity (K) of graphs and networks capture some group-theoretic and topological properties of empirical networks, ranging from metabolic to social networks, and of small synthetic networks that we have produced. That K and the size of the group of automorphisms of a graph are correlated opens up interesting connections to problems in computational geometry, and thus connects several measures and concepts from complexity science. We derive these results via two different Kolmogorov complexity approximation methods applied to the adjacency matrices of the graphs and networks. The methods used are the traditional lossless compression approach to Kolmogorov complexity, and a normalised version of a Block Decomposition Method (BDM) based on algorithmic probability theory.

BIND – An algorithm for loss-less compression of nucleotide sequence data

Recent advances in DNA sequencing technologies have enabled the current generation of life science researchers to probe deeper into the genomic blueprint. The amount of data generated by these technologies has been increasing exponentially since the last decade. Storage, archival and dissemination of such huge data sets require efficient solutions, both from the hardware as well as software perspective. The present paper describes BIND-an algorithm specialized for compressing nucleotide sequence data. By adopting a unique 'block-length' encoding for representing binary data (as a key step), BIND achieves significant compression gains as compared to the widely used general purpose compression algorithms (gzip, bzip2 and lzma). Moreover, in contrast to implementations of existing specialized genomic compression approaches, the implementation of BIND is enabled to handle non-ATGC and lowercase characters. This makes BIND a loss-less compression approach that is suitable for practical use. More importantly, validation results of BIND (with real-world data sets) indicate reasonable speeds of compression and decompression that can be achieved with minimal processor/ memory usage. BIND is available for download at http://metagenomics.atc.tcs.com/compression/BIND. No license is required for academic or non-profit use.