.png){kind=icon}
返回
An efficient first-scan method for label-equivalence-based labeling algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2009.08.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Label-equivalence-based connected-component labeling algorithms complete labeling in two or more raster scans. In the first scan, each foreground pixel is assigned a provisional label, and label equivalences between provisional labels are recorded. For doing this task, all conventional algorithms use the same mask that consists of four processed neighbor pixels to process every foreground pixel. This paper presents a simple yet efficient first-scan method for label-equivalence-based labeling algorithms. In our method, foreground pixels following a background pixel and those following a foreground pixel are processed in a different way. By use of this idea, the pixel followed by the current foreground pixel can be removed from the mask. In other words, the mask used in our method consists of three processed neighbor pixels. Thus, for processing a foreground pixel, the average number of times for checking the processed neighbor pixels in the first scan is reduced from 2.25 to 1.75. Because the current foreground pixel following a background pixel or a foreground pixel can be known without any additional computing cost, our method is efficient for any image that contains at least one foreground pixel. Experimental results demonstrated that our method is effective for improving the efficiency of label-equivalence-based labeling algorithms. (C) 2009 Published by Elsevier B.V.
Keyword:
Connected component
Labeling algorithm
First scan
Mask
Pattern recognition
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
查看更多内容