Toward forensics by stroke order variation: performance evaluation of stroke correspondence methods

Authors:
Wenjie Cai;Seiichi Uchida;Hiroaki Sakoe
Affiliations:
O-RID Company, Japan and Faculty of Information Science and Electrical Engineering, Kyushu University, Japan;Faculty of Information Science and Electrical Engineering, Kyushu University, Japan;Faculty of Information Science and Electrical Engineering, Kyushu University, Japan
Venue:
IWCF'10 Proceedings of the 4th international conference on Computational forensics
Year:
2010

Citing 3
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Algorithms (2nd ed.)

Algorithms (2nd ed.)
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider personal identification using stroke order variations of online handwritten character patterns, which are written on, e.g., electric tablets. To extract the stroke order variation of an input character pattern, it is necessary to establish the accurate stroke correspondence between the input pattern and the reference pattern of the same category. In this paper we compare five stroke correspondence methods: the individual correspondence decision (ICD), the cube search (CS), the bipartite weighted matching (BWM), the stable marriage (SM), and the deviation-expansion model (DE). After their brief review, they are experimentally compared quantitatively by not only their stroke correspondence accuracy but also character recognition accuracy. The experimental results showed the superiority CS and BWM over ICD, SM and DE.