登录
首页 » matlab » CWT2

CWT2

于 2012-04-16 发布 文件大小:2KB
0 266
下载积分: 1 下载次数: 27

代码说明:

  SAR图像二维小波gabor变换,读取SAR图像,并进行Gabor变换,求得最大值和次最大值(Gabor two-dimensional wavelet transform for SAR image.read the SAR image, and the Gabor transform to obtain the maximum and times the maximum)

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

发表评论

0 个回复

  • guide_nero_network_precedure_matlab
    说明:   matlab 神经网络使用指南,内容很具体,希望对大家有所帮助(guide for nn precedure used in matlab)
    2010-03-28 19:08:16下载
    积分:1
  • hn
    说明:  This file usesd Hopfield network to store patterns and to recall the full patterns based on partial input.
    2012-10-04 12:51:10下载
    积分:1
  • direction-in-degree
    Estimation of direction in degree for doa study
    2014-01-05 23:47:10下载
    积分:1
  • Nominalstress1
    名义应力发估算疲劳循环次数,希望对你有所帮助,共同学习探讨(Nominal stress to estimates fatigue life cycles)
    2012-03-29 16:41:31下载
    积分:1
  • BCGSFFT_PlaneW_TM_ST
    program about cgfft in matlab. it can help you in mom simulations. cgfft is a way of calculating mom. and minimizing error.
    2013-01-27 06:45:34下载
    积分:1
  • xiaobo7wavelet
    用小波函数进行分解与重构信号,通过重构信号在进行基音检测的运算(Wavelet function decomposition and reconstruction signal through the reconstructed signal during operation pitch detection)
    2013-05-22 14:31:35下载
    积分:1
  • SuperResolutionEx
    说明:  Simple super resolution algorithm
    2020-04-27 03:25:49下载
    积分:1
  • Newton
    说明:  用牛顿下山法求解方程:下山因子在计算过程中可以变动,一般选择下山因子时从1开始,逐次将减半进行试算,直到能使下降条件成立为止。若当计算到某步时取不到满足要求的值(或值小到无法容忍),这时称“下山失败”,需要另取初值重新算起。(Descent method with Newton' s equation: down factor in the calculation process can change, usually selected from the 1 start down factor, will be halved for successive spreadsheet until the can down the conditions established. If when calculating the time to take a step not meet the requirements of the value (or values ??too small to tolerate), then the &quot down failed&quot , you need an alternative initial re-counting.)
    2011-03-16 16:54:30下载
    积分:1
  • SIMULATED-ANNEALING-
    这是一个关于商人visit许多城市,怎样走法才能使距离最短的例子,采样的了退火算法的经典案例(Traveling Salesman Problem (TSP) has been an interesting problem for a l me in classical optimization techniques which are based on linear and nonlin ogramming. TSP can be described as follows: Given a numberof cities to v d their distances from all other cities know, an optimal travel route has to und so that each city is visited one and only once with the least possible dista aveled. This is a simple problem with handful of cities but becomes complica the number increases.)
    2013-12-15 03:26:30下载
    积分:1
  • inpudlg_inv
    input dlg with more columns
    2010-12-03 00:21:09下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载