CompCode - Competitive coding scheme for palmprint verification
CompCode - Competitive coding scheme for palmprint verification
1,2
Adams Wai-Kin Kong and 1David Zhang
1
Biometrics Research Center, Department of Computing,
The Hong Kong Polytechnic University, Kowloon, Hong Kong
[email protected]
2
Pattern Analysis and Machine Intelligence Lab, University of Waterloo,
Waterloo, Ontario, N2L 3G1, Canada
[email protected]
¦¦ ( P M ( x, y ) ∩ Q M ( x, y )) × G ( P ( x, y ), Q ( x, y ))
y =0 x = 0
D ( P, Q ) = N N
(4)
3¦¦ PM ( x, y ) ∩ QM ( x, y ) (c) (d) (e)
y =0 x=0
where
min(P(x, y) −Q(x, y), Q(x, y) −(P(x, y) −6)) if P(x, y ≥ Q(x, y)
G(P(x, y),Q(x, y)) = ®
¯min(Q(x, y) − P(x, y),P(x, y) −(Q(x, y) −6)) if Q(x, y) > P(x, y)
(5)
and ∩ represents an AND operator and the size of the
feature matrixes is N×N. Obviously, D is between 0 and 1. (f) (g) (h)
For perfect matching, the angular distance is zero.
Because of imperfect preprocessing, we need to translate Figure 1. An example of Competitive Code. (a)
one of the features vertically and horizontally and then Preprocessed image. (b) Competitive code. (c)-(h) are the
perform the matching again. Both the ranges of the winning Code 0, 1, 2, 3, 4 and 5, respectively.
vertical and the horizontal translation are –2 to 2. The
minimum of the D’s obtained by translated matching is Table 1. Bit representation of the Competitive Code
regarded as the final angular distance.
However, we find that directly implementing Eqs. 4-5 Original values Bit 1 Bit 2 Bit 3
is ineffective. The elements of Competitive Code are 0, 1, 0 0 0 0
2, 3, 4 and 5. We can use three bits to represent an 1 0 0 1
element and one bit for the mask. In total, a Competitive 2 0 1 1
Code is constituted by four bit-planes. The bit values 3 1 1 1
among different elements of Competitive Code are shown 4 1 1 0
in Table 1. According to this bit representation of the 5 1 0 0
Competitive Code, a more effective implementation of
angular distance can be defined as:
4. Experimental results
N N 3
¦ ¦ ¦ (P M ( x, y ) ∩ Q M ( x , y )) ∩ ( Pi ( x, y ) ⊗ Q ( x, y ))
b
i
b
D ( P, Q ) =
y =0 x =0 i=0
We collected palmprint images from 193 individuals
N N
3¦ ¦ PM ( x, y ) ∩ Q M ( x, y )
(6)
using our palmprint scanner. The subjects are mainly
y =0 x =0
students and staff volunteers from The Hong Kong
where Pi (Q ) is the ith bit plane of P(Q) and ⊗ is bitwise
b
i
b
Polytechnic University. In the dataset, 131 people are
exclusive OR. male, and the age distribution of the subjects is: about
Using ASUS notebook embedded Intel Pentium III 86% are younger than 30, about 3% are older than 50, and
Mobile processor (933MHz), directly implementing Eqs. about 11% are aged between 30 and 50. We collected the
4-5 requires 2.27ms for one matching but Eq. 6 only palmprint images in two occasions. Each time, the
4.1 Verification