Research Article
A New String Matching Algorithm and its Application in Hand-Written Digits Recognition
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 71 - Issue 13 |
| Published: May 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 },
year = { 2013 },
volume = { 71 },
number = { 13 },
pages = { 13-16 },
doi = { 10.5120/12158-7944 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Mehrnoosh Bazrafkan
%A Ali Broumandnia
%T A New String Matching Algorithm and its Application in Hand-Written Digits Recognition%T
%J International Journal of Computer Applications
%V 71
%N 13
%P 13-16
%R 10.5120/12158-7944
%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
- H. Freeman, On the encoding of arbitrary geometric configurations, IEEE Trans, Electron, Compute, EC-10, 260-268, 1961.
- Levenshtein VI. Binary codes capable of correcting deletions, insertions, and reversalsPDF. Soviet Physics Doklady 10: 707–10, 1966.
- Gonzalez and Woods ,Digital Image Processing Third Edition, Prentice Hall ,2008
- SergiosTheodoridis, KonstantinosKoutroumbas, Pattern Recognition fourth edition. Academic Press is an imprint of Elsevier,2009.
- 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.
- 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.
- Gonzalo Navarro. A guided tour to approximate string matching. ACM Computing Surveys (CSUR) archive, 33(1), pp. 31-88, 2001.
- D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Comm. A. C. M. 18(6) p341-343, 1975.
Index Terms
Keywords