SHAPE VECTORS - AN EFFICIENT PARAMETRIC REPRESENTATION FOR THE SYNTHESIS AND RECOGNITION OF HAND SCRIPT CHARACTERS

被引:14
作者
RAO, PVS
机构
[1] Computer Systems and Communications Group, Tata Institute of Fundamental Research, Bombay, 400 005, Homi Bhabha Road
来源
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES | 1993年 / 18卷
关键词
SHAPE VECTOR; CURSIVE SCRIPT; CHARACTER SYNTHESIS; SCRIPT RECOGNITION;
D O I
10.1007/BF02811383
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Earlier work by the author has established: (i) that cursive script can be synthesised out of individual characters by using polynomial merging functions which satisfy boundary conditions of continuity of the displacement functions x(t) and y(t) for each character and their first and second derivatives; and (ii) that the procedure lends itself to a Bezier curve based formulation. This was done since cursive writing avoids discontinuities (of shape) between individual characters as well as discontinuities in pen movement. We show here that even individual characters can be synthesised out of more primitive elements by using the same merging functions. We choose directed straight lines which we call shape vectors as basic elements for this. Script characters generally have shapes which are essentially straight segments alternating with 'bends' or regions of relatively high curvature. For a character with n bends, we need only n + 1 shape vectors. Thus, each script character needs only three to seven shape vectors, depending on its complexity. The ''character generation'' shape vectors are derived from the original character by means of a simple procedure that identifies comparatively straight regions in it. These are then approximated to straight lines by linear regression and positioned to be tangential to the original curve. The synthesised version of this character is obtained by 'merging' or concatenating these vectors. The close fit between the original and resynthesised characters demonstrates that the shape vectors adequately characterise their identities and shapes. Data reduction ratios in the range of 15 to 25 are thus possible. This method thus shows good promise as a possible basis for script character recognition, and a recognition scheme based on it has yielded an accuracy of 94% for a vocabulary size of 67 words.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 10 条
[1]  
Bezier P.E, Numerical control — mathematics and applications, (1972)
[2]  
Eden M., Handwriting and pattern recognition, IRE Trans., 8 IT, pp. 160-166, (1960)
[3]  
Eden M., Halle M., The characterization of cursive writing, 4th London Symposium on Information Theory, (1961)
[4]  
Farag R.F.H, Word-level recognition of cursive script, IEEE Trans. Comput., 100-121, pp. 172-175, (1979)
[5]  
Mokhtarian G., Mackworth A., Scale-based description and recognition of planar curves and two-dimensional shapes, IEEE Trans. Pattern Anal. Machine Intell., 8 PAMI, pp. 34-43, (1986)
[6]  
Ramasubramanian V., Rao P.V.S, Connected script synthesis by character concatenation — An overlap and weighted average formulation, Modern trends in information technology, (1988)
[7]  
Rao P.V.S, Cursive script recognition using neural nets, Proceedings of International Conference on Automation, Robotics and Computer Vision, (1990)
[8]  
Rao P.V.S, Ramasubramanian V., Connected script synthesis by character concatenation — A Bezier curve formulation, Inst. Electron. Telecommun. Eng., 37, pp. 485-493, (1991)
[9]  
Van der Gon D., Thuring J., A handwriting simulator, Physiol. Med. Biol., 6, pp. 407-414, (1962)
[10]  
Yasuhara M., Identification and decomposition of fast handwriting system, IEEE Trans. Circuits Syst., 30 CAS, pp. 828-832, (1983)