Abstract
In order to raise a class discrimination power by combining multiple classifiers, the upper bound of a Bayes error rate bounded by the conditional entropy of a class variable and decision variables should be minimized. Wang and Wong (1979) proposed a tree dependence approximation scheme of a high order probability distribution composed of those variables, based on minimizing the upper bound. In addition to that, this paper presents an extended approximation scheme dealing with higher order dependency. Multiple classifiers recognizing unconstrained handwritten numerals were combined by the proposed approximation scheme based on the minimization of the Bayes error rate, and the high recognition rates were obtained by them.
Original language | English |
---|---|
Title of host publication | Proceedings of the 5th International Conference on Document Analysis and Recognition, ICDAR 1999 |
Publisher | IEEE Computer Society |
Pages | 398-401 |
Number of pages | 4 |
ISBN (Electronic) | 0769503187 |
DOIs | |
Publication status | Published - 1999 |
Event | 5th International Conference on Document Analysis and Recognition, ICDAR 1999 - Bangalore, India Duration: 1999 Sept 20 → 1999 Sept 22 |
Publication series
Name | Proceedings of the International Conference on Document Analysis and Recognition, ICDAR |
---|---|
ISSN (Print) | 1520-5363 |
Other
Other | 5th International Conference on Document Analysis and Recognition, ICDAR 1999 |
---|---|
Country/Territory | India |
City | Bangalore |
Period | 99/9/20 → 99/9/22 |
Bibliographical note
Publisher Copyright:© 1999 IEEE.
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition