Translator Disclaimer
14 April 1993 New method for word recognition without segmentation
Author Affiliations +
Proceedings Volume 1906, Character Recognition Technologies; (1993)
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1993, San Jose, CA, United States
A method for recognition of word feature graphs without previous segmentation into characters is described. In the system, each subgraph of features that matches a previously defined character prototype is recognized anywhere in the word even if it corresponds to a broken character or to a character touching another one. The characters are detected in the order defined by the matching quality. Each subgraph that is recognized is introduced as a node in a direct net that compiles different alternatives of interpretation of the features in the feature graph. A path in the net represents a consistent succession of characters in the word. The method allows the recognition of characters that overlap, or that are underlined. A final search for the optimal path under certain criteria gives the best interpretation of the word features. The character recognizer uses a flexible matching between the features and a flexible grouping of the individual features to be matched. Broken characters are recognized by looking for gaps between features that may be interpreted as part of a character. Touching characters are recognized because the matching allows non-matched adjacent features. The recognition results of this system on over 4,000 printed numeral characters belonging to a USPS database and on some hand printed words confirmed the method's high robustness level.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jairo Rocha and Theo Pavlidis "New method for word recognition without segmentation", Proc. SPIE 1906, Character Recognition Technologies, (14 April 1993);


Back to Top