Jpeg_code_decode

This function quickly finds local peaks or valleys (local extrema) in a noisy vector using a user defined magnitude threshold to determine if each peak is significantly larger (or smaller) than the data around it. The problem with the strictly derivative based peak finding algorithms is that if the signal is noisy many spurious peaks are found.

说明：  本系统运用LZ77字典算法、懒惰匹配算法和Huffman编码算法，使用Java语言在Jbuilder2006环境下设计了使用GZIP算法对文件压缩与解压缩的实现程序。用户可以根据自己的需求，使用此程序方便地对文件进行压缩或者解压缩操作。(This system uses LZ77 dictionary algorithm, lazy matching algorithm and Huffman coding algorithm, and uses Java language to design the implementation program of gzip algorithm for file compression and decompression under the environment of JBuilder 2006. Users can use this program to compress or decompress files conveniently according to their own needs.)

实现SPIHT算法!!!!使用MATLAB 实现程序(SPIHT algorithm realize!!!! Realize the use of MATLAB procedures)

说明：  利用哈夫曼树对简单文件进行压缩和解压缩，对数据的压缩集成(Compression and Decompression of Simple Files Using Huffman Tree)

263yasuoyuv.rar是把yuv-411格式文件压缩为*.263可直看(263yasuoyuv.rar is yuv-411 format for the*. 263 files can be read straight)

10杆桁架结构优化程序，使用最新的帝国竞争算法。请求多多加点数！！！(10 bar truss optimization, very powerful source code, using imperilist competition algorithm.)

霍夫曼编码程序 对给定的概率 生成霍夫曼编码 希望大家给点意见(Huffman encoding procedure to generate the probability of a given Huffman code to the point I hope everyone)

实现图像的jpeg无损压缩，可以在linux系统下经过交叉编译器编译后在arm上实现，已经写好makefile文件(Realize jpeg image lossless compression, you can linux system through cross-compiler to compile in the arm to achieve, has written makefile file)

说明：  文件介绍了x264程序的算法流程表，每个函数的内容详细介绍在里面 (Document describes the algorithm flow chart x264 programs, and detailed description of each function in it)

对图像进行斑点噪声的添加，用方程f=f+n*f将乘性噪音添加到图像f上，其中n是均值为零，方差为var的均匀分布的随机噪声。(Image speckle noise addition, the equation f = f+ N* f will be added to the multiplicative noise on the image f, in which n is zero mean, variance var of the uniform distribution for the random noise.)