A Hierarchical Classification Method for US Bank Notes

This paper describes a method for the classification of bank-notes. The algorithm has three stages, and classifies bank-notes with very low error rates and at high speeds. To achieve the very low error rates, the result of classification is checked in the final stage by using different features to those used in the first two. High-speed processing is mainly achieved by the hierarchical structure, which leads to low computational costs. In evaluation 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. We estimate that the worst error rate is 3.1E-9 for the classification statistically.