-
kalmanfilter
很经典的卡尔曼滤波程序 与大家分享 多多支持啊!!!!!!!!(Classic Kalman filtering process to share with you will support ah! ! ! ! ! ! ! !)
- 2010-05-21 10:42:29下载
- 积分:1
-
GPS-Positioning-matlab
利用matlab实现gps的单点定位,需要下载n文件与o文件(Using Matlab for gps single point positioning, you need to download the n file and o file.)
- 2012-05-05 21:18:10下载
- 积分:1
-
LPCctoLPC
使用LPCC参数来生成源滤波器模型的的线性预测系数(LPCC parameters to generate the linear prediction coefficients of the source filter model)
- 2012-06-02 16:16:14下载
- 积分:1
-
lcmv
波束合成中的LCMV算法,多个入射波和干扰信号(LCMV beam synthesis algorithm, a number of the incident wave and interference signals)
- 2020-09-25 15:07:48下载
- 积分:1
-
all1
利用小波和霍夫曼对单声道文件进行压缩编码 并解码输出(using wavelet and Hoffman right mono document coding and decoding output)
- 2006-06-05 12:37:41下载
- 积分:1
-
upf_demos
说明: % PURPOSE : Demonstrate the differences between the following filters on the same problem:
%
% 1) Extended Kalman Filter (EKF)
% 2) Unscented Kalman Filter (UKF)
% 3) Particle Filter (PF)
% 4) PF with EKF proposal (PFEKF)
% 5) PF with UKF proposal (PFUKF)( PURPOSE: Demonstrate the differences between the following filters on the same problem: 1) Extended Kalman Filter (EKF) 2) Unscented Kalman Filter (UKF) 3) Particle Filter (PF) 4) PF with EKF proposal ( PFEKF) 5) PF with UKF proposal (PFUKF))
- 2008-09-13 12:21:05下载
- 积分:1
-
diliuci
自己编写的源代码能实现简单的形态学操作,如腐蚀膨胀边界提取(I have written the source code to achieve a simple morphological operations, such as corrosion expansion boundary extraction)
- 2011-05-15 23:15:33下载
- 积分:1
-
NeuralNetwork_Backpropagation_Classifier
使用MATLAB语言实现BP神经网络的分类功能,代码很简洁(using MATLAB BP neural network classification function, a very simple code)
- 2007-05-22 21:42:48下载
- 积分:1
-
8
说明: 龚纯主编的“matlab语言常用算法程序集”的第8章源代码(Gong pure edited matlab language commonly used algorithm for assembly, " the source code of Chapter 8)
- 2012-12-03 19:06:20下载
- 积分:1
-
MATLAB-Code-for-Simulated-Annealing
TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.
- 2009-11-20 02:54:41下载
- 积分:1