Gray-Level Co-occurrence Matrix and Random Forest Based Off-line Odia Handwritten Character Recognition

Author(s): Abhisek Sethy*, Prashanta Kumar Patra, Deepak Ranjan Nayak.

Journal Name: Recent Patents on Engineering

Volume 13 , Issue 2 , 2019

Submit Manuscript
Submit Proposal

Graphical Abstract:


Abstract:

Background: In the past decades, handwritten character recognition has received considerable attention from researchers across the globe because of its wide range of applications in daily life. From the literature, it has been observed that there is limited study on various handwritten Indian scripts and Odia is one of them. We revised some of the patents relating to handwritten character recognition.

Methods: This paper deals with the development of an automatic recognition system for offline handwritten Odia character recognition. In this case, prior to feature extraction from images, preprocessing has been done on the character images. For feature extraction, first the gray level co-occurrence matrix (GLCM) is computed from all the sub-bands of two-dimensional discrete wavelet transform (2D DWT) and thereafter, feature descriptors such as energy, entropy, correlation, homogeneity, and contrast are calculated from GLCMs which are termed as the primary feature vector. In order to further reduce the feature space and generate more relevant features, principal component analysis (PCA) has been employed. Because of the several salient features of random forest (RF) and K- nearest neighbor (K-NN), they have become a significant choice in pattern classification tasks and therefore, both RF and K-NN are separately applied in this study for segregation of character images.

Results: All the experiments were performed on a system having specification as windows 8, 64-bit operating system, and Intel (R) i7 – 4770 CPU @ 3.40 GHz. Simulations were conducted through Matlab2014a on a standard database named as NIT Rourkela Odia Database.

Conclusion: The proposed system has been validated on a standard database. The simulation results based on 10-fold cross-validation scenario demonstrate that the proposed system earns better accuracy than the existing methods while requiring least number of features. The recognition rate using RF and K-NN classifier is found to be 94.6% and 96.4% respectively.

Keywords: Gray level co-occurrence matrix (GLCM), discrete wavelet transform, random forest, K- nearest neighborhood (KNN), Odia, character recognition.

