viterby

快速的2D/3D区域生长算法，通过对邻近像素进行优先级排队进行加速，效果优于matlab本身的区域生长算法(Native Matlab implementations of region growing algorithms are usually quite slow, especially for 3D input data. This submission is a mex implementation of a 3D/2D region growing algorithm. The region growing process is further accellereated by using priority queues for the neighbourhood pixels.)

function deconvolution in matlab

关于遗传PID的程序，可以用来参考，我毕业论文用到这个了(Genetic PID on the procedure can be used for reference, I use this a thesis)

half wave rectifier one of the best

rectificador de media onda analisis por codigo

分形的练习一 ①Koch曲线 用复数的方法来迭代Koch曲线 clear i 防止i被重新赋值 A=[0 1] 初始A是连接（0，0）与（1，0）的线段 t=exp(i*pi/3) n=2 n是迭代次数 for j=0:n A=A/3 a=ones(1,2*4^j) A=[A (t*A+a/3) (A/t+(1/2+sqrt(3)/6*i)*a) A+2/3*a] end plot(real(A),imag(A)) axis([0 1 -0.1 0.8]) ②Sierpinski三角形 A=[0 1 0.5 0 0 1] 初始化A n=3 迭代次数 for i=1:n A=A/2 b=zeros(1,3^i) c=ones(1,3^i)/2 A=[A A+[c b] A+[c/2 c]] end for i=1:3^n patch(A(1,3*i-2:3*i),A(2,3*i-2:3*i), b ) patch填充函数 end (Fractal Exercise One The ① Koch curve Plural iteration Koch curve clear i to prevent i is reassigned A = [0 1] initial A is a connection (0,0) and (1,0) of the segments t = exp (i* pi/3) n = 2 n is the number of iterations for j = 0: n A = A/3 a = ones (1,2* 4 ^ j) A = [A (t* A+ a/3) (A/t+ (1/2+ sqrt (3)/6* i)* a) A+2/3* a] end plot (real (A), imag (A)) axis ([0 1-0.1 0.8])   ② Sierpinski triangle A = [0 1 0.5 0 0 1] initialized A n = 3 the number of iterations. for i = 1: n A = A/2 b = zeros (1,3 ^ i) c = ones (1,3 ^ i)/2 A = [A A+ [c b] A+ [c/2 c]] end for i = 1:3 ^ n patch (A (1,3* i-2: 3* i), A (2,3* i-2: 3* i), b ) patch filled function end)

基于修正的hausdorff的图像匹配算法，可快速实现图像匹配(hausdorff mattch)

analog modulation and coding technique

平面圆阵波束形成，使用阵列流型向量编写，对于理解波束形成有帮助(Planar circular array beamforming, the use of array-based flow vector preparation, for help understanding beamforming)

Gabor filters image processing