icm---条件迭代算法

function y=icm1(f,k) %GMM ite=0; [m,n]=size(f); y=zeros(m,n); ff=wextend('2','symw',f,1); beta=1; %label=ceil(k.*rand(m,n)); tihuan=kmeans(f(:),k); label=zeros(m,n); label(:)=tihuan(:); theta=zeros(4,k); vark=zeros(k,1); f1=ff(1:m,2:n+1); f2=ff(2:m+1,1:n); f3=ff(3:m+2,2:n+1); f4=ff(2:m+1,3:n+2); f11=f1.*f1; f12=f1.*f2; f13=f1.*f3; f14=f1.*f4; f22=f2.*f2; f23=f3.*f2; f24=f2.*f4; f33=f3.*f3; f34=f3.*f4; f44=f4.*f4; ff1=f.*f1; ff2=f.*f2; ff3=f.*f3; ff4=f.*f4; while ite<1000 && sum(sum(abs(y-label)))>0 ite=ite+1; y=label; labelext=wextend('2','symw',label,1); for i=1:k li=find(label==i); fi11=sum(f11(li)); fi12=sum(f12(li)); fi13=sum(f13(li)); fi14=sum(f14(li)); fi22=sum(f22(li)); fi23=sum(f23(li)); fi24=sum(f24(li)); fi33=sum(f33(li)); fi34=sum(f34(li)); fi44=sum(f44(li)); fif1=sum(ff1(li)); fif2=sum(ff2(li)); fif3=sum(ff3(li)); fif4=sum(ff4(li)); theta(:,i)=inv([fi11,fi12,fi13,fi14;fi12,fi22,fi23,fi24;fi13,fi23,fi33,fi34;fi14,fi24,fi34,fi44])*[fif1;fif2;fif3;fif4]; vt=f(li)-theta(1,i).*f1(li)-theta(2,i).*f2(li)-theta(3,i).*f3(li)-theta(4,i).*f4(li); vark(i)=std(vt); end for i=1:m for j=1:n energy=ones(k,1)*100000000000000; for h=1:k fl=find(labelext(i:i+2,j:j+2)==h); num=numel(fl); vst=10-2*num; energy(h)=beta*vst+log(vark(h))+(f(i,j)-theta(1,h).*f1(i,j)-theta(2,h).*f2(i,j)-theta(3,h).*f3(i,j)-theta(4,h).*f4(i,j)).^2/(2*vark(h).^2); end label(i,j)=find(energy==min(energy)); end end %beta=beta*1.07; end y=label; imshow(mat2gray(y));