TY - GEN
T1 - Statistical modeling and learning for recognition-based handwritten numeral string segmentation
AU - Wang, Yanjie
AU - Liu, Xiabi
AU - Jia, Yunde
PY - 2009
Y1 - 2009
N2 - This paper proposes a recognition based approach to handwritten numeral string segmentation. We consider two classes: numeral strings segmented correctly or not. The feature vectors containing recognition information for numeral strings segmented correctly are assumed to be of the distribution of Gaussian mixture model (GMM). Based on this modeling, the recognition based segmentation is solved under the Max-Min posterior Pseudo-probabilities (MMP) framework of learning Bayesian classifiers. In the training phase, we use the MMP method to learn a posterior pseudo-probability measure function from positive samples and negative samples of numeral strings segmented correctly. In the process of recognition based segmentation, we generate all possible candidate segmentations of an input string through contour and profile analysis, and then compute the posterior pseudo-probabilities of being the numeral string segmented correctly for all the candidate segmentations. The candidate segmentation with the maximum posterior pseudo-probability is taken as the final result. The effectiveness of our approach is demonstrated by the experiments of numeral string segmentation and recognition on the NIST SD19 database.
AB - This paper proposes a recognition based approach to handwritten numeral string segmentation. We consider two classes: numeral strings segmented correctly or not. The feature vectors containing recognition information for numeral strings segmented correctly are assumed to be of the distribution of Gaussian mixture model (GMM). Based on this modeling, the recognition based segmentation is solved under the Max-Min posterior Pseudo-probabilities (MMP) framework of learning Bayesian classifiers. In the training phase, we use the MMP method to learn a posterior pseudo-probability measure function from positive samples and negative samples of numeral strings segmented correctly. In the process of recognition based segmentation, we generate all possible candidate segmentations of an input string through contour and profile analysis, and then compute the posterior pseudo-probabilities of being the numeral string segmented correctly for all the candidate segmentations. The candidate segmentation with the maximum posterior pseudo-probability is taken as the final result. The effectiveness of our approach is demonstrated by the experiments of numeral string segmentation and recognition on the NIST SD19 database.
UR - http://www.scopus.com/inward/record.url?scp=71249094699&partnerID=8YFLogxK
U2 - 10.1109/ICDAR.2009.25
DO - 10.1109/ICDAR.2009.25
M3 - Conference contribution
AN - SCOPUS:71249094699
SN - 9780769537252
T3 - Proceedings of the International Conference on Document Analysis and Recognition, ICDAR
SP - 421
EP - 425
BT - ICDAR2009 - 10th International Conference on Document Analysis and Recognition
T2 - ICDAR2009 - 10th International Conference on Document Analysis and Recognition
Y2 - 26 July 2009 through 29 July 2009
ER -