-
ACO_Hamilton1
可以实现任何一个哈密顿图的最短路径，从而可以方便的计算出最短路径，获得更大的经济效益(Can achieve any of the shortest Hamiltonian path, which can easily calculate the shortest path to greater economic efficiency)
- 2010-07-14 16:19:53下载
- 积分：1
-
A200711-405
本书详细介绍了卡尔曼滤波的原理，并给出部分源码(This book details the principles of Kalman filtering, and gives part of the source)
- 2010-09-17 11:47:36下载
- 积分：1
-
imvectrol5
this is an induction motor vector control model in MATLAB/simulink environment.
- 2009-06-01 21:45:25下载
- 积分：1
-
AdaboostVSsvm
说明： 一篇关于SVM和adaboost算法对比的文章。分别运用两种方法进行目标识别，比较算法与结果(A comparison on the SVM algorithm and adaboost article. Two methods were used for target identification, comparison algorithm and results)
- 2011-03-28 08:58:25下载
- 积分：1
-
jpeg_qtable
創建 JPEG quantization table(JPEG quantization table)
- 2012-11-13 19:50:05下载
- 积分：1
-
BSC_Viterbi_M-File
这是一个（2.1.3）卷积码编码、BSC信道传输、Viterbi译码组成的程序合集，运行main.m即可得到仿真结果(This is a (2.1.3) convolutional code, Viterbi decoding, BSC channel transmission is composed of collection procedures, running main.m can be obtained by the simulation results)
- 2015-03-19 10:45:36下载
- 积分：1
-
base-to-Matlab-dsp
MATLAB程序关于数字信号处理的算法实现(MATLAB program on digital signal processing algorithm)
- 2007-09-28 15:54:58下载
- 积分：1
-
matlab
灰关联上的源代码，主要用于计算机使用，便于计算者进行灰关联计算。(matlab)
- 2009-03-14 10:30:24下载
- 积分：1
-
DOAtwodimesion
二维DOA估计,文件不是很长，还是比较好用的，希望能对大家有所帮助(use for two-dimension DOA estimate.)
- 2010-05-10 20:59:07下载
- 积分：1
-
DTW
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.)
- 2014-05-05 14:30:21下载
- 积分：1
