一种快速解压的无损压缩算法

随着信息技术的不断发展,大量数据给存储和传输都带来了巨大的挑战。数据压缩能够有效减少数据量,方便数据的处理和传输。无损压缩是一种利用数据的冗余特点进行压缩的压缩方法,解压时可以完全还原数据而不会有任何失真。在研究LZO算法的快速解压原理基础上,设计了一种新的压缩算法。该算法通过减少压缩数据中压缩块的数量,降低了解压程序的执行开销。测试结果表明,新算法可实现比LZO算法更快的解压速度。     

破损压缩文件的修复还原

数据压缩和解压缩已广泛应用于现代通信和数据传输领域。但是如何解压缩损坏的无损压缩文件仍然是一个挑战。针对在通用编码领域广泛使用的无损数据压缩算法,该文提出一种能够修复误码并解压还原损坏的LZSS文件的有效方法,并给出了理论依据。该方法通过利用编码器留下的残留冗余携带校验信息,在不损失任何压缩性能的情况下,能够修复LZSS压缩数据中的错误。所提方法不需要增加额外比特,也不改变编码规则和数据格式,所以与标准算法完全兼容。即采用具有错误修复能力的LZSS方案压缩的数据,仍然可以通过标准LZSS解码器进行解压。实验结果验证了所提算法的有效性和实用性。     

一种基于三维整型DCT变换的高光谱图像无损压缩方法

本文根据高光谱图像具有空间和谱间相关性的特点,提出一种基于三维整型DCT变换的无损压缩方法.首先采用三维整型DCT变换消除高光谱图像空间和谱间的相关性;然后,对变换系数进行类似小波的树状系数重组,并按子带顺序进行一阶自适应算术编码.实验结果表明,本文提出的方法与JPEG2000中无损压缩算法相比,平均比特率降低0.1～0.4bpp;与JPEG-LS相比,平均比特率降低0.01～0.2bpp.     

一种基于阵列配置加速比模型的无损压缩算法

针对现有压缩算法通过增加复杂度来降低压缩率,获得信息高效传输的问题。该文提出阵列配置加速比模型,证明低压缩率不一定能提高传输效率,并找到影响信息传输效率的因子,即解压模块吞吐率和数据块压缩率。将影响因子与配置信息特征结合,设计了一种新的无损压缩算法,并硬件实现了解压模块,吞吐率可达到16.1 Gbps。采用AES, A5-1和SM4对无损压缩算法进行测试,然后与主流无损压缩算法LZW, Huffman, LPAQ1和Arithmetic对比。结果表明,整体压缩率相当,但该文压缩算法产生的数据块压缩率经过优化,不仅能满足加速需求,且具有高吞吐率的解压性能;该文无损压缩算法获得的配置加速比,比硬件吞吐率理想情况下的LPAQl, Arithmetic, Huffman, LZW算法分别高8%, 9%, 10%, 22%左右。     

基于IWT和FCM的曲线矢量数据压缩方法

矢量数据压缩对于GIS数据的存储、网络传输以及在移动设备中的使用都具有重要意义。在此通过对曲线矢量数据特点的分析,提出基于整数小波变换的矢量数据压缩方法。压缩方案包括3个主要流程：矢量数据整型化。曲线矢量数据具有相邻坐标点间坐标值大小差别不大的特点,将坐标点间的差值转换为整型的偏移量,用偏移量表示矢量数据的坐标点,利用整数小波变换处理偏移量序列。实验表明,偏移量序列经过整数小波变换得到的小波系数序列在空间分布上更加集中,适合使用高效的编码压缩方法;对变换后的小波系数进行编码压缩。在此使用模糊C均值聚类字典法编码实现了曲线矢量数据的有损编码。通过实验和其他压缩算法结果的对比,该方法具有压缩比较高,失真小的特点。     

测井数据的实时无损压缩研究和硬件实现

为了实现针对石油测井数据的高效率实时传输,提出了一种基于FPGA的针对测井数据的编码方案,实现了数据的实时无损压缩的存储与转发,有效地提高了数据传输效率.通过对测井数据用不同的压缩方法进行处理,分析比较字典编码(LZW算法)和其他无损压缩算法的特征.结果表明,采用字典编码的方法,压缩率最高,能够达到20%左右,而且该算...     

基于数据相关性的测试数据压缩方法

