matlab_sourcecode_part1

matlab tuturial for beginner

一个蚁群算法优化GM模型的程序，相互学习(An ant colony algorithm GM model program, learn from each other)

说明：  用matlab平台实现的拉格朗日插值算法（另附一个插值算法）(Matlab platform with the Lagrange interpolation algorithm (followed by an interpolation algorithm))

对运动估计传统的各个方法，例如全搜索，菱形法，自适应，三步法，四步法，以及它们的几种改进的matlab实现(Motion estimation traditional methods, such as full search, diamond method, adaptive, three-step, four-step, and their several improvements matlab implementation)

关于MATLAB的GUI界面学习。可以从这个程序中学习GUI界面的编程。(About the MATLAB GUI interface to learn.You can learn from this program GUI interface programming.)

蚁群算法、TSP、MATLAB。已经调试通过，算法比较简洁。(Ant colony algorithm, TSP, MATLAB. Has been debugged, the algorithm of relative simplicity.)

本资料涵盖量丰富，关联维，信息量，GP算法，熵等工具箱，并且每种问题采用的方法有好几种，便于比较。其中包含了LORENZ的一些算法。积累了本人一段时间的整理成果。(This information covers the amount of rich, correlation dimension, the amount of information, GP algorithm, entropy and so the toolbox, and the methods used for each question there are several, to facilitate comparison. Which contains a number of algorithms LORENZ. I have accumulated the collation of the results for some time.)

自己写的一个计算空间时频分布的程序，魏格纳威尔分布原代码(Wrote a frequency distribution calculating space program, Wigner distribution of the original code Weir)

自适应滤波器，求解性能误差曲面和等值曲线，最陡下降法和LMS算法的比较，(Adaptive filter, the solution surface and contour error performance curve, the steepest descent method and the LMS algorithm,)

DTW算法的程序，申请两个n*m的矩阵D、d,分别为累积距离和帧匹配距离。这里n和m为测试模版与参考模版的帧数。然后通过一个循环计算两个模版的帧匹配距离d。接下来进行动态规划，为每个格点 （i，j）都计算其三个可能的前续格点的累积距离D1，D2，D3。考虑到边界问题，有些前续格点可能不存在，因此加入一些判断条件最后利用最小值函数min()，找到三个前续格点的累积 距离作为累积距离，与当前帧的匹配距离d（i，j）相加，作为当前格点的累积距离。该计算过程一直达到格点（n，m），并将D（n，m）输出，作为模版匹配的结果。(DTW algorithm procedures, apply two n* m matrix D, d, respectively, accumulated distance and frame matching distance. Where n and m is a reference test pattern and the template frames. Then through a loop to calculate two frames template matching distance d. Next, dynamic programming, for each grid point (i, j) are calculated from the cumulative D1 before the renewal of its three possible lattice point, D2, D3. Taking into account the boundary problem, some former continued grid point may not exist, so add some conditions to determine the final use of the minimum function min (), found three former continued accumulation of grid points cumulative distance as the distance from the current frame to match the d (i, j) added, and a current cumulative distance grid. This calculation has reached the grid (n, m), and D (n, m) output, as a result of template matching.)