tar原码，不知道有没有用

上载多少才可以下一个啊>-available only following a number ah

This 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" In order to run this example you need to install all these m.files in the same directory and type trialSP at the prompt. Written by Igor Carron http://nuit-blanche.blogspot.com Creative Commons Licence with attribution- 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" In order to run this example you need to install all these m.files in the same directory and type trialSP at the prompt. Written by Igor Carron http://nuit-blanche.blogspot.com Creative Commons Licence with attribution

ZPAV (H.265) is audio-visual codec protocol, very different from H264/MPEG4, ZPAV (H.265) basic algorithm is wavelets, SPIHT, BSW, MMW, ...... ZPAV (H.265) basic algorithm : 1, analysis/synthesis : wavelets 2, denoise : GCV (generalized cross validation) 3, bit-rate controller : entropic bit-rate controller 4, quantizer : entropic quantizer 5, DC/AC : NDLD (near-domain lower dimension) 6, MV/QP codec : BSW (generalized (broad-sense) wavelets) 7, bitplanes codec : SPIHT, EZW, MMW (mathematical morphological wavelets), BPLD (bitplanes lower dimension) 8, bitstreams codec : arithmetic, entropy 9, motion estimate : MBOD (macro block optimal decision), MVP (motion vector prediction) A, motion search : EPZS, diamond(normal, advance, small), square B, post process : low_pass, default, dering filter .

It reads the bitmap image and displays it.

huffman codding: codding based opn huffman method

matlab program for finding PSNR

实现Huffman编码统计压缩算法，并对自定义文件进行压缩和解压。实现了vc界面，不错的程序。-achieve statistical compression algorithm, as well as from the definition files for compression and decompression. To achieve the vc interface, good procedures.

地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第i个城市与第j个城市相邻，则metro[i][j]=1,否则metro[i][j]=0。 算法：按照编号从小到大的顺序检查每个城市，对每个城市从1到4使用4种颜色着色，若当前颜色可用（即不与相邻城市颜色相同），则着色；否则测试下一种颜色。 -Map coloring to each city on the map as a point of abstraction, and to every city number, adjacent lines to connect between cities. Accordingly to make adjacency matrix, if the section i and section j cities adjacent cities, the metro [i] [j] = 1, otherwise the metro [i] [j] = 0. Algorithm: In accordance with the code sequence from small to large checks every city, every city on 1-4 from the use of four kinds of color shading, color can be used if the current (ie not with the same colors as the neighboring cities), then coloring Otherwise, the next test colors.

JPEG2000 ADI BLACKFIN 压缩解压程序-JPEG2000 ADI BLACKFIN compression decompression procedures

一个文件压缩打包库的源代码-a compression packing for the source code