matlab

迭代自适应Simpson，Lobatto积分 In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm. We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf. (Iterative Adaptive Simpson, Lobatto Points In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm.We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (eg quad, quadv, and quadl) . Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.)

说明：  很简单的对图像进行滤波而使用的维纳滤波器使用代码(Very simple filter on the image using the Wiener filter used by the code)

开环迭代学习控制的matlab仿真程序。(Open loop iterative learning control matlab simulation program)

analyze data association algorithms (Nearest Neighbour and JCBB) in SLAM. Data association is basically a combinatorial optimization problem whose goal is to find the “best” set of associations between the observations and predictions according to a particular criterion (e.g. individual compatibility). Form this point of view, near- est neighbour (NN, a.k.a. ML) is simply a “greedy” algorithm in which the “compatibility” of individual associations with each other is not examined. On the contrary, JCBB, by considering both the individual and joint compatibility, is able to yield much better results. JCBB uses the branch and bound technique in order to prune the search tree

这是关于数字水印的嵌入例程！经过调试，可以放心使用！(This is on the digital watermark embedded routines! After debugging, can be assured use!)

基于PID控制的永磁同步电机矢量控制simulink仿真(Simulink simulation-based PID control of permanent magnet synchronous motor vector control)

回声音频加密的matlab文件代码。用来数字水印隐藏( Echo audio file encryption matlab code. For Digital Watermarking)

COMPARISON OF MEAN AND MEDIAN FILTER METHOD

说明：  基于MATLAB对EMD算法分解的例子，学习希尔伯特-黄变换的可以参考学习(Based on the example of EMD algorithm decomposition in MATLAB, learning Hilbert-Huang transform can be referred to.)

这个是用于两类的带有类别的数据的线性分类器，是结构体类型如下判别 y(i) = 1 if W *X(:,i) + b >= 0 2 if W *X(:,i) + b < 0(his function classifies input data X using linear discriminant function: y(i) = argmax W(:,y) *X(:,i)+ b(y) y where parameters W [dim x nfun] and b [1 x nfun] are given in model and nfun is number of discriminant functions. In the binary case (nfun=1) the classification rule is following y(i) = 1 if W *X(:,i)+ b >= 0 2 if W *X(:,i)+ b < 0)