摘要
介绍了一种改进的二值图像连通域快速标记方法。该算法首先找出二值图像中每行的像素直线段,接着利用链表来确定它们之间的连通关系,以此来克服同类算法中像素重复标记和标记归并需大量运算等缺陷,具有一定的使用价值。
This paper presents an improved algorithm for searching connected area in binary image. The algorithm ascertains the segments in each line of the binary image firstly. And then, these segments are united by the lists. This algorithm overcomes the shortcomings of needing a memory of big volume to memorize connecting relationships and a great deal of operations to unite labels,which is helpful to the application.
出处
《计算机与现代化》
2005年第4期11-13,共3页
Computer and Modernization
关键词
二值图像
像素标记
连通域
binary image
pixel labeling
connected area
