首页 | 本学科首页   官方微博 | 高级检索  
     

基于递归的二值图像连通域像素标记算法
引用本文:徐正光,鲍东来,张利欣.基于递归的二值图像连通域像素标记算法[J].计算机工程,2006,32(24):186-188.
作者姓名:徐正光  鲍东来  张利欣
作者单位:北京科技大学信息工程学院,北京100083
摘    要:在研究以前二值图像连通算法的基础上,提出了一种基于递归方法的二值图像连通域像素标记算法。通过对二值图像的扫描和分析可得到二值图像中的连通域划分和连通域的数目。算法主要包括两个步骤:对输入的二值图像进行一次扫描,得到所有目标像素的连通域划分和标记的等价对表;利用递归对等价对表进行分析,得到正确的连通标记划分和连通区域数目。实验结果表明,该算法对于任意复杂形状、任意数目(小于1 000)的连通区域都能正确检测。

关 键 词:二值图像  像素标记  递归
文章编号:1000-3428(2006)24-0186-03
收稿时间:2005-12-13
修稿时间:2005-12-13

Pixel Labeled Algorithm Based on Recursive Method of Connecting Area in Binary Images
XU Zhengguang,BAO Donglai,ZHANG Lixin.Pixel Labeled Algorithm Based on Recursive Method of Connecting Area in Binary Images[J].Computer Engineering,2006,32(24):186-188.
Authors:XU Zhengguang  BAO Donglai  ZHANG Lixin
Affiliation:School of Information Engineering, University of Science and Technology Beijing, Beijing 100083
Abstract: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).
Keywords:Binary image  Pixel labeling  Recursion
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号