?? findldnode.m
字號:
function [ tmpNode ] = findldNode( mask )%UNTITLED1 Summary of this function goes here% Detailed explanation goes hereleastN=inf;ii=0;jj=0;for i=1:size(mask,1) for j=1:size(mask,2) if(mask(i,j)==0) n=0; if ((i-2)>0 & (j-1)>0) n=n+1; end if ((i-2)>0 & (j+1)<=size(mask,2)) n=n+1; end if ((i-1)>0 & (j+2)<=size(mask,2)) n=n+1; end if ((i+1)<=size(mask,1) & (j+2)<=size(mask,2)) n=n+1; end if ((i+2)<=size(mask,1) & (j+1)<=size(mask,2)) n=n+1; end if ((i+2)<=size(mask,1) & (j-1)>0) n=n+1; end if ((i+1)<=size(mask,1) & (j-2)>0) n=n+1; end if ((i-1)>0 & (j-2)>0) n=n+1; end if n<leastN leastN=n; ii=i; jj=j; end end end endif leastN==inf tmpNode=[];else tmpNode(1,1)=(ii-1)*size(mask,2)+jj; if ((ii-2)>0 & (jj-1)>0) tmpNode(1,end+1)=(ii-3)*size(mask,2)+jj-1; end if ((ii-2)>0 & (jj+1)<=size(mask,2)) tmpNode(1,end+1)=(ii-3)*size(mask,2)+jj+1; end if ((ii-1)>0 & (jj+2)<=size(mask,2)) tmpNode(1,end+1)=(ii-2)*size(mask,2)+jj+2; end if ((ii+1)<=size(mask,1) & (jj+2)<=size(mask,2)) tmpNode(1,end+1)=ii*size(mask,2)+jj+2; end if ((ii+2)<=size(mask,1) & (jj+1)<=size(mask,2)) tmpNode(1,end+1)=(ii+1)*size(mask,2)+jj+1; end if ((ii+2)<=size(mask,1) & (jj-1)>0) tmpNode(1,end+1)=(ii+1)*size(mask,2)+jj-1; end if ((ii+1)<=size(mask,1) & (jj-2)>0) tmpNode(1,end+1)=ii*size(mask,2)+jj-2; end if ((ii-1)>0 & (jj-2)>0) tmpNode(1,end+1)=(ii-2)*size(mask,2)+jj-2; endend?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -