DCT离散余弦变换编码和解码，利用vc对bmp图像实行变换，可以对变换和恢复后的结果进行保存和观看比较结果...

通过学习，理解继承热性的用法，程序中通过直线和点之间的继承特性进行演示了。-Through the study, understanding the usage of heat inherited the program through the succession between the lines and points, demonstrate the properties.

ZPAV (H265) is audio-visual codec protocol, very different from H264/MPEG4, ZPAV (H265) basic algorithm is wavelets, SPIHT, BSW, MMW, ...... ZPAV (H265) 是 音视频 压缩解压 协议，非常不同于H264/MPEG4， ZPAV (H265) 的基本算法 是 小波，多级树集合群，广义小波，数学形态小波，...... -ZPAV (H265) is audio-visual codec protocol, very different from H264/MPEG4, ZPAV (H265) basic algorithm is wavelets, SPIHT, BSW, MMW, ...... ZPAV (H265) are audio and video compression decompression agreement very different H264/MPEG4, ZPAV (H265) the basic algorithm are wavelet, multi-level tree collection groups, generalized wavelets, mathematical morphology wavelet ,......

Class in Visual Basic for ZIP / unzip a file-Class in Visual Basic for ZIP/unzip a file

基于wavelet和bandelet的spiht图像压缩！-And wavelet-based image compression spiht the bandelet!

最新h.264 c++原型代码。请解压到固定目录下，目录中有编译说明。-latest h.264 c prototype code. Please extract fixed directory and compile a directory shows.

迷你虚拟光驱，才470KB，不必安装解压运行即可-mini virtual drive, only 470KB without decompression operation can be installed

针对图形的Vector Quantization压缩算法 -Vector Quantization Compression Algorithm for picture

霍夫曼编码是可变字长编码(VLC)的一种，是消除编码冗余最常用的方法。 它是Huffman于1952年提出一种编码方法，它的基本原理是频繁使用的数据用较短的代码代替，较少使用的数据用较长的代码代替，每个数据的代码个不相同。有时称之为最佳编码，一般就叫作Huffman编码。下面引证一个定理，该定理保证了按字符出现概率分配码长，可使平均码长最短。-Huffman coding is a variable word length coding (VLC) A is to remove redundant code of the most commonly used methods. It is Huffman in 1952 made a coding method, and its basic tenets are frequently used data with the code instead of a shorter, less use of the data over a longer period instead of the code, the code for each data-not the same. Sometimes referred to as the best coding, the general called on Huffman coding. Below prove a theorem, the theorem guarantees by the characters emerging probability distribution yards long, will enable the shortest average yards long.

In each step the LZSS algorithm sends either a character or a pair. Among these, perhaps character "e" appears more frequently than "x", and a pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.-In each step the LZSS algorithm sends either a character or a lt;position, lengthgt; pair. Among these, perhaps character "e" appears more frequently than "x", and a lt;position, lengthgt; pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adap

这是分行用于图像压缩的经典的程序,在正常的情况下可达到7:1左右的压缩比.-This is a branch for the classic image compression procedures, in normal circumstances can reach about 7:1 compression ratio.