为了减少测试数据量,提出一种利用数据中大量无关位的特殊相关性进行编码压缩的方法,压缩步骤分两步,先选定参考数据,然后利用相关性将与参考数据兼容的数据块编码为"11",数据互补的数据块编码为"10",弥补了FDR码单一编码的不足.解压结构包括一个与参考数据等长的循环移位寄存器和一个有限状态机,结构简单,与Golomb码和FDR码中需要一个与测试向量等长的循环移位寄存器相比,消耗的硬件资源小.针时ISCAS-89标准电路测试向量集的压缩实验结果表明,该方法可以有效地压缩测试数据.且效果比Golomb码和FDR码更好,硬件开销更小.     

基于流量分析的XML嵌套数据流无损压缩算法

为避免基体的反复压缩操作，提出一种基于流量分析的XML嵌套数据流无损压缩算法。利用GDDStream算法对高相似度的XML嵌套数据流进行聚类分析，并表述成“簇中心(基体)+个体差异量”形式，分解数据流，完成一次基体压缩；仅对差异量进行压缩，极大减少对基体的反复压缩操作；利用改进LZW算法实现XML嵌套数据流无损压缩。实验结果表明，压缩后不仅数据完整性得到了保证，数据量也大幅减少，数据冗余度降低，与压缩前数据相比，压缩后数据未出现变化，说明压缩算法性能较好。     

基于整型小波变换的遥感图像压缩

对给定的遥感图像采用基于“提升”（Lifing)算法的整型小波变换，然后对变换后的小波域图像进行编码。在小波域编码时，采用逐次近似量化和LZ77方法编码。当量化门限较高时，则有用EZW方法直接对小波域上的图像进行编码，当门限较低时，则对EZW编码后的残差信息进行LZ77编码，文章用上述方法实现了遥感图像的无损压缩，提高了图像的压缩效果。     

基于单帧干涉图的无损压缩的研究

受位消减法启发,针对单帧干涉图特点设计一种新的无损压缩方式,并分别采用哈夫曼编码、LZW编码以及算术编码作为新方法的熵编码部分对干涉图进行压缩,比较它们最终的压缩比。经Matlab仿真实验证明,三种编码方式最终取得的压缩比均高于位消减法,其中算术编码的压缩比最高,哈夫曼编码紧随其后,两者均能够取得较位消减法27%及以上的压缩比增长,LZW编码所取得的压缩效果相比前两者一般,不适合用于干涉数据的压缩。     

Wavelet-based lossy-to-lossless ECG compression in a unified vector quantization framework

In a prior work, a wavelet-based vector quantization (VQ) approach was proposed to perform lossy compression of electrocardiogram (ECG) signals. In this paper, we investigate and fix its coding inefficiency problem in lossless compression and extend it to allow both lossy and lossless compression in a unified coding framework. The well-known 9/7 filters and 5/3 integer filters are used to implement the wavelet transform (WT) for lossy and lossless compression, respectively. The codebook updating mechanism, originally designed for lossy compression, is modified to allow lossless compression as well. In addition, a new and cost-effective coding strategy is proposed to enhance the coding efficiency of set partitioning in hierarchical tree (SPIHT) at the less significant bit representation of a WT coefficient. ECG records from the MIT/BIH Arrhythmia and European ST-T Databases are selected as test data. In terms of the coding efficiency for lossless compression, experimental results show that the proposed codec improves the direct SPIHT approach and the prior work by about 33% and 26%, respectively.     

一组整数的几个实用编码方案

以Golomb码和扩展Gamma码为基础提出了4种针对一组整数的编码方案。这些方案增强了对低熵值整数序列的压缩性能,同时仍保持了整数码低复杂性的特点。通过应用这些编码方案,设计了一个基于Burrows-Wheeler变换的压缩算法。该算法的实验结果表明其压缩比率要优于采用整数码的BWT类压缩算法。     

Cross residual transform for lossless intra-coding for HEVC

A new lossless intra-coding method based on a cross residual transform is applied to the next generation video coding standard HEVC (High Efficiency Video Coding). HEVC includes a multi-directional spatial prediction method to reduce spatial redundancy by using neighboring pixels as a prediction for the pixels in a block of data to be encoded. In the new lossless intra-coding method, the spatial prediction is performed as pixelwise DPCM but is implemented as block-based manner by using cross residual transform on the HEVC standard. The experimental results show that the new lossless intra-coding method reduces the bit rate of approximately 8.43% in comparison with the lossless-intra coding method in the HEVC standard and the proposed method results in slightly better compression ratio than the JPEG200 lossless coding.     

