登录
首页 » matlab » 一阶Keystone变换Keystone

一阶Keystone变换Keystone

于 2021-04-19 发布
0 378
下载积分: 1 下载次数: 64

代码说明:

说明:  实现一阶Keystone变换,包含三种方法,分别是DFT+IFFT方法,sinc插值方法和chirp-Z方法(Three algorithms for perform keystone transform, including DFT+IFFT, sinc interpolation and chirp-z transform.)

文件列表:

Keystone\testKeyStone.m, 6925 , 2019-12-30
Keystone, 0 , 2019-12-30

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

发表评论

0 个回复

  • ekf
    EKF-SLAM Simulator This version of the simulator uses global variables for all large objects, such as the state covariance matrix. While bad programming practice, it is a necessary evil for MatLab efficiency, as MatLab has no facility to avoid gratuitous memory allocation and copying when passing (and modifying) variables between functions. With this concession, effort has been made to keep the code as clean and modular as possible.
    2008-03-26 13:04:45下载
    积分:1
  • flatness-and-xinxisha
    自己编写的平坦因子理论以及信息熵的程序,可用于学习和交流(I have written a flat factor theory, and entropy procedure can be used for learning and communication)
    2011-09-03 20:46:05下载
    积分:1
  • LMS_EQ
    In practical implementations, the weighting factors for a MRC system are obtained by deriving a signal which has amplitude proportional to the kth branch carrier amplitude and a phase that LMS equalizer
    2013-04-17 15:17:24下载
    积分:1
  • Qa
    说明:  通过拟合计算Qa,对较多的地理数据分析比较有用(By fitting the calculated Qa, geographic data analysis on more useful)
    2011-01-11 20:01:23下载
    积分:1
  • PV_System
    Incremental Conductance: In the incremental conductance algorithm, we find the derivative of PV output power with respect to output voltage. The dP/dV is evaluated and the algorithm keeps checking this value and changes the duty cycle such that dP/dV=- I/V = 0. This is the point at which maximum power is transferred. If dP/dV is greater than zero, it means the PV is operating to the left of the MPP. If dP/dV is less than zero, it means the PV is operating to the right of the MPP. This method holds an advantage over the perturb and observe method since it is fast and does not oscillate around MPP. However, the method could experience instability due the involvement of the derivative.
    2013-01-08 08:57:53下载
    积分:1
  • Arnold
    上传内容为基于Arnold变换的图像加密和解密程序,作為一般影像處理程序時使用(Upload content for image encryption and decryption program based on Arnold transform image processing program used as a general)
    2015-03-13 14:11:36下载
    积分:1
  • EMDs
    经验模态分解(Empirical Mode Decomposition,EMD)法是美国国家宇航局美籍华人黄锷(N. E. Huang)等人于1998年创造性地提出的一种新型自适应信号时频处理方法,特别适用于非线性非平稳信号的分析处理。(Empirical Mode Decomposition (Empirical Mode Decomposition, EMD) method is a new kind of video processing method adaptive signal NASA Chinese-American yellow E (NE Huang), who in 1998 proposed a creative way, especially for non- Linear analysis and processing non-stationary signals.)
    2015-03-27 00:52:13下载
    积分:1
  • 12344
    基于投影的干扰对齐算法代码,最终达到干扰消除的效果。(Align the projection-based algorithm code interference, and ultimately achieve the effect of interference cancellation.)
    2015-03-27 11:21:18下载
    积分:1
  • MS_SAR_ADC_Sim_ver03_02
    This is a code written in MATLAB for 12-bit SAR ADC simulation
    2016-11-24 19:23:27下载
    积分:1
  • GAforPathPlaning
    说明:  采用栅格对机器人的工作空间进行划分,再利用优化算法对机器人路径优化,是采用智能算法求最优路径的一个经典问题。目前,采用蚁群算法在栅格地图上进行路径优化取得比较好的效果,而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。 利用遗传算法处理栅格地图的机器人路径规划的难点主要包括:1保证路径不间断,2保证路径不穿过障碍。 用遗传算法解决优化问题时的步骤是固定的,就是种群初始化,选择,交叉,变异,适应度计算这样,那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve. The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles. The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)
    2019-05-02 14:56:19下载
    积分:1
  • 696518资源总数
  • 104509会员总数
  • 10今日下载