zuihoude

Symmetricdivergingbipolar cold-neutral-hot colormapة

实例：曲线标记 实例:修改曲型 内容很不错!对于做曲线相关的同学!可以借用看看!(Examples: examples of curves tags: Curved modify the content is pretty good! Make curves relevant for students! Can borrow to see!)

Stop function Unpacked in UPX The program will not be able to decompress. After using this program

三电平svpwm算法的simulink模型仿真(svpwm 3level)

说明：  旅行商问题，解决经过多个城市的最短距离。(MATLAB)

EOF时空分解源代码，详细细节和注释，一看就懂，基于matlab(EOF temporal decomposition source code, further details and comments, one can understand, based on matlab)

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.)

图象的消噪,图象的压缩,图象的融合,图象的增强(Image Denoising, image compression, image integration, enhanced image)

PSO-ACO-TSP算法，解决旅行商问题，结合PSO和ACO算法(PSO- ACO- TSP algorithm to solve the traveling salesman problem, and with PSO and ACO Algorithm)

StandardCell Placement Tool Using Graph Theory