GM

qu elle que exemple de traitement d image pour s exercer

用matlab来做随机模糊模拟的计算，清华刘宝锭《不确定理论》中的算例(Calculated using matlab to do a random fuzzy simulation, Qinghua Liu ingot "Uncertainty Theory" in the numerical example)

实现图像的对数极坐标变换，具有旋转不变性，可用于数字水印的抗几何攻击(achieving the right number of images Polar transform, with a rotating invariance, the digital watermark can be used against geometric attack)

这个程序是用在LDPC加EM中的，自己编的有很好的性能，用来估计依稀未知的参数，比如相偏频偏之类的(This procedure is used in LDPC EM in Canada, his series have good performance, used to estimate the unknown parameters vaguely, such as phase offset of the class of partial)

说明：  传统的脉搏血氧R值提取大多采用脉搏波的峰谷值法.一个脉搏周期的峰谷值往往不能反映真实的R值，因此通常采用多个周期峰谷值的平均来提高R值的精度。提供了移动平均算法进行脉搏血氧信号特征值提取源码。(Traditional pulse oximetry R value extraction most of the peak value of the pulse wave method. A peak value of pulse cycles often do not reflect the true R value, usually more than one cycle, the average of the peak value to improve the accuracy of the R value. Moving average algorithm to extract the source pulse oximeter signal eigenvalue.)

说明：  迭代法 最简单的方法求取一个阈值 用来分割图像(Iteration threshold method)

Cultural Algorithms similation (Cultural Algorithms similation)

说明：  齿轮传动simulink仿真内含行星齿轮传动在一定负载下的仿真模型(You can model the effects of heat flow and temperature change through an optional thermal conserving port. By default, the thermal port is hidden. To expose the thermal port, right-click the block in your model and, from the context menu, select Simscape > Block choices. Select a variant that includes a thermal port. Specify the associated thermal parameters for the component.)

vc与matlab联合编程实现圆环渐变功能(vc joint programming and implementation matlab functions Gradient Circle)

这是一个关于商人visit许多城市，怎样走法才能使距离最短的例子，采样的了退火算法的经典案例(Traveling Salesman Problem (TSP) has been an interesting problem for a l me in classical optimization techniques which are based on linear and nonlin ogramming. TSP can be described as follows: Given a numberof cities to v d their distances from all other cities know, an optimal travel route has to und so that each city is visited one and only once with the least possible dista aveled. This is a simple problem with handful of cities but becomes complica the number increases.)