登录
首页 » matlab » EasyKrig3.0

EasyKrig3.0

于 2009-08-18 发布 文件大小:495KB
0 100
下载积分: 1 下载次数: 19

代码说明:

  Usage: yi=akimai(x,y,xi) Given vectors x and y (of the same length) and the array xi at which to interpolate, fits piecewise cubic polynomials and returns the interpolated values yi at xi. Ref. : Hiroshi Akima, Journal of the ACM, Vol. 17, No. 4, October 1970, pages 589-602. Programmer: N. Shamsundar, University of Houston, 6/2002 Correction to lines 32-33, 9/2004, motivated by Gilford Ward, to make routine work correctly for linear data. Notes: Use only for precise data, as the fitted curve passes through the given points exactly. This routine is useful for plotting a pleasingly smooth curve through a few given points for purposes of plotting.

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

发表评论

0 个回复

  • TelecommunicationCircuitDesign
    Telecommunication related material
    2011-01-06 01:40:30下载
    积分:1
  • errorcodes
    error codes for elm 327
    2010-03-19 12:22:16下载
    积分:1
  • MSS-master
    说明:  MSS-Toolbox for simulations about underwater vehicles
    2020-08-23 23:58:17下载
    积分:1
  • create3DLookUpTable
    Creates a 3D look table for a given size and width
    2011-01-20 08:02:50下载
    积分:1
  • picture
    利用matlab归一化算法提取边缘后配准目标图像,并能框出目标物(get edge )
    2014-11-27 20:14:25下载
    积分:1
  • 16QAM
    说明:  实现16QAM的算法程序,包含在白噪声信道条件下的性能实现程序(achieve 16QAM algorithm procedures contained in the white noise channel conditions of the performance of procedures)
    2020-09-17 21:17:54下载
    积分:1
  • 3D-ESPRIT-Scattering-Centers-
    一种基于3D_ESPRIT的散射中心参数估计算法_温晓杨(A 3D-ESPRIT Method for Radar Target Scattering Centers Parameters Estimation)
    2013-09-22 14:37:19下载
    积分:1
  • nnd3hopc_883707972
    神经计算,本代码主要介绍BP神经算法的主要步骤,非常简单有很明了,非常适合阅读 (Neural computing, the main source of the main steps of BP algorithm is very simple, very clear, very suitable for reading)
    2015-04-20 09:53:19下载
    积分: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
  • RNN_LSTM-master
    description de code RNN LSTM
    2021-04-13 16:18:56下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载