Vertex directed segmentation of handwritten numerals

摘要

A new algorithm is described for segmenting handwritten numeral strings that contain pairs of simply connected numerals. The algorithm identifies the location of a connection through analysis of the vertices that are formed by the convergence of vertically oriented edges of adjacent strokes. The connected numerals are then partitioned by a cut based at the vertices associated with the connection. A complete partitioning path is constructed by extending the cut to the top and bottom of the numerals. The algorithm has proved to be fast, effective, and relatively insensitive to the presence of dropouts and variations of size and baseline.