Answers are grounded in this paper and cite their sources.
The authors propose a character segmentation algorithm which is a region-based approach using background pixels. Some interesting background regions are found automatically by performing two independent filtering steps: top-down filtering and bottom-up filtering. Relationships between the resulting background components are considered to select plausible regions favorable to segmentation. For preliminary experimentation, the authors collected 120 samples of connected digits written by 12 people, 97 pairs were successfully segmented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Cheriet et al. (2003) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: