一个查找文件的源码

经典的LZW算法，转自Mark R. Nelson著名的“Data Compression Book”-classic LZW algorithm, Mark R. Nelson switched from the famous "Data Compression Book"

本程序采用了最简单的方块编码对512×512的lena图像进行了编码.运行程序后可以看出，方块取得越大，图像编码后失真越大。-This procedure uses the most simple code box 512 × 512 on the lena image coding. After running the program we can see that the box to obtain the greater the greater the distortion image is encoded.

对数据进行一些流方面的操作-some of the data flow in operation

dm642上实现H.264的编码，可惜没有解码部分。-dm642 achieve H.264 encoding, decoding Unfortunately no part.

C codes and programming Embedded system

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

linux下的rar软件，安装后linux系统下就可以解压rar以及相关的文件了。-rar under linux software, linux system after installation you can extract the rar and related documents.

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 .

0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

VC++编程，有源代码，使用RLE算法压缩文件，适合压缩解压的初学者-VC++ Programming, source code, the use of RLE algorithm for compressed files, suitable for beginners compression decompression