Presentation 1995/9/28
Stroke Order Search Algorithms for Online Character Recognition : Cubic Search
Hiroaki Sakoe,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Efficient stroke-to-stroke assignment algorithms were investigated with application to online character recognition. Starting from the cubic search method proposed by Sakoe and Shin (IEICE Tech. Paper PRU95-59), use of information on relative stroke position was first investigated. Secondarily, effective use of stroke order information was discussed. Thirdly, dealing method of irregular stroke connection was extensively studied. Then, algorithm extension to stochastic model was briefly mentioned. Algorithm outline and computational complexity estimation were given for each of cases.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) online chracter recognition / stroke order / stroke-to-stroke correspondence / Dynamic Programming / beam search
Paper # PRU95-112
Date of Issue

Conference Information
Committee PRU
Conference Date 1995/9/28(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Pattern Recognition and Understanding (PRU)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Stroke Order Search Algorithms for Online Character Recognition : Cubic Search
Sub Title (in English)
Keyword(1) online chracter recognition
Keyword(2) stroke order
Keyword(3) stroke-to-stroke correspondence
Keyword(4) Dynamic Programming
Keyword(5) beam search
1st Author's Name Hiroaki Sakoe
1st Author's Affiliation Department of Computer Science and Communication Engineering, Kyushu University()
Date 1995/9/28
Paper # PRU95-112
Volume (vol) vol.95
Number (no) 278
Page pp.pp.-
#Pages 6
Date of Issue