8-鄰域邊界跟蹤算法

1、C+利用點的八鄰域信息，選擇下一個點作為邊界點，這個算法需要選擇一個開始點，可以選擇圖像上是目標(biāo)點，在最上，最左的點。然后查看它的八鄰域的點，從右下方45°的位置開始尋找，如果是目標(biāo)點，將沿順時針90°作為下一次尋找的方向，如果不是，則逆時針45。繼續(xù)尋找，一旦找到重復(fù)上面的過程。void VessDibTrack(HDIB hdib,vector<POINT >& pt) /八鄰域un sig ned char *lpSrc;LPSTR lpDIB = (LPSTR) :GlobalLock(HGLOBAL)hdib);in t cxDIB = (in

2、t) :DIBWidth(lpDIB);/ Size of DIB - xin t cyDIB = (int) :DIBHeight (l pDIB);/ Size of DIB - yLPSTR lpDIBBits=:Fi ndDIBBits (I pDIB);long lLi neBytes = WIDTHBYTES(cxDIB * 8); /計算圖像每行的字節(jié)數(shù)/尋找開始點，最右，最下/先行，后列int i,j;POINT startPt,currPt;for (i = 0;i<cyDIB;+i)for (j = 0;j<cxDIB;+j)lpSrc = (un sig ne

3、d char*)lpDIBBits + ILin eBytes * (cyDIB -1 - i) + j;if (*lpSrc=0) /是黑點startPt.x = i;startPt.y = j;/ 停止條件i = cyDIB;j = cxDIB;/設(shè)置方向數(shù)組/ int direction82= -1,-1,0,-1,1,-1,1,0,1,1,0,1,-1,1,-1,0;int directio n82 = -1,1,0,1,1,1,1,0,1,-1,0,-1,-1,-1,-1,0;int startDirect ;BOOL Fin dStartPoi nt = FALSE;BOOL Fi

4、 ndPoi nt = FALSE;/開始跟蹤currPt.x = startPt.x;currPt.y = startPt.y;POINT NextPt ;int NextPtValue;startDirect = 0;int cnt= 0;while(!Fi ndStartPoi nt&&cnt<100000)Fi ndPoi nt = FALSE;pt.push_back(currPt);while(!Fi ndPoi nt)/沿預(yù)定方向掃描，尋找下一個點NextPt.x = currPt.x + directio nstartDirect1;NextPt.y =

5、currPt.y + directio nstartDirectO;IpSrc = (un sig ned char*)lpDIBBits + ILin eBytes * (cyDIB -1 - NextPt.x) +NextPt.y;/NextPtValue = GetPiexValue(hdib,NextPt.x,NextPt.y);NextPtValue = * lpSrc;if (NextPtValue =0&&NextPt.x>=0&&NextPt.x<cyDIB&&NextPt.y>=0&&NextPt.y<cxDIB)Fi ndPoi nt = TRUE;currPt.x = NextPt.x;currPt.y = NextPt.y;if (currPt.x = startPt.x&&currPt.y = startPt.y)Fi ndStartPoi nt = TRUE;startDirect = startDirect-2;if(startDirect<0) startDirect = startDirect+8;elsestartDirect = startDirec