julei.m

来自「本次的算法是相位周期展开聚类」· M 代码 · 共 20 行

clear;
result1=max(max(sun));
result2=min(min(sun));
M=zeros(50);
N=zeros(50);
for k=1:50
    M(k)=k*(result2-result1)/50;
end
for s=1:49;
for m=1:128
    for l=1:6
        if(sun(m,l)>M(s)&sun(m,l)<M(s+1))
            N(s)=N(s)+1;
        end
    end
end
end