-
tuxiang2
说明: matlab读图像和图像信息,函数imread可以从任何Matlab支持的图像文件格式中,以任意位深度读取一幅图像。(matlab read images and image information, the function imread Matlab support from any image file format to read any bit depth of an image.)
- 2010-04-20 17:16:37下载
- 积分:1
-
burgf
信号为两个正弦信号加高斯白噪声,用burg递推法对其进行功率谱估计,效果不错。(Signal for two sinusoidal signal plus Gaussian white noise, the recursive method burg its power spectrum estimation, good results.)
- 2009-06-14 15:44:26下载
- 积分:1
-
upload
These are some basic matlab codes.
- 2013-01-06 00:30:03下载
- 积分:1
-
ISODATA_IRIS
ISODATA法分类IRIS数据集,压缩包中包括两个.m文件,运行provaisodata_4D.m可直接分类。或者通过isodata_4D.m设置参数也可以得到结果。程序有详细注释,很容易懂。最后结果既有文字描述,也有图形输出。(ISODATA classification method IRIS data set, compressed package includes two. M files, run provaisodata_4D.m direct classification. Or set the parameters by isodata_4D.m can get results. Procedures detailed notes, it is easy to understand. Final results of both the written description, there are graphical output.)
- 2011-05-21 23:33:48下载
- 积分:1
-
xiandaitongxinxitong
现代通信系统第二版的源代码(非常全面)学习通信编程的必备。(The source code for the second edition of the modern communication systems)
- 2012-04-22 10:58:39下载
- 积分:1
-
TSP
用matlab求解各个城市之间的最优的路径(Using matlab to solve the optimal path between the various cities)
- 2012-05-21 12:00:06下载
- 积分:1
-
path
这是计算最优路径的Floyd算法在Matlab中的实现程序。(This is the calculation of the optimal path Floyd algorithm in Matlab implementation process.)
- 2013-09-13 17:05:12下载
- 积分:1
-
newmarkB
结构动力响应求解Newmark方法Matlab程序(Newmark method of solving structural dynamic response Matlab program)
- 2011-11-19 21:04:32下载
- 积分:1
-
FloatArrayBuffer
FloatArrayBuffer, ReadWriteFloatArrayBuffer and ReadOnlyFloatArrayBuffer compose the implementation of array based float buffers.
- 2014-01-22 11:08:41下载
- 积分:1
-
huffman
霍夫曼编码的具体方法:先按出现的概率大小排队,把两个最小的概率相加,作为新的概率 和剩余的概率重新排队,再把最小的两个概率相加,再重新排队,直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率,读出时由该符号开始一直走到最后的“1”, 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好,就是该符号的霍夫曼编码。(Specific methods Huffman coding: the probability of emergence of the size press line, the two smallest sum probability, as a new probability and the probability of re-queue the remaining, then the minimum of two probabilities are added, and then re-queue, until finally become one. Each time the sum will be 0 and 1 Fu added two probabilities, when read by the symbol has come to begin the final 1 , the route will encounter a 0 and 1 at the lowest to the highest bit of the right order, that is the symbol of the Huffman coding.)
- 2015-04-04 20:34:08下载
- 积分:1