登录
首页 » matlab » sift-0[1].9.19.tar

sift-0[1].9.19.tar

于 2010-04-16 发布 文件大小:2964KB
0 210
下载积分: 1 下载次数: 0

代码说明:

说明:   尺度不变特征转换(Scale-invariant feature transform 或 SIFT)(Scale Invariant Feature Transform (Scale-invariant feature transform, or SIFT))

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

发表评论

0 个回复

  • matlabABCbianjie
    MATLAB在ABC边界上的FDTD程序仿真程序。(MATLAB in the ABC program on the border FDTD simulation program.)
    2009-04-19 16:24:48下载
    积分:1
  • -variador-casero-d
    manual para el diseñ o e implementacion de un variador de frecuencia casero y sencillo de bajo costo
    2015-03-26 17:20:34下载
    积分:1
  • Gray-relational-analysis
    利用灰关联分析模型判断初始序列与比较矩阵的相关关系,最后是以邓氏灰关联度的大小来判断的。(The use of gray relational analysis model to determine the initial sequence and comparison of the correlation between the matrix, the last of the Tang is gray relational grade to determine the size of the.)
    2009-07-15 20:48:28下载
    积分:1
  • PSK-Simulation
    Phase shift keying simulation
    2012-05-14 23:27:12下载
    积分:1
  • 518854-BandLanczosMethod.f90
    lanczos算法 计算矩阵特征值 说明要这么长干嘛,说清楚就好了啊(lanczos algorithm for eigvalue)
    2009-10-30 11:22:18下载
    积分:1
  • BCI_hw4
    brain computer interface matlab code
    2010-11-22 08:51:57下载
    积分:1
  • fastica
    FastICA算法,又称固定点(Fixed-Point)算法,是由芬兰赫尔辛基大学Hyvä rinen等人提出来的。是一种快速寻优迭代算法,与普通的神经网络算法不同的是这种算法采用了批处理的方式,即在每一步迭代中有大量的样本数据参与运算。(FastICA algorithm, also known as fixed-point (Fixed-Point) algorithm, University of Helsinki, Finland by Hyvä rinen et al put forward. Is a fast iterative optimization algorithm, with the ordinary neural network algorithm is different from the algorithm used in batch mode, that is, in every iteration step in a large number of samples involved in computing the data.)
    2009-05-15 22:02:08下载
    积分:1
  • TowersOfHanoi
    matlab source code tower of hanoi!! good luck!
    2013-12-08 16:51:31下载
    积分:1
  • 2. 霍尔顿(Halton)序列
    说明:  2.霍尔顿(Halton)序列,matlab产生拟随机数(Halton sequence, matlab produces quasi random number)
    2020-12-07 21:58:04下载
    积分:1
  • t1
    说明:  在N=128时采用次优化迭代算法的PTS法与普通PTS法的PAPR性能比较。仿真参数:QPSK调制,V=4,P=4,取 。从程序的运行时间可知,采用次优化迭代算法,PTS法的复杂性可以大大降低。(In the N = 128 used sub-optimal iterative algorithm method and the general PTS PTS PAPR performance comparison method. Simulation parameters: QPSK modulation, V = 4, P = 4, to take. We can see from the program' s running time, using sub-optimal iterative algorithm, PTS method can greatly reduce the complexity.)
    2011-05-26 16:38:34下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载