摘要
由于处理时间及存储空间的限制,常规的区域标记算法往往无法满足实时图像处理的需要。针对这些不足,提出了一种新的快速区域标记算法。通过改变游程编码的存储结构,建立编码间的亲缘关系,实现快速地址寻访,完成二值图像中所有区域目标对象的标记过程。与传统的标记算法相比,降低了算法复杂度,缩短了处理时间。
Common region labeling algorithms often cannot meet the demands of processing image at real-time because of the limit of processing time and memory space. A fast region-labeling algorithm is proposed in view of this shortcoming. Through modifying storage structure of run-length coding, constructing relationship between codes and performing fast address access, a labeling process for all region objects in binary image can be realized. Compared with the traditional labeling algorithms, this algorithm reduces algorithm complexity and shortens processing time.
出处
《光电工程》
EI
CAS
CSCD
北大核心
2004年第6期63-65,共3页
Opto-Electronic Engineering
关键词
二值图像
区域标记
游程编码
实时图像处理
Binary image
Region labeling
Run-length code
Real-time image processing