Handwritten word recognition based on structural characteristics and lexical support

Proceedings of the International Conference on Document Analysis and Recognition, ICDAR

Volumn 2003-January, Issue , 2003, Pages 562-566

  Kavallieratou, E ^a   Sgarbas, K ^a   Fakotakis, N ^a   Kokkinakis, G ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPHIC METHODS;

COMPONENT BASED; HANDWRITTEN RECOGNITION; HANDWRITTEN WORD RECOGNITION; ON DYNAMICS; RADIAL PROFILES; RECOGNITION PROCESS; STRUCTURAL CHARACTERISTICS;

CHARACTER RECOGNITION;

EID: 84936948820     PISSN: 15205363     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDAR.2003.1227727     Document Type: Conference Paper

References (25)

1. E.K avallieratou, N.Fakotakis and G.Kokkinakis, Skew Estimation using Cohen's class distributions'', Pattern Recognition Letters 20, 1999, pp. 1305-1311.
2. E.Kavallieratou, N.Fakotakis, and G.Kokkinakis, Slant Estimation Algorithm for OCR Systems'', Pattern Recognition, V.34, n.12, 2001, pp.2515-2522.
3. M.Maragoudakis, E.Kavallieratou, N.Fakotakis and G.Kokkinakis, How Conditional Independence Assumption Affects Handwritten Character Segmentaion'', In Proc. ICDAR, 2001.
4. E.Kavallieratou, D.C.Balcan, M.F.Popa, and N.Fakotakis, Handwritten Text Localization in Skewed Documents'', In Proc. ICIP, 2001, pp.1102-1105.
5. E. Kavallieratou, E. Stamatatos, N. Fakotakis, and G. Kokkinakis, Handwritten Character Segmentation Using Transformation-Based Learning'', In Proc. ICPR, 2000, pp.634- 637.
6. E. Kavallieratou, N.Fakotakis, G.Kokkinakis, New algorithms for skewing correction and slant removal on wordlevel'', In Proc. ICECS, 1999, pp.1159-1162.
7. V.K.Govindan, A.P.Shivaprasad, Character recognition - A review'', Pattern Recognition, v. 23, No 7, 1990, pp. 671-683.
8. H.Bunke, A.Sanfeliu, Syntactic and structural Pattern Recognition, Theory and Applications, World Scientific, Singapore.
9. M. Crochemore and R. Verin. 1997. Direct Construction of Compact Directed Acyclic Word Graphs. 8th Annual Symposium, CPM 97, Aarhus, Denmark, 116-129.
10. R. Lacouture and R. De Mori. 1991. Lexical Tree Compression. EuroSpeech '91, 2nd European Conference on Speech Communications and Techniques, Genova, Italy, 581- 584.
11. K. Sgarbas, N. Fakotakis and G. Kokkinakis. 2000. A Straightforward Approach to Morphological Analysis and Synthesis. Proc. COMLEX 2000, Workshop on Computational Lexicography and Multimedia Dictionaries, Kato Achaia, Greece, 31-34.
12. J. Aoe, K. Morimoto and M. Hase. 1993. An Algorithm for Compressing Common Suffixes Used in Trie Structures. Systems and Computers in Japan, 24(12):31-42.
13. M. Ciura and S. Deorowicz. 1999. Experimental Study of Finite Automata Storing Static Lexicons. Report BW-453/RAu- 2/99 (Also at http://www-zo.iinf.polsl.gliwice.pl/~sdeor/pub.htm).
14. J. Daciuk, S. Mihov, B. Watson and R. Watson. 2000. Incremental Construction of Minimal Acyclic Finite State Automata. Computational Linguistics, 26(1):3-16.
15. J. Daciuk, R.E. Watson and B.W. Watson. 1998. Incremental Construction of Acyclic Finite-State Automata and Transducers. Proceedings of Finite State Methods in Natural Language Processing, Bilkent University, Ankara, Turkey.
16. S. Mihov. 1998. Direct Construction of Minimal Acyclic Finite States Automata. Annuaire de l' Universite de Sofia 'St. Kl. Ohridski', Faculte de Mathematique et Informatique, Sofia, Bulgaria, 92(2).
17. K. Park, J. Aoe, K. Morimoto and M. Shishibori. 1994. An Algorithm for Dynamic Processing of DAWG's. International Journal of Computer Mathematics, Gordon and Breach Publishers SA, OPA Amsterdam BV, 54:155-173.
18. D. Revuz. 2000. Dynamic Acyclic Minimal Automaton. CIAA 2000, 5th International Conference on Implementation and Application of Automata, London, Canada pp.226-232.
19. K. Sgarbas, N. Fakotakis and G. Kokkinakis. 1995. Two Algorithms for Incremental Construction of Directed Acyclic Word Graphs. International Journal on Artificial Intelligence Tools, World Scientific, 4(3):369-381.
20. K. Sgarbas, N. Fakotakis and G. Kokkinakis. 2000. Optimal Insertion in Deterministic DAWGs. Technical Report WCL/SLT#000524, Wire Communications Lab., Dept. of Electrical and Computer Engineering, University of Patras, Greece (Also at http://slt.wcl.ee.upatras.gr/sgarbas/PublAbsEN.htm).
21. K. Sgarbas, N. Fakotakis and G. Kokkinakis. 2001. Incremental Construction of Compact Acyclic NFAs. Proc. ACL-2001, 39th Annual Meeting of the ACL, Toulouse, France, 474-481.
22. A. Blumer, D. Haussler, and A. Ehrenfeucht. 1989. Average Sizes of Suffix Trees and DAWGs. Discrete Applied Mathematics, 24:37-45.
23. R. Wilkinson, J. Geist, S. Janet, P. Grother, C. Burges, R. Creecy, B. Hammond, J. Hull, N. Larsen, T. Vogl, and C. Wilson, The first census optical character recognition systems conf. #NISTIR 4912. The U.S Bureau of Census and the National Institute of Standards and Technology. Gaithersburg, MD, 1992.
24. E.Kavallieratou, N.Liolios, E.Koutsogeorgos, N.Fakotakis, G.Kokkinakis, The GRUHD database of Modern Greek Unconstrained Handwriting'', In Proc. ICDAR, 2001.
25. G.Frosini, B.Lazzerini, A.Maggiore, F.Marcelloni, Fuzzy classification based system for handwritten character recognition'', In Proc. 2 nd Intern. Conf. On Knowledge-based Intelligent Electronic Systems (KES'98), pp. 61-65, 1998.