A Hierarchical Classification Method for US Bank-Notes
Tatsuhiko Kagehiro · IEICE Transactions on Information and Systems · 2006
This paper describes a method for the classification of bank notes.The algorithm has three stages, and classifies bank notes with v ery low error rates and at high speeds.To achiev e the v ery low error rates, the result of classification is check ed in the final stage by using different features to those used in the first two.High-speed processing is mainly achiev ed by the hierarchical structure, which leads to low computational costs.I n ev aluation on 32, 850 samples of US bank notes, with the same number used for training, the algorithm classified all samples precisely with no error sample.