核极限学习机kernel-ELM

对于npsk的调制和解调方案，修改n的值就可以得到各种psk的效果(Modulation and demodulation for npsk program, modify the value of n can be the effect of various psk)

high gain observer article

线性规划 用于最优化算法中的线性规划最优问题(Linear programming optimization algorithm for linear programming optimization problem)

本程序是在遥感图象处理中第一步,服务于内定向,用来确定框标图象中框标的重心位置.(this procedure is in remote sensing image processing first step in the services within orientation, standard used to determine frame image frame target focus position.)

说明：  TCP-AQm router design active queue management

empirical formula with kaiser clc clear all fs=1000 fc=250 df=50 r=0.001 f=fc/fs dw=2*pi*(df/fs) a=-20*log(r) n=floor(((a-8)/(2.285*dw))+1) if a>50 b=0.1102*(a-8.7) elseif a>=21 && a<=50 b=0.5842*((a-21)^0.4)+0.07886*(a-21) elseif a<21 b=0.0 end w=kaiser(n,b) for i=1:n if i~=(n-1)/2 hd(i)= (2*f*sin((i-((n-1)/2))*2*pi*f))/((i-((n-1)/2))*2*pi*f) elseif i==(n-1)/2 hd(i)=2*f end end for j=1:n h(j)=w(j)*hd(j) end subplot(3,1,1), plot(w) subplot(3,1,2), plot(h) subplot(3,1,3), plot(h,n)

合成孔径雷达成像的三个经典算法matlab仿真。包括RD算法，Chirp Scaling算法，wK算法。程序正确，注释清晰。(Synthetic aperture radar imaging of three classical algorithm matlab simulation. Including RD algorithms, Chirp Scaling Algorithm, wK algorithm. Program correctly, clear notes.)

说明：  卡尔曼滤波的一个典型实例是从一组有限的，对物体位置的，包含噪声的观察序列预测出物体的坐标位置及速度. 在很多工程应用(雷达, 计算机视觉)中都可以找到它的身影. 同时，卡尔曼滤波也是控制理论以及控制系统工程中的一个重要话题. 　　比如,在雷达中,人们感兴趣的是跟踪目标,但目标的位置,速度,加速度的测量值往往在任何时候都有噪声.卡尔曼滤波利用目标的动态信息,设法去掉噪声的影响,得到一个关于目标位置的好的估计。这个估计可以是对当前目标位置的估计(滤波),也可以是对于将来位置的估计(预测)，也可以是对过去位置的估计(插值或平滑). (kalman filter in matlab)

harris corner detector code in digital image processing

Mean Shift 这个概念最早是由Fukunaga等人[1]于1975年在一篇关于概率密度梯度函数的估计中提出来的,其最初含义正如其名,就是偏移的均值向量,在这里Mean Shift是一个名词,它指代的是一个向量,但随着Mean Shift理论的发展,Mean Shift的含义也发生了变化,如果我们说Mean Shift算法,一般是指一个迭代的步骤,即先算出当前点的偏移均值,移动该点到其偏移均值,然后以此为新的起始点,继续移动,直到满足一定的条件结束. 用matlab实现mean shift算法仿真(Mean Shift the concept was first used by Fukunaga et al [1] in 1975 in an article on the probability density function estimation of gradient raised its original meaning, as its name implies, is the offset of the mean vector, where is the Mean Shift a noun, it refers to a vector, but with the Mean Shift the development of the theory, Mean Shift the meaning has changed, if we say that Mean Shift algorithm, generally refers to an iterative steps, namely, first calculate the current point Mean offset, move the shift points to its average, and then as a new starting point and continue to move until the end to meet certain conditions. realize using mean shift algorithm matlab simulation)