首页> 外文期刊>Computers & Graphics >Note: An algorithm for contour-based region filling
【24h】

Note: An algorithm for contour-based region filling

机译:注意:基于轮廓的区域填充算法

获取原文
获取原文并翻译 | 示例
           

摘要

A linear-time algorithm for filling regions defined by closed contours in raster format is proposed. The algorithm relies on a single pass contour labeling and the actual filling is done in a scan-line manner, visiting the interior pixels only once. The interior endpoints of the scan-lines are discovered solely on the basis of the labeled contour. Despite its simplicity and low computation cost, the proposed method fills-in arbitrary shapes correctly, with no obvious exceptions. Possible special cases may arise from the 8-connectivity, inner contour detection. However, in extensive tests on complicated images, the proposed labeling scheme has given correct results.
机译:提出了一种线性时间算法,以栅格格式填充由闭合轮廓定义的区域。该算法依赖于单次通过轮廓标记,并且实际填充以扫描线方式完成,仅访问内部像素一次。仅在标记轮廓的基础上发现扫描线的内部端点。尽管其简单性和低计算成本,但所提出的方法可以正确地填充任意形状,没有明显的例外。 8连通性,内部轮廓检测可能会引起特殊情况。但是,在复杂图像的大量测试中,提出的标记方案已给出正确的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号