基于边过程的围线追踪与围线的树结构  

GRACK BASED CONTOUR TRACING AND TREE STRUCTURE OF CONTOURS

作　　者：吴立德[1] 林应强[1] 

机构地区：[1]上海复旦大学计算机科学系

出　　处：《计算机学报》1996年第6期457-465,共9页Chinese Journal of Computers

基　　金：国家攀登计划;863高科技基金

摘　　要：现有的基于象素的区域围线追踪算法在追踪形状复杂区域的围线时往往失效，而且没有简单的方法来加以改进．为此，提出了一种基于边过程的区域困线追踪算法．该算法不仅能追踪形状任意复杂区域的围线，还能给出表示围线之间包含关系的树结构，追踪出的围线由边过程组成，并且可以十分方便地转化成由象素组成的围线或扩展围线，算法的计算复杂性是线性的，即Ｏ（Ｐ），其中Ｐ＝Ｎ×Ｎ是图象中象素的个数，而Ｎ为图象的线性尺寸．it is pointed out that pixel-based algorithms for contour tracing fail in some cases due to the complicated relation between contours, and it is very difficult, if not impossible, to improve. Therefore a crack based contour representation and tracing algorithm is proposed. The algorithm can trace the contours of any region and give the inclusion relations among the contours. The contours consist.of cracks, but they can be converted into conventional pixel-based contours and pixelbased extended contours easily. The computational complexity of the algorithm is linear.

关 键 词：围线追踪 边过程 树结构 围线 二值图象 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]