Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

An algorithm for searching connective regions based on matching between the points of up-contour and down-contour

Xie Gui Peng Jiaxiong Doctoral Candidate; Institute of Pattern Recognition & Artificial Intelligence, Huazhong Univ. of Sci. & Tech., Wuhan 430074, China.  
This paper presents a new algorithm for searching the connective regions in the binary image based on the matching between the up contour and down contour points. The connective regions have the same numbers of the points of up contour and down contour. Because of the one to one match between the contour points, the connective regions can be searched when scanning the image by line. The last line of the image is reached and a connective region is gotten immediately when its points are finished scanning. The steps of the new algorithm′s implementation are given and analyzed in the experiment. Compared the experimental data with the running length mark algorithm, a conclusion is drawn that the new algorithm is more simple and effective.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved