摘要
在线标记和区域增长的基础上提出了一种二值图像连通区域标记的快速算法。该算法综合了线标记法和区域增长法的优点,对图像进行一次扫描就可以标记所有连通区域,避免了重复标记问题;同时该算法不受标记的区域形状影响,具有良好的鲁棒性。提出对此算法的进一步优化策略,有效地降低了其搜索次数。最后与传统算法进行了比较,试验结果表明该算法是快速和高效的。
A new algorithm based on line-labeling and region-growing was proposed for binary connected component labeling. All the connected components were labeled with one pass, and had no label collisions. The algorithm was independent of the shapes of the connected regions. Then the new algorithm was optimized and the search time was reduced. The comparative experiments with traditional algorithms show that this new method is more efficient and effective.
出处
《计算机应用》
CSCD
北大核心
2007年第11期2776-2777,2785,共3页
journal of Computer Applications
关键词
连通区域
标记
线标记
区域增长
connected region
labeling
line labeling
region growing