非洪泛的基于区域标记的图像分割与填充算法

提出了一种对大分辨率图像有效的、基于区域标记的图像分割与填充算法,能分割并填充高分辨率图像中任意形状的连通区域。算法不使用栈结构,不使用递归方法,仅通过一次标记和一次填充过程即可完成对主连通区域的分割和填充,不仅易于实现还克服了基于洪泛的种子填充算法和扫描线填充算法容易出现栈空间溢出的缺点,具有较强的实用性。

An Un-flooding Image Segment and Filling Algorithm Based on Region Marking

This thesis proposes an un-flooding image segment and filling algorithm based on region marking, which is applicable for high-resolution images, namely that the arbitrary shapes in the high-resolution images can be filled by this algorithm. Without stack and recursion, to segment and fill the main connected region by once marking once filling process, this algorithm overcomes the memory overflow deficiency in seed filling algorithms and scan line filling algorithms, mean while, it is an easy and practical algorithm.