SL0MatlabCode

霍夫曼编码的C++实现，含word详细叙述文档，详细注释。(Huffman coding C++ to achieve, including the word detailed description of the documents, detailed notes.)

fsw data compressin in matlab

pqmagic pro script,PQMagic 脚本说明.(pqmagic pro script!!!!!!!!!!!)

抽象类和借口的区别抽象类和借口的区别抽象类和借口的区别(English Version)

说明：  一篇关于压缩感知的经典文章，压缩感知（Compressed sensing，简称CS，也称为Compressive sampling)理论异于近代奈奎斯特采样定理，它指出：利用随机观测矩阵可以把一个稀疏或可压缩的高维信号投影到低维空间上，然后再利用这些少量的投影通过解一个优化问题就可以以高概率重构原始稀疏信号，并且证明了这样的随机投影包含了原始稀疏信号的足够信息。(A classic article on compressed sensing, compressive sensing (Compressed sensing, referred to as CS, also known as Compressive sampling) different from the modern theory of the Nyquist sampling theorem, which states: the use of a random measurement matrix can be sparse or compressible high-dimensional signal projected to low dimensional space, and then use a small amount of projection by solving an optimization problem to be sparse with high probability to reconstruct the original signal, and prove that random projection of the original sparse signal contains enough information.)

说明：  这是相关编码的标准和实现，是密码学的和数据压缩的基础。(This is the relevant coding standards and implementation, is cryptography and data compression basis.)

说明：  java对GZIP的压缩格式提供了直接支持，可以方便的实现GZIP压缩与解压(right GZIP compression format provides direct support to facilitate the realization of GZIP Compression and Decompression)

1一种剪切波域的稀疏分量分析方法.pdf(1.A sparse component analysis of shear wave field )

Codes". Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.

完整的SNIC的算法，可直接运行，无需其他操作(SNIC algorithm, can run directly)