A character segmentation algorithm for the palm leaf manuscripts

摘要

To tackle the problem of character segmentation for the palm leaf manuscripts, a character segmentation algorithm is proposed in this paper. The whole process of the algorithm consists of two steps, interleaving character segmentation and touching character segmentation. In the first step, the improved Viterbi algorithm and some path filtering rules are used to perform path detecting and path filtering respectively. In the second step, the Concave spot detecting method based segmentation algorithm is proposed to solve the touching character segmentation problem. The experiments in this work base on a text line database obtained by our previous works and the experimental results prove the effectiveness of the proposed algorithm in the character segmentation for the palm leaf manuscripts.