登录
首页 » matlab » numberRecognition

numberRecognition

于 2010-05-29 发布 文件大小:225KB
0 258
下载积分: 1 下载次数: 20

代码说明:

  数字识别,用MATLAB编程实现,十分有用(Digital Identification, using MATLAB programming, very helpful)

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

发表评论

0 个回复

  • findpeaks
    matlab新增寻找极值点程序,较老的版本中没有次函数(matlab find new extreme point of procedure, not the older version of the second function)
    2010-07-26 10:58:49下载
    积分:1
  • dikstra
    说明:  dijkstra算法求最短路径及路径标号的matlab实现(dijkstra,shortest path)
    2011-03-31 09:44:57下载
    积分:1
  • KMB
    图论中KMB算法,用于解决加权节点的Steiner树的问题。(KMB graph theory algorithms for solving weighted Steiner tree problem nodes.)
    2015-10-17 20:43:07下载
    积分:1
  • water
    应用ADI方法对海洋原始方程组数值离散,再在理想湖泊的假设前提下,结合物理海洋学,有限差分法,利用MATLAB数学软件,进行三维数值模拟,以期对海洋数值模式做出最基础的实现,并从动力机制上分析,验证其模拟结果的近似准确性。( ADI method is applied to Marine primitive equations, numerical discrete, again under the ideal assumptions of lakes, combining with the physical oceanography, finite difference method, using mathematical software MATLAB, the 3-d numerical simulation of the ocean numerical patterns in order to make the most basic implementation, and from the analysis on dynamic mechanism, simulation results verify its approximation accuracy. )
    2014-09-11 23:41:59下载
    积分:1
  • 9346346
    二维码扫描应用demo,精选ios编程学习源码,很好的参考资料。(Two dimensional bar code scanning application demo, select learning IOS programming source code, a good reference.)
    2013-12-07 10:22:54下载
    积分:1
  • DFIG并网.mdl
    说明:  matlab实现dfig并网,亲测可以运行出结果。(MATLAB realizes DFIG grid connection, and pro-test can run the results.)
    2019-10-03 19:34:23下载
    积分:1
  • wcdma2
    wcdma simulation without rake receiver.
    2010-11-18 16:44:05下载
    积分:1
  • gray
    this expalins gray pridiction algo for localisation method...........................
    2013-09-23 16:24:20下载
    积分:1
  • loss-friss-matlab.tar
    Complete simulation in matlab of loss of a signal, diffraction, Friss, and measure of Fresnell zones
    2010-07-27 23:13:06下载
    积分:1
  • lle
    Locally-Linear Embedding (LLE)[9] was presented at approximately the same time as Isomap. It has several advantages over Isomap, including faster optimization when implemented to take advantage of sparse matrix algorithms, and better results with many problems. LLE also begins by finding a set of the nearest neighbors of each point. It then computes a set of weights for each point that best describe the point as a linear combination of its neighbors. Finally, it uses an eigenvector-based optimization technique to find the low-dimensional embedding of points, such that each point is still described with the same linear combination of its neighbors. LLE tends to handle non-uniform sample densities poorly because there is no fixed unit to prevent the weights from drifting as various regions differ in sample densities. LLE has no internal model.
    2011-01-23 02:12:31下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载