This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Set of Constraint-Free Character Recognition Grammars
December 1990 (vol. 12 no. 12)
pp. 1210-1217

A general pattern-recognition procedure for application to unconstrained alphanumeric characters is presented. The procedure is designed to allow hierarchical redescription of the input images in terms of significant elements only, and formal developments are given within the framework of elementary phrase-structure grammars. The extraction of the primitives associated with the terminal vocabularies of the grammars is always deterministic, and the productions of the parsers are characterized by a significant degree of topological fidelity. Preliminary experimental results indicate recognition rates comparable to the state of the art, but with a considerable reduction in computing time.

[1] P. Ahmed and C. Y. Suen, "Computer recognitions of totally unconstrained handwritten zip codes,"Int. J. Pattern Recognition and Artificial Intell., 1, 1987.
[2] G. Baptista and K. M. Kulkarni, "A high accuracy algorithm for recognition of handwritten numerals,"Pattern Recognition, vol. 21, 1988.
[3] M. Berthod, "On-line analysis of cursive writing," inComputer Analysis and Perception, Vol. 1: Visual Signs, C. Y. Suen and R. De Mori, Eds. Boca Raton, FL: CRC Press, 1982.
[4] C. H. Chen,Statistical Pattern Recognition. New York: Hayden, 1973.
[5] N. Chomsky, "On certain formal properties of grammar,"Inform. Contr., vol. 2, 1959.
[6] B. Duerr, W. Haettich, H. Tropf, and G. Winkler, "A combination of statistical and syntactical pattern recognition applied to classification of unconstrained handwritten numerals,"Pattern Recognition, vol. 12, 1980.
[7] M. S. El-Wakil and A. A. Shoukry, "On-line recognition of handwritten isolated Arabic characters,"Pattern Recognition, vol. 22, 1989.
[8] J. Feder, "Languages of encoded line-patterns,"Inform. Contr., vol. 13, 1968.
[9] T. J. Fountain, "Array architectures for iconic and symbolic image processing," inProc. 8th Int. Conf. Pattern Recognition, 1986.
[10] H. Freeman, "On encoding of arbitrary geometric configurations,"IEEE Trans. Electron. Comput., vol. EC-10, 1961.
[11] H. Freeman, "On the digital-computer classification of geometric line patterns," inProc. Nat. Electron. Conf., 1962.
[12] K. S. Fu,Syntactic Methods in Pattern Recognition. New York: Academic, 1974.
[13] K. S. Fu,Syntactic Pattern Recognition, Applications. New York: Springer-Verlag, 1977.
[14] K. S. Fu,Syntactic Pattern Recognition and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[15] K. Fukunaga,Introduction to Statistical Pattern Recognition. New York: Academic, 1972.
[16] J. S. Huang and K. Chuang, "Heuristic approach to handwritten numeral recognition,"Pattern Recognition, vol. 19, 1986.
[17] P. J. Knobe and R. G. Wiley, "A linguistic approach to mechanical pattern recognition," inProc. IEEE Comput. Conf., 1967.
[18] L. Lam and C. Y. Suen, "Structural classification and relaxation matching of totally unconstrained handwritten Zip-code numbers,"Patt. Recogn., vol. 21, no. 1, pp. 19-31, 1988.
[19] R. Manara and L. Stringa, "The EMMA system: An industrial experience on a multiprocessor," inLanguages and Architectures for Image Processing, M. G. B. Duff and S. Levialdi, Eds., New York: Academic, 1981.
[20] J. Mantas, "An overview of character recognition methodologies,"Pattern Recognition, vol. 19, 1986.
[21] N. J. Nillson,Learning Machine-Foundations of Trainable Pattern-Classifying System. New York: McGraw-Hill, 1965.
[22] J. F. O'Callaghan, "Problems in on-line character recognition," inPicture Language Machines, S. Kaneff, Ed. New York: Academic, 1970.
[23] T. Pavlidis, "Analysis of set patterns,"Pattern Recognition, vol. 1, 1968.
[24] T. Pavlidis, "Syntactic feature extraction for shape recognition," inProc. 3rd Int. Joint Conf. Pattern Recognition, 1976.
[25] T. Pavlidis,Structural Pattern Recognition. New York: Springer-Verlag, 1977.
[26] S. R. Ramesh, "A generalized character recognition algorithm: A graphical approach,"Pattern Recognition, vol. 22, 1989.
[27] H. Samet, "The quadtree and related hierarchical data structures,"Comput. Surveys, vol. 16, pp. 187-260, 1984.
[28] G. S. Sebestyen,Decision Process in Pattern Recognition. New York: Academic, 1968.
[29] H. Peng and H. Stark, "One-step image reconstruction from incomplete data in computer tomography,"IEEE Trans. Med. Imaging, vol. 8, pp. 16-31, 1989.
[30] L. Stringa, "LCD: A formal language for constraint-free handprinted character recognition," inProc. 4th Int. Joint Conf. Pattern Recognition, 1978.
[31] L. Stringa, "Efficient classification of totally unconstrained handwritten numerals with a trainable multilayer network,"Pattern Recognition Lett., vol. 10, 1989.
[32] L. Stringa, "A structural approach to automatic primitive extraction in handprinted character recognition," inProc. Int. Workshop Frontiers in Handwriting Recognition, Montreal P. Q., Canada, 1990.
[33] L. Stringa and C. Furlanello, "A trainable multilayer network with high computing efficiency," IRST Tech. Rep., 1988.
[34] C. Y. Suen, "Distinctive features in automatic recognition of handprinted characters,"Signal Processing, vol. 4, 1982.
[35] C. Y. Suen, "Character recognition by computer and applications," inHandbook of Pattern Recognition and Image Processing. New York: Academic, 1986.
[36] C. Y. Suen, R. Shinghal, and C. C. Kwan, "Dispersion factor: A quantitative measurement of the quality of handprinted characters," inProc. Int. Conf. Cybern. and Soc., 1977.
[37] S. L. Xie and M. Suk, "On machine recognition of hand-printed Chinese characters by feature relaxation,"Patt. Recogn., vol. 21, no. 1, pp. 1-7, 1988.
[38] E. F. Yhap and E. C. Greanias, "An on-line Chinese character recognition system,"IBM J. Res. Develop., vol. 25, 1981.
[39] T. Y. Young and T. W. Calvert,Classification, Estimation and Pattern Recognition. Amsterdam: Academic Elsevier, 1973.

Index Terms:
primitive extraction; constraint-free character recognition; pattern-recognition; alphanumeric characters; phrase-structure grammars; topological fidelity; character recognition; grammars; topology
Citation:
L. Stringa, "A New Set of Constraint-Free Character Recognition Grammars," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 12, pp. 1210-1217, Dec. 1990, doi:10.1109/34.62612
Usage of this product signifies your acceptance of the Terms of Use.