histogram_equip

design of median filter to remove noise

西安交大的课件,内容很详细的,包括MATLAB希望才用,(Courseware Xi'an Jiaotong University, as very detailed, including using MATLAB only hope, I would like to thank)

很全的PSO优化SVM，还带例子。希望大家下下去认真研究，支持支持向量机(this is good method of pso optimizing parameters of svm)

非常详细的MUSIC谱估计程序，自己写的，毕业设计，保证结果正确且可以运行。有非常详细的注释，每句话都有注解，简明易懂，保证可以看懂并学到知识，并且每一步与MUSIC算法详细的对应和算法解释，不管是学习程序还是学习算法都很有帮助，.m文件中是程序的一部分，全部代码在WORD中，肯定是你见过的最好的代码(MUSIC spectrum estimation very detailed procedures for their own writing, graduation, there are very detailed notes, every word has a comment, simple to understand, to ensure you can read and acquire knowledge, and every step of the MUSIC algorithm and the corresponding detailed and algorithm explanation, whether the learning process or learning algorithms are very helpful)

块自适应处理算法先有采样快拍数据计算采样协方差矩阵，再来计算自适应权矢量。典型的块自适应处理算法为采样矩阵求逆(SMI)算法。仿真了采样矩阵求逆法(SMI)的波束形成方向图旁瓣的高低受信号快拍数的影响。(Block adaptive processing algorithms prior sample snapshot data of the sampling covariance matrix, again computing adaptive weight vector. A typical block adaptive processing algorithms for the sample matrix inversion (SMI) algorithm. Simulation of the sampling matrix inversion method (SMI) beamforming pattern sidelobe level of the signal by the number of snapshots.)

说明：  图象压缩方面的论文pdf格式 可用于毕业设计方面的工作(Image compression pdf format papers for school design work)

多项式编程，可以实现十项的matlab运算，可以运用于很多场合(Polynomial programming,the operation can be achieved 10)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家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. )

MUSIC谱峰搜索算法，Multiple Signal Classification Method for direction finding.(MUSIC spectral peak search algorithm 。Multiple Signal Classification Method for direction finding.)

class to produce an X.509 Version 3 certificate.