旋转门算法

读取数据

if (1>2) fid = fopen('data.txt','r');t=zeros(6000,6);for i=1:6000tline = fgets(fid,100);j=1;state=0;base=0.1;A=size(tline);while (j<A(2)) switch state case{0} if (tline(j)>='0' && tline(j)<='9') t(i,1)=t(i,1)*10 + tline(j)-'0'; else state=state+1; end; case{1} if (tline(j)>='0' && tline(j)<='9') t(i,2)=t(i,2)*10 + tline(j)-'0'; else state=state+1; end; case{2} if (tline(j)>='0' && tline(j)<='9') t(i,3)=t(i,3)*10 + tline(j)-'0'; else state=state+1; end; case{3} if (tline(j)>='0' && tline(j)<='9') t(i,4)=t(i,4)*10 + tline(j)-'0'; else state=state+1; end; case{4} if (tline(j)>='0' && tline(j)<='9') t(i,5)=t(i,5)*10 + tline(j)-'0'; else state=state+1; end; case{5} if (tline(j)>='0' && tline(j)<='9') t(i,5)=t(i,5) + (tline(j)-'0')*base; base=base*0.1; else state=state+1; end; case{6} if (tline(j)>='0' && tline(j)<='9') t(i,6)=t(i,6) + (tline(j)-'0'); else state=state+1; end; case{7} error('ERROR'); end; j=j+1;end;%whileend;%forend;%ifs=t(:,5);d=s(1:5999)-s(2:6000);cnt=0;%plot(s)for i=1:5999 if (d(i)<1.0) cnt=cnt+1; end;end;for i=1:6000time(i) = t(i,1)*3600 + t(i,2)*60 + t(i,3)*1 + t(i,4)/50;end;%plot(time(1:6000))a=100;b=1000;%plot(time(a:b),s(a:b),'.')%figure;%plot(s(a:b),'-*')i=0;d=6000;plot(s(i*50+1:i*50+d),'b-*') 

 

旋转门算法：

%旋转门算法.clearload ts=t(:,5);b=zeros(size(s)); %存储的起始结点,长度最大为3000e=zeros(size(s)); %存储的终点结点,长度最大为3000red=zeros(size(s)); %该段共有多少个点,长度最大为3000y=zeros(size(s));dif=1.0; %误差容限state=0; %当前状态，0表示当前的点是起点，1表示当前的点是终点figure(1)plot(s)cnt=1; %第一段b(cnt)=1;e(cnt)=2;red(cnt)=2;for i=3:6000 if (state<0.5) if (i-b(cnt)>1.5) flag = 1; for j=b(cnt)+1:i-1 temp = s(b(cnt)) + ( s(i) - s(b(cnt)) ) / ( i - b(cnt) ) * ( j - b(cnt)); if ( abs(temp - s(j)) > dif ) flag=0; end; end; if (flag < 0.5) e(cnt)=i-1; cnt=cnt+1; b(cnt)=i; e(cnt)=i; end; else e(cnt)=i; end; end; if i>5999.5 e(cnt)=i; end; end;for i=1:cnt for j=b(i):e(i) y(j)=( s(e(i))-s(b(i)) )/(e(i)-b(i)) * (j-b(i)) + s(b(i)); end;end;figure(2)plot(y(1:6000))d=y-s;figure(3)plot(d)