iru

极大似然估计法用于系统模型辨识，需要构造一个以观测数据和未知参数为自变量的似然函数。(Maximum likelihood estimation method for system model identification, the need to construct a likelihood function as independent variables to the observed data and the unknown parameters.)

枝切法matlab原始代码,内有详细的代码，帮助新手了解相位解缠的算法。(Branch-cut method matlab source code, a detailed code to help the novice to understand the phase unwrapping algorithms.)

简支梁受均布荷载为常数。试用MATLAB编程， 1） 求剪力方程并绘出剪力图 ； 2） 求弯矩方程并绘出弯矩图 ； 3） 求转角方程并绘出转角图 ； 4） 求挠度方程并绘出挠度图 ； (The Charpy by uniformly distributed load is constant. Trial MATLAB programming, 1) and shear equation and draw the shear diagram 2) Find the moment equation and draw the bending moment diagram 3) Find the angular equation and draw the corner Figure 4) Find the deflection equation and draw the deflection diagram )

对输入的图像进行单个像元的阈值分割，以提取出地物信息(The input images of a single pixel threshold segmentation to extract feature information)

matlab用于图形图像处理，小波分析等(a book oabout matlab,which can use operating picture,wavelet,etc)

说明：  二分集CDMA跳频通信子程序,计算2分集CDMA跳频通信系统的误码率(two set points CDMA frequency-hopping communications subroutine to calculate two set points Hopping CDMA communication system BER)

拉格朗日插值法matlab源程序，具有通用性和可扩展性。(Lagrange interpolation matlab source, has the versatility and scalability.)

本程序在matlab下面实现编码和解码，程序注释非常清楚，其中的算法都是常用的，参考的都是S. Lin and D. J. Costello, Error Control Coding, 2nd ed. New York: Prentice Hall, 2004. 这本书上面的算法。(The following matlab program to achieve encoding and decoding, the program notes are very clear, in which algorithms are used, reference is S. Lin and DJ Costello, Error Control Coding, 2nd ed. New York: Prentice Hall, 2004.. This book the above algorithm.)

Along with image stitching and motion direction detection, Phase correlation has important role in detection of copy move forgery.These papers elaborate role of phase correlation in "Copy Move forgery". Soon I will upload running code for this application.

改进的总体经验模态分解,效果不错,欢迎讨论(Improved overall empirical mode decomposition, the effect is good, welcome to discuss)