-
choosenk
该matlab代码描述了谱减的语音增强算法(The matlab code spectrum is described by the speech enhancement algorithm)
- 2008-05-09 10:27:04下载
- 积分:1
-
EMD
该程序用于Hilbert谱分解,可分析非平稳和非线的信号(The procedures used for the Hilbert spectral decomposition and analysis of non-stationary and non-linear signal)
- 2012-09-21 17:32:24下载
- 积分:1
-
NMFLAB-Guidebook-Cichocki-Zdunek
这是nmflab的操作指导书,可以当成一个工具箱添加到matlab中,其中包含nmf几种经典的算法,很有指导意义!(This is the operating instructions nmflab can be added as a toolbox to matlab, which contains nmf several classic algorithms, is very instructive!)
- 2013-11-26 17:55:05下载
- 积分:1
-
Low_Complexity_MIMO_Detection
本书介绍了低复杂度的MIMO检测算法,并有伪代码,适合初学者(This book is written by Lin_Bai, Jinho_Choia, talking about low complexity MIMO Detection Algorithm)
- 2015-03-13 09:58:56下载
- 积分:1
-
numerical
numerical code for matlab
analytical
bisec
differentiation
F
FALSEPOS
fixedpoint
- 2013-09-04 02:29:02下载
- 积分:1
-
mkabrpt.m
mk突变点分析;
输入:x是数据序列;sy是起始年份或序号(做图的时候会用到)(mk point mutation analysis Input: x is a data sequence sy is the initial year or serial number (do figure it will be used))
- 2013-12-24 02:39:38下载
- 积分:1
-
Hallen3
海伦公式的学习程序 , matlab程序(Helen formulas learning program, matlab program)
- 2012-11-09 01:53:22下载
- 积分:1
-
FCM_src
classification d image avec l algo FCM
- 2013-12-14 20:13:25下载
- 积分:1
-
tj
说明: 用于优化算法的萤火虫算法,整理和很多资料,很有用的(Optimization algorithm for fireflies, organize and a lot of information, very useful)
- 2016-12-30 09:10:54下载
- 积分:1
-
NSGA-III
测试可以跑,根据自己情况修改下函数即可. NSGA-III 首先定义一组参考点。然后随机生成含有 N 个(原文献说最好与参考点个数相同)个体的初始种群,其中 N 是种群大小。接下来,算法进行迭代直至终止条件满足。在第 t 代,算法在当前种群 Pt的基础上,通过随机选择,模拟两点交叉(Simulated Binary Crossover,SBX)和多项式变异 产生子代种群 Qt。Pt和 Qt的大小均为 N。因此,两个种群 Pt和 Qt合并会形成种群大小为 2N 的新的种群 Rt=Pt∪Qt。 为了从种群 Rt中选择最好的 N 个解进入下一代,首先利用基于Pareto支配的非支配排序将 Rt分为若干不同的非支配层(F1,F2等等)。然后,算法构建一个新的种群St,构建方法是从 F1开始,逐次将各非支配层的解加入到 St,直至 St的大小等于 N,或首次大于 N。假设最后可以接受的非支配层是 L层,那么在 L+ 1 层以及之后的那些解就被丢弃掉了,且 St FL中的解已经确定被选择作为 Pt+1中的解。Pt+1中余下的个体需要从 FL中选取,选择的依据是要使种群在目标空间中具有理想的多样性。(The test can run and modify the function according to its own situation. NSGA-III first defines a set of reference points. Then the initial population containing N individuals (preferably the same number of reference points as the original literature) was randomly generated, where N was the size of the population. Next, the algorithm is iterated until the termination condition is satisfied. On the basis of current population Pt, the algorithm simulates two-point crossover (SBX) and polynomial mutation to produce offspring population Qt by random selection.)
- 2021-01-26 22:38:41下载
- 积分:1