新的RLE压缩算法，在医院MIS中处理US图象时非常有用。

这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用c语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.我把它改写成了一个c++类,使它可以方便的压缩和解压缩,更重要的是,我新增加了两个接口,这个类可以压缩/解压缩一段内存缓冲区,而不仅仅是文件. 一共提供了5个对外接口: -LZARI algorithm based on the type of data compression. Haruhiko SAP in 1989, July 4 c language daily wrote realization of this algorithm. But above uses some static or global variables, using the MFC which are very convenient. I rewrite it became a c categories, it can convenience compression, but more importantly, I added two new interface, the class can compression/decompression period memory buffer, and not just paper. A total of five external interface :

实现LZARI压缩算法的C++类-LZARI compression algorithm to achieve the category C

x264视频编解码源代码（更新时间2005-12-07，v384），含VC编译指南。x264是H.264标准的一种实现，与JM相比更适合与应用，因为JM主要是与标准更接近，所以便于学习，而x264做了很多的优化。-MPEG video decoder source code (2005-12-07 update time, the v384). Compiling with VC Guide. MPEG H.264 is a standard to achieve, and JM compared with the more suitable application JM is mainly because the standard closer to, easy to learn and do a lot Inc. optimization.

zip算法的源码-zip algorithm source code

基于SDK的图像采集程序-based on the SDK image acquisition procedures

音频文件编码为G729.VS2005编写,已测试-G729.VS2005 encoding audio files to prepare for, have been tested

用数字电位器替代机械式电位器WOSDOFEODF-Digital Potentiometers replace mechanical potentiometers WOSDOFEODF

该程序实现了算术编码的编译码，并得到随机信源的输出码字和编码效率。-The program achieves the encoding and decoding of arithmetic coding, and gets the output code words and coding efficiency of the random sourse.

) 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

tips for develop web content