Presentation on theme: "Multiple Classifier Combination for Character Recognition: Revisiting the Majority Voting System and its Variations M.C. Fairhurst University of Kent UK."— Presentation transcript:
Multiple Classifier Combination for Character Recognition: Revisiting the Majority Voting System and its Variations M.C. Fairhurst University of Kent UK A. F. R. Rahman and H. Alam BCL Technologies Inc. USA
Basic Problem Statement Given a number of experts working on the same problem, is group decision superior to individual decisions?
Ghosts from the Past… Jean-Charles de Borda (1781) N. C. de Condorcet (1785) Laplace (1795) Issac Todhunter (1865) CC. L. Dodgson (Lewis Carrol) (1873) M. W. Crofton (1885) E. J. Nanson (1907) Francis Galton (1907)
Is Democracy the answer? Infinite Number of Experts Each Expert Should be Competent
How Does It Relate to Character Recognition? Each Expert has its: Strengths and Weaknesses Peculiarities Fresh Approach to Feature Extraction Fresh Approach to Classification But NOT 100% Correct!
Practical Resource Constraints Unfortunately, We Have Limited Number of Experts Number of Training Samples Feature Size Classification Time Memory Size
Solution Clever Algorithms to Exploit Experts –Complimentary Information –Redundancy: Check and Balance –Simultaneous Use of Arbitrary Features and Classification Routines
Question? –Recent trend is towards complicated decision combination schemes –Exhaustive Classifier Selection –Theoretical analysis in place of empirical methods How sophisticated (read “complex”) algorithms do we really need?
Majority Voting Philosophy Should the decision agreed by the majority of the experts be accepted without giving due credit to the competence of the experts? ---- OR ---- Should the decision delivered by the most competent expert be accepted without giving any importance to the majority consensus?
 Simple Majority Voting Decision accepted if at least k of the experts agree, where If n is even, If n is odd.
 Weighted Majority Voting
 Weighted Majority Voting (Contd.) So if decision to assign the unknown pattern to the class is denoted by with, being the number of classes, then the final combined decision supporting assignment to the class takes the form of: The final decision is therefore:
 Class-wise Weighted Majority Voting
 Restricted Majority Voting (Top Choice)
 Restricted Majority Voting (Generalized)
 Class-wise Best Decision Selection
 Enhanced Majority Voting
 Ranked Majority Voting Not only the top choice, but ranked list of other classes Takes account of the negative votes cast by the experts against a particular decision. Each expert not only supplies the top choice (class) decision, but also supplies the ranking of all the other choices considered. The idea is to translate this ranking into ``scores" which would be comparable across all the decisions by all the experts.
 Ranked Majority Voting: Continued ( Class Set Reordering) Highest Rank: Take the highest assigned rank Borda Count: Sum of the number of classes ranked below it by each classifier. Regression Method
Selection of a Database NIST Handwritten Characters Collected Off-line Total 34 Classes (0-9, A-Z, no Distinction between 0/O and I/1) Total Samples of Over 34,000 characters Size Normalized to 32X32
Performance of the Classifiers ExpertAcceptedRecog.ErrorRej. FWS MPC BWS MLP
Performance of the Combination Combination MethodAcceptedRecog.ErrorRej. Simple Weighted Class-wise Weighted Restricted Top Choice Class-wise Best Decision Restricted Generalized Enhanced (ENOCORE) Ranked (Borda) Committee Regression
Comparative Study MethodAcceptedRecogn.ErrorReject BKSM Sum Rule GA Best of MVS
Conclusions Majority Voting Solutions can be very versatile and adaptive Different variations may be adopted for different problem domains The Majority Voting configuration is generic Majority Voting Systems may be as applicable to any task domains with equal effectiveness as other complicated solutions