-
matlab
matlab介绍，能更好的学习该软件，有经典的算法和例子及介绍等。(matlab introduced to better learn the software, there is a classic example and introduce algorithms and so on.)
- 2015-01-07 10:49:24下载
- 积分：1
-
EKF
一个简单易懂的扩展卡尔曼程序，跟踪的是一个二维空间的非线性运动目标(An easy-to-understand program extended Kalman tracking is a two-dimensional nonlinear moving target)
- 2013-04-17 21:02:26下载
- 积分：1
-
matlab_optimized
包含了matlab优化工具箱的大多数函数及描述.(matlab optimized functions and their descriptions.)
- 2010-01-14 09:40:34下载
- 积分：1
-
pso
说明： matlab初始化源代码，用于进行函数的优化(initialize matlab source code, used for the optimization function)
- 2009-08-13 15:41:10下载
- 积分：1
-
Simulation_Study_of_UWB_Communication_System
说明： 英国伦敦大学一个学生写的有关UWB的文章，里面有较详细的说明并附有Matlab源码，适合初学者。(University of London a student to write an article on UWB, there are more detailed description with Matlab source, suitable for beginners.)
- 2008-11-24 20:59:50下载
- 积分：1
-
pr3
边缘检测代码。多种检测方法，包括梯度算法（多种窗），LOG算法，sobel算子等等(Edge detection code. A variety of detection methods, including gradient algorithm (multiple windows), LOG algorithm, sobel operator, etc.)
- 2013-12-18 12:42:45下载
- 积分：1
-
Adaptc
adptc the code for adptc its an exellent one
- 2009-11-17 18:11:04下载
- 积分：1
-
matlabtest11
matlab程序：
matlabtest11 是可设置函数曲线图视角的用户界面；(matlab program: matlabtest11 is setting function curve of the user interface perspective )
- 2008-08-01 23:05:40下载
- 积分：1
-
1044931_Mikael_Montelius_Rapporten_utan_kod
Matlab tool for segmentation and re-creation of
H-MRS volumes of interest in MRI image stack
- 2013-09-21 15:53:58下载
- 积分：1
-
KNN
K最邻近密度估计技术是一种分类方法，不是聚类方法。
不是最优方法，实践中比较流行。
通俗但不一定易懂的规则是：
1.计算待分类数据和不同类中每一个数据的距离（欧氏或马氏）。
2.选出最小的前K数据个距离，这里用到选择排序法。
3.对比这前K个距离，找出K个数据中包含最多的是那个类的数据，即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method.
It is not the best method, but it is popular in practice.
Popular but not necessarily understandable rule is:
1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov).
2. select the minimum distance from the previous K data, where the choice sorting method is used.
3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
- 2020-10-23 14:37:22下载
- 积分：1
