基于拓扑的填充算法的实现  

Implement of Filling Algorithm Based on Topology

作　　者：马玉洁[1] 

机构地区：[1]商丘师范学院计算机科学系,河南商丘476000

出　　处：《煤炭技术》2010年第9期180-181,共2页Coal Technology

摘　　要：论文提出了一种基于拓扑的快速递归的自适应的填充算法来填充二进制图像的内部区域。该算法不仅能对简单图像进行填充,而且也适用于待填充的图像轮廓重叠和模糊的情况。该算法的思想是首先为每一个待填充的区域找出它的填充深度,然后对每一个填充深度为奇数的区域进行填充。对于边界重叠的图像,填充深度不容易找出来,可以使用一种树形的数据结构区域分类来找出填充深度,该树形结构的层次为奇数的叶子结点所代表的区域可以作为填充的对象。最后将该算法用在仿真图像和三维的医学切片图像上,实验证明取得了较好的效果。In this paper,presens a fast-recursive fully automated topology-based algorithm for filling in the interiors of objects that appear in a binary image.The algorithm not only can fill simple images,but also it can suit to image contours overlap and ambiguities which to be filled.It works first is to find the fill depth for every prepared zone,then fills in the zones where depth is an odd number.As for the image which contours overlap and ambiguities,the fill depth is not easy to find,may use a tree-structured region classification to find the fill depth,the leaf nodes that their level are odd can be as the fill region.Finally,the algorithm can be used in phantom images and a slice of three-dimensional medical image,the experiment proved to obtain good results.

关 键 词：计算机图形学 填充 拓扑 树形结构 

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