Automatic State Machine Induction for String Recognition

11 years 26 days ago
Automatic State Machine Induction for String Recognition
—One problem of generating a model to recognize any string is how to generate one that is generalized enough to accept strings with similar patterns and, at the same time, is specific enough to reject the non-target strings. This research focus on generating a model in the form of a state machine to recognize strings derived from the direction information of character’s images. The state machine induction process has two steps. The first step is to generate the machine from the strings of each target character (Positive Training), and the second step is to adjust the machine to reject any other string (Negative Training). This automatic state machine induction method can also be applied with any string sequence recognition in other applications.
Boontee Kruatrachue, Nattachat Pantrakarn, Kritawa
Added 07 Nov 2010
Updated 07 Nov 2010
Type Conference
Year 2007
Where WCE
Authors Boontee Kruatrachue, Nattachat Pantrakarn, Kritawan Siriboon
Comments (0)