Machine recognition of hand-printed Japanese characters has been an area of great interest for many years. A major problem of this classification task is the huge number of different characters. Applying standard "state-of-the-art" techniques, such as SVM, to multi-class problems of this kind imposes severe problems of both a conceptual and technical nature: (i) separating one class from all others may be an unnecessarily hard problem; and (ii) solving these subproblems can impose unacceptably high computational costs. In this paper, a new approach to Japanese character recognition is presented that successfully overcomes these shortcomings. It is based on a pairwise coupling procedure for probabilistic two-class kernel classifiers. Experimental results for Hiragana recognition effectively demonstrate that our method attains an excellent level of prediction accuracy while imposing very low computational costs.
Pairwise coupling for machine recognition of hand-printed Japanese characters
2001-01-01
613758 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Pairwise Coupling for Machine Recognition of Hand-Printed Japanese Characters
British Library Conference Proceedings | 2001
|Recognition of Hand Printed Latin Characters Using Machine Learning
British Library Conference Proceedings | 1995
|British Library Conference Proceedings | 2001
|IEEE | 2001
|British Library Online Contents | 1997
|