论文标题
一个新的基于运行的连接组件标签，用于有效分析和处理孔
A New Run-based Connected Component Labeling for Efficiently Analyzing and Processing Holes
论文作者
论文摘要
本文介绍了用于计算邻接树的前景和背景标签的新的连接组件标签和分析算法。功能的计算（边界框，第一个统计矩，Euler编号）是在即时完成的。传递闭合实现了有效的孔处理，可以在其特征与周围连接的组件合并时可以填充，而无需重新分组图像。与现有算法的比较表明，这种新算法可以比处理黑白组件处理算法更快地完成所有这些计算。
This article introduces a new connected component labeling and analysis algorithm for foreground and background labeling that computes the adjacency tree. The computation of features (bounding boxes, first statistical moments, Euler number) is done on-the-fly. The transitive closure enables an efficient hole processing that can be filled while their features are merged with the surrounding connected component without the need to rescan the image. A comparison with existing algorithms shows that this new algorithm can do all these computations faster than algorithms processing black and white components.
