主题:帮忙看看这个程序!(help)
利用极限腐蚀来处理图片!(帮忙解释一下程序意思,大概的思路!)
[Im,Connex_Num(1)]=bwlabel(A(:,:,1)) ; %计算图像中连通区域的数量
B=[0,1,1,0;1,1,1,1;1,1,1,1;0,1,1,0];%近似圆形的结构元
%得到极限腐
k=1; n=0;Connex_Num0=Connex_Num(1);
while sum(sum(A(:,:,k)))~=0
A(:,:,k+1)= imerode(A(:,:,k),B); %检查A(:,:,n+1)的联通情况,求一个最终连通分量
[Im,Connex_Num(k+1)]=bwlabel(A(:,:,k+1));
if Connex_Num0<Connex_Num(k+1) % 成立,更新Connex_Num0
Connex_Num0=Connex_Num(k+1);
end
if Connex_Num0>Connex_Num(k+1) % 成立,求一个最终联通分量,更新 Connex_Num0
Connex_Num0=Connex_Num(k+1);
temp1=A(:,:,k+1);
temp2=zeros(size(A(:,:,k+1)));
while sum(sum(temp1-temp2))
temp2=temp1;
temp1=imdilate(temp1,B)&A(:,:,k); % Uk =((Ak +1)膨胀{ B});Ak ??
end %while_end
n=n+1;U(:,:,k)=temp1;
y(:,:,n)=A(:,:,k)-U(:,:,k); % Yk = Ak–Uk ??
Y=Y+y(:,:,n);
end
k=k+1;
end
[em2]大家帮帮忙!谢谢
[Im,Connex_Num(1)]=bwlabel(A(:,:,1)) ; %计算图像中连通区域的数量
B=[0,1,1,0;1,1,1,1;1,1,1,1;0,1,1,0];%近似圆形的结构元
%得到极限腐
k=1; n=0;Connex_Num0=Connex_Num(1);
while sum(sum(A(:,:,k)))~=0
A(:,:,k+1)= imerode(A(:,:,k),B); %检查A(:,:,n+1)的联通情况,求一个最终连通分量
[Im,Connex_Num(k+1)]=bwlabel(A(:,:,k+1));
if Connex_Num0<Connex_Num(k+1) % 成立,更新Connex_Num0
Connex_Num0=Connex_Num(k+1);
end
if Connex_Num0>Connex_Num(k+1) % 成立,求一个最终联通分量,更新 Connex_Num0
Connex_Num0=Connex_Num(k+1);
temp1=A(:,:,k+1);
temp2=zeros(size(A(:,:,k+1)));
while sum(sum(temp1-temp2))
temp2=temp1;
temp1=imdilate(temp1,B)&A(:,:,k); % Uk =((Ak +1)膨胀{ B});Ak ??
end %while_end
n=n+1;U(:,:,k)=temp1;
y(:,:,n)=A(:,:,k)-U(:,:,k); % Yk = Ak–Uk ??
Y=Y+y(:,:,n);
end
k=k+1;
end
[em2]大家帮帮忙!谢谢