Describes a method to improve the cumulative recognition rates of pattern recognition using a decision directed acyclic graph (DDAG) based on support vector machines (SVM). Though the original DDAG has high level of performance and its execution speed is fast, it does not consider the so-called cumulative recognition rate. We construct a DDAG which can incorporate the cumulative recognition rate. As a result of our experiment for handprinted Hiragana characters in JEITA-HP, the cumulative recognition rate is improved and its execution time is almost the same as the original DDAG and 30 times faster than the Max Win Algorithm which is one of the famous recognition methods using support vector machines for a multi-class problem.
Handprinted Hiragana recognition using support vector machines
01.01.2002
317682 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Handprinted Hiragana Recognition Using Support Vector Machines
British Library Conference Proceedings | 2002
|A Demonstration of Handprinted Symbol Recognition
British Library Conference Proceedings | 2001
|A demonstration of handprinted symbol recognition
IEEE | 2001
|Handprinted word recognition on a NIST data set
British Library Online Contents | 1995
|