【摘要】 二值图像连通成份标记在很多计算机图像处理问题中起到重要作用，提高标记算法的效率非常必要。本文提出了一个二值图像连通成份标记的快速算法。算法采用了平面扫描方式，在考察相邻两列间可能的连通性时采用了在区间树上查找的技巧，使算法的运行速度非常快。对ｎ×ｎ二值图像，算法的运行时间是Ｏ（ｎ２ｌｏｇｎ）的。更多还原

【Abstract】 Connected computents labelling of a binary image is very useful in some areas of image processing so it is very important to improve the running efficiency of labelling procedure.In this paper a fast algorithm for connected components labelling of a binary image is proposed.In suggested algorithm the plane sweep technique is adopted and the search technique on an interval tree is applied to determine the connectivity between two adjacent columns.Thus,the high speed is achieved.The algorithm runs in O(n 2logn) time,where n×n is the size of the binary image.更多还原