Professional Documents
Culture Documents
ABSTRACT
In recent years, iris recognition has become a popular
recognition system as compare to the existing systems. It
is an important biometric method for human
identification with high accuracy. It is the most reliable
and accurate biometric identification system available
today. The most popular biometric types are: signature,
face, iris, finger prints, hand and voice. Among all these
biometric techniques, iris recognition is one of the
accurate due to its high reliability for personal
identification. A number of techniques are available for
iris recognition system like Morlet Wavelet, Reverse
Biorthogonal Wavelet, K-D Tree Method and
Biorthogonal Wavelet etc. In this paper Reverse
Biorthogonal Wavelet is used for Iris Recognition
system and using this technique Hamming distance
between iris codes is calculated to measure the
difference between two iris images in the database. Iris
recognition is then performed by matching the iris pair
with the minimum Hamming distance.
1.1.
Upper Eyelid
I.
INTRODUCTION
Pupil
Lower eyelid
Scelra
1.2.
PUPIL
www.ijsret.org
232
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 3, Issue 2, May 2014
1.3.
II.
METHODOLOGY
The algorithm can be divided into four steps:
Segmentation, Normalization, Feature Extraction and
Matching. The block diagram given below:
(a)
(b)
(c)
Fig. 3 Segmented outer and inner area of iris (a)
Localized outer and inner Area of iris
(b) Localized of pupil (c) Localized of iris boundary.
2.2
2.1
SEGMENTATION
NORMALIZATION
In order to remove the pupil; Dugman [18] rubber-sheet
method was used to unwrap the iris image. The main
aim of normalization is to convert the iris image from
cartesian coordinate (x,y) to polar coordinate (r, ). This
paper uses the polar coordinate transform to carry on the
normalization, because the inner and outer circle are not
cocentric [18]. Each iris image was normalized and
unwrapped to multiple rows and columns. This process
cuts the iris image at one point along the radial direction
and streches it into a rectangular shape [18].
www.ijsret.org
(a)
(b)
233
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 3, Issue 2, May 2014
FEATURE EXTRACTION
2.4
MATCHING
The last step of iris recognition is matching the image
with the stored image or database. UBIRIS.v1 database
is to be used for this iris recognition system. It contains
the 765 grayscale images with 108 unique eye 5 and
different images of each unique eye. For the comparison
of the two iris codes, the hamming distance algorithm is
employed. Since the iris region contains features with
very high degrees of freedom, and each iris produces a
bit-pattern which is independent to that produced by
another iris, whereas the codes produced by the same iris
would be similar. If two bits patterns are completely
independent, then the ideal Hamming distance between
the two patterns will be equal to 0.5. It happens because
independent bit pattern are completely random.
Therefore, half of the bits will agree and half will
disagree between the two patterns. The Hamming
distance is the matching metric employed by Daugman
[21], and calculation of the Hamming distance is taken
only in bits that are generated from the actual iris region.
The Hamming distance will be defined as follows:
III.
(1)
RESULT
Inner-class and inter-class hamming distance: The
main objective of iris recognition system is to determine
the value of hamming distance which can separate innerclass and inter-class iris image. Hamming distance
between the iris images of same person is known as
inner-class and hamming distance between the iris
patterns of different persons is known as inter-class. A
much better iris recognition system tries to achieve the
overlapping of the hamming distance of two classes that
should as small as possible, because results depend upon
the separation value. When the hamming distance value
of two iris pattern is less than the separation point, then
results shows that the code of two iris is belongs to a
same person. Otherwise, the code of two iris is belongs
to a different person. The overlap between the two
distributions determines the error rate [2]. For the innerclass irises, the right side area of separation point creates
the false rejection rate. For the inter-class iris, the left
side area of the separation point creates the false
acceptance rate.
www.ijsret.org
500
450
400
Number Of Images
Where
and
are the two bit wise template to
compare and N is the number of bits represented by each
templates. In the present case, the HD is 0.445 which
signifies that if the hamming distance between the two
templates is below 0.445 than both the irises are of same
eye and if the HD value falls above 0.445, it signifies
that both the irises are from different eye.
(c)
(d)
Fig. 4 The normalized iris images of different eyes.
2.3
350
inner-class
Mean=0.4
300
inter-class
Mean=0.54
250
200
150
100
50
0
0.1
0.2
0.3
0.4
0.5
0.6
Hamming Distance
0.7
0.8
0.9
234
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 3, Issue 2, May 2014
Fig. 5 shows the distribution of inner-class and interclass hamming distance. This result clearly shows that
the separation between inter-class and inner-class
hamming distance. This result indicates that it was still
very much possible to clearly separate the iris codes of
different people by using this technique. In fig. 7 and 8
graph shows the distribution of inner-class and interclass hamming distance. This graph is shown in the form
of bar. The graph is the plot between hamming distance
and the number of images
12
10
Number Of Images
0.1
0.2
0.3
0.4
0.5
0.6
Hamming Distance
0.7
0.8
0.9
Number Of Images
10
IV.
0
-0.2
0.2
0.4
0.6
Hamming Distance
0.8
1.2
Number Of Images
350
300
250
200
150
100
50
0
-0.2
0.2
0.4
0.6
Hamming Distance
0.8
1.2
CONCLUSION
This paper presents an iris recognition system using
reverse biorthogonal wavelet for UBIRIS.v1 database,
which was tested using database of grayscale eye images
that is a set of human eye images from UBIRIS.v1
database is used in the experiments. From UBIRIS.v1
database, 5 different images of 50 persons are taken(250
sample of the iris). Firstly, segmented algorithm was
presented, which would localize the iris region and the
segmentation was achieved through the use of the
circular hough transform for localizing the iris and pupil
region. It also uses the canny edge detection for wide
range of edges. Next, the normalization is used to
convert the cartesian coordinate into the polar
coordinate. This was achieved by implementing a
version of daugmans rubber sheet model, which is
unwrapped into a rectangular block with polar
dimensions. Finally in the feature extraction, the reverse
biothogonal wavelet is used to extract the feature of the
human iris. This decomposition obtained the coefficients
and converted into binary codes and is to be used for
calculation of hamming distance for matching purpose.
The results show that the average time for both search
and matching is approximately 12 seconds. Seperation
point between inner and inter class is 0.445. The innerclass mean of the Hamming distance is 0.4, while the
inter-class mean of the Hamming distance is 0.54. The
Proposed algorithm exactly finds iris regions with higher
reliability, greater efficiency and in small time duration.
www.ijsret.org
235
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
Volume 3, Issue 2, May 2014
V.
REFERENCES
www.ijsret.org
236