-
biaoding
标定程序 用在立体视觉 (calibrate stereomatching)
- 2010-08-04 09:10:20下载
- 积分：1
-
pso
粒子群算法的基本程序，文中举的是最简单的例子(Particle swarm optimization of the basic procedures, the paper cited is the simplest example of)
- 2010-11-26 13:44:25下载
- 积分：1
-
TD_vedyna_user_manual
车辆动力学仿真软件veDYNA的用户指南(VeDYNA vehicle dynamics simulation software user s guide)
- 2010-12-09 22:59:36下载
- 积分：1
-
kalman
Face Tracking in matlab
- 2009-07-12 01:48:50下载
- 积分：1
-
YCbCr
Finding Picture Average YCbCr
- 2014-08-12 01:22:30下载
- 积分：1
-
kalman_filter_success2
实现一维卡尔曼滤波,画出真实值和估测值之间的图像，通过比较，研究卡尔曼滤波的性质。(Implement a Kalman filter, draw the image and estimate the true value between the values, by comparison, study the nature of the Kalman filter.)
- 2013-12-28 17:01:05下载
- 积分：1
-
RobotObstacleAvoidance
MATLAB仿真机器人避障实验,其中机器人系统通过模型实现，障碍物由点构成(MATLAB simulation robot obstacle avoidance test)
- 2016-03-23 10:54:28下载
- 积分：1
-
sobel
sobel边缘检测在matlab环境下实现的源程序代码(Sobel edge detection in matlab source code realization)
- 2010-06-19 22:16:01下载
- 积分：1
-
压缩&解压缩
此程序用C语言用哈夫曼编码法实现了对英文的压缩与解压缩，是C语言编程一个比较经典的例子(this program in C language with Huffman coding method to achieve the right English compression and decompression, the C programming language is a classic example)
- 2005-05-19 00:54:38下载
- 积分：1
-
danchunxingfa
单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
(Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination.
)
- 2011-01-17 21:01:44下载
- 积分：1
