登录
首页 » matlab » cedif

cedif

于 2010-05-05 发布 文件大小:3KB
0 187
下载积分: 1 下载次数: 1

代码说明:

说明:  相干增强扩散,可用于去噪,去噪的同时可较好的保持边缘特征 (failed to translate)

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

发表评论

0 个回复

  • matlabDatabook
    Matlab Data Book for programming in matlab
    2009-09-15 18:21:20下载
    积分:1
  • MIMO
    BER SNR plot in rayleigh channel with maximal ratio combining technique for MIMO
    2010-10-08 14:42:32下载
    积分:1
  • JPA
    说明:  一个JPA的学习资料。很适合初学者进行学习。对于初学者来说是个非常宝贵的资料。(A JPA of learning materials. Is suitable for beginners to learn. For beginners is a very valuable information.)
    2010-04-12 15:03:03下载
    积分:1
  • Kalman-Filtering
    代码卡尔曼滤波器原理的书以及源代码,学习滤波器的经典资料。(Kalman filter theory book code and source code, learning the classic filter information.)
    2014-12-25 15:58:47下载
    积分:1
  • PL_logdist_or_norm
    描述对数距离/正态阴影衰落路径损耗模型的MATLAB程序(A description of the number of distance/normal shadow fading MATLAB program path loss model)
    2021-04-19 20:38:50下载
    积分:1
  • ILC
    多输入多输出系统迭代学习控制算法程序,此程序对迭代学习控制算法的新手,具有一定帮助,加深对ILC算法的理解。(the ILC of MIMO system)
    2021-02-08 16:49:54下载
    积分:1
  • bldc_sensored_00
    This simulation file has been made in matlab simulink software and describes the bldc sensored motor.
    2014-08-10 13:51:53下载
    积分:1
  • ch07solutions
    Key to the book:C++ HOW TO PROGRAM 7th, chapter 7.
    2015-03-01 23:46:16下载
    积分:1
  • Linear-predictive-voice
    线性预测分析的基本原理,线性预测分析的基本原理,线性预测分析格型法的解法,线谱对的分析法(The basic principle of linear predictive analysis, the basic principles of linear predictive analysis, the solution of linear predictive analysis lattice method, the line spectrum pair analysis)
    2014-11-19 20:46:38下载
    积分: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
  • 696516资源总数
  • 106913会员总数
  • 8今日下载