-
w
说明: 用标记分水岭算法进行图像的分割,得到分割伪彩色图像。(use the watershed Algorithms to divide the picture)
- 2010-07-28 09:58:05下载
- 积分:1
-
yuyindaoxu
用Matlab以及c语言求语音序列的倒谱
这某段语音信号求FFT、取模、取log、IFFT得到倒谱,并画图。选取一段进行分析,分别对浊音和清音各自求倒谱。(Using Matlab, as well as for c language serial Cepstral voice that voice signal for a certain period of FFT, check mode, check log, IFFT been cepstrum, and drawing. Select a section of the analysis, respectively, and the voiceless to voiced their demand cepstrum.)
- 2021-05-24 01:30:02下载
- 积分:1
-
programme
Source code of AFIS (pattern recognition)
- 2010-12-29 08:42:10下载
- 积分:1
-
daima
arc engine初级代码开发,对初学者很有帮助。希望能帮助广大初学者。代码很短,但是很经典。下载后可以直接用。(arc engine primary code development, helpful for beginners. Hoping to help the beginners. Code is very short, but very classic. After downloading can be used directly.)
- 2014-10-19 11:30:11下载
- 积分:1
-
83390075Data-Envelopment-Analysis
可以进行DEA分析。并给出一些例子,可供参考。(DEA analysis can be carried out. Some examples are given for reference.)
- 2018-10-30 14:38:42下载
- 积分:1
-
GraphTheoryAlgorithmMATLAB
说明: 图论算法及其MATLAB 程序代码
1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法
2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法
3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法
6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
- 2010-03-28 15:39:29下载
- 积分:1
-
123
信号预处理,对于信号的一些干扰进行排除——(Signal preprocessing for signal interference exclude-)
- 2013-03-24 19:16:32下载
- 积分:1
-
MT_inversion
大地电磁最小二乘光滑约束反演,包含bostick反演对比(Smooth constrained least squares inversion of magnetotelluric, including bostick contrast inversion)
- 2021-04-27 09:58:44下载
- 积分:1
-
guihua
用matlab来解决线性规划的问题,几个例子程序+一个ppt(Using matlab to solve linear programming problems, a few examples of procedures and a ppt)
- 2009-11-08 19:34:55下载
- 积分:1
-
ChannalCoding_ConvDecode
这里实现的卷积码译码器可实现(n,1,K)的卷积译码,即一个输入码元,n个输出码元,编码器的约束长度为K,采用函数的默认值将实现(2,1,7)的卷积译码。译码方法为维特比硬判决译码,且译码开始状态假定为全零状态。(Here to realize convolutional code decoder can realize (n, 1, K) convolutional decoding, namely an input element, n output element, encoder constraint length is K, takes the default value of function, achieve the convolutional decoding,1,7 (2). Decoding method for decoding victor than hard decisions, and decoding the start state assumed to zero state.)
- 2019-03-19 15:49:35下载
- 积分:1