IS95

conversion de matlab vers c++

在matlab环境下对图像进行高通滤波和低通滤波处理。(The high-pass filter and low-pass filtering image processing in Matlab environment.)

newmark方法求解非线性振动duffing方程(newmark method for solving nonlinear vibration duffing equations)

经典的MUSIC算法，很适合新手的学习和认识(Traditional MUSIC ，DOA adaptive array suitable for newer learning)

说明：  基于MATLAB的无人飞行器数学模型的飞行仿真实验程序(MATLAB-based mathematical model of unmanned aircraft flight simulation program)

Learning_random.m : 随机选择样例，从（90）pool里随机选择样本，删除版本空间树的数量 activeLearning.m:根据最大熵原则,从pool里选择样本，删除版本空间树的数量 getlabel.m:根据树和测试样例，得到根据该树得到的类标 getTrees.m:从提供的大量树结构(随机生成的)中，随机挑选一定数量的树(如果该树的叶子节点无类标随机添加) RandomCreateTree_d_unbalance:根据样本点割点中的非平衡割点建造树， RandomCreateTree_d_all.m:根据所有样本点的割点建造树 randomdata.m：给定属性取值，造数据 randomselect.m:从数据中随机选择一部分作为 showTree.m:显示树的结构 test.m:给出树，测试样例，得到正确率(Learning_random.m: randomly selected sample, randomly selected sample from (90) pool the The deleted version space tree quantity activeLearning.m: selecting a sample from the pool based on the principle of maximum entropy, delete the number of version space tree getlabel.m: According to the tree and the test sample obtained according to the class standard getTrees.m the tree: from the tree structure (randomly generated), randomly selected a certain number of trees (the leaves of the tree node class marked randomly adding ) RandomCreateTree_d_unbalance: According to the sample point cut point unbalanced cut point construction tree, RandomCreateTree_d_all.m: construction of the tree randomdata.m all sample points cut point: given the value of the property, manufacturing data randomselect.m: random data Select as part showTree.m: tree structure test.m: tree, the test sample is given to get the correct rate)

FourierICA是一种无监管的自适应学习方法，用于盲源分离问题，将短时傅里叶变换STFT与独立分量分析ICA相结合。(FourierICA is an unsupervised learning method suitable for the analysis of bss.The method performs independent component analysis(ICA) on short-time Fourier transforms of the data. )

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

有小波分析的盲信号处理，基于欧几里得距离的聚类分析，代码里有很完整的注释和解释。( There Wavelet Analysis Blind Signal Processing, Clustering analysis based on Euclidean distance, Code, there are very complete notes and explanation.)

Matlab中基于dq变换的锁相环仿真研究.(Matlab based on dq transformation of phase-locked loop simulation.)