CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A New String Matching Algorithm and its Application in Hand-Written Digits Recognition

by Mehrnoosh Bazrafkan, Ali Broumandnia
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 71 - Number 13
Year of Publication: 2013
Authors: Mehrnoosh Bazrafkan, Ali Broumandnia
10.5120/12158-7944

Mehrnoosh Bazrafkan, Ali Broumandnia . A New String Matching Algorithm and its Application in Hand-Written Digits Recognition. International Journal of Computer Applications. 71, 13 ( May 2013), 13-16. DOI=10.5120/12158-7944

@article{ 10.5120/12158-7944,
author = { Mehrnoosh Bazrafkan, Ali Broumandnia },
title = { A New String Matching Algorithm and its Application in Hand-Written Digits Recognition },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 71 },
number = { 13 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 13-16 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume71/number13/12158-7944/ },
doi = { 10.5120/12158-7944 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:35:25.580738+05:30
%A Mehrnoosh Bazrafkan
%A Ali Broumandnia
%T A New String Matching Algorithm and its Application in Hand-Written Digits Recognition
%J International Journal of Computer Applications
%@ 0975-8887
%V 71
%N 13
%P 13-16
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper a new algorithm is introduced for syntactic pattern recognition and string matching by using linked listdata structure which later could be used for hand written digits recognition. At first,handwritten digits are changed to string as input pattern by using chain-codethen the achieved string is recognized by using refer algorithm being implemented by linked list. This refer algorithm is able to compute the distance between the chain code strings shown in the implementation. The suggested algorithm reduces time complexity oflevenshtein's algorithm from second-order to linear-orderand in addition is able to decrease the consumption memory and increase accuracy of handwritten digits recognition as well. Our proposed implemented algorithm has 94. 8% accuracy over 3000 handwritten digits samples

References
  1. H. Freeman, On the encoding of arbitrary geometric configurations, IEEE Trans, Electron, Compute, EC-10, 260-268, 1961.
  2. Levenshtein VI. Binary codes capable of correcting deletions, insertions, and reversalsPDF. Soviet Physics Doklady 10: 707–10, 1966.
  3. Gonzalez and Woods ,Digital Image Processing Third Edition, Prentice Hall ,2008
  4. SergiosTheodoridis, KonstantinosKoutroumbas, Pattern Recognition fourth edition. Academic Press is an imprint of Elsevier,2009.
  5. H. Izakian, S. A. Monadjemi, B. TorkLadani, and K. Zamanifar, Multi-Font Farsi/Arabic Isolated Character Recognition Using chain code s, World Academy of Science, Engineering and Technology 43, 2008.
  6. Cormen, T. H. ; Leiserson, C. E. ; Rivest, R. L. ; Stein, C. ,Introduction to Algorithms (2nd ed. ), MIT Press & McGraw-Hill, ISBN 0-262-03293-7 . pp. 327–328, 2001.
  7. Gonzalo Navarro. A guided tour to approximate string matching. ACM Computing Surveys (CSUR) archive, 33(1), pp. 31-88, 2001.
  8. D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Comm. A. C. M. 18(6) p341-343, 1975.
Index Terms

Computer Science
Information Sciences

Keywords

handwritten digits chain-code syntactic pattern recognition string matching linked list data structure dynamic programming time complexity

Powered by PhDFocusTM