A segmentation algorithm for handwritten Chinese character strings

Proceedings of the International Conference on Document Analysis and Recognition, ICDAR

Volumn , Issue , 1999, Pages 637-640

  Gao, Jiang ^a   Ding, Xiaoqing ^a   Wu, Youshou ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; IMAGE SEGMENTATION; PROBABILITY DISTRIBUTIONS;

CHINESE CHARACTERS; DYNAMIC PROGRAMMING ALGORITHM; HANDWRITTEN CHINESE CHARACTER; JOINT OPTIMIZATION; MAXIMUM A POSTERIORI PROBABILITIES; SEGMENTATION ALGORITHMS; SEGMENTATION PROCESS; SPLIT-AND-MERGE;

OPTIMIZATION;

EID: 84892721582     PISSN: 15205363     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDAR.1999.791867     Document Type: Conference Paper

References (3)

1. Casey, R. G. and E. Lecolinet (1995). Strategies in character segmentation: A survey. Proc. Int. Conf. On Document Analysis and Recognition, Montreal, Canada, pp. 1028-1033.
2. Scagliola, C. (1998). Search algorithm for the recognition of cursive phrases without word segmentation. Proc. 6th Int. Workshop on Frontiers in Handwritten Recognition, Taejon, Korea, pp. 123-132.
3. Myers, C. S. and L. R. Rabiner (1981). A level building dynamic time warping algorithm for connected word recognition. IEEE Trans. ASSP, 29, pp. 284-297.