HAND IDENTIFICATION USING FUZZY FEATURE MATCHING(FFM)
M.Moorthi, M.Madhu, S.Sathish kumar
Assistant professors
Department of Electronics and Communication Engg
Prathiyusha Engg College & Rajiv Gandhi College of Engg.
m.moorthi@yahoo.com, gasath2001@gmail.com
Abstract
The rapid growth in the use of e-
commerce applications requires security of the
communication channel used and reliable and
auto personal identification for effective security
control. Conventional identification techniques
can be divided into two categories: token based,
such as physical key, an ID card and a passport,
and knowledge-based, such as a password in this
paper we propose a WAVELET based hand
identification system for personal identification.
These approaches offer more scope for credible
authentication as compared to finger print
recognition. The images of the hand are taken
and length of the fingers is computed using
gradient method. These are used as feature for
categorizing the palm. The variance of the lines
in the palm is calculated for all sub blocks of the
palm image to get another set of feature vectors.
Therefore the numbers of parameters, which
have to be matched for authentication, are more
in the case of palm than a finger. From these
extracted features we take the minutiae of the
lines in the palm. This paper proposes a novel
method, a fuzzy feature match (FFM) based on a
local triangle feature set to match the deformed
palm. The palm is represented by fuzzy feature
set: the local triangle feature set. The similarity
between the fuzzy features set is used to
characterize the similarity between the palms. A
fuzzy similarity measure for two triangles is
introduced and extends to construct a similarity
vector including the triangle-level similarities for
all triangles in two palms. Accordingly, a
similarity vector pair is defined to illustrate the
similarities between two palms. The FFM
method maps the similarity vector pair to
normilized value, which quantifies the overall
image similarity.
1. Previous analysis:
Palm recognition has applied for security
purpose, and currently it is being increasingly
used for personal identification in a civilian’s
daily life. In general in palm matching process
the features taken in the consideration are the
length of the fingers and the certain palm
features, then the comparisons between the input
palm feature and the palm feature in the database
is taken place. But in this process there is a
chance to mismatch of the palm, due to some
distortion taken place in the palm surface. The
poor quality of the palm is due to variations in
impression or skin condition, ridge
configuration, acquisition device, and non-
cooperative attitude of subjects, etc.
2. Proposed analysis:
In our proposed method a new concept is
introduced. That is different from the above-
mentioned method, we are developing a novel
way, fuzzy feature match (FFM) based on a local
triangle feature set to match the deformed palms.
The palm was represented by the fuzzy feature
set: local triangle feature set. The similarity
between the fuzzy features set was used to
characterize the similarity between palms. A
fuzzy similarity measure for two triangles is first
introduced. The result was extended to construct
a similarity vector which include the triangle-
level similarities for all triangle in two
palms.Acordingly a similarity vector pair was
defined to illustrate the similarities between two
palms. Finally, the FFM measure mapped a
similarity vector pair to a normalized quantity
within the real interval [0, 1], which qualifies the
overall image to image similarity. The palmprint
and hand geometry images can be extracted from
a hand image in a single shot at the same
time.Unlike other multibiometric systems(e.g.,
face and fingerprint,voice and face,etc.),a user
doesnot have to undergo the inconvenience of
passing through multiple sensors.Furthermore
the fraud associated with fake hand,in hand
geometry based verification system,can be
alleviated with the integeration of palmprint
features.This paper presents a new method of
personal authentication using palmprint and hand
geometry features that are simultaneously
acquired from a single hand image.The block
diagram of the proposed verification system
. image. The threshold value is automatically
FIG1: Block diagram of the personal
Verification system using palm print
and hand geometry
Hand images of every user are used to
automatically extract the palmprint and hand
geometry features.This is achieved by first
thresholding the images acquired from the digital
camera.The resultant binary image is used to
estimate the orientation of hand since in absence
of pegs user does not necessarily align their hand
in a preferred direction.The rotated binary image
is used to compute hand geometry features.This
image also serves to estimate the center of
palmprint from the residue of morphological
erosion with a known structuring element (SE).
The center point is used to extract the palmprint
image of a fixed size, from the rotated gray level
hand images. Each of these palmprint are used to
extract. Thus the palmprint and hand geometry
features of an individual are obtained from the
same hand image. Two schemes for the fusion of
features,fusion at the decision level and at the
representation level, were considered. The
decision level fusion gave better result.
2.1.Image Acquisition And Alignment
Our image acquisition setup is
inherently simple and does not employ any
special illumination nor does it use any pegs to
cause inconvenience to users.The Olympus C-
3020 digital camera(1280 x 960 pixels)was used
to acquire the hand images as shown in
figure.The users were only requested to make
sure that (i) their fingers do not touch each others
and (ii) most of their hamd(back side) touches
the imaging table.
2.2.Extraction of hand geometry
images
Each of the acquired needs to be aligned
in a preferred direction so as to capture the same
features for matching. The image threshold
operation is used to obtain a binary hand-shape
computed using Ostu’s method. Since the image
background is stable (black),the threshold value
can be computed once and used subsequently for
other images. The binarized shape of the hand
can be approximated by an ellipse. The
parameters of the best-fit ellipse, for a given
binary hand shape, is computed using the
moments. The orientation of the binarized hand
image is approximated by the major axis of the
ellipse and the required angle of rotation is the
difference between normal and the orientation of
the image. The binarized image is rotated and
used for computing the hand geometry features.
The estimated orientation of binarized image is
also used to rotate gray-level hand image, from
which the palmprint image is extracted as
detailed in the next subsection.
(a) (b) (c) (d) (e)
.
FIG2: Extraction of two biometrics modalities
from hand image,(a) Captured image from the
digital camera,(b)Binaries image and ellipise
fitting to compute the orientation,(c) Binary
image after rotation,(d)Grayscale image after
rotation,(e)ROI (i.e.)palm print, extracted image
from the center of image in (c) after erosion
2.3.Extraction of plamprint images
Every binaries hand-shape image is
subjected to morphological erosion, with a
known binary SE, to compute the region of
interest, i.e., the palmprint. Let R be the set of
non-zero pixels in given binary image and the set
of non-zero, i.e., structuring element. The
morphological erosion is defined as
ROSE={g:SEg⊆R},
Where SEg denotes the structuring element with
its reference point shifted by g pixels. A square
structuring element (SE) is used to probe the
composite binaries image. The center of
binarized hand image after erosion, i.e., the
center of the rectangle that can ensole the residue
is determined. This center coordinates are used
to extract a square palm print region of fixed size
as shown.
2.4.Normalization of palmprints
The extracted palmprint images are
normalized to have pre-specified mean and
variance.The normalization is used to reduce the
possible imperfections in the image due to sensor
noise and non-uniform illumination.The method 0 0
(h2), 90 (h3), and 135 (h4). The spatial
for normalization employed in this work is the extent of these masks was empirically fixed as 9
same work as suggested and is sufficient for the
× 9. Each of these masks is used to filter I ′(x, y)
qualityu of acquired images in our
as follows:
I 1 ( x, y )= h1 * I ′( x, y )
experiments.Lets the gray level at (x,y), in a
palmprint image be rpresented by l(x,y).The
mean and variance of image, φ and ρ , Where ‘*’ denotes the discrete 2D convolution.
respectively, can be computed from the gray Thus four filtered images, i.e., I 1 ( x, y ) ,
levels of the pixels. I 2 ( x, y ) , I 3 ( x, y ) , And I 4 ( x, y ) are used
I f ( x, y ) by
⎧φd + λ if I(x, y) >φ
I′(x, y) = ⎨
{
ρ I(x, y)−φ}2
whereλ = d
to generate a final image

