compare_ekf_kf

EM@matlab是一个有限元工具包，适用于静力和偏微分方程的演变(AFEM@matlab is a MATLAB package of adaptive finite element methods (AFEMs) for stationary and evolution partial differential equations in two spatial dimensions)

手写体数字识别的例子，含处理图片和matlab程序，自己编写的，可以实现的。(Examples of handwritten numeral recognition, include image and matlab program ， writing it by myself, and it can be achieved.)

用matlab对船舶回转模型的建模以及源代码(Ship rotation model using matlab modeling and source code)

基于图像内容的检索，文献及其相关代码，2012年的会议CVPR(Image content-based retrieval, literature, and their associated code, 2012 meeting CVPR)

一个用于计算时间的界面，可根据需要进行修改(An interface for the computing time can be modified as needed)

迭代自适应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.)

ROOT-MUSIC算法，在MUSIC上进行改进，能够提高分辨力，较好的测出信号的信息(ROOT-MUSIC algorithm, can increase the resolution of information)

说明：  简单的DMC以及MPC控制代码和说明都有，不错的学习参考(Simple DMC and MPC control code and instructions are available, good learning reference)

递归算法 [1 1 1 1 1 0 1 0 0 0 1 0 0 0 0 1 1 0 0 0 1 1 1 0 0 1 1 1 1 0] t=[0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1] 给权值赋初值 w1=eye(5,10) w2=eye(10,5) wr=eye(10,10)/3 wobias=eye(6,5)/4 wbias=eye(6,10)/3 x=ones(6,10)/3 ww2=zeros(10,5)/6 ww1=zeros(5,10)/6 wwr=zeros(10,10)/6 wwobias=zeros(6,5)/5 wwbias=zeros(6,10)/4 g=[1 1 1 1 1] f=[1 1 1 1 1 1 1 1 1 1] (Recursive algorithm)

UN AUTRE MONDE DE LA VISION.............MATLAB..................SEGMENTATION