论文信息 - Using a hidden Markov model to transcribe handwritten bushman texts

Using a hidden Markov model to transcribe handwritten bushman texts

The Bushman texts in the Bleek and Lloyd Collection contain complex diacritics that make automatic transcription difficult. Transcriptions of these texts would allow for enhanced digital library services to be created for interacting with the collection. In this study, an investigation into automatic transcription of the Bushman texts was performed using the popular method of using a Hidden Markov Model for text line recognition. The results show that while this technique may be well suited to well-constrained and understood scripts, its application to more complex scripts introduces a number of difficulties that need to be overcome.

Hussein Suleman | Kyle Williams

[1] Hussein Suleman,et al. Digital Libraries Without Databases: The Bleek and Lloyd Collection , 2007, ECDL.

[2] N. Ahmed,et al. Discrete Cosine Transform , 1996 .

[3] Tianwen Zhang,et al. Off-line recognition of realistic Chinese handwriting using segmentation-free strategy , 2009, Pattern Recognit..

[4] Marcus Liwicki,et al. Recognition of handwritten historical documents: HMM-adaptation vs. writer specific training , 2008 .

[5] Samy Bengio,et al. Offline recognition of unconstrained handwritten texts using HMMs and statistical language models , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6] Horst Bunke,et al. On the influence of vocabulary size and language models in unconstrained handwritten text recognition , 2001, Proceedings of Sixth International Conference on Document Analysis and Recognition.