Handwritten word recognition based on structural characteristics and lexical support
暂无分享,去创建一个
[1] Kozo Kinoshita,et al. Removal of redundancy in combinational circuits under classification of undetectable faults , 1993, Systems and Computers in Japan.
[2] K. GovindanV.,et al. Character recognitiona review , 1990 .
[3] Nikos Fakotakis,et al. A Straightforward Approach to Morphological Analysis and Synthesis , 2001, ArXiv.
[4] Horst Bunke,et al. Syntactic and Structural Pattern Recognition , 1988, NATO ASI Series.
[5] Bruce W. Watson,et al. Incremental construction of minimal acyclic finite state automata , 2000, CL.
[6] Renato De Mori,et al. Lexical tree compression , 1991, EUROSPEECH.
[7] Nikos Fakotakis,et al. How conditional independence assumption affects handwritten character segmentation , 2001, Proceedings of Sixth International Conference on Document Analysis and Recognition.
[8] V. K. Govindan,et al. Character recognition - A review , 1990, Pattern Recognit..
[9] Patrick J. Grother,et al. The First Census Optical Character Recognition Systems Conference | NIST , 1992 .
[10] Nikos Fakotakis,et al. Skew angle estimation in document processing using Cohen's class distributions , 1999, Pattern Recognit. Lett..
[11] Nikos Fakotakis,et al. Incremental Construction of Compact Acyclic NFAs , 2001, ACL.
[12] Nikos Fakotakis,et al. Slant estimation algorithm for OCR systems , 2001, Pattern Recognit..
[13] Masami Shishibori,et al. An algorithm for dynamic processing of dawg's , 1994 .
[14] Stoyan Mihov,et al. Direct Construction of Minimal Acyclic Finite States Automata , 1998 .
[15] Beatrice Lazzerini,et al. A fuzzy classification based system for handwritten character recognition , 1998, 1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111).
[16] Nikos Fakotakis,et al. New algorithms for skewing correction and slant removal on word-level [OCR] , 1999, ICECS'99. Proceedings of ICECS '99. 6th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.99EX357).
[17] Proceedings Seventh International Conference on Document Analysis and Recognition , 2003, Seventh International Conference on Document Analysis and Recognition, 2003. Proceedings..
[18] M. Hase,et al. An algorithm for compressing common sulfixes used in trie structures , 1993 .
[19] Jan Daciuk,et al. Incremental Construction of Minimal Acyclic Finite State Automata and Transducers , 1998 .
[20] Horst Bunke,et al. Syntactic and structural pattern recognition : theory and applications , 1990 .
[21] David Haussler,et al. Average sizes of suffix trees and DAWGs , 1989, Discret. Appl. Math..
[22] Maxime Crochemore,et al. Direct Construction of Compact Directed Acyclic Word Graphs , 1997, CPM.
[23] Nikos Fakotakis,et al. Two Algorithms for Incremental Construction of Directed Acyclic Word Graphs , 1995, Int. J. Artif. Intell. Tools.
[24] Nikos Fakotakis,et al. Optimal insertion in deterministic DAWGs , 2003, Theor. Comput. Sci..
[25] Nikos Fakotakis,et al. The GRUHD database of Greek unconstrained handwriting , 2001, Proceedings of Sixth International Conference on Document Analysis and Recognition.
[26] G. Kokkinakis,et al. Handwritten character segmentation using transformation-based learning , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.
[27] Maria-Florina Balcan,et al. Handwritten text localization in skewed documents , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).