English

应用科学学报

• 信号与信息处理 • 上一篇    下一篇

Blob分析中基于游程链的连通区域标记

张二虎,冯江   

  1. 西安理工大学 信息科学系，陕西 西安 710048

  • 收稿日期:2007-09-10 修回日期:2008-06-29 出版日期:2008-09-27 发布日期:2008-09-27
  • 通信作者: 张二虎

Run-List Based Connected Components Labeling for Blob Analysis

ZHANG Er-hu, FENG Jiang   

  1. Department of Information Science, Xi’an University of Technology, Xi’an 710048, China

  • Received:2007-09-10 Revised:2008-06-29 Online:2008-09-27 Published:2008-09-27
  • Contact: ZHANG Er-hu

被引次数

34

摘要： Blob分析是机器视觉系统中的一个重要组成部分，为满足工业应用的实时性要求需研究快速高效标记算法.该文提出一种基于游程链的快速Blob分析法，使用游程链表和动态数组，建立相邻两行游程信息的动态链表，通过分析游程节点间连通性标记游程节点.该方法只需扫描图像一次，并且无需建立等价表和进行等价标记合并，克服了现有算法中的标记冗余，另外还能标记连通区域中的内洞.实验结果表明该方法对于任意复杂形状、任意数目的Blob区域都能正确检测并计算参数，并且具有很快的速度和很好的稳定性.该方法已成功应用到印刷缺陷在线检测系统中.

关键词: Blob分析, 连通区域标记, 游程链表, 动态数组

Abstract: Blob analysis is an important part of machine vision system. Fast and efficient Blob analysis is needed to meet real-time demands in industrial applications. This paper presents a fast Blob analysis algorithm based on run-list. The algorithm uses the method of run-lists and dynamic array to build dynamic chain tables for storing two neighbor rows run-coding information. The run list node can be labeled by analyzing its connectivity. This algorithm requires only a single pass over the image, without the need to build an equivalence table and to unite equivalent labels. It can avoid label redundancies present in conventional algorithms. In addition, it can also label holes in blobs. Experimental results show that it can correctly label any Blob regions with complicated shapes and random numbers, and compute blobs features. With faster speed and good stability, the proposed labeling algorithm has been successfully applied in an on-line defect detection system for printed matter.

Key words: Blob analysis, connected component labeling, run-lists, dynamic array

中图分类号: