Classification of coins using an eigenspace approach

We present a vision-based approach to coin classification which is able to discriminate between hundreds of different coin classes. The approach described is a multistage procedure. In the first stage a translationally and rotationally invariant description is computed. In a second stage an illumination-invariant eigenspace is selected and probabilities for coin classes are derived for the obverse and reverse sides of each coin. In the final stage coin class probabilities for both coin sides are combined through Bayesian fusion including a rejection mechanism. Correct decision into one of the 932 different coin classes and the rejection class, i.e., correct classification or rejection, was achieved for 93.23% of coins in a test sample containing 11,949 coins. False decisions, i.e., either false classification, false rejection or false acceptance, were obtained for 6.77% of the test coins.

[1]  Paul Davidsson,et al.  Coin Classification Using a Novel Technique for Learning Characteristic Decision Trees by Controlling the Degree of Generalization , 1996, IEA/AIE.

[2]  Takio Kurita,et al.  Scale and Rotation Invariant Recognition Method Using Higher-Order Local Autocorrelation Features of Log-Polar Image , 1998, ACCV.

[3]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[5]  David J. Kriegman,et al.  Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection , 1996, ECCV.

[6]  Muhittin Gökmen,et al.  Eigenhill vs. eigenface and eigenedge , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[7]  Takeo Kanade,et al.  Use of Fourier and Karhunen-Loeve decomposition for fast pattern matching with a large set of templates , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Liu Ning,et al.  Translation, Rotation and Scale-Invariant Object Recognition , 2001 .

[9]  KanadeTakeo,et al.  Use of Fourier and Karhunen-Loeve Decomposition for Fast Pattern Matching With a Large Set of Templates , 1997 .

[10]  Hiroshi Murase,et al.  Visual learning and recognition of 3-d objects from appearance , 2005, International Journal of Computer Vision.

[11]  Minoru Fukumi,et al.  Rotation-invariant neural pattern recognition system with application to coin recognition , 1992, IEEE Trans. Neural Networks.

[12]  Takeo Kanade,et al.  Optimal approximation of uniformly rotated images: relationship between Karhunen-Loeve expansion and discrete cosine transform , 1998, IEEE Trans. Image Process..

[13]  Igor Holländer,et al.  Dagobert - A New Coin Recognition and Sorting System , 2003, DICTA.

[14]  Matteo Golfarelli,et al.  On the Error-Reject Trade-Off in Biometric Verification Systems , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Jürgen Altmann,et al.  A Fast Correlation Method for Scale-and Translation-Invariant Pattern Recognition , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  P. Sprent,et al.  Statistical Analysis of Circular Data. , 1994 .

[17]  Juyang Weng,et al.  Using Discriminant Eigenfeatures for Image Retrieval , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Horst Bischof,et al.  Multiple eigenspaces , 2002, Pattern Recognit..

[19]  Nicholas I. Fisher,et al.  Statistical Analysis of Circular Data , 1993 .

[20]  J. Mundy,et al.  Driving vision by topology , 1995, Proceedings of International Symposium on Computer Vision - ISCV.

[21]  Sadao Matsumoto,et al.  Coin discriminating apparatus , 1993 .

[22]  Jiri Matas,et al.  On Combining Classifiers , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  C. Wogerer,et al.  Development of a mechatronic device for high-speed coin sorting , 2003, IEEE International Conference on Industrial Technology, 2003.

[24]  Edward Y. Chang,et al.  SVM binary classifier ensembles for image classification , 2001, CIKM '01.

[25]  Victor Y. Pan,et al.  The complexity of the matrix eigenproblem , 1999, STOC '99.

[26]  J. Kittler,et al.  Multistage pattern recognition with reject option , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems.

[27]  Bayya Yegnanarayana,et al.  Face Detection, Recognition in an Image Sequence Using Eigenedginess , 2002, ICVGIP.

[28]  D Marr,et al.  Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[29]  L Sirovich,et al.  Low-dimensional procedure for the characterization of human faces. , 1987, Journal of the Optical Society of America. A, Optics and image science.

[30]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[31]  Hiroshi Murase,et al.  Illumination Planning for Object Recognition Using Parametric Eigenspaces , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[32]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[33]  Stephen Alan Underwood.  Visual learning and recognition by computer , 1972 .

[34]  Alex Pentland,et al.  View-based and modular eigenspaces for face recognition , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.