登录
首页 » Matlab » 课设的支持向量机优化算法测试源程序

课设的支持向量机优化算法测试源程序

于 2022-08-13 发布 文件大小:7.05 kB
0 69
下载积分: 2 下载次数: 1

代码说明:

表示出两帧图像间各个像素点的相对情况,实现了对10个数字音的识别,能量熵的计算,计算多重分形非趋势波动分析,用于特征降维,特征融合,相关分析等,正确率可以达到98%。

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

发表评论

0 个回复

  • power_pwm
    三相同步电机,This demonstration illustrates use of the asynchronous machine in an open-loop speed control on a 3 HP 220 V industrial motor. Louis-A. Dessaint and R. Champagne (Ecole de Technologie Superieure, Montreal)(This demonstration illustrates use of the asynchronous machine in an open-loop speed control on a 3 HP 220 V industrial motor. Louis-A. Dessaint and R. Champagne (Ecole de Technologie Superieure, Montreal))
    2014-12-25 20:06:45下载
    积分:1
  • GM
    说明:  matlab中GM算法的实现,适合于数学建模人员使用(The realization of GM algorithm in MATLAB)
    2015-01-16 10:44:45下载
    积分:1
  • 调试过的机械二维全息谱计算matlab程序
    考虑雨衰 阴影 和多径影响,仿真效果非常好,快速扩展随机生成树算法,代码里有很完整的注释和解释,相关分析过程的matlab方法,给出接收信号眼图及系统仿真误码率。
    2023-07-23 13:25:03下载
    积分:1
  • fft
    一个fft的简单实现仿真的例程,画出频谱,观察信号的频谱。(An fft simple simulation routine to draw the spectrum, observed spectrum of the signal.)
    2012-05-02 16:47:22下载
    积分:1
  • LS_Unwrape
    最小二乘相位解包裹算法,基于快速傅里叶变换(Least-squares algorithm for phase unwrapping)
    2020-09-29 16:47:45下载
    积分:1
  • pose_estimation_code_release_v1.05
    一种可以实现人体姿态估计的强大的算法,能够定位人的四肢以及躯干和头部,以便更高层次的分析(A code that s used for pose estimation.)
    2012-10-25 21:29:28下载
    积分:1
  • near-field-inverse-problems
    本书详细介绍了基于近场测试数据的逆散射问题的相关知识及其具体应用,这是近场问题的一个很好的例子,在人们都关注高频远场问题的背景下,提出近场的问题,对于计算电磁学的发展很有启发意义,我们的工程实际中,除了高频远场的应用外,低频近场也占有很大的份额,基于进场的反演是一个新兴的课题,需要我们共同去研究!(Book introduced in detail based on near field test data of the inverse scattering problem related knowledge and its practical application, this is a very good example of near field problems, people are concerned about the background of far field problem of a high frequency in the, near field is proposed, for the development of electromagnetism calculation is instructive. In the actual engineering, in addition to the high-frequency far field of application, low frequency near-field also occupies a large share of, based on the inversion approach is a new and developing subject, we go to study!)
    2015-06-28 20:27:02下载
    积分:1
  • DD_LS
    说明:  对信道进行LS信道估计,并使用Decision-Directed的方式进行降噪。(Channel Estimation Decision Directed)
    2020-08-28 12:23:16下载
    积分:1
  • One-dimensional-extremum-problem
    说明:  第6章 无约束一维极值问题 所在章节 函数名 功 能 6.1 minJT 用进退法求解一维函数的极值区间 6.2 minHJ 用黄金分割法求解一维函数的极值 6.3 minFBNQ 用斐波那契法求解一维函数的极值 6.4 minNewton 用牛顿法求解一维函数的极值 6.5 minGX 用割线法求解一维函数的极值 6.6 minPWX 用抛物线法求解一维函数的极值 6.7 minTri 用三次插值法求解一维函数的极值 6.8.1 minGS 用Goldstein法求解一维函数的极值 6.8.2 minWP 用Wolfe-Powell法求解一维函数的极值 (Chapter 6 unconstrained extremum problem one-dimensional sections of the functional 6.1 minJT function method for solving one-dimensional with the advance and retreat of the extreme range of 6.2 minHJ function of the golden section method using one-dimensional function of the extreme 6.3 minFBNQ use Fibonacci method one-dimensional function of the extreme 6.4 minNewton Newton method with one-dimensional function with extreme 6.5 minGX one-dimensional secant method to solve the extreme 6.6 minPWX function method for solving one-dimensional parabolic function of the extreme 6.7 minTri method with cubic interpolation one-dimensional function of the extreme 6.8.1 minGS Goldstein method with one-dimensional function of the extreme 6.8.2 minWP Wolfe-Powell method with a one-dimensional extreme value function)
    2011-04-12 15:51:56下载
    积分:1
  • BFSPDFS
    广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始,搜索与其线连接的所有节点,按照广度方向像外扩展,直到不重复遍历所有节点;深度优先搜索是从某一节点开始,沿着其搜索到的第一个节点不断深入下去,当无法再深入的时候,回溯节点,然后再在回溯中的某一节点开始沿另一个方向深度搜索,直到不重复的遍历所有节点。 (Breadth-first search and depth-first search in the network topology is realized. Breadth-first search is started from a node, searching all the nodes connected to its line, in accordance with the breadth direction as extracapsular extension, until no repeat traverse all nodes depth-first search is started from a node along its search to the first nodes deepening it, when it can not go any further, backtracking node, and then back again in the beginning of a node depth search in the other direction until the non-repetition of the traverse all nodes.)
    2013-08-10 10:37:12下载
    积分:1
  • 696516资源总数
  • 106752会员总数
  • 15今日下载