A new stroke string matching algorithm for stroke-based on-line character recognition

  • Authors:

  • Quen-Zong Wu;Bor-Shenn Jeng;Yeou-Fuh Kuan;Kou-Sen Chou;Moa-Tai Chen;Tzu-Kai Su

  • Affiliations:

  • Telecommunication Laboratories, Ministry of Transportation and Communications, Chung-Li, Taiwan, ROC;Telecommunication Laboratories, Ministry of Transportation and Communications, Chung-Li, Taiwan, ROC;Telecommunication Laboratories, Ministry of Transportation and Communications, Chung-Li, Taiwan, ROC;Telecommunication Laboratories, Ministry of Transportation and Communications, Chung-Li, Taiwan, ROC;Telecommunication Laboratories, Ministry of Transportation and Communications, Chung-Li, Taiwan, ROC;Telecommunication Laboratories, Ministry of Transportation and Communications, Chung-Li, Taiwan, ROC

  • Venue:
  • ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new stroke string matching algorithm for stroke-based on-line character recognition. Each character can be regarded as a string of strokes with each stroke being represented by the type of the stroke. The stroke string is constructed according to the writing order of strokes. After the type of each stroke has been recognized, we use a matching algorithm to compute the distances between input character and the reference characters. The matching process is carried out in two ways, forward and backward. We artificially generate a database for simulating the performance upgrading by using two-way matching instead of one-way matching on stroke strings. The simulation result shows that two-way matching works much better than one-way matching when some strokes are mis-recognized, omitted or mis-sequenced.