Quantitative Comparative Study of the Performance of Lossless Compression Methods Based on a Text Data Model

Data compression plays a key role in optimizing the use of memory storage space and also reducing latency in data transmission. In this paper, we are interested in lossless compression techniques because their performance is exploited with lossy compression techniques for images and videos generally using a mixed approach. To achieve our intended objective, which is to study the performance of lossless compression methods, we first carried out a literature review, a summary of which enabled us to select the most relevant, namely the following: arithmetic coding, LZW, Tunstall’s algorithm, RLE, BWT, Huffman coding and Shannon-Fano. Secondly, we designed a purposive text dataset with a repeating pattern in order to test the behavior and effectiveness of the selected compression techniques. Thirdly, we designed the compression algorithms and developed the programs (scripts) in Matlab in order to test their performance. Finally, following the tests conducted on relevant data that we constructed according to a deliberate model, the results show that these methods presented in order of performance are very satisfactory:- LZW- Arithmetic coding- Tunstall algorithm- BWT + RLELikewise, it appears that on the one hand, the performance of certain techniques relative to others is strongly linked to the sequencing and/or recurrence of symbols that make up the message, and on the other hand, to the cumulative time of encoding and decoding.

Investigation on relations between grain crushing amount and void ratio change of granular materials in one-dimensional compression and creep tests

Grain crushing plays an important role in one-dimensional (1D) compression and creep behaviors of granular materials under high stress. It is clear that the macro-properties of granular materials are closely related to the micro-fracture properties of grains in 1D compression and creep tests. In this paper, a series of 1D compression and creep tests were performed on Ottawa sand to investigate the deformation and grain crushing properties of granular materials, and it shows that the void ratio is correlated to the grain crushing amount (the quantity of crushed grains) for granular materials subjected to grain crushing. The test results, combining with the existing test data related to grain crushing of granular materials, were used to verify the relation. Moreover, the implications of these relations on the yield of granular material, and the equivalent effect of stress and time in changing soil fabric are presented.

ADVANCED FREQUENCY-DIRECTED RUN-LENTH BASED CODING SCHEME ON TEST DATA COMPRESSION FOR SYSTEM-ON-CHIP

