全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

一种基于Delaunay三角化的手写体文字细化方法

DOI: 10.11834/jig.200209298

Keywords: 手写体文字,细化方法,骨架,Delaunay三角化,文字图象,文字识别

Full-Text   Cite this paper   Add to My Lib

Abstract:

为了对手写体文字进行快速准确的识别,基于Delaunay三角化方法,提出了一种新的文字图象细化算法,该算法首先通过对文字图象边界的近似多边形进行Delaunay三角化,同时把其分成一系列保持拓扑关系的三角形,然后根据三角形的类型生成不同的局部骨架;最后连接生成整文字图象的骨架,由于该算法充分利用了图象的全局和局部信息,因此具有速度快,效果好等优点。

References

[1]  [2]Luk A, Leung S, Lee C et al. A two-level classifier for fingerprint recognition[A]. In: Proc. of IEEE Internat. Symp.on Circuits and Systems[C], Singapore, 1991: 2625~2628.
[2]  [4]Ye Q, Danielsson P. Inspection of printed circuits boards by connectivity preserving shrinking[J]. IEEE Trans. Pattern Anal.Machine Intell. , 1988,10(5) :737~743.
[3]  [8]Lam L, Lee S, Suen C Y. Thinning methodologies-A comprehensive survey [J]. IEEE Trans. Pattern Anal. Machine Intell. , 1992,14(9):869~885.
[4]  [10]Rosenfeld A. A characterization of parallel thinning algorithms [J]. Inform. Contr. 1975,29(3) :286~291.
[5]  [13]Pavlidis T. A vectorizer and feature extractor for document recognition [J]. Comput. Vision Graphics Image Process. 1986,35(1):111~127.
[6]  [15]Feng H F, Pavlidis T. Decomposition of polygons into simpler components :feature generation for syntactic pattern recognition [J]. IEEE Trans. Comput. , 1975,24(6) :636~649.
[7]  [17]杨承磊,孟祥旭,李学庆等.基于无向图的图象整体骨架表示模型及其算法[J].计算机学报,2000,23(3):293~299.
[8]  [18]杨承磊,孟祥旭,李学庆等.带状图象交叉区域的骨架求解算法[J].计算机辅助设计与图形学报,2000,12(9):677~681.
[9]  [20]Yuan J, Suan C Y. An optimal O(n) algorithm for identifying line segments from a sequence of chain codes [J]. Pattern Recognition, 1995,28 (5): 635 ~ 646.
[10]  [22]Kirkpatrick D, Klawe M, Tarjan R. Polygon triangulation in O (nloglogn) time with simple data-structures[A]. In:Proc. Sixth Ann. Symp. on Computational Geometry [C], Berkeley, CA,USA, 1990:34~43.
[11]  [1]Abuhaiba I, Holt M, Datta S. Processing of binary images of handwritten text documents [J]. Pattern Recognition, 1996,29(7):1161~1177.
[12]  [3]DiezHiguera J, DiazPernas F, LopezCoronado J. Neural network architecture for automatic chromosome analysis[A]. In:Proc. of SPIE-Applications of Artificail Neural Networks in Image Processing[C], San Jose ,CA,USA,1996:85~94.
[13]  [5]Blum H. A transformation for extracting new description of shape[A]. In: Wathen-Dunn W ed. Model for the perception of Speech and Visual Form[C]. Cambride, Massachusetts USA:MIT Press, 1967:362~380.
[14]  [6]Pavlidis T, Ali F. Computer recognition of handwritten numerals by polygonal approximation[J]. IEEE Trans. Systems Man Sybernet,1975,5(6) :610~614.
[15]  [7]Davies E R, Plummer A P. Thinning algorithms:a critique and a new methodology[J]. Pattern Recognition, 1981,14 (1): 53 ~ 63.
[16]  [9]Arcelli C, Cordelia L, Leviadi S. Parallel thinning of binary pictures[J]. Electronic Lett. , 1975,11(7): 148~149.
[17]  [11]Zhang T Y, Suen C Y. A fast parallel algorithm for thinning digital patterns[J]. Commun. ACM, 1984,27(3) :236~239.
[18]  [12]Datta A, Parui S. A robust parallel thinning algorithm for binary images [ J ]. Pattern Recognition, 1994, 27 ( 9 ):1181~1192.
[19]  [14]Lin J, Chen Z. A Chinese-character thinning algorithm based on global features and contour information [ J ] . Parttern Recognition, 1995,28 (4): 493 ~ 512.
[20]  [16]杨承磊,孟祥旭.一种新的快速细化算法的设计与实现[J].工程图学学报,1998,(3):87~93.
[21]  [19]Melhi M, Ipson S S, Booth W. A novel triangulation procedure for thinning hand written text[J]. Pattern Recognition Letters,2001,22 (10) : 1059~ 1071.
[22]  更多...
[23]  [21]Tarjan R, Wyk V. An O (nlogl ogn)-time algorithm for triangulating a simple polygon [J]. SIAM J. Comput, 1988,17(1) :143~178.
[24]  [23]Joseph, O\'Rourke. Computational geometry in C [ M].Cambride, England :Cambridge University Press, 1994.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133