摘要
在研究以前二值图像连通算法的基础上,提出了一种基于递归方法的二值图像连通域像素标记算法。通过对二值图像的扫描和分析可得到二值图像中的连通域划分和连通域的数目。算法主要包括两个步骤:对输入的二值图像进行一次扫描,得到所有目标像素的连通域划分和标记的等价对表;利用递归对等价对表进行分析,得到正确的连通标记划分和连通区域数目。实验结果表明,该算法对于任意复杂形状、任意数目(小于1 000)的连通区域都能正确检测。
On the foundation of studying former connecting area algorithms, the paper presents a pixel labeled algorithm based on recursive method of connecting area in binary images. The algorithm determines the distribution and count of connecting areas through once scanning of image. It mainly includes two steps in the algorithm. Firstly, scanning the input binary image is used to get the whole connecting labeled area and the equal marks list. The second step is to analyze the equal marks list by recursive method to ascertain the right distribution and count of connecting areas. Experiments show that it can exactly detect any connecting areas in binary images, which contains complicated shapes and random number （less than 1 000）.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2006年第24期186-188,225,共4页
Computer Engineering
关键词
二值图像
像素标记
递归
Binary image
Pixel labeling
Recursion