[1]
J. Mantas, "An overview of character recognition methodologies", Pattern Recognit., vol. 19, pp. 425-430, 1986.
[2]
V.K. Govindan, and A.P. Shivaprasad, "Character recognition - a review", Pattern Recognit., vol. 23, pp. 671-683, 1990.
[3]
R. Plamondon, and S.N. Srihari, "On-Line and Off-line Handwritten Recognition: A Comprehensive Survey", IEEE Trans. PAMI, vol. 22, pp. 62-84, 2000.
[4]
K. Chaudhri, T.C.K. Shiva, and S. Mukundan, "Handwritten character recognition based on frequency variations in characters U.S. Patent 8494277B2,", 2013
[5]
U. Pal, and B.B. Chaudhuri, "Machine-printed and handwritten text lines identification", Pattern Recognit. Lett., vol. 22, pp. 431-441, 2001.
[6]
U. Pal, and B.B. Chaudhuri, "Indian script character recognition: a survey", Pattern Recognit., vol. 37, pp. 1887-1899, 2004.
[7]
K.S. Dash, N.B. Puhan, and G. Panda, "Odia character recognition: a direction review", Artif. Intell. Rev., vol. 48, pp. 1-25, 2016.
[8]
T.K. Mishra, B. Majhi, and S. Panda, "A comparative analysis of image transformation for handwritten Odia numeral recognition", In: Proceedings of International Conference on Advances in Computing Communications and Informatics, Mysore, India, 2013, pp. 22-25.
[9]
P.K. Patra, M. Nayak, S.K. Nayak, and N.K. Gabbak, "Probabilistic neural network for pattern classification", In: Proceedings of International Joint Conference on Neural Networks, Honolulu, HI, USA, 2002, pp. 1200-1205.
[10]
U. Pal, T. Wakabayashi, and F. Kimura, "A system for off-line oriya handwritten character recognition using curvature feature", In: Proceedings of 10th International Conference on Information Technology, Orissa, India, 2007, pp. 227-229.
[11]
B.B. Chaudhuri, U. Pal, and M. Mitra, "Automatic recognition of printed Oriya script", In: Proceedings of International Conference on Document Analysis and Recognition, Seattle, WA, USA, 2001, pp. 795-799.
[12]
S. Chand, K. Frank, and U. Pal, "Text independent writer identification for Oriya script", In: Proceedings of 10th IAPR International Workshop on Document Analysis Systems, Gold Cost, QLD, Australia, 2012, pp. 369-373.
[13]
D. Senapati, S. Rout, and M. Nayak, "A novel approach to text line and word segmentation on Odia printed documents", In: Proceedings of 3rd International Conference on Computing Communication and Networking Technologies, Coimbatore, India, 2012, pp. 1-6.
[14]
A.K. Pujari, C. Mitra, and S. Mishra, "A new parallel thinning algorithm with stroke correction for Odia characters", In: Proceedings of Advanced Computing, Networking and Informatics, Smart Innovation, Systems and Technologies., Springer: Cham, 2014, pp. 413-419.
[15]
C. Mitra, and A.K. Pujari, "Directional decomposition for Odia character recognition, mining intelligence and knowledge exploration", In: Mining Intelligence and Knowledge Exploration. Lecture Notes in Computer Science, . R. Prasath, T. Kathirvalavakumar, Ed. Cham: Springer, vol. 8284, 2013, pp. 270-278.
[16]
D.R. Nayak, R. Dash, B. Majhi, and J. Mohammed, "Non-linear cellular automata based edge detector for optical character images", Simulation Trans. Soc. Model. Sim. Intern., vol. 92, pp. 849-859, 2016.
[17]
M. Nayak, and A. Nayak, "Odia-conjunct character recognition using evolutionary algorithm Asian J. App. Sci.,", vol. 03, pp. 789 798, 2015
[18]
K.S. Dash, N.B. Puhan, and G. Panda, "BESAC: binary external symmetry axis constellation for unconstrained handwritten character recognition", Pattern Recognit. Lett., vol. 03, pp. 413-422, 2016.
[19]
A. Sethy, and P.K. Patra, "Off-line Odia numeral recognition using neural network: a comparative analysis", In: Proceedings of International Conference on Computing Communication and Automation, Noida, India, 2016, pp. 1099-1103.
[20]
A. Sethy, P.K. Patra, and D.R. Nayak, "Off-line handwritten Odia character recognition using DWT and PCA", In: Progress in Advanced Computing and Intelligent Engineering. Advances in Intelligent Systems and Computing,. K. Saeed, B. Pati, S. Bakshi, D. Mohapatra, Ed. Singapore: Springer, vol. 563, 2016, pp. 1-5.
[21]
V. Nataranjan, M. Swaminathan, S. Geelapaturu, and A. Gauriar, "System and method for efficient recognition of handwritten characters in documents U.S. Patent 9659213B2", 2017
[22]
T.K. Mishra, B. Majhi, P.K. Sa, and S. Panda, "Model based Odia numeral recognition using fuzzy aggregated features", Front. Comput. Sci., vol. 8, pp. 916-922, 2014.
[23]
W. Pratt, Digital image processing., John Willey & Sons: California, 2007.
[24]
D.R. Nayak, R. Dash, and B. Majhi, "Brain MR Image classification using two-dimensional discrete transform and adaboost with random forests", Neurocomp., vol. 177, pp. 188-197, 2016.
[25]
D.R. Nayak, R. Dash, and B. Majhi, "Classification of brain MR images using discrete wavelet transform and random forests", In: Proceedings of 5thNational Conference on Computer Vision, Pattern Recognition, Image Processing, and Graphics, Patna, India, 2015, pp. 1-4.
[26]
S. Mallat, A wavelet tour of signal processing., Academic Press: USA, 1999.
[27]
R.M. Haralick, K. Shanmugam, and I.H. Dinstein, "Textural features for image classification", IEEE Trans. Syst. Man Cybern., vol. 6, pp. 610-621, 1973.
[28]
M. Bishop, Pattern recognition and machine learning., Springer Press: New York, 2006.
[29]
L. Breiman, "Random forests", Mach. Learn., vol. 45, pp. 5-32, 2001.
[30]
B. Xu, Y. Ye, and L. Nie, "An Improved Random Forest Classifier for Image Classification", In: Proceedings of International Conference on Information and Automation, Shenyang, China, 2012, pp. 795-800.


Rights & PermissionsPrintExport Cite as


Article Details

VOLUME: 13
ISSUE: 2
Year: 2019
Page: [136 - 141]
Pages: 6
DOI: 10.2174/1872212112666180601085544
Price: $58

Article Metrics

PDF: 29
HTML: 4
EPUB: 2
PRC: 2