登录
首页 » matlab » Matlab-handwriting-recognitio

Matlab-handwriting-recognitio

于 2012-06-24 发布 文件大小:155KB
0 233
下载积分: 1 下载次数: 37

代码说明:

  matlab代码实现手写体数字的识别,测试可用,识别率较高(matlab code for handwritten numeral recognition, the test is available, the recognition rate is higher)

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

发表评论

0 个回复

  • intrans
    编写一个可以增强图像的函数,可以使得图像的灰度级转变。(Write a function that can enhance the image, you can make changes in the gray level of the image.)
    2013-09-06 20:31:34下载
    积分:1
  • randlp
    monte_carlo法求解非线性规划,有中文注释,可以参考学习(monte_carlo method for solving nonlinear programming, a Chinese comments, you can refer to learning)
    2011-12-27 21:55:54下载
    积分:1
  • 2008518115818983
    遗传算法Matlab程序。可添加到工具箱的。(Matlab genetic algorithm procedure. Can add to the toolbox.)
    2008-05-24 22:32:10下载
    积分:1
  • buck_boost
    buck_boost电路中电感电容的计算,等效电路的详细的推导过程,及仿真(buck_boost inductor-capacitor circuit in the calculation of the equivalent circuit of the detailed derivation and simulation)
    2020-10-11 08:37:33下载
    积分:1
  • UtilityBasedSchedulingCode
    this program basically implementation of new scheduling algorithm in NS3 for LTE/4G. it is developed in ns3 which is open source platform used cpp.
    2014-11-12 12:43:15下载
    积分:1
  • ModularityWithMef
    一个学习Mef的demo,Modularity with mef(A study of Mef demo ,Modularity with mef )
    2014-12-09 11:30:12下载
    积分:1
  • M=4
    基于matlab的信噪比差错估计 m=4双极性(Matlab error signal to noise ratio is estimated based on m = 4 bipolar)
    2010-12-07 20:57:17下载
    积分:1
  • metodo_relay
    example Method relay. Adaptive control
    2013-07-28 06:28:46下载
    积分:1
  • 基于遗传算法优化EKF算法的SOC估算
    说明:  采用遗传算法对 EKF 中的系统噪声矩阵和测量矩阵的协方差进行在线优化,以实现在模型误差最小时对 SOC 进行在线估计(Genetic algorithm is used to optimize the covariance of system noise matrix and measurement matrix in EKF on-line, so as to realize the on-line estimation of SOC at the minimum model error)
    2020-03-12 12:29:21下载
    积分:1
  • matlab_3_opt
    提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。 bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。 (Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
    2007-09-20 19:35:15下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载