-
throughwall
这是使用射线跟踪法求解墙体造成误差的程序，分别有穿单面墙，平行双墙，垂直双墙的情况(This is to use ray-tracing procedure for solving the error caused by the wall, respectively, through a single wall, parallel to the double wall, vertical double-wall case)
- 2010-09-02 13:21:51下载
- 积分：1
-
Tsaicalibrition
运用TSAi方法对相机标定程序，有详细说明，可读性强(TSAi_calibrition)
- 2009-05-22 11:18:48下载
- 积分：1
-
MultipathFading
对无线通信中的多径衰落信道进行MATLAB代码仿真。(Wireless communications multipath fading channel simulation of MATLAB code.)
- 2011-01-10 22:31:32下载
- 积分：1
-
OSU_SVM-Classifier-Matlab-Toolbox-v3.00.00
用matlab编写的用语分类的支持向量机(using Matlab language prepared by the breakdown of support vector machines)
- 2006-11-22 14:40:21下载
- 积分：1
-
HHT
希尔伯特黄变换的相关资料。有需要的可以下载下来学习学习！也可以大家讨论(Hilbert Huang transform the relevant information. Need to download to learn from! You can also discuss)
- 2012-06-04 19:57:54下载
- 积分：1
-
Pattern-Recognition
分别利用fisher判别法和近邻法对一组声呐数据进行模式识别，计算分类的正确率(Respectively, and the use of fisher discriminant method nearest neighbor method sonar data to a set of pattern recognition, to calculate the correct classification rate)
- 2013-12-21 13:26:13下载
- 积分：1
-
segmentation
本matlab代码实现了图像分割，分割成a*a的图像小块，效果还行()
- 2015-03-10 19:10:50下载
- 积分：1
-
G-Rilling
G Rilling 团队写的一些关于EMD的算法程序，比较详细(It gives some files on EMD by the team of G Rilling,and it show the algorithm on EMD in detail.)
- 2012-03-25 15:27:10下载
- 积分：1
-
sector_identification_dtc
flux sector idntification simulation block diagram for dtc
- 2010-02-26 17:02:10下载
- 积分：1
-
Dijkstra
说明： 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分：1