用整数小波结合改进SPIHT编码实现静止图像无损压缩

无损图像压缩是图像处理中的一个重要领域 ,传统的基于熵编码的无损压缩编码方式存在一定的局限。利用提升算法构造整数小波变换 ,然后针对无损压缩特点 ,对 SPIHT算法加以改进 ,实现了一种可行的图像无损压缩编码方案。实验表明 ,优于传统熵编码和直接采用 SPIHT的无损压缩方法     

A lossless compression algorithm of remote sensing image for space applications

A simple and adaptive lossless compression algorithm is proposed for remote sensing image compression, which includes integer wavelet transform and the Rice entropy coder. By analyzing the probability distribution of integer wavelet transform coefficients and the characteristics of Rice entropy coder, the divide and rule method is used for high-frequency sub-bands and low-frequency one. High-frequency sub-bands are coded by the Rice entropy coder, and low-frequency coefficients are predicted before coding. The role of predictor is to map the low-frequency coefficients into symbols suitable for the entropy coding. Experimental results show that the average Comprcssion Ratio （CR） of our approach is about two, which is close to that of JPEG 2000. The algorithm is simple and easy to be implemented in hardware. Moreover, it has the merits of adaptability, and independent data packet. So the algorithm can adapt to space lossless compression applications.     

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.     

Adaptive lossless coding scheme of lattice vector quantisation

In the process of quantisation, a lattice vector quantiser (LVQ) generates radius and index sequences. In lossless coding, the radius sequence is run-length coded and then Huffman or arithmetic coded, and the index sequence is represented by fixed binary bits. The author has improved the LVQ lossless coding by removing the redundant information between radius sequence and index sequence. An algorithm is developed that redistributes radius and index sequences. The algorithm adaptively shifts down large indices to smaller values and reduces the index bits. Hence, the proposed LVQ lossless coding method reduces the gap between actual coding bit rates and the optimal bit rate boundary. For a Laplacian source the proposed lossless coding scheme achieves more than 10% of bit reduction at bit rates higher than 0.7 bits/sample over the traditional lossless coding method     

MODIS多光谱图像压缩研究

为有效存储MODIS多光谱图像数据,该文提出一种基于谱间预测和整数小波变换的多光谱图像压缩算法.首先通过构造谱间最优预测器去除谱间冗余,再利用整数小波变换和SPIHT算法对预测误差图像去除空间冗余,最后进行自适应算术编码.该方法可实现MODIS多光谱图像的无损、近无损和有损压缩,取得了满意的实验结果;在不同小波基条件下与3D-SPIHT算法比较,表明了该方法的有效性.     

Lossless, near-lossless, and refinement coding of bilevel images

We present general and unified algorithms for lossy/lossless coding of bilevel images. The compression is realized by applying arithmetic coding to conditional probabilities. As in the current JBIG standard the conditioning may be specified by a template. For better compression, the more general free tree may be used. Loss may be introduced in a preprocess on the encoding side to increase compression. The primary algorithm is a rate-distortion controlled greedy flipping of pixels. Though being general, the algorithms are primarily aimed at material containing half-toned images as a supplement to the specialized soft pattern matching techniques that work better for text. Template based refinement coding is applied for lossy-to-lossless refinement. Introducing only a small amount of loss in half-toned test images, compression is increased by up to a factor of four compared with JBIG. Lossy, lossless, and refinement decoding speed and lossless encoding speed are less than a factor of two slower than JBIG. The (de)coding method is proposed as part of JBIG2, an emerging international standard for lossless/lossy compression of bilevel images.     

Four-dimensional matrix Walsh transform for lossless compression of color video

This article presents a coding method for the lossless compression of color video.In the proposed method,four-dimensional matrix Walsh transform(4D-M-Walsh-T)is used for color video coding.The whole n frames of a color video sequence are divided into '3D-blocks' which are image width(row component),image height(column component),image width(vertical component)in a color video sequence,and adjacency(depth component)of n frames(Y,U or V)of the video sequence.Similar to the method of 2D-Walsh transform,4D-M-Walsh-T is 4D sub-matrices,and the size of each sub-matrix is n.The method can fully utilize correlations to encode for lossless compression and reduce the redundancy of color video,such as adjacent pixels in one frame or different frames of a video at the same time.Experimental results show that the proposed method can achieve higher lossless compression ratio(CR)for the color video sequence.