基于模板保留的快速并行细化算法  

FAST PARALLEL THINNING ALGORITHM BASED ON RESERVED TEMPLATES

作　　者：贺继刚[1] 杨晓伟[1] 吴广潮[1] 郝志峰[1] 

机构地区：[1]华南理工大学数学科学学院,广东广州510640

出　　处：《计算机应用与软件》2007年第12期26-28,103,共4页Computer Applications and Software

基　　金：国家自然科学基金(10471045);广东省自然科学基金(031360;04020079)

摘　　要：快速并行算法(FPA)是经典算法中比较好的一种细化算法,但其存在固有缺陷,可能产生信息丢失。为了克服这个缺点,首先验证了FPA映像算法,在此基础上,提出了FPA重合算法,最后为了减少计算时间和冗余信息,提出了基于模板保留的FPA算法。实验结果表明,基于模板保留的FPA算法运行速度快,对手写体汉字能很好地得到中心骨架,没有断点,较好地保持了原图像的拓扑结构,且细化为只有一个像素宽的图像。Fast parallel algorithm（FPA） is one of the best classical thinning algorithms for binary-value images. However it has some inherent shortages and may generate information missing. To overcome this drawback,firstly, FPA mapping algorithm is verified. Based on this, FPA superposition algorithm is given. Finally, a fast parallel thinning algorithm based on reserved templates is proposed to reduce the computational time and redundant information. The experimental results show that the novel algorithm is fast. It can get the central skeleton without discontinuous points,keep the shape of the original images perfectly,and get the skeleton of only one-pixel width.

关 键 词：细化 快速并行算法 FPA映像算法 FPA重合算法 模板保留 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]