登录
首页 » matlab » matlab

matlab

于 2012-09-05 发布 文件大小:2039KB
0 164
下载积分: 1 下载次数: 3

代码说明:

  这是MATLAB的经典课件,每个PPT都详细的讲解了MATLAB的各方面内容,是优秀的入门教材(This is a classic courseware MATLAB, each PPT are detailed explanations of the various aspects of the MATLAB is an excellent introductory textbook)

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

发表评论

0 个回复

  • Basic-Segmentation
    Segmentation methodes en matlab
    2010-05-26 22:30:30下载
    积分:1
  • MammEnhan
    Mammogram Enhancement
    2010-10-21 18:16:05下载
    积分:1
  • RBFNet
    利用神经网络进行台风分类的matlab程序,主要将台风分成三个阶段。(Using neural network the typhoon classification Matlab program, the main typhoon is divided into three stages.)
    2012-04-09 20:59:01下载
    积分:1
  • OFDM_Simulation_Using_Matlab
    OFDMsimulink技术的分析模拟仿真,适合研究OFDM技术的人群,比如毕业设计(OFDMsimulink technology analysis simulation, appropriate to study the crowd OFDM technology, such as the graduation project)
    2008-05-26 19:42:48下载
    积分:1
  • glmlab
    说明:  这是一个关于广义线性模型的matlab代码,里面有说明。(glmlab is a set of m-files for using MATLAB for analysing generalised linear models. )
    2010-04-12 20:24:12下载
    积分:1
  • kalman-matlab
    扩展卡尔曼滤波算法的matlab,很好用的(malman ,it is very good 。)
    2011-06-25 11:01:43下载
    积分:1
  • 3DFRFT
    三维的分数阶傅立叶变换,用于非平稳信号处理(the 3D Fractional Fourier Transform)
    2013-11-07 20:19:42下载
    积分:1
  • srplems
    This function uses SRP-PHAT with Stochastic Region Contraction (SRC) global-optimization algorithm to locate a single source using a frame of data and M microphones.
    2010-06-03 11:24: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
  • Constructing a Surrogate
    说明:  基于代理模型的工程设计:实用指南Constructing a Surrogate(Constructing a Surrogate)
    2020-08-03 15:06:36下载
    积分:1
  • 696516资源总数
  • 106409会员总数
  • 8今日下载