Abstract
Most algorithms for segmenting connected handwritten digit strings are based on the analysis of the foreground pixel distributions and the features on the upper/lower contours of the image. A new approach is presented to segment connected handwritten two-digit strings based on the thinning of background regions. The algorithm first locates several feature points on the background skeleton of the digit image. Possible segmentation paths are then constructed by matching these feature points. With geometric property measures, these segmentation paths are ranked using fuzzy rules generated from a decision-tree approach. Finally, the top ranked segmentation paths are tested one by one by an optimized nearest neighbor classifier until one of these candidates is accepted based on an acceptance criterion. Experimental results on NIST special database 3 show that our approach can achieve a correct classification rate of 92.4% with only 4.7% of digit strings rejected, which compares favorably with the other techniques tested.
Original language | English |
---|---|
Title of host publication | Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998 |
Pages | 1065-1068 |
Number of pages | 4 |
Volume | 2 |
DOIs | |
Publication status | Published - 1 Dec 1998 |
Event | 1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998 - Seattle, WA, United States Duration: 12 May 1998 → 15 May 1998 |
Conference
Conference | 1998 23rd IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 1998 |
---|---|
Country/Territory | United States |
City | Seattle, WA |
Period | 12/05/98 → 15/05/98 |
ASJC Scopus subject areas
- Software
- Signal Processing
- Electrical and Electronic Engineering