meijao

基于LDA的iris数据集分类算法，matlab实现，有注释。(LDA-based classification algorithm of the iris data set, the Matlab implementation, and comment.)

三维模型数据中包含“Princeton Shape Benchmark dataset”，三维模型数据库，其中的.off文件为三维模型，这些模型可以使用文件夹中的“打开三维模型的软件”打开查看。 matlab代码中“读取三维模型”为matlab读取.off文件的代码，得到的是三角面片信息和点云坐标 “三维模型切割”中为切割三维模型的一个例子，具体是从三维模型上找三个点构成一个平面，找到这个平面与三维模型的交点，这只是一个例子，具体如何切割三维模型需要自己实现，其中读取的三维模型为.obj格式，实验时需要把这部分换成上面读取.off的代码。运行其中的cut.m和cut2.m文件 “CBSM特征提取”用于提取形状特征，a.m是批量提取的，b.m是提一张图片的(3D model data contained in the Princeton Shape Benchmark dataset , the three-dimensional model , which .off file three-dimensional models that can be used in the folder open a 3D model of software Open View. matlab code reads the three-dimensional model for the matlab code to read .off file to obtain a triangular facets information and coordinate point cloud Three-dimensional model of cutting as an example of cutting three-dimensional model, in particular to find a three-dimensional model the three points form a plane, find the intersection of the plane and three-dimensional model, this is just an example of how to cut specific need to implement three-dimensional model wherein the three-dimensional model is read .obj format, experiments need to replace this part of the above read .off code. Run one of the cut.m and cut2.m file CBSM feature extraction is used to extract the shape feature, a.m bulk extraction, b.m is to provide a picture o)

Minimum Error thresholding method realized in Matlab environment based on Kittler and J. Illingworth, "Minimum error thresholding," Pattern Recognition, vol. 19, pp. 41-47, 1986.

可用来计算复杂网络的易损性，进而分析网络特性(used to calculate the vulnerability of networks)

直线检测及道路边缘检测，包括在DM6437上的实现(use the Hough Transform, Find Local Maxima, and Hough Lines blocks to find the longest line in an image. In the second step, the algorithm used for line detection will be the basis of a lane detection procedure. )

Vth-Vth0-Vsb for NMOS

不敏卡尔曼滤波算法及其性能分析，对研究目标跟踪有所帮助。(UKF and its performance analysis, which is helpful for target tracking.)

说明：  Dieu khien robot tu xa

包括最小二乘法、SVM、神经网络、1_k近邻法,对球谐函数图形进行仿真,LZ复杂度反映的是一个时间序列中。( Including the least squares method, the SVM, neural networks, 1 _k neighbor method, Of spherical harmonics graphic simulation, LZ complexity is reflected in a time sequence.)

pagerank的一个简单改进，用来识别核心节点。(A simple improvement of PageRank is used to identify core nodes.)