-
zhifangtu
MATLAB实现均衡算法，画出原始图像的直方图和经过处均衡处理后的直方图(MATLAB realize equalization algorithm, draw the original image s histogram and after treatment, the Department balanced histogram)
- 2007-11-11 13:35:21下载
- 积分：1
-
anfismex
用于模糊理论的核心函数，可以转成M文件来方正(fuzzy study)
- 2010-12-08 14:01:27下载
- 积分：1
-
ukfopt
说明： 利用ukf滤波实现对目标的跟踪，程序应该能运行。(ukf filter)
- 2010-04-16 20:35:49下载
- 积分：1
-
weinalvbo
自编维纳滤波实现运动模糊图像的恢复与matlab自带的维纳滤波函数实现复原对比(Using Wiener filter to achieve the restoration of motion-blurred images and MATLAB with Wiener filtering function restoration contrast)
- 2020-12-03 10:19:24下载
- 积分：1
-
ipad_iphone_sensorgroup
使用MATLAB从你的iPhone或iPad上的内置传感器采集传感器数据(Use MATLAB to acquire sensor data from built-in sensors on your iPhone or iPad.
)
- 2013-11-18 14:36:32下载
- 积分：1
-
GODLIKEcode
GODLIKE - A robust single-& multi-objective optimizer
- 2010-12-25 17:13:00下载
- 积分：1
-
project
Pulse-code modulation (PCM) is a method used to digitally represent sampled analog signals. It is the standard form of digital audio in computers, Compact Discs, digital telephony and other digital audio applications. In a PCM stream, the amplitude of the analog signal is sampled regularly at uniform intervals, and each sample is quantized to the nearest value within a range of digital steps. Quantization Noise occurs in PCM.
- 2013-10-06 05:07:20下载
- 积分：1
-
1.2-Poluwnuma
project in matlab about polyonyms
- 2011-11-24 20:48:36下载
- 积分：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
-
Massively-Parallel-Computing-[Read-Only]
Massively parallel computing on GPU
- 2014-09-03 18:49:45下载
- 积分：1
