A fast algorithm for the minimum distance classifier (MDC) is proposed. The MDC has been used in various areas of pattern recognition because it is simple and fast compared with other complicated classifiers. The algorithm proposed is much faster than the exhaustive one that calculates all the distances straighforwardly. Our algorithm, which produces the same output as the exhaustive, omits redundant calculations according to Karhunen-Loeve expansion. From the KL-expansion of the prototype patterns, we form a subspace of the feature space, in which the order of examining the prototypes is decided adaptive to a given unknown pattern. We have applied the algorithm to recognition of handprinted Kanji characters and measured its performance on the ETL9B database. As a result, the theoretical and practical speedups were 10-20 and 4-9, respectively.
A fast algorithm for the minimum distance classifier and its application to Kanji character recognition
Proceedings of 3rd International Conference on Document Analysis and Recognition ; 1 ; 283-286 vol.1
01.01.1995
355614 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
British Library Conference Proceedings | 1995
|On-Line Cursive Kanji Character Recognition as Stroke Correspondence Problem
British Library Conference Proceedings | 1995
|Mixed neural-traditional classifier for character recognition [2949-64]
British Library Conference Proceedings | 1996
|