登录
首页 » matlab » steepest1111

steepest1111

于 2007-05-27 发布 文件大小:1KB
0 105
下载积分: 1 下载次数: 85

代码说明:

  一个最速下降法源码,很有用,需要的赶快下。(a steepest descent algorithm source code, useful, it needs quickly under.)

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

发表评论

0 个回复

  • knn
    knn 方法为k均值聚类用于数据点的分类(KNN method for k-means clustering for the classification of data points)
    2008-05-06 11:57:40下载
    积分:1
  • kpca_azaaza
    kpca 基于核主成分分析的源程序,有注释,希望对大家有帮助!(kpca based on kernel principal component analysis, source code, there are comments, want to help you!)
    2010-02-25 15:07:11下载
    积分:1
  • OFDM-basedsystemdesignandsimulation
    基于matlab的OFDM系统设计与仿真(Matlab for OFDM-based system design and simulation)
    2010-05-26 22:30:52下载
    积分:1
  • Astar2
    最经典的ASTAR算法 很实用的 学机器人的可以进(The most classic ASTAR algorithm very practical learning robot can enter)
    2012-11-23 20:30:44下载
    积分:1
  • UPF
    无迹卡尔曼粒子滤波,有效的估计状态,ZHENHAO YONG(An unscented Calman particle filter is used to estimate the state effectively)
    2017-06-26 10:25:41下载
    积分:1
  • KalmFilter
    卡尔曼滤波是一种高效率的递归滤波器(自回归滤波器), 它能够从一系列的不完全包含噪声的测量中,估计动态系统的状态。(Kalman filter is an efficient recursive filter (autoregressive filter), it can not completely contain from a series of noise measurements, the estimated dynamical systems.)
    2010-12-27 22:50:27下载
    积分:1
  • jietitu
    说明:  阶梯图绘制的MATLAB程序。需要的来下载。(MATLAB step of mapping procedures. Need to download.)
    2009-08-02 17:56:26下载
    积分:1
  • power_singlephaseASM
    power_singlephaseASM.rar,功率电子领域matlab仿真文件,已经验证过,程序运行正常(power_singlephaseASM.rar,Power electronics field matlab simulation file, has already been verified, the normal operating procedures)
    2013-07-14 12:35:48下载
    积分:1
  • MATLABSchrodinger-equation-
    用来解薛定谔方程的很好的代码,可以解氢原子及类似的原子的本征能谱(Solution of the Schrodinger equation for a good code, and similar solutions of hydrogen atoms in the intrinsic spectrum)
    2011-08-02 21:09:18下载
    积分:1
  • houghcircle
    Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.
    2011-11-18 02:09:58下载
    积分:1
  • 696518资源总数
  • 104384会员总数
  • 26今日下载