TreeSpline

说明：  数字减影增强处理血管造影图像，可以处理眼底视网膜DSA图像(Digital subtraction angiography image enhancement processing, can handle the retinal image DSA)

能实现局部线性嵌入算法来完成数据的降维，需要设置参数有K，d(To achieve local linear embedding algorithm to perform data dimensionality reduction, you need to set the parameters K, d)

This tutorial is designed to give the reader an understanding of Principal Components Analysis (PCA). PCA is a useful statistical technique that has found application in fields such as face recognition and image compression, and is a common technique for finding patterns in data of high dimension. Before getting to a description of PCA, this tutorial first introduces mathematical concepts that will be used in PCA. It covers standard deviation, covariance, eigenvectors and eigenvalues. This background knowledge is meant to make the PCA section very straightforward, but can be skipped if the concepts are already familiar.

该程序功能为对所输入的振动信号进行希尔伯特黄变换，得到其边际谱(The program features the vibration input signal Hilbert Huang transform and its marginal spectrum of)

说明：  可以用来检测心电信号R波的位置和个数，使用方便准确率高(It can be used to detect the position and number of R wave of ECG signal, and it is convenient to use and has high accuracy)

Matlab的信号处理书籍，经典学习教程，相信一定收益颇丰！(Matlab Book about the deal with signals)

关于节点定位不同方法的代码,包括RSSI(Different methods of positioning the node code)

Extended Luenberger observer for speed-sensorless AC motor d

这是用于工程测量进行大坝变形分析的软件，比较有价值，欢迎试用。(This is for engineering measurements dam deformation analysis software, valuable, welcomed the trial.)

分形的练习一 ①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)