这是编解码中运动估计的代码（已经调试通过）对于视频处理初学者很有帮助...

 能够完成基本的压缩与解压缩文件功能  能够一次加入多个文件  能够给出压缩比等信息 -# 61,548 to complete the basic compression and decompression functions# 61,548 documents to a file by adding a number of# 61,548 is given to the compression ratio and other information

SPIHT(多级树集合分裂算法)对图像压缩有很大的推进作用,此为原始代码,进行过仿真,程序结构清晰.-SPIHT (set of multi-level tree splitting algorithm) on the image compression to promote the role of a great, this is the original code, and carried out simulations, program structure clear.

新的RLE压缩算法，在医院MIS中处理US图象时非常有用。-new RLE compression algorithm, in the hospital MIS U.S. image processing will be very useful.

jpg compression and decompression~-jpg compression and decompression ~

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

huffman对英文的编码和解码程序，随便吧-huffman encoding and decoding of the English program, casual bar

baba khodai nemodi maro up kon dige

Convex Hull algorithms

SMC1602字符液晶的显示程序，封装很好，可直接调用-SMC1602 character liquid crystal display process, package well and can be directly called

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.