分析快速细化算法和 OPTA 细化算法不足产生的内在原因 ,提出一种新的基于重心的快速细化算法.该算

法根据被细化图像的特点 ,用密度重心快速将纹线细化到 3 个像素宽度内 ,计算 4 邻域拓扑实现彻底细化.仿真结

果表明 ,在细化效率方面 ,该算法一次遍历删除超过一半的大量冗余像素 ,是快速细化算法的 3～7 倍 在细化要求

方面 ,该算法可达到绝对单像素、 光滑无毛刺 ,并能保持端点不被吞噬 ,能够很好地满足图像细化的要求.

-The int rinsic origin of deficiencies in both t he fast t hinning algorit hm ( F TA) and one2pass

t hinning algorithm (OPTA) was analyzed , and a barycenter based fast t hinning algorit hm was presented.

According to t he image’ s feat ure to be fined , the veins of t he image were fined to be of t hree pixel in widt h

by using density barycenter and t hen t he 42neighborhood topology was comp uted to make complete

t hinning. Simulation result showed t hat , in connection wit h t he t hinning efficiency , t he proposed algo2

rit hm exhibited so perfect ly that a great amount (more t han a half ) of redundant pixel s was eliminated af2

ter single overall checking , being 3 to 7 times faster t han t hat wit h fast t hinning algorit hm. As to t he re2

quirement of t hinning , this algorithm could implement absolute single2pixel t hinning wit hout blurred edges

and keep the ends un2swallowed , so that t he requirement of image t hinning was well met .