登录
首页 » matlab » fwdtailieuthamkhaotimevaiantchannels

fwdtailieuthamkhaotimevaiantchannels

于 2011-03-13 发布 文件大小:2038KB
0 88
下载积分: 1 下载次数: 2

代码说明:

  hay lam,,,,,..........................................................

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

发表评论

0 个回复

  • waveletexample1
    说明:  在MATLAB环境下,实现对小波变换信号处理的有关试验(In the MATLAB environment, the realization of wavelet transform signal processing of the pilot)
    2008-10-10 09:58:16下载
    积分:1
  • grady2004faster_code.tar
    说明:  该算法用于图片切割,有详细的源代码和注释。于是希望大家能好好利用(The algorithm used for image cutting, detailed source code and comments. So hope that we can make good use of)
    2010-04-26 08:45:06下载
    积分:1
  • mmbox
    说明:  matlab绘图代码:取得一个Rubberband Box的位置向量(mapping matlab code: get a Rubberband Box location vector)
    2008-11-30 12:41:37下载
    积分:1
  • tftb-0[1].1
    这是一个用matlab语言编写的小波变换的程序,是时频分析的一种,可以在时域和频域内对信号进行分析。(using Matlab language of the wavelet transform procedure is time-frequency analysis of a kind in the time domain and frequency domain analysis of the signal.)
    2006-09-29 14:28:05下载
    积分:1
  • fuzzy
    汽车自动倒车的控制理论主要有神经网络控制、模糊控制等智能控制方法(The auto reversing control theory neural network control, fuzzy control, intelligent control method)
    2013-05-15 20:29:20下载
    积分:1
  • APF_ex1
    说明:  利用MATLAB/silulink搭建有源电力滤波器仿真(Active power filter simulation)
    2019-01-03 16:12:45下载
    积分:1
  • MSSB32
    利用对已知样本的学习,测试,从而对未知样本进行分类!(Study using the known sample, test, and thus to classify the unknown samples!)
    2010-06-28 16:36:31下载
    积分:1
  • string_32
    Most of the string-functions are rather heavily hand-optimized, see especially strsep,strstr,str[c]spn.
    2014-09-08 22:52:14下载
    积分:1
  • CMI-CODES
    CONSTANT MODULE ALGORITHM
    2013-10-11 16:10:14下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载