watershed-a-region-growing

AITKEN S INTERPOLATION Aitken s procedure yields systematically and successively better interpolation polynomials corresponding to successively higher order truncation of Newton s divided difference formula. Given a set of x and corresponding f(x), estimate f1(x1) f1= aitkenInterp(x,f,x1) f = corresponding function of x f1= corresponding function of x1

能够跟踪视频中简单背景下的移动物体。 Matlab运行后有相应界面，先选择视频，然后按“跟踪”键开始处理。(This is able to track moving objects with a simple background. After running the corresponding Matlab interface, the video, then press the track button to begin processing.)

周期信号有效值算法，取半周期进行计算，采用matlab s函数编写(Periodic signal RMS algorithm, take half cycle is calculated using matlab s function)

kalman这个著名模型在图像处理与机器智能方面的应用的一些代码，打包上传了，基于matlab平台开发的。(Tracking the famous model in image processing and machine intelligence and the application of some code, Upload the package, based on the Matlab development platform.)

balanis antenna code part4

数字水印DCT嵌入与提取水印matlab实现实例！(Digital Watermarking DCT watermark embedding and extraction matlab examples realize!)

Spectral analysis of discrete deterministic signals

车牌定位系统的目的在于正确获取整个图像中车牌的区域，并识别出车牌号。(The purpose of plate positioning system to obtain the correct license plate area in the whole image, and brand recognition out of the bus.)

自发辐射、受激辐射和受激吸收,激光二极管抽运的被动调Q Nd3+:YAG微晶片激光器仿真(Spontaneous emission, stimulated emission and stimulated absorption of laser diode pumped passively Q Nd3+: YAG microchip laser simulation)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)