Translator Disclaimer
7 March 1996 Efficient chain-code-based image manipulation for handwritten word recognition
Author Affiliations +
Abstract
Efficient image handling in the handwritten document recognition is an important research issue in real time applications. Image manipulation procedures for a fast handwritten word recognizer, including pre-processing, segmentation, and feature extraction, have been implemented using the chain code representation and presented in this paper. Pre-processing includes noise removal, slant correction and smoothing of contours. Slant angle is estimated by averaging orientation angles of vertical strokes. Smoothing removes jaggedness on contours. Segmentation points are determined using ligatures and concavity features. Average stroke width of an image is used in an adaptive fashion to locate ligatures. Concavities are located by examination of slope changes in contours. Feature extraction efficiently converts a segment into feature vectors. Experimental results demonstrate the efficiency of the algorithms developed. Three-thousand word images captured from real mail pieces, with size of 217 by 82 in average, are used in the experiments. Average processing times taken for each module are 10, 15, and 34 msec on a single Sparc 10 for pre-processing, segmentation, and feature extraction, respectively.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gyeonghwan Kim and Venu Govindaraju "Efficient chain-code-based image manipulation for handwritten word recognition", Proc. SPIE 2660, Document Recognition III, (7 March 1996); https://doi.org/10.1117/12.234708
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

The validity of pyramid K-means clustering
Proceedings of SPIE (September 16 2007)
Fast modular RLE-based inspection scheme for PCBs
Proceedings of SPIE (December 08 1997)
Computational complexity of object-based image compression
Proceedings of SPIE (September 16 2005)

Back to Top