Test data compression and test resource partitioning （TRP） are essential to reduce the amount of test data in system-on-chip testing. A novel variable-to-variable-length compression codes is designed as advanced fre- quency-directed run-length （AFDR） codes. Different [rom frequency-directed run-length （FDR） codes, AFDR encodes both 0- and 1-runs and uses the same codes to the equal length runs. It also modifies the codes for 00 and 11 to improve the compression performance. Experimental results for ISCAS 89 benchmark circuits show that AFDR codes achieve higher compression ratio than FDR and other compression codes.

An Efficient Test Data Compression Technique Based on Codes

This paper presents a new test data compression/decompression method for SoC testing,called hybrid run length codes. The method makes a full analysis of the factors which influence test parameters：compression ratio,test application time, and area overhead. To improve the compression ratio, the new method is based on variable-to-variable run length codes,and a novel algorithm is proposed to reorder the test vectors and fill the unspecified bits in the pre-processing step. With a novel on-chip decoder, low test application time and low area overhead are obtained by hybrid run length codes. Finally, an experimental comparison on ISCAS 89 benchmark circuits validates the proposed method

Enhanced prediction of anisotropic deformation behavior using machine learning with data augmentation

Mg alloys possess an inherent plastic anisotropy owing to the selective activation of deformation mechanisms depending on the loading condition.This characteristic results in a diverse range of flow curves that vary with a deformation condition.This study proposes a novel approach for accurately predicting an anisotropic deformation behavior of wrought Mg alloys using machine learning(ML)with data augmentation.The developed model combines four key strategies from data science:learning the entire flow curves,generative adversarial networks(GAN),algorithm-driven hyperparameter tuning,and gated recurrent unit(GRU)architecture.The proposed model,namely GAN-aided GRU,was extensively evaluated for various predictive scenarios,such as interpolation,extrapolation,and a limited dataset size.The model exhibited significant predictability and improved generalizability for estimating the anisotropic compressive behavior of ZK60 Mg alloys under 11 annealing conditions and for three loading directions.The GAN-aided GRU results were superior to those of previous ML models and constitutive equations.The superior performance was attributed to hyperparameter optimization,GAN-based data augmentation,and the inherent predictivity of the GRU for extrapolation.As a first attempt to employ ML techniques other than artificial neural networks,this study proposes a novel perspective on predicting the anisotropic deformation behaviors of wrought Mg alloys.

Empirical data decomposition and its applications in image compression

A nonlinear data analysis algorithm, namely empirical data decomposition （EDD） is proposed, which can perform adaptive analysis of observed data. Analysis filter, which is not a linear constant coefficient filter, is automatically determined by observed data, and is able to implement multi-resolution analysis as wavelet transform. The algorithm is suitable for analyzing non-stationary data and can effectively wipe off the relevance of observed data. Then through discussing the applications of EDD in image compression, the paper presents a 2-dimension data decomposition framework and makes some modifications of contexts used by Embedded Block Coding with Optimized Truncation （EBCOT） . Simulation results show that EDD is more suitable for non-stationary image data compression.

RESEARCH ON ADAPTIVE DATA COMPRESSION METHOD FOR TRIANGULATED SURFACES

NC code or STL file can be generated directly from measuring data in a fastreverse-engineering mode. Compressing the massive data from laser scanner is the key of the newmode. An adaptive compression method based on triangulated-surfaces model is put forward.Normal-vector angles between triangles are computed to find prime vertices for removal. Ring datastructure is adopted to save massive data effectively. It allows the efficient retrieval of allneighboring vertices and triangles of a given vertices. To avoid long and thin triangles, a newre-triangulation approach based on normalized minimum-vertex-distance is proposed, in which thevertex distance and interior angle of triangle are considered. Results indicate that the compressionmethod has high efficiency and can get reliable precision. The method can be applied in fastreverse engineering to acquire an optimal subset of the original massive data.

Study on one-dimensional consolidation of soil under cyclic loading and with varied compressibility

This paper presents a semi-analytical method to solve one dimensional consolidation problem by taking consideration of varied compressibility of soil under cyclic loading. In the method, soil stratum is divided equally into n layers while load and consolidation time are also divided into small parts and time intervals accordingly. The problem of one-dimensional consolidation of soil stratum under cyclic loading can then be dealt with at each time interval as one-dimensional linear consolidation of multi-layered soils under constant loading. The compression or rebounding of each soil layer can be judged by the effective stress of the layer. When the effective stress is larger than that in the last time interval, the soil layer is compressed, and when it is smaller, the soil layer rebounds. Thus, appropriate compressibility can be chosen and the consolidation of the layered system can be analyzed by the available analytical linear consolidation theory. Based on the semi-analytical method, a computer program was developed and the behavior of one-dimensional consolidation of soil with varied compressibility under cyclic loading was investigated, and compared with the available consolidation theory which takes no consideration of varied compressibility of soil under cyclic loading. The results showed that by taking the variable compressibility into account, the rate of consolidation of soil was greater than the one predicted by conventional consolidation theory.

Design of quantum VQ iteration and quantum VQ encoding algorithm taking O（√N） steps for data compression

Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N） steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes O（√N） steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor＇s factorization algorithm and Grover＇s algorithm. Entanglement state is generated and used, by contrast the state in Grover＇s algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.

Improved SDT Process Data Compression Algorithm

Process data compression and trending are essential for improving control system performances. Swing Door Trending (SDT) algorithm is well designed to adapt the process trend while retaining the merit of simplicity. But it cannot handle outliers and adapt to the fluctuations of actual data. An Improved SDT (ISDT) algorithm is proposed in this paper. The effectiveness and applicability of the ISDT algorithm are demonstrated by computations on both synthetic and real process data. By applying an adaptive recording limit as well as outliers-detecting rules, a higher compression ratio is achieved and outliers are identified and eliminated. The fidelity of the algorithm is also improved. It can be used both in online and batch mode, and integrated into existing software packages without change.

Design of real-time data compression wireless sensor network based on LZW algorithm

A real-time data compression wireless sensor network based on Lempel-Ziv-Welch encoding(LZW)algorithm is designed for the increasing data volume of terminal nodes when using ZigBee for long-distance wireless communication.The system consists of a terminal node,a router,a coordinator,and an upper computer.The terminal node is responsible for storing and sending the collected data after the LZW compression algorithm is compressed;The router is responsible for the relay of data in the wireless network;The coordinator is responsible for sending the received data to the upper computer.In terms of network function realization,the development and configuration of CC2530 chips on terminal nodes,router nodes,and coordinator nodes are completed using the Z-stack protocol stack,and the network is successfully organized.Through the final simulation analysis and test verification,the system realizes the wireless acquisition and storage of remote data,and reduces the network occupancy rate through the data compression,which has a certain practical value and application prospects.

A Hybrid Method for Compression of Solar Radiation Data Using Neural Networks

The prediction of solar radiation is important for several applications in renewable energy research. There are a number of geographical variables which affect solar radiation prediction, the identification of these variables for accurate solar radiation prediction is very important. This paper presents a hybrid method for the compression of solar radiation using predictive analysis. The prediction of minute wise solar radiation is performed by using different models of Artificial Neural Networks (ANN), namely Multi-layer perceptron neural network (MLPNN), Cascade feed forward back propagation (CFNN) and Elman back propagation (ELMNN). Root mean square error (RMSE) is used to evaluate the prediction accuracy of the three ANN models used. The information and knowledge gained from the present study could improve the accuracy of analysis concerning climate studies and help in congestion control.

NONLINEAR STABILITY OF VISCOUS SHOCK WAVES FOR ONE-DIMENSIONAL NONISENTROPIC COMPRESSIBLE NAVIER–STOKES EQUATIONS WITH A CLASS OF LARGE INITIAL PERTURBATION

We study the nonlinear stability of viscous shock waves for the Cauchy problem of one-dimensional nonisentropic compressible Navier–Stokes equations for a viscous and heat conducting ideal polytropic gas. The viscous shock waves are shown to be time asymptotically stable under large initial perturbation with no restriction on the range of the adiabatic exponent provided that the strengths of the viscous shock waves are assumed to be sufficiently small.The proofs are based on the nonlinear energy estimates and the crucial step is to obtain the positive lower and upper bounds of the density and the temperature which are uniformly in time and space.

Technology of OptimalData Compression

The method of data compression, using orthogonal transform, is introduced so as to insure the minimal distortion of signal restoration. It, featured with transformation, can compress the data according to the needed precision. The ratio of compressed data is closely related to precision. The results show it to be favorable to different kinds of data compression.

DPCM-based vibration sensor data compression and its effect on structural system identification

Due to the large scale and complexity of civil infrastructures, structural health monitoring typically requires a substantial number of sensors, which consequently generate huge volumes of sensor data. Innovative sensor data compression techniques are highly desired to facilitate efficient data storage and remote retrieval of sensor data. This paper presents a vibration sensor data compression algorithm based on the Differential Pulse Code Modulation (DPCM) method and the consideration of effects of signal distortion due to lossy data compression on structural system identification. The DPCM system concerned consists of two primary components: linear predictor and quantizer. For the DPCM system considered in this study, the Least Square method is used to derive the linear predictor coefficients and Jayant quantizer is used for scalar quantization. A 5-DOF model structure is used as the prototype structure in numerical study. Numerical simulation was carried out to study the performance of the proposed DPCM-based data compression algorithm as well as its effect on the accuracy of structural identification including modal parameters and second order structural parameters such as stiffness and damping coefficients. It is found that the DPCM-based sensor data compression method is capable of reducing the raw sensor data size to a significant extent while having a minor effect on the modal parameters as well as second order structural parameters identified from reconstructed sensor data.

RAPID CODEBOOK SEARCH ALGORITHM FOR SAR RAW DATA COMPRESSION

This paper presents a simple but eifective algorithm to speed up the codebook search in a vector quantization scheme of SAR raw data when a minimum square error(MSE) criterion is used. A considerable reduction in the number of operations is achieved.

ENHANCED MULTISTAGE VECTOR QUANTIZATION FOR SAR RAW DATA COMPRESSION

Multistage Vector Quantization(MSVQ) can achieve very low encoding and storage complexity in comparison to unstructured vector quantization. However, the conventional MSVQ is suboptimal with respect to the overall performance measure. This paper proposes a new technology to design the decoder codebook, which is different from the encoder codebook to optimise the overall performance. The performance improvement is achieved with no effect on encoding complexity, both storage and time consuming, but a modest increase in storage complexity of decoder.

SIXTEEN TREE METHOD FOR BILEVEL IMAGE DATA COMPRESSION

A sixteen tree method of data compression of bilevel image is described.Thismethod has high efficiency,no information loss during compression,and easy to realize.

Data Compression in Information Technology——High Speed Sampling Theorems

Shannon gave the sampling theorem about the band limited functions in 1948, but the Shannon's theorem cannot adapt to the need of modern high technology. This paper gives a new high speed sampling theorem which has a fast convergence rate, a high precision, and a simple algorithm. A practical example has been used to verify its efficiency.

METHODS OF RADAR DATA COMPRESSION AND TARGET IDENTIFICATION BASED ON BIORTHOGONAL FDWT

In this paper, by using the biorthogonal quadrature filters, the biorthogonal mul-tiresolution analysis of finite dimension space equipped with inner product and the fast discrete wavelet transform (FDWT) are constructed. The dual transform method is proposed and the radar data storage is reduced by it. The method of choosing the wavelet coefficients, and the methods of correlation and nearest neighbor classification in wavelet domain based on the compressed data, are presented. The experimental results of the classification, using the high resolution range returns from six kinds of aircrafts, show that the methods of transform, compression and recognition are efficient.