登录
首页 » WORD » Changes_for_Curvelet_retrieval.doc

Changes_for_Curvelet_retrieval.doc

于 2011-06-10 发布 文件大小:4KB
0 243
下载积分: 1 下载次数: 2

代码说明:

  modification for curvelet code running

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

发表评论

0 个回复

  • particle-Filter-Examples
    5个粒子滤波必会实例,其中4个为网页版,有应用介绍(particle Filter Examples)
    2011-06-05 16:22:09下载
    积分:1
  • QPCCP
    a new clustering algorithm source code in MATLAB
    2013-02-20 19:34:47下载
    积分:1
  • adacode
    matlab codes for RLS Algorithm Demo
    2010-12-25 17:31:36下载
    积分:1
  • kalman
    GPS 导航定位系统卡尔曼滤波 假定船舶向某固定方向航行,以港口码头的出发处为坐标原点。 假定船舶在二维平面上运动,初始位置为(-100m,200m),水平运动速度为 2m/s, 垂直方向运动速度为 20m/s,GPS 接收机的扫描周期为 T = 1s,观测噪声的均值 为 1,方差为 100。 采用卡尔曼滤波跟踪船舶航行轨迹。 1、绘出真实轨迹、观测轨迹、滤波后轨迹 2、滤波前误差、滤波后误差(Calman filtering of GPS navigation and positioning system)
    2020-06-26 16:40:01下载
    积分:1
  • HW6_P1sim
    anti-windup scheme example
    2012-04-18 15:23:02下载
    积分:1
  • plltiaopin
    二阶锁相环在输入信号为调频信号是的混沌特性分析(Second-order PLL FM signal in the input signal is Chaotic Characteristic Analysis)
    2013-09-12 21:35:57下载
    积分:1
  • Anfis
    Fuzzy control Design using ANFIS for a power system with svc
    2009-06-03 16:46:06下载
    积分:1
  • MATLAB-analyse
    一本matlab工科入门书籍,特别推荐,附有多个实例(Start a matlab engineering books, especially recommended, with multiple instances)
    2011-05-25 17:04:20下载
    积分:1
  • Untitled
    将采集光纤光栅传感器信号进行加速度标定,积分成速度,并滤波(The collected signals are calibrated, integrated and filtered)
    2017-06-30 10:10:21下载
    积分:1
  • Optimization_Newton
    设r是f(x) = 0的根,选取x0作为r初始近似值,过点(x0,f(x0))做曲线y = f(x)的切线L,L的方程为y = f(x0)+f (x0)(x-x0),求出L与x轴交点的横坐标 x1 = x0-f(x0)/f (x0),称x1为r的一次近似值。过点(x1,f(x1))做曲线y = f(x)的切线,并求该切线与x轴交点的横坐标 x2 = x1-f(x1)/f (x1),称x2为r的二次近似值。重复以上过程,得r的近似值序列,其中x(n+1)=x(n)-f(x(n))/f (x(n)),称为r的n+1次近似值(Let r is f (x) = 0 root, select the initial approximation x0 as the r, over point (x0, f (x0)) to do the curve y = f (x) the tangent L, L the equation y = f ( x0)+ f ' (x0) (x-x0), find the intersection of L and the x-axis of abscissa x1 = x0-f (x0)/f' (x0), x1 is called an approximation r. Through points (x1, f (x1)) to do the curve y = f (x) the tangent, and find the intersection of the tangent with the x-axis of abscissa x2 = x1-f (x1)/f ' (x1), x2 is called r the second approximation. Repeat the process, get an approximation of the sequence r, where x (n+1) = x (n)-f (x (n))/f ' (x (n)), as an approximation of r n+1 times)
    2011-06-21 21:13:09下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载