Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Fast and Reliable Coin Recognition System Marco Reisert, Olaf Ronneberger and Hans Burkhardt
 

Summary: A Fast and Reliable Coin Recognition System
Marco Reisert, Olaf Ronneberger and Hans Burkhardt
University of Freiburg, Computer Science Department,
79110 Freiburg i.Br., Germany
{reisert}@informatik.uni-freiburg.de
Abstract. This paper presents a reliable coin recognition system that
is based on a registration approach. To optimally align two coins we
search for a rotation in order to reach a maximal number of colinear
gradient vectors. The gradient magnitude is completely neglected. After
a quantization of the gradient directions the computation of the induced
similarity measure can be done efficiently in the Fourier domain. The clas-
sification is realized with a simple nearest neighbor classification scheme
followed by several rejection criteria to meet the demand of a low false
positive rate.
1 Introduction
The goal of a coin recognition system is to automatically sort and classify high
volumes of coins with high accuracy within a small amount of time. In 2003
ARC Seibersdorf research GmbH created the sorting device called Dagobert [1].
The recognition unit of Dagobert is able to discriminate between over 600 differ-
ent coin types based on over 2000 different coin faces. In 2006 ARC Seibersdorf

  

Source: Albert-Ludwigs-Universität Freiburg, Institut für Informatik,, Lehrstuhls für Mustererkennung und Bildverarbeitung

 

Collections: Computer Technologies and Information Sciences