一种有效的快速细化算法  

Efficient Quick Thinning Algorithm

作　　者：杨兴炜[1] 刘文予[1] 白翔[1] 

机构地区：[1]华中科技大学电子与信息工程系,湖北武汉430074

出　　处：《小型微型计算机系统》2006年第7期1343-1346,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金资助项目(No.60273099)资助.

摘　　要：提出一种有效的快速细化算法,包括两个步骤:首先通过建立w e igh t-va lue的概念对模板进行分类,然后按照分类后的模板对象素进行删除,使之成为由双层点或单层点构成的子图像;为保证能将双层点细化为单层点,提出两个模板,依据这两个模板进行并行细化从而得到单象素骨架.实验证明这个方法是快速有效的.A new thinning algorithm was addressed in this paper. The most important feature in this paper was that it thins symbols to their central lines with high speed. This meant that the method was rotation invariant. The method in this paper contained two steps. The first one used the concept of weight-value to separate the rules into 6 groups in order to improve the speed of thinning; The second one used 2 rules to make sure that the skeleton was single pixel and can preserve the connectivity. The results showed that this method had good effect on preserving the topology of symbols and letters.

关 键 词：细化 模板 双层点 weight—value 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]