期刊文献+

一种基于离散Voronoi图的手写体文字细化方法 被引量:5

Algorithm for thinning hand-written text based on Voronoi diagram
下载PDF
导出
摘要 基于一般图形Voronoi图的离散构造法,提出了一种新的文字图像细化算法。该方法首先对文字图像进行水平扫描和垂直扫描,通过游程匹配记录下所有端点游程,并对端点游程进行处理,接着计算文字图像的边界,在计算边界的同时根据端点游程划分出生成元。最后基于一般图形Voronoi图的离散构造法生成文字图像内部的Voronoi边,从而得到文字图像骨架。该方法直接从图像的边界入手,解决了当前已有算法从图像边界近似多边形入手的问题。该方法速度较快,尤其在大篇幅文字图像的细化速度方面具有显著优势,且简单易行,可以较精确地获取文字图像的骨架。 Based on Voronoi diagrams,the authors give a new method of thinning text image.The algorithm scans the text image horizontally and vertically,memorizes all the ends of line segment through the result of matching line segment at first,and deals with the ends of line segment.Then calculate text image boundary,plot generator based on end of line segment at the same time.Finally,according to Voronoi diagrams’ discrete method,the authors get Voronoi border,which is the skeletons of hand-writing text.It is based on image boundary straightly,solves algorithms’ problem formerly which is based on approximate polygon of region boundary.The algorithm has the advantages of fast speed,especially in image at great length.And the algorithm is accurate,efficient and easy to perform.
出处 《计算机工程与应用》 CSCD 北大核心 2008年第15期179-181,184,共4页 Computer Engineering and Applications
基金 河北省教育厅项目(No.2001238)
关键词 细化 骨架 VORONOI图 离散 手写体 thinning,skeleton,Voronoi diagram,discrete,hand-writing
  • 相关文献

参考文献10

  • 1Abuhaiba I,Holt M,Datta S.Processing of binary images of hand-written text documents[J].Pattern Recognition, 1996,29(7): 1161-1177.
  • 2Luk A,Leung S,Lee C,et al.A two-level classifier for fingerprint recognition[C]//Proc of IEEE Internat Symp on Circuits and Systems, Singapore, 1991:2625-2628.
  • 3Lam L,Lee S W,Suen C Y.Thinning mechologies-acomprehensive survey[J].IEEE Trans Patter Analysis and Machine Intelligence, 1992,14(9 ) : 869-885.
  • 4Blum H,A transformation for extracting new description of shape[C]// Wathen-Dunn Wed.Model for the perception of Speech and Visual Form.Cambridge, Massachusetts USA: MIT Press, 1967: 362-380.
  • 5Pavlids T,Ali F.Computer recognition of handwritten numerals by polygonal approximation[J].IEEE Trans Systems Man Sybernet, 1975,5 (6):610-614.
  • 6Lee D T.Medial axis transformation of a planar shape[J].IEEE Trans Pattern Analysis and Machine Intelligence, 1982,4(4):306- 336.
  • 7付庄,王树国,王剑英,蔡鹤皋.基链分治算法与Voronoi区的面积计算定理研究[J].软件学报,2001,12(3):440-447. 被引量:6
  • 8李小俊,张逸新.基于边界点偏置的VORONOI骨架算法的研究[J].计算机应用,2002,22(10):41-43. 被引量:2
  • 9Watanabe T,Murashima S.A method to construct a Voronoi diagram on 2-D digitized space O(1) computing time[C]//The IEICE, 1996,79(3) : 114-122.
  • 10赵晔,张有会,赵志辉,杨俊华.关于一般图形Voronoi图的离散构造法的研究[J].计算机应用与软件,2004,21(6):76-78. 被引量:9

二级参考文献14

  • 1[1]Sugihara K., Approximation of generalized Voronoi diagrauns by ordinary Voronoi diagrams [ J ]. Computer Vision, Graphics, and Image ProcessingGraphical Models and Image Processing, 1993,55:522 ~ 531.
  • 2[2]Takafumi Watanabe and Sadayuki Murashima, A method to construct a Voronoi diagram on 2-D digitized space O(1) computing time[J] .Faculty of Engineering, Kagoshirna University, Kagoshimashi, 1996, J79 - D - I (3):114 ~ 112.
  • 3[3]Kazuhiro Yamada and Kokichi Sugihara ,Approximation of Voronoi diagrams for figures and its improvement[J]. Department of Mathematical Engineering and Information Physics, Graduate School of Engineering, University of Yokyo,1996.
  • 4[4]Voronoi G. ,Nouvelles applications des parameters continues a la theorie des formes quadratiques; Deuxieme memoire: Recherches sur les parplleloedres primitives[J]. Math, 1908,134:198 ~ 287.
  • 5[5]Lee D. T. and Schachter B. J., Two algorithms for constructing a Delaunay triangulation [J]. International Journal of Computer and Information Sciences, 19o0,9:709 ~ 720.
  • 6[6]Ohya T. Iri M. and Murota K., Improvement of the incremental method for the Voronoi diagram with computational comparison of various algorithms[J].Joumal of the Operations Research Society of Japan, 1984,27:306 ~336.
  • 7T. Ohya,M. Iri,K. Murota.Improvements of the incremental method of the voronoi diagram with computational comparison of various algorithms[].J Oper Res Soc Jpn.1984
  • 8Vijay Srinivasan."Voronoi diagram for multiply-connected polygonal domains Ⅰ:Algorithm"[].IBM Journal of Research and Development.1987
  • 9Persson H.NC machining of arbitrarily shaped pockets[].Computer Aided Design.1978
  • 10Lee DT.Medial axis transformation of a planar shape[].IEEE Transactions on Pattern Analysis and Machine Intelligence.1982

共引文献14

同被引文献68

引证文献5

二级引证文献42

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部