unzip

263yasuoyuv.rar是把yuv-411格式文件压缩为*.263可直看(263yasuoyuv.rar is yuv-411 format for the*. 263 files can be read straight)

Mpeg1 I Frame to Bitmap (Delphi Source)

CCSDS图像压缩源代码，MATLAB编写处理(CCSDS image compression source code, MATLAB write processing)

一个压缩软件的SDK，有例子！ 请大家尝试！(a packer software sdk)

说明：  使用霍夫曼huffman 編碼方式 對文件進行壓縮 程序很簡單 主要是幫助新人了解霍夫曼編碼的實現方法(The use of Huffman huffman encoding file compression program is very simple principal is to help newcomers understand the Hoffman encoding method)

一系列展示图像压缩技术的源代码。包括有：使用块截断编码的图像压缩(Block Truncation)、基于高斯金字塔变换的图像压缩(Gaussian Pyramids)、基于离散余弦变换对图像压缩(Discrete Cosine Transform)、基于奇异值分解(SVD)的图像压缩(Singular Value Decomposition)。给出的代码还可以用于2D图像噪声消除。(Series show the source code for image compression technology. Include: use of block truncation coding for image compression (Block Truncation), Gaussian pyramid transform based image compression (Gaussian Pyramids), based on the discrete cosine transform image compression (Discrete Cosine Transform), based on singular value decomposition (SVD) image compression (Singular Value Decomposition). The code given 2D image can also be used for noise cancellation.)

CELP (CELl Processing) is a functional programming package for Matlab. It is often better to use FP instead of loops: - it s more compact - it s more clear.

哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)

基于tinyjpeg的jpeg解压缩程序，可解码jpeg数据为YUV分量数据(Based Solutions tinyjpeg jpeg compression program, you can decode jpeg data to YUV component data)

compresive sampling matching pursuit