A Hidden Markov Model Based Segmentation and Recognition Algorithm for Chinese Handwritten Address Character Strings

Authors:
Qiang Fu;X. Q. Ding;C. S. Liu;Yan Jiang
Affiliations:
Tsinghua University, P.R. China;Tsinghua University, P.R. China;Tsinghua University, P.R. China;Tsinghua University, P.R. China
Venue:
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Year:
2005

Citing 4
Cited 2

A Survey of Methods and Strategies in Character Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Segmenting handwritten Chinese characters based on heuristic merging of stroke bounding boxes and dynamic programming

Pattern Recognition Letters
Lexicon-Driven Segmentation and Recognition of Handwritten Character Strings for Japanese Address Reading

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Segmentation Algorithm for Handwritten Chinese Character Strings

ICDAR '99 Proceedings of the Fifth International Conference on Document Analysis and Recognition

Segmentation-driven offline handwritten Chinese and Arabic script recognition

SACH'06 Proceedings of the 2006 conference on Arabic and Chinese handwriting recognition
A hybrid handwritten chinese address recognition approach

ICONIP'06 Proceedings of the 13th international conference on Neural Information Processing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient method of Chinese handwritten address character string segmentation and recognition is presented. First, an address string image is presegmented into several radicals using stroke extraction and stroke mergence. Next, the radical series obtained by pre-segmentation merge into different character image series according to different merging paths. After that, the optimal merging path is selected using recognition and semantic information. The recognition information is given by the character classifier. The semantic information is obtained from address database which contains 180,000 address items. Finally, the optimal recognition results of the character image series which are combined by radical series according to the optimal merging paths are obtained. In experiments on 897 mail images, the proposed method achieves correct rate of 85 percent while the error rate is 15 percent.