A novel two-scan connected-component labeling algorithm

Lecture Notes in Electrical Engineering(2013)

引用 4|浏览15
暂无评分
摘要
This chapter proposes a novel two-scan labeling algorithm. In the first scan, all conventional two-scan labeling algorithms process image lines one by one, assigning each foreground pixel a provisional label, finding and resolving label equivalences between provisional labels. In comparison, our proposed method first scans image lines every four lines, assigns provisional labels to foreground pixels among each three lines, and finds and resolves label equivalences among those provisional labels. Then, it processes the leaving lines from top to bottom one by one, and for each line, assigns provisional labels to foreground pixels on the line, and finds and resolves label equivalences among the provisional labels and those assigned to the foreground pixels on the lines immediately above and below the current line. With our method, the average number of times for checking pixels for processing a foreground pixel will decrease; thus, the efficiency of labeling can be improved. Experimental results demonstrated that our method was more efficient than conventional label-equivalence-based labeling algorithms. © 2013 Springer Science+Business Media Dordrecht.
更多
查看译文
关键词
computer vision,connected component,fast algorithm,label equivalence,labeling,pattern recognition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要