完美的旋转不变子空间法源程序

说明：  这个代码适用于检测运动目标，基于混合高斯建模的运动目标检测。(this code can help you detection some objects，such as car，people，and so on. which based on mixture of gaussians background model)

说明：  合成孔径雷达的距离多普勒成像算法的源代码，简单易懂，适合新手与初学者。(Distance synthetic aperture radar Doppler imaging algorithm source code, easy to understand for novice and beginners.)

AHP层次分析法计算判断矩阵的最大特征值,小波包分析提取振动信号中的特征频率，线性调频脉冲压缩的Matlab程序。( Calculate the maximum eigenvalue judgment matrix of AHP, Wavelet packet analysis to extract vibration signal characteristic frequency, LFM pulse compression of the Matlab program.)

EM算法求高斯过程的参数,这种算法的计算过程简单，但是准确度不高(EM algorithm for getting the parameters of Gaussian process, this computation is simple, but accuracy is not high)

变学习因子粒子群算法，来自于《精通MATLAB最优化计算》(pso with variant learning factor)

雨流法的matlab程序 可用于疲劳计算，适用于机械和相关行业(Rainflow matlab program can be used for fatigue calculation for machinery and related industries)

用BP网络逼近某曲线函数，在神经网络中邮广泛的应用 是系统辨识的基础。 通过反馈来不断的调整系数，限制了最大循环次数 防止进入死循环，当然如果想要得到更精确的系数可以增大循环次数。 (Using BP network function approximation to a curve, mail is widely used in neural network is the basis of system identification. Through feedback to constantly adjusted factor, limit the maximum cycle times to prevent into dead circulation, and of course if you want to get a more accurate coefficients can increase the cycles.)

猴群算法（MA）是由Zhao和Tang提出的一种新的用于求解大规模、多峰优化问题的智能优化算法.其思想在于通过模拟自然界中猴群爬山过程中爬、望和跳的几个动作，设计了三个搜索过程：爬过程主要用来搜索当前所在位置的局部最优解；望过程主要通过眺望来搜索邻近领域比当前位置更优的解，以便加速最优解的搜寻过程；跳过程的目的在于由当前搜索区域转移到其它区域,以避免搜索过程陷入局部最优(Monkey swarm algorithm (MA) is a new intelligent optimization algorithm proposed by Zhao and Tang for solving large-scale and multi-peak optimization problems. Its idea is to design three search processes by simulating several movements of climbing, looking and jumping of monkeys in nature. The climbing process is mainly used to search the local part of the current location. Optimal solution; Looking process mainly searches for solutions in adjacent areas that are better than the current location by looking over, so as to speed up the search process of the optimal solution; The purpose of jumping process is to shift from the current search area to other areas, so as to avoid the search process falling into local optimum.)

抽象-分割是根据大小、 颜色、 纹理、 强度、 区域、 灰度级图像的分裂的过程。有几种算法的图像分割，但这些只是一般的图像，不像磁共振图像 （MRI） 的医疗图像。在医学领域中它是很难分析脑 MRI 图像，所以该图像的分割方法是非常重要的所以在本白皮书中我们实施了一种新的蚂蚁蚁群优化算法 (ACO) 算法 MRI Image 分割。通过使用蚁群优化算法我们获得更准确的结果相比其他分割算法的 MRI 图像。这种算法遵循用于获取他们的食物蚂蚁的实际工作。搜索食物后蚂蚁使用最短路径到巢从使用信息素痕迹的食物。信息素是一种存放于蚂蚁作为他们旅行和它蒸发一段时间后所以哪个路径有更多的信息素的化学物质这条道路是最短路径，因为许多蚂蚁从该路径只去了，这一概念用在蚁群优化算法。在本文中我们讨论了关于在 Matlab 中此算法的实现。我们比较我们拟议的算法类似进化算法的性能。这种算法跨不同的 MRI 图像集进行测试并显示高速度和准确性。

概率论与数理统计的matlab程序，对于解决概率论的问题很有帮助(Probability Theory and Mathematical Statistics matlab program for solving the problem of probability theory is helpful)