Professional Documents
Culture Documents
Literature Review
Presently ,there are a number of methods
for paper currency recognition:
Using symmetrical masks technique
for recognizing paper currency in any
direction.
Other method:
1. The edges of patterns on a paper
currency are spotted.
2. In the next step, paper currency is
divided into N equal parts along
vertical vector.
3. Then, for each edge in these parts
the number of pixels is added and
fed to a three-layer, back
propagation neural network.
4. In this process, to conquer the
problem of recognizing dirty worn
(1)
p12 p 1 n
. 2
P= . . pn 1
[ pn n ]
where n is the number of states in the
chain.
Steps for paper currency recognition :
1. Banknote Size is calculated. If its size
satisfies equation (2) it is considered
as a possible true banknote.
2. The banknote image histogram is
calculated.
3. The transition matrices (Nx and Ny)
are calculated then, the main diagonal
elements of the matrices (namely Dx
and Dy) are taken out as a feature for
distinguishing between different
denominations.
4. The paper currency under observation
is assigned to a denomination class if
the Euclidean distances between the
main diagonal elements of its
1
F ( n) = Fi ( n)
M i=1
(5)
Ei=
1
Ei ( n )
N i=1
(6)
1
( Fi ( n )d ( n ) ) 2+ 1
2
N
()
1
N i=1
pi ( n )
i=1
(7)
pi ( n ) =( Fi ( n )F ( n ) ) ( Fj ( n )F ( n ))
(8)
j =1
= Fi ( n )d ( n )+
( F j ( n )F ( n ) )
j 1
= Fi ( n )d ( n )+
( F i ( n )F ( n ))
( F i ( n )F ( n ))
for the ith network. During the training
process, the entire ensemble interacts
with each other through their penalty
terms in the error functions. Each
network i minimizes not only the
difference between Fi(n) and d(n) , but
also the difference between F(n) & d(n).
That is, negative correlation learning
considers errors what all other networks
have learned while training a network.
Comparative study of
different paper currency and
coin recognition method
Currency has great importance in day to
day life so currency recognition is a great
area of interest .We can conclude that
Coin-o-omatic(2006)
Curren
cy
note
localiz
ation(e
dge
detecti
Feat
ure
extr
actin
g
Matc
hing
algo
rith
m
Final output
decision
Potential applications
1. Assisting blind and visually impaired
people.
2. Distinguishing original note from
counterfeit currency.
3. Automatic selling goods.
4. Banking service and applications.
Related work
Image acquisition : is the creation of
digital image.
Image pre-processing: Enhance some
image features
1. Image adjusting: reducing the
image size.
2. Image smoothening: by applying
mask on the image higher is the
size of mask, more is the
smoothing.
Discussion
Artificial Neural Network based
currency classification is the most
frequently used method like Feed
Forward Network, Back Propagation
Neural Network, RBF network and
ENN.
There are also some models
developed by researchers like
Markov chain.
f(x) = Fax+Fd
where x is the input image in gray
scale, f(x) is the output image and
selecting
Fa=3,
N=50
Fd=-128,
Wiener filter
It is a filter used to reduce the effect of dirt
through improving image lightness.
Wiener filter estimate local mean and
variance around each pixel as:
1
MN
2=
(n 1, n2)
n 1,n 2 ( N xM )
1
MN
2 ( n 1, n 2 )2
n 1,n 2 (N xM )
b(n1, n 2)=+
2v 2 (
[ n 1, n 2 ) ]
2
(a)
m =0 n=0
m 0=
N
N
, n0 = for N odd
2
2
m 0=
( N 1)
(N 1)
,n 0=
for N
2
2
(b)
(a)
(c)
(b)
(d)
Fig 1:
Using the Wiener filter to reduce the dirt
from the worn banknote.
a)Original image before filtering,
b)Obtained image after filtering.
c)Worn image before filtering
d)Worn image after filtering.
Fourier-mellin Transform
It is a powerful tool for image recognition
as:
2
2
( km ) j( ) ( ln )
(
M)
e N
|F {I [ m , n ] }|=|F [ k , l ]|= I [ m, n ] e
M1 N 1
(c)
Fig 2:
Using the Fourier-Mellin transform to reduce
the effect of rotation of the banknote:
a) Original image,
b) Rotated image
c) Output image after applying FourierMellin transform.
Hidden Markov Model (HMM)
By using the hidden Markov Model the
texture of a banknote is modeled as a
random process.
A random process { x n ,n=0,1,2, .. } is
called a Markov chain if the possibility
value in state x n+1 depends on just the
possible value in state x n that is:
p 11
p 12 p 1 n p 21
p 22 p 2 n
.
.
.
.
P=
.
[ pn 1 pn 2 pnm ]
Where n is the number of states in a chain.
In a discrete time Markov chain, the
possibility value of different states in the
matrix is computed as follow:
pij =
nij
n
nik
k=1
by the factor
n ik
k=1
N=
pij nik
k=1
N 11
N 12 N 1n N 21
N 22 N 2n
.
.
.
.
[ Nn 1 Nn 2 Nnm ]
19
49
51
222
340
6
486
198
467
213
126
26
75
46
186
0
256
107
6
1
52
5
26
13
26
23
793
634
48
67
198
409
16
21
38
331
209
8
376
9
103
39
60
17
675
672
6
197
8
67
15
Table 1.
Transition matrix for a 5 Euro banknote
45
19
16
8
7
5
5
35
402 238 50
38
25
9
9
235 871 356 114 90
48
7
50
337 155 459 183 116
3
3
29
150 556 193 700 231
8
2
26
59
157 876 707 172
7
6
5euro
45
402 871
1553
1938
10euro
0
35
609
585
512
20euro
9
451 1359
461
1007
50euro
0
261 985
777
2122
100euro 0
119
1405
910
1430
200euro 0
83
811
768
678
500euro 0
98
1255
876
1429
4
16
25
39
4
21
15
33
0
4
9
17
0
0
5
5
100
74
35
12
240
125
70
28
7077
2284
4821
4753
2503
913
2615
Table 2.
Transition matrix for 7 types Euro banknotes
Original 45
402
871
1553
1938
7077
5 euro
Dirty 5
39
398
813
1456
1892
6981
euro
Table 3.
Transition matrix for original 5 Euro and dirty 5 euro
3406
2646
2025
6051
5725
1605
8082
793
6804
5372
6806
5648
3287
2457
6726
12852
11825
19935
8204
5160
2412
3769
2760
245
16754
1427
15485
8895
49
5
8
19969
34
90
63
3406
793
6726
3769
49
3355
721
6451
3689
24
80
49
Image
aquistion
Currency note
localization(edge
detection and
segmentation
Feature
extracting
Matchin
g
algorith
m
Final output
decision
Most of matching algorithm used Artificial Neural Network specially Ensemble Neural
Network as its better performance than single Neural Network.
Also the most common model technique is the Markov Chain.