this is matlab jpeg compression based on dct,it is helpful for who embark on jpe...

管理器的相关文件合乎饿合乎 饿暖-management of the relevant documents in line with hungry out hungry and warmer

一个JEPG标准的图像压缩编码算法程序，程序简单有效，有说明。-1 JEPG standard image compression coding algorithm program, the program is simple and effective, there are instructions.

USQ压缩工具, 源码-USQ compression tools, source

conpressive sensing 的MMA新程序- This is an example using the Subspace Pursuit Algorithm of Wei Dai and Olgica Milenkovic "Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity" and the Re-weighted algorithm of Rick Chartrand and Wotao Yin "Iteratively Reweighted Algorithms for Compressive Sensing" In order to run this example you need to install all these m.files in the same directory and type trialSP2 at the prompt. Written by Igor Carron http://nuit-blanche.blogspot.com Creative Commons Licence with attribution

source code for unrar3.3.4,uppack the .rar files,for multi-os

一个解压程序,只要设定了解压路径和解压文件的种类,就可以随意解压-A decompression procedure, as long as the set-extracting file path and extract the type, it can extract

一个C语言实现的压缩解压的工具代码，可以拥有二进制文件的压缩解压-A C language code compression decompression tool, you can have a binary file compression decompression

一个很好的系统设计,详细的说明和精确明了的图说明-A good system design, detailed and accurate understanding of the illustrated

compression with rle algorithm

) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. -) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The