摘要
以图像的补与图像的补的平移的并集作为状态集,以探针与探针拷贝的并集作为输入字母表,用向量加法和减法构造状态转换映射和输出映射,给出了实现数学形态学基本运算膨胀的有限自动机.与通用计算机对图像的串行处理相比较,膨胀自动机采取了并行结构,将运算的空间复杂度降低到了背景像素个数的3倍与探针像素个数的2倍之和.
The paper designs a finite automaton for the basic morphological operation dilation. The state set of the automata is the union of the complete of the image with its translation, and the input alphabet is the union of the probe with its copy. The state transformation and output mapping is constructed by using vector addition and subtraction. Comparing the automata with the general-purpose computers, the former are parallel and the later are serial in architecture. the sum of three times the probe pixel. of the amounts of the image The dilation automata reduce the space complexity to background pixel and the two times of the amount of
出处
《西北师范大学学报（自然科学版）》
CAS
北大核心
2012年第3期48-51,59,共5页
Journal of Northwest Normal University(Natural Science)
基金
山西省重点学科建设专项基金资助项目(20101029)
关键词
图像处理
分形
形态学膨胀
有限自动机
image processing
fractal
morphological dilation
finite automaton
