登录
首页 » matlab » chengxu

chengxu

于 2009-03-18 发布 文件大小:4KB
0 189
下载积分: 1 下载次数: 11

代码说明:

  用MATLAB开发的BP算法源程序,对你或许有所帮助。(Developed using MATLAB source BP algorithm)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • lingo
    数学建模中用lingo来编写程序动态聚类树画法,(Mathematical modeling lingo to write programs using dynamic clustering tree painting,)
    2013-07-16 22:16:31下载
    积分:1
  • SIMPLE-suanfa
    Simple迭代算法模型,可作为模块直接用于需要利用simple迭代的计算(Simple iterative algorithm model, or as a module for the need to use a simple iterative calculation)
    2012-04-07 01:48:18下载
    积分:1
  • avorpp
    说明:  求解四种佐布尼兹方程近似公式的反射系数,比较方便的m文件(reflection of zoepprtize appoximation)
    2009-08-07 16:47:21下载
    积分:1
  • FOCMS
    control of an induction motor
    2011-06-17 02:41:06下载
    积分:1
  • Ackley
    Not mine code, but very usefull!
    2013-10-24 20:38:04下载
    积分:1
  • newton
    牛顿法,用于优化求解,在图像优化求解,在点散射目标的仿真 (newton)
    2010-12-04 12:19:24下载
    积分:1
  • ABCoptimization_0.13.11_3
    abc algorithm optimization program considered all the parameter....
    2015-01-04 14:08:14下载
    积分:1
  • 6803
    关于LTC6803的相关资料和实例程序,包括1234几种类型,希望有帮助,大家一起探讨(About LTC6803 relevant information and examples of procedures, want to help, you can contact incomplete information, we explore together)
    2014-01-22 17:25:23下载
    积分: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
  • fisher
    Fisher线性判别验证程序,以简单二分类为例说明的(Fisher linear discriminant validation process, a simple classification as an example)
    2012-06-22 00:26:47下载
    积分:1
  • 696518资源总数
  • 106227会员总数
  • 11今日下载