Speed-up fractal image compression with a fuzzy classifier

This paper presents a fractal image compression scheme incorporated with a fuzzy classifier that is optimized by a genetic algorithm. The fractal image compression scheme requires to find matching range blocks to domain blocks from all the possible division of an image into subblocks. With suitable classification of the subblocks by a fuzzy classifier we can reduce the search time for this matching process so as to speedup the encoding process in the scheme. Implementation results show that by introducing three image classes and using fuzzy classifier optimized by a genetic algorithm the encoding process can be speedup by about 40% of an unclassified encoding system.     

离散效应存在时孤子脉冲的增强压缩

在群速度不匹配的条件下，提出一种提高孤子脉冲压缩效应的新方法．研究表明，若使信号脉冲与泵浦脉冲存在一适当的初始延时，则不但可以提高离散效应单独存在时信号脉冲的压缩比，而且可以提高孤子脉冲的压缩质量．     

Diagnostic Data Compression Techniques for Embedded Memories with Built-In Self-Test

A system-on-chip (SOC) usually consists of many memory cores with different sizes and functionality, and they typically represent a significant portion of the SOC and therefore dominate its yield. Diagnostics for yield enhancement of the memory cores thus is a very important issue. In this paper we present two data compression techniques that can be used to speed up the transmission of diagnostic data from the embedded RAM built-in self-test (BIST) circuit that has diagnostic support to the external tester. The proposed syndrome-accumulation approach compresses the faulty-cell address and March syndrome to about 28% of the original size on average under the March-17N diagnostic test algorithm. The key component of the compressor is a novel syndrome-accumulation circuit, which can be realized by a content-addressable memory. Experimental results show that the area overhead is about 0.9% for a 1Mb SRAM with 164 faults. A tree-based compression technique for word-oriented memories is also presented. By using a simplified Huffman coding scheme and partitioning each 256-bit Hamming syndrome into fixed-size symbols, the average compression ratio (size of original data to that of compressed data) is about 10, assuming 16-bit symbols. Also, the additional hardware to implement the tree-based compressor is very small. The proposed compression techniques effectively reduce the memory diagnosis time as well as the tester storage requirement.     

运用热模拟压缩试验确定精确的金属流动方程

研究分析在用压缩试验确定金属高温塑性流动方程时影响流动应力，应变值精度的主要因素即试样表面摩擦与变形温升，并提出了相应的的修正方法。     

心电图数据压缩技术

本文介绍了在计算机上实现的二种心电图数据压缩方法，并详述了每种压缩法对心电图压缩技术的压缩比、失真度的影响。     

一种基于双正交重叠变换的嵌入式编码算法研究

双正交变换为基于块的低复杂度变换,而且与传统的离散余弦变换相比,一定程度上减小了变换后图像的块效应,因而被采纳入联合图像专家组织JPEG（Joint Photographic Expert Group）最新制定的静态图像编码标准JPEG XR中。为了能够改善其无法实现码流长度控制的缺陷,文章深入研究了JPEG XR的编码技术,提出了一种针对固定压缩比的编码算法。主要思路是通过对双正交变换后的系数进行嵌入式位平面编码,取代了原先的量化步骤,使得压缩码流长度可以精确控制。     

DPCM编码在图像压缩中的应用

DPCM编码（差分脉冲编码调制）是一种线性预测编码。在二维图像中,由于相邻像素间的相关性很强,所以图像数据的冗余度都很大。对于瞬时斜率比较大和传输速度要求比较高的信号场合,为了使相邻像素间的相关性减小,通常采用DPCM编码技术对图像进行压缩。通过MATLAB仿真,表明DPCM编码能有效地对图像进行压缩。     

曲线曲面小波变换的边界连续性保持

现有的小波分解边界连续性保持方法由于将去除的节点全部插回,摒弃了数据压缩特性.为此在曲线小波分解边界处理方面提出2种基于数据压缩的连续性保持方法:一是插入与Cr连续相关的节点,然后调整相应的控制顶点与高分辨曲线的控制顶点保持一致;二是不插入节点,直接调整与Cr连续相关的控制顶点.在曲面方面,提出了曲面分裂法和T曲面法:通过插入重节点把曲面分裂成边界部分和中心部分并对边界部分插入节点,再调整相应的控制顶点与高分辨曲面的重合;构造了T网格,使其边界部分与高分辨曲面一致,中心部分与低分辨曲面一致.最后把T曲面方法推广到周期曲面小波变换边界处理上.实验结果表明,文中方法既保证了小波分解后模型的边界连续,又保留了数据压缩特性.     

Linux下高效存储优化的研究

随着数据的指数性增长,存储技术成为信息产业发展的核心动力,存储系统在一定程度上比计算系统和通信系统更加重要。如何高效地存储和优化存储空间,是存储系统急需解决的问题。本文介绍高效存储技术中的RAID技术、重复数据删除技术、数据压缩技术等,并在Linux环境下设计与实现具有高效存储优化特点的应用程序。试验表明该应用程序实现了软件RAID,删除了重复性数据,提高了存储空间利用率,降低了存储能耗。     

数据库压缩功能实现方法

在VFP开发的应用中利用第三方压缩软件,实现对数据的压缩和解压缩操作。通过WinRAR压缩软件的一般调用方法,编程实现了对选择的任意数据文件进行压缩和解压缩的操作。