This Article 
 Bibliographic References 
 Add to: 
Recognition of Handwritten Cursive Arabic Characters
June 1994 (vol. 16 no. 6)
pp. 664-672

An automatic off-line character recognition system for handwritten cursive Arabic characters is presented. A robust noise-independent algorithm is developed that yields skeletons that reflect the structural relationships of the character components. The character skeleton is converted to a tree structure suitable for recognition. A set of fuzzy constrained character graph models (FCCGM's), which tolerate large variability in writing, is designed. These models are graphs, with fuzzily labeled arcs used as prototypes for the characters. A set of rules is applied in sequence to match a character tree to an FCCGM. Arabic handwritings of four writers were used in the learning and testing stages. The system proved to be powerful in tolerance to variable writing, speed, and recognition rate.

[1] C. H. Leung, Y. S. Cheung, and Y. L. Wong, "A knowledge-based stroke-matching method for Chinese character recognition,"IEEE Trans. Syst. Man Cybernet., vol. SMC-17, no. 6, pp. 993-1003, 1987.
[2] F. H. Cheng, W. H. Hsu, and M. Y. Chen, "Recognition of handwritten Chinese characters by modified Hough transform techniques,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-11, pp. 429-439, Apr. 1989.
[3] P. Siy and C. S. Chen, "Fuzzy logic for handwritten numeral character recognition,"IEEE Trans. Syst. Man Cybernet., vol. SMC-4, pp. 570-575, Nov. 1974.
[4] W. J. M. Kickert and H. Koppelaar, "Application of fuzzy set theory to syntactic pattern recognition of handwritten capitals,"IEEE Trans. Syst. Man Cybernet., vol. SMC-6, pp. 148-151, Feb. 1976.
[5] G. Wolberg, "A syntactic omni-font character recognition system, inProc. IEEE Computer Vision and Pattern Recognition Conf., May 1986, pp. 168-173.
[6] A. Rajavelu, M. Musavi, and M. Shirvaikar, "A neural network approach to character recognition,"Neural Networks, vol. 2, no. 5, pp. 387-394, 1989.
[7] Y. Le Cunet al., "Handwritten digit recognition: Applications of neural network chips and automatic learning,"IEEE Commun. Mag., pp. 41-46, Nov. 1989.
[8] T. Pavlidis,Algorithms for Graphics and Image Processing. Rockville, MD: Computer Science Press, 1982.
[9] S. Stefanelli and A. Rosenfeld, "Some parallel thinning algorithms for digital pictures,"J. ACM, vol. 18, pp. 255-264, 1971.
[10] E. S. Deutsch, "Thinning algorithms on rectangular, hexagonal, and triangular arrays,"Comm. ACM, Vol. 15, no. 9, pp. 827-837, 1972.
[11] E. R. Davies and A. P. N. Plummer, "Thinning algorithms: A critique and a new methodology,"Pattern Recognition, vol. 14, nos. 1-6, pp. 53-63, 1981.
[12] K. J. Udupa and I. S. N. Murthy, "Some new concepts for encoding line patterns,"Pattern Recognition, vol. 7, pp. 225-233, 1975.
[13] H. Tamura, "A comparison of line thinning algorithms from digital geometry viewpoint, inProc. 4th Int. Jt. Conf. Pattern Recognition, Kyoto, Japan, pp. 715-719.
[14] S. Peleg and A. Rosenfeld, "A min-max medial axis transformation,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-3, no. 2, pp. 208-210, Mar. 1981.
[15] N. J. Naccache and R. Shinghal, "SPTA: A proposed algorithm for thinning binary patterns,"IEEE Trans. Syst. Man Cybernet., vol. SMC- 14, no. 3, pp. 409-418, May/June 1984.
[16] U. Montanari, "A note on the minimal length polygonal approximation to a digitized contour,"Communs. Ass. Comput. Mach., vol. 13, no. 1, pp. 41-47, 1970.
[17] B. Shapiro, J. Pisa, and J. Sklansky, "Skeleton generation fromx-yboundary sequences,"Comput. Graphics Image Process., vol. 15, pp. 136-153, 1981.
[18] S. H. Y. Hung and T. Kasvand, "Critical points on a perfectly 8- or perfectly 6-connected thin binary line,"Pattern Recognition, vol. 16, no. 3, pp. 297-306, 1983.
[19] R. M. Bozinovic and S. N. Srihari, "Off-line cursive script word recognition,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-11, no. 1, pp. 68-83, 1989.
[20] C. C. Tappert, C. Y. Suen, and T. Wakahara, "The state of the art in on-line handwriting recognition,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-12, no. 8, pp. 787-808, 1990.
[21] B. Parhami and M. Taraghi, "Automatic recognition of printed Farsi texts,"Pattern Recognition, vol. 14, nos. 1-6, pp. 395-403, 1981.
[22] A. Nouh, A. Sultan, and R. Tolba, "An approach for Arabic characters recognition,"J. Eng. Sci., Univ. Riyadh, vol. 6, no. 2, pp. 185-191, 1980.
[23] H. Almuallim and S. Yamaguchi, "A method of recognition of Arabic cursive handwriting,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-9, no. 5, Sept. 1987.
[24] R. Ramsis, S. S. El-Dabi, and A. Kamel, "Arabic character recognition system," IBM Kuwait Scientific Center, Rep. KSC027, Jan. 1988.
[25] S. Al-Emami and M. Usher, "On-line recognition of handwritten Arabic characters,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-12, no. 7, pp. 704-710, 1990.
[26] S. A. Mahmoud, I. S. I. Abuhaiba, and R. J. Green, "Skeletonization of Arabic characters using clustering based skeletonization algorithm (CBSA),"J. Pattern Recognition, vol. 24, no. 5, pp. 453-464, 1991.
[27] I. S. I. Abuhaiba, S. A. Mahmoud, and R. J. Green, "Cluster number estimation and skeleton refining algorithms for Arabic characters," accepted for publication in theArabian Journal of Science and Engineering.
[28] A. Kandel,Fuzzy Mathematical Techniques with Applications. Reading, MA: Addison-Wesley, 1986, pp. 72-101.

Index Terms:
optical character recognition; trees (mathematics); fuzzy set theory; handwritten cursive Arabic characters; automatic off-line character recognition system; robust noise-independent algorithm; character skeleton; tree structure; fuzzy constrained character graph models; fuzzily labeled arcs
I.S.I. Abuhaiba, S.A. Mahmoud, R.J. Green, "Recognition of Handwritten Cursive Arabic Characters," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 6, pp. 664-672, June 1994, doi:10.1109/34.295912
Usage of this product signifies your acceptance of the Terms of Use.