We propose a maximum-likelihood approach to segmentation-based recognition of unconstrained handwriting text. The segmentation scores and recognition scores are transformed into posterior probabilities, and the likelihood function which is composed of both these probabilities and character n-gram probabilities is derived from the Bayesian theorem. The recognition result which maximizes the function can be obtained by Viterbi search. Experiments have shown that the proposed likelihood function is effective in the recognition of online Japanese text.
['Shuji Senda', 'Keiji Yamada']
A maximum-likelihood approach to segmentation-based recognition of unconstrained handwriting text