Context-directed segmentation algorithm for handwritten numeral strings

摘要

A context-directed algorithm is proposed for segmenting connected numeral strings into their components. The algorithm is hierarchical (tree-like structure) in the sense that it tests various hypotheses ranging from the case where the numerals are completely isolated to that where the numerals may be connected, touching and/or existing in overlapping fields. Test results indicate that the algorithm is very effective in providing an accurate segmentation in a form suitable for further processing by a recognition algorithm.