Академический Документы
Профессиональный Документы
Культура Документы
Profile:
PAPER PRESENT BY : K.NAGA SANDHYA
R.SAILAJA
UNIVERSITY : J.N.T.U.
E-MAIL : sphity_k@yahoo.co.in
sailu_ravula40@yahoo.co.in
Abstract:
The second is authentication. Most of the The scheme proposed by Juels and Sudan
authentication mechanisms use passwords to [3] can tolerate differences between locking and
release the correct decrypting key, but these unlocking the vault. This fuzziness comes from
mechanisms are unable to provide non- the variability of biometric data. Even though the
repudiation. Such limitations can be overcome same biometric entity is analyzed during
Positive biometric matching extracts data will vary due to acquisition characteristics,
secret key from the biometric templates. The noise etc. If the keys are not exactly the same,
performance of these algorithms depends on the the decryption operation will produce useless
correspondence between query minutiae sets and random data. Fuzzy vault scheme requires
alignment of biometric data at the time of 3. IMAGE ACQUISITION
enrolment with that of verification. This is a very We use the iris image data base from
difficult problem in case of other biometric CASIA Iris image Database [CAS03a] and
templates such as fingerprint when compared to MMU Iris Database [MMU04a]. CASIA Iris
Using multiple minutiae fixed location 756 iris image which were taken in two different
sets per iris, they first find the nodes of the time frames. Each of the iris images is 8-bit gray
pseudo structures, and use these as the elements scale with resolution 320X280. MMU data base
of the set A. As many chaff points as possible contributes a total number of 450 iris images
are added to form final point set. There is no which were captured by LG Iris Access®2200.
locations in the iris, that is from origin of the The eye image is acquired,
pupil traveling in clock wise direction. converted to gray scale and its contrast is
The algorithms are implemented using enhanced using histogram equalization [4].
Matlab for its ease in image manipulation and Algorithm based on thresholding and
horizontal directions. The resulting standard angular direction are positioned into an
deviation windows are thresholded in order to appropriate square with LXL window size. L
produce a binary image. A single row or column may be of any size in binary sequence, 16, 32,
vector is obtained by eroding and dilating the ….128 bits. If the size of each row is 16, then
windows. These vectors determine limbic each row can be used to generate 16 bit words of
. The gray level value of I(x,y,h) for all Fig. 2.1-2.6 Iris textures after Opening –
pixels in the iris template is normalized as, Closing operations
I(x,y,h)=I(x,y,h) * L/H, Where the L is window
Fig 5: Nodes and End Points Union of these two sets, G ∪ C, and degree of
code is of 128 bit size and 16 bit CRC for error Let u*1, u*2, …. be the points from query
check. A total of 144 bits are used to generate a features used for polynomial reconstruction. If
polynomial of 9(144/16) coefficients with degree u*i , i=1,2,…N is equal to values of vault V, then
p(u) = c8u8 + c7u7 +…….+ c0 . is added to the list of points used. For decoding
The 144 bit code is divided into non overlapping D degree polynomial, (D+1) unique projections
16 bit segments and each segment is declared as are needed. Thus C(k,D+1) combinations are
a specific coefficient. Normally MSB bits are needed to construct a polynomial, where k<=N.
used to represent higher degree coefficients and After constructing the polynomial, the
LSB bits for lower degree coefficients. The same coefficients are mapped back to the decoded
mapping is also used during decoding. secret code. For checking errors the polynomial
Genuine set G is found by projecting the is divided with CRC primitive polynomial. A
polynomial p using N iris template features u1, u2, zero remainder means no errors. The first 128
…… Thus G ={ [u1, p(u1)], [u2, p(u2)],….}. Chaff bits in secret code leads to actual information If
set C is found by randomly assuming M points the query list overlaps with template list, then the
c1, c2, ….which do not overlap with u1, u2, ….. information transmitted is correct.
9..EXPERIMENTAL RESULTS: The 144 bits are converted to polynomial p(u) as
Data Base: CASIA iris data base, i)Image
p(u)=1804u8+16384u7+52868u6+59549u5+14256
type: Gray ii)Image Size of Database: 756
u4+3167u3+40820u2+3160u1+10280
images iii) Class Information: The images are
The indices of x and y coordinates of nodes are
from 108 eyes of 80 subjects iv)Sensor: A digital
used for projections.
optical sensor. Each image is of 320 x 280 pixel
The co-ordinates of nodes in fig (5) are
size and of 96 dpi resolution in both horizontal
fig-5(a) (13,0), (23,15),
and vertical directions with a depth of 8 bits. The
fig-5(b) (12,18),(29,5),
indices of nodes are converted to 8-bit range. Pre
fig-5(c ) (14,17),(20,18),
alignment of template and query data sets are not
fig-5(d) (16,13)
needed since both are acquired from a fixed
Using these indices, genuine points are generated
position in iris and traveling in same direction,
to which chaff points are added later to form
clockwise, for example.
vault. The ratio of chaff points and original
The secret key is generated from the iris
points is taken as 10:1 so that the combinations
template
are large in giving high security. During
0000011100001100
decoding 20 query points are selected on the
0111110101011011
average. Out of 100 iris templates, 82 are
1100111010000100
successful in unlocking the vault. Hence False
1110100010011101
Rejection Rate (FRR) of the system is 0.18 that
0011011110110000
is genuine acceptance ratio is 82% which is
0000110001011111
considerably higher than by other biometric
1001111101110100
templates.
0000110001011000
elements. Only C(20,9) = 167960 of these are []4 R.C.Gonzalez amd R.E.Woods, Digital Image Processing,
Addison-Wesley, 3rd
ed.,1992.
used to open the vault. Therefore, it takes [5] Joaquim De Mira Jr, Joceli Mayer, “Image Feature
Extraction for application of Biometric Identification of Iris –
C(220,9)/C(20,9) = 1.67 x 1010 evaluations for A Morphological Approach”. proc IEEE Int’l Symp on
Computer Graphics and Image processing, SIBGRAPI’03
an attacker to open the vault. [6] Umut Uludag, and Anil K.Jain, “ Fuzzy Finger
Print Vault”, Proc. Workshop: Biometrics: Challenges Arising
from Theory to practice, pp.13-16, 2004,W.H.Press
10. CONCLUSION
[7] S.A.Teukolsky,
Fuzzy vault, constructed for iris W.T.Vetterling, and B.P.Flannery,
Numerical
Recipes in C,2.Ed.,
templates, is superior to that of other biometric Cambridge University press,1992.
11. REFERENCES: