登录
首页 » matlab » shang2JIAZHI_of_extract_feather_VMD_test

shang2JIAZHI_of_extract_feather_VMD_test

于 2021-04-27 发布 文件大小:2KB
0 235
下载积分: 1 下载次数: 67

代码说明:

  利用VMD分解,计算每个模态的能量熵的程序。(VMD decomposition is used to calculate the energy entropy of each mode.)

文件列表:

shang2JIAZHI_of_extract_feather_VMD_test.m, 4310 , 2018-09-07

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

发表评论

0 个回复

  • WienerFilter
    说明:  用matlab做成的维纳滤波器程序,跟踪先验信噪比使用直接判决的方法进行滤波(Made use of the Wiener filter matlab program to track a priori signal to noise ratio using a direct method of filtering decision)
    2010-03-30 15:26:47下载
    积分:1
  • 080306
    说明:  一种基于MATLAB的MSK软件解调方法 介绍数字调制信号的发展过程和MSK的调制解调原理,提出了一种基于MALTAB的MSK 解调方法,并进行了仿真实验,实验结果证明了该方法的有效性。(MATLAB-based software demodulation of MSK digitally modulated signals to introduce the development process and the principle of modulation and demodulation of MSK, a MALTAB based on the MSK demodulation method, and the simulation results, experimental results show that the method effectiveness.)
    2009-08-09 13:02:10下载
    积分:1
  • Spycam
    Spycam coding in Matlab using various commands
    2015-02-07 11:47:20下载
    积分:1
  • otsu-threshold
    OTSU METHOD FOR THRESHOLDING
    2013-11-30 13:33:21下载
    积分:1
  • bangei_V6.3
    该函数用来计算任意函数的一阶偏导数(数值方法),小波包分析提取振动信号中的特征频率,可以提取一幅图中想要的目标。( This function is used to calculate the arbitrary function of th)
    2016-05-20 10:37:03下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • polymatlab
    Initiation et Introduction à Matlab.
    2012-03-31 17:09:24下载
    积分:1
  • trick2
    Function with GUI in MATLAB Some Tricks
    2013-01-14 14:31:37下载
    积分:1
  • TSP
    A Traveling Salesmen Problem
    2010-08-17 15:53:08下载
    积分:1
  • Arnold-funtion
    数字图像处理中的Arnold变换和反变换的MATLAB实现程序,附Lenna图片一张。(Matlab program for Arnold transfer and invers Arnold transfer in digital image processing with a picture of Lenna. )
    2013-12-23 19:08:06下载
    积分:1
  • 696518资源总数
  • 106148会员总数
  • 10今日下载