⎩φd −λ otherwise ρ
where φd and ρ d are the desired values for
mean and variance, respectively. These values The resultant image represents the combined
are pre-tuned according to the image directional map of palm print I (x, y) . This
characteristics , i.e., I(x, y ). In all our image I f ( x, y ) is characterized by a set of
experiments, the
localized features, i.e., standard deviation, and
Used for verification. I f ( x, y ) is divided into a
set n blocks and the standard deviation of
Gray-levels in each of these overlapping blocks
is used to form the feature vector.
v palm = {σ 1 , σ 2 , .... , σ n }
Where σ 1 is the standard deviation
3.2 Extraction of hand geometry
features
The binary image‡ as shown in figure
2(c), is used to compute significant hand
geometry features. A total of 16 hand geometry
features were used (figure 5); 4 finger lengths, 8
finger widths (2 widths per finger), palm width,
FIG 3: Palmprint feature extraction; (a) palm length, hand area, and hand length. Thus,
segmented image, (b) image after normalization, the hand geometry of every hand image is
filtered images with directional mask at characterized by a feature vector vhg of length 1
orientation 0o in (c), 90o in (d), 45o in (e), 135o × 16.
in (f), (g) image after voting, and (h) features
extracted from each of the overlapping blocks.
3. Feature Extraction
3.1 Extraction of palm print features
The palm print pattern is mainly made
up of palm lines, i.e., principal lines and creases.
Line feature matching [8], [15] is reported to be
powerful and offers high accuracy in palm print
verification. However, it is very difficult to
accurately characterize these palm lines, i.e.,
their magnitude and direction, in noisy images.
Therefore, a robust but simple method is used
here. Line features from the normalized palm
print images are detected using four line
detectors [28] or directional masks. Each of these FIG 4: Hand Geometry Feature Extraction
masks can detect lines oriented at 0 0 (h1), 45 0
4.Defining local triangle feature set
In our algorithm, the block of the
matching is the local triangle feature of the
palms.the feature vector of a local triangle
structure Tk is defined as FTk={dij, dik, djk, Ψi,
Ψj, Ψk, OZi, OZj, OZk, αi, αj, αk} where dij
denotes the distance between minutiae i and j;
and Ψi indicates the angle between the direction
from minutiae i to j; and the direction from
minutiae i to k;
OZi presents the orientation differences within
the region of minutiae i ,αi, denotes the angle
between the orientation of minutiae i with the
direction of the interior angle bisector of corner i.
The pixels in the square centered around
minutiae I within the radius r (r is an empirical
parameter r=15 in our algorithm)are forming the
region of the minutiae i.OZi is computed as
follows:
i =r 0+ r j = y 0+ r
∑ ∑ Ori(i, j ) − Ori( x0, y0)
i =r 0r j= y0r
OZ i =
2r • 2r
Where r is the radius of region, and Ori (i,j) is
the orientation at image point (i,j).
The meaning of the parameter {dik, djk, ψj
ψk, Ozj, OZk, αj, αk) is similar to (dij, ψi, OZi,
αi). It is clear that the local triangle structure
feature vector FTk is independent from the
rotation and translation of the palm. if shows a
local triangle structure of the palm.
An exhaustive search will be done to
construct the triangle as no prior minutiae
correspondence is established. The triangles are
constructed by means that a minutia belongs to
many triangles formed with others minutiae.
There is one constraint during the process of
constructing the local triangles: the maximum
length of the edge should be less then thr1,and
the minimum length of the edge should be
greater then greater then thr2.As the palm ids
deformed, the distance between two
minutiae)should not be long. The large
deformation is formed by the accumulation from
all of the region between minutiae.thr1 and thr2
are empirical parameters (set different value for
different database thr1=250 pixels, thr2=40).
FIG 5:Local triangle structure of the palm
Then the feature vector set F={FT1, FT2…FTN},
which consists of feature vector FTk, k=1,2…N,
of all local triangles detected from a palm, is
used to represent the image. Palm matching is to
find a similarity between two-feature vector set,
one from the template and another from the input
palm respectively.
5. Learning Genuine Distorted pattern
Parameter space
Before measuring the similarity
between the fuzzy feature set.we define the
genuine distorted pattern parameter space,which
is derived from a set of genuine matching
attempts.
Suppose FTk={dij, dik, djk, ψi, ψj, ψk, OZi,
Ozj, OZk, αi, αj, αk} is a local triangle feature in
a templat palm and FTIk={ďij, ďik, ďjk, ψ’i, ψ’j,
ψ’k, OZ’i, OZ’j, OZ’k, άi, άj, άk) is a local
triangle feature in an input palm. Four distorted
pattern parameter. Vector lendiff, ψdiff,OZdiff,and
αdiff are calculated as follows:
r
len diff ={ |dij -d’ij| , |dik-d’ik| , |djk-d’jk| }
r
ψ diff ={|ψij -ψ’ij| , |ψik-ψ’ik| , |ψjk,ψ’jk|}
r
OZ diff ={|OZi-OZ’i|, |OZj -OZ’j|, |OZk-OZ’k|}
r
α diff ={| αi-α’i|, |αj-α’j |, |αk-α’k|}
These distorted pattern parameter
construct deformed pattern feature vector
r r r r
f( len diff ,ψ diff , OZ diff , α diff ).To learn the
genuine distorted pattern parameter, we applied a
set of distorted palm images to derive a genuine
distorted pattern parameter space. in order to
ensure the samples are representative of various
types of distortion ,we choose the corresponding
training samples for each database.
6. Fuzzy Feature Matching(FFM): are cone, exponential efficiency, and Cauchy
Functions. In our algorithm, the modified
Based upon fuzzy feature Cauchy function is chosen due to its good
representation of palms, the similarity between expressiveness and high-computational
the fuzzy features is used to characterize the efficiency.
similarity between palms. We introduce a fuzzy The membership function of ƒ to fuzzy feature
~
similarity measure for two triangle-level set G : C (ƒ)Æ[0,1] is defined as
similarities for all triangles in two palms.
( )
r r
Accordingly, a similarity vector pair is defined to
⎧1 if h f , g = True
illustrate the resemblance between two images.
⎪
~ ⎪⎪
The FFM method maps a similarity vector pair to 1
a normalized quantity, within the real interval
[0,1], which quantifies the overall image-to-
()
C f =⎨ ⎛ ~ ~ ⎞a
f .g ⎟
, otherwise

image similarity. ⎪1+⎜

⎪ ⎜⎜ m ⎟⎟
6.1 Fuzzy Similarity Between ⎪⎩ ⎝ ⎠
Triangles
All elements in the genuine
distorted pattern parameter space construct the r ~
~ defined as
fuzzy feature set G, with g Where f ∈ G . m and a ∈ ℜ , m>0, a> = 0. If
~
∑
and only if the value of each entry in feature
~ ~ f r
f ∈G
g~ =
( )
~ f is less than the value of corresponding entry
V G in feature ƒ is less than the value of
r
corresponding entry in feature vector g ,
( f , gr ) = True . gr is the center location
~ ~ r
where f represent a feature vector in G , h of the
~ ~ r r
V ( G ) denotes the volume of G , which is fuzzy set, m represent the width (|| f − g || for
essentially the mean of all elements of the ferture

()
set,and it may not be an element of the feature r
set. while averaging over all features in a feature C f =0.5) of the function ,and a determines the
set increases the robustness of the fuzzy feature smoothness of the function. Generally, m and a
,at the same time ,lots of useful information are describe the grade of fuzziness of the
submerged into the smoothing process because a corresponding feature. For fixed m, the grade of
set of feature vectors is mapped to a single fuzziness increase while a decreases. For fixed a,
feature vector.Here,we chose only the first-order the grade of fuzziness increases as m increases. It
moment to describe the fuzzy feature set, and the is clear that the farther a feature vector moves
experimental results prove that it is simple and away from the cluster center, the lower the
efficient for using the center ( g~ ) to represent degree of membership to the fuzzy feature is.
~
feature set G . 6.2 Fuzzy Feature Matching
Similarity Between Palms: It is clear
Suppose FTTK={dij, dik, djk, ψi, ψj, ψk, that the image-level similarity is constructed
OZi, OZj, OZk, αi, αj, αk} is a local triangle in from triangle-level similarities. Let
{
the template palm and FT1k={d’ij, d’ik, d’jk, ψ’i, r
T= FTt : 1 ≤ t ≤ u , u be the number of all
ψ’j, ψ’k, OZ’i, OZ’j, OZ’k, α’i, α’j, α’k} is a local
triangle in the input palm, the following method triangles detected from the template palm}
is employed to measure the similarity between represents the template palm, and
r
FTTk and FTIk.First, calculate the deformed I = FTi :1 ≤ i ≤ v ,v is the number of all
pattern feature vector ƒk (lendiff, ψdiff, OZdiff,
αdiff); then measure the degree of membership of triangles detected from the input palm}represents
r
~
ƒk to the fuzzy feature set G . the input palm. First, for every FTt ∈ T , we
Building or choosing a proper membership define the similarity measure for it and I as
r
function is application dependent. The most
commonly used prototype membership functions [
l I = l1I , l 2I ,..., luI ].
T
 {( )
r r
liT = max C FTi − FTt | t = 1....u } 4) For i=1 to m;
r 5) Generate each minutiae details for template;
Likewise, for every FTi ∈ I , we 6) Next i
7) For i=1 to n; For j=i+1 to m; For k=j+1 to m
define the similarity measure for it and T as
{ ( )
r r 8)Compute each local triangle feature
ltI = max C FTt − FTi | i = 1....v. } details(dij,dik,dik,Ψi,Ψj,Ψk,OZi,OZj,OZk,αi,αj,αk) for
T template;
Combining l together, we get a vector
i 9) Next k; Next j; Next i
rT
[ ] T
l = l1T , l 2T ,....., l vT .
rI
10) Suppose a triangles have been constructed
for the template palm
it is clear that l describes the similarity 11) For i=1 to m; For j=j+1 to m; For k=j+1 to
between the individual fuzzy feature in T and all m;
rT 12) Compute each local triangle feature
the fuzzy features in I, and l illustrates the details(dpq,dpr,dqr,Ψp,Ψq,Ψr,OZp,OZq,OZr,αp,αq,αr)
similarity between individual fuzzy features in I for query;
and all fuzzy features in T. Thus, we define a 13) Next k; Next j; Next I
similarity vector for T and I, The FFM method is 14) Suppose b triangles have been constructed
applied to provide an overall image to image for the query palm
similarity by summation of all the weighted 15) For ii=1 to a; For jj=1 to b
r(T , I )
entries of similarity vectors L with weight 16) If (|d ij- d pq|< thrd and |d ik –d pr|< thrd and |d
vectors w. There are many options to choose jk- d qr|< thrd and |Ψ i- Ψ p|< thrΨ and |Ψ j- Ψ q|<
weight vector w.We can take the location of the thrΨ and |Ψ k-Ψ r|< thrΨ and |oz i-oz p|< throz and
triangle into account and assign higher weights |oz j-oz q|<throz and |oz j-oz q|< throz
to triangles closer to the center of the palm and |α i-α p|< thra and |α j-α q|< thra and |α k-α
(center-favored scheme, assuming the triangles r|< thra )
near the image center are more reliable). Another
choice is the area scheme. It takes the area 17) s1 =s1+1;
covered by the triangle as the weight based on 18) End if;
the viewpoint that the triangle as the weight 19) Next jj; Next ii
based on the viewpoint that the triangle of the
r ⎡ wB ⎤
proper area in a palm is more reliable. In the r ⎡ wBI ⎤ ⎢ 1 ⎥ 1 − ri − R
FFM method, both area- and center favored wB = ⎢ r L ⎥ = ⎢M ⎥ , wBi = e ,
schemes are used. The weight vector w is defined ⎢⎣ wB ⎥⎦ ⎢ ⎥ S B
as ⎣ wBu + v ⎦
r r r
w = (1 − p )w A + pwB u+v
⎧ RT i = 1....u
SB = ∑e
− ri − R
, R=⎨
r ⎡ wB ⎤ i =1 ⎩ RT i = 1 ....u + v
r ⎡ wBI ⎤ ⎢ 1 ⎥ 1 − ri − R
wB = ⎢ r L ⎥ = ⎢M ⎥ , wBi = e ,
⎣⎢ wB ⎦⎥ ⎢ w ⎥ SB where S B is the desired area of the triangle, RT
⎣ Bu + v ⎦ is the center of the template image, R I is the
u+v
⎧ RT i = 1....u
SB = ∑e i
−r −R
, R=⎨ center of the input image, ri is the barycenter of
i =1 ⎩ RT i = 1 ....u + v r
the ith triangle. w A contains the normalized area
r
of the template and input image palms, wB
INPUT:the minutiae number n,m of the template
and query palm contains normalized weights which favor
OUTPUT: s1 ,the number of matched triangles triangles near the image center, p ∈ 0,1 [ ]
between the template and input palm r
adjusts the significance of wA and
6.3.ALGORITHM: r
1) For i=1 to n; wB .Consequently, the FFM measure for
2) Generate each minutiae details (position, template and input palms is defined as
r
minutiae orientation, orientation differences
within the region) for template; Sim = [(1 − p )wr A + pwr B ] L(T ,I ) .
3) Next i
 7. Conclusion: elastic deformations,” pattern
Copying with nonlinear distortion recognit.,vol36,no.8pp.1859-1867,2003
in palm matching is a challenging task. We (8)X.P.Leo,J.Tian and Y.Wu “A minutiae
proposed a novel method for deformed palms matching algorithm in palm verification”
matching. The fuzzy feature represents the palm: in porc.15th ICPR,sep.2000,Vol 4 pp.833-836.
local triangle feature set. The similarity between
the fuzzy features is used to character the
similarity between palms. We introduce a fuzzy
similarity between palms. We introduce a fuzzy
similarity measurement for two triangles and
extend it to construct a similarity vector
including the triangle and extends it to construct
a similarity vector including the triangle-level
similarity in two palms Accordingly a similarity
vector pair is defined to illustrate the
resemblance between two palms. Finally, the
FFM method maps a similarity vector pair to a
normalized quantity, which quantifies the overall
image-to-image similarity within the real interval
[0,1].

References

1. A. K. Jain, R. Bolle, and S. Pankanti,

Biometrics: Personal Identification in Networked
Society,
Kulwer Academic, 1999.
2. M.-H. Yang, D. J. Kriegman, and N. Ahuja,
“Detecting faces in images: A Survey,” IEEE
Trans.
Patt. Anal. Machine Intell., vol. 24, pp. 34-58,
Jan. 2002.
3. W. K. Kong and D. Zhang, "Palmprint texture
analysis based on low-resolution images for
personal
authentication," Proc. ICPR-2002, Quebec City
(Canada).
4. A. Kumar and H. C. Shen, “Recognition of
palmprints using wavelet-based features,” Proc.
Intl.
Conf. Sys., Cybern., SCI-2002, Orlando, Florida,
Jul. 2002.
5. W. Li, D. Zhang, and Z. Xu, "Palmprint
identification by Fourier transform," Int. J. Patt.
Recognit.
Art. Intell., vol. 16, no. 4, pp. 417-432, 2002.
6. J. You, W. Li, and D. Zhang, "Hierarchical
palmprint identification via multiple feature
extraction," Pattern Recognition., vol. 35, pp.
847-859, 2002.
(7)A.M.Bazen and S.H.Gerez “ Finger print
matching by thin-plane spline modeling of