IRIS RECOGNITION

Prepared By: 1) Vora Aarohi (7280) 2) Parekh Vandana (82916) 3) Umrigar Madhurika (82917) 4) Naik Dhara (82919)

Guided By: Prof. Mita Paunwala

Electronics And Communication Dept., C.K. Pithwalla College Of Engineering And Technology

Types of biometric
Fingerprint Verification Hand Geometry Retinal Scanning Iris Scanning Facial Recognition Signature Verification Voice Verification

Iris

Fig 1 eye image [1]

Why Iris ??
Characterist ic Ease of use Error Incidence Accuracy Cost User Acceptance Required Security LTS Finger Print High Dryness,Di rt,Age High * Medium Hand Geometry High Hand Injury,Age High * Medium Retina Iris Face Signature Voice

Low Glasses

Medium Poor Lighting Very High * Medium

Medium Lighting,A ge,Glasses High * Medium

High Changing Signatures High * Medium

High Noise,Cold s,Weather High * High

Very High * Medium

High High

Medium Medium

High High

Very High High

Medium Medium

Medium Medium

High Medium

Application

     

Criminal identification Prison security ATM Aviation security Border crossing controls Database access

How Iris System works?

IMAGE CAPTURE

EYE LOCALISATION

IRIS SEGMENTATION

NORMALISAT ION

ACCEPT

DECISION MAKING

MATCHING

FEATURE EXTRACTION

REJECT

DATABASE

Performance Parameters

ROCReceiver Operation Characteristics EEREqual Error Rate FARFalse Acceptance Rate FRRFalse Rejection Rate DOFDegree of Freedom

Segmentation
 Segmentation is to isolate the actual iris region in a digital eye image.

Implementation Techniques: (1) Linear and circular Hough transform (2) Daugmans Integro-differential operator (3) Parabolic Hough Transform

Segmentation

Input eye image

Gamma adjusted image

Non maximum suppressed image

Hysterisis thresholding image Segmented iris and pupil from original image Segmented image

Gamma corrected image

The localised eye image from the database is passed through the Gaussian filter for smoothening purpose. Calculate the gradient of the image and its orientation and perform gamma corrections on this image for enhancement of this image.

Non maximum suppression

To get the thin fine edges of the image we perform non maxima supression. As seen from this figure, the edges of image are not sharp in gamma corrected image i.e. there are some reflections .So to get the thin sharp edges we perform non maxima supression in which we find the maximum of the pixel value around a given centre pixel and supress the pixel which is lower than it.

Hysterisis Thresholding

To get the pixel values of the points that define the most probable edges of iris, pupil and eyelid regions we perform hysterisis thresholding. In this, two threshold values are used to get the soft decision. So the number of edges to be given to Hough accumulator will be reduced.

Hough transformation

For segmenting the iris and pupil circles we calculate first the centre and radius of iris and pupil regions. Now using this radius and centre cordinates we overlay circles on iris and pupil region. Also, the line is placed on the upper and lower eyelid sections and hence get the segmented iris and pupil region.

Normalization
 Normalisation transforms the iris region so that it has fixed dimensions in order
to allow comparisons.  Techniques available: (1) Daugman rubber sheet model (2) Virtual circles

Normalization
DAUGMAN RUBBER SHEET MODEL:

Fig 2 Daugmans rubber sheet model.[1] Remaps each point within the iris region to a pair of polar coordinates (r , ) where r is on the interval [0,1] and is angle [0,2 ]. The iris region is modelled as a flexible rubber sheet anchored at the iris boundary with the pupil centre as the reference point.

Normalization
The remapping of the iris region from Cartesian coordinates to the normalised nonconcentric polar representation .

I x r , U , y r , U p I r , U
With

x r , U

! 1  r x p U  r x i U y  r , U ! 1  r y p U  r y i U
Where, I(x,y) is the iris region image, (x,y) are the original Cartesian coordinates, (r, ) are the corresponding normalised polar coordinates, and xp,yp, and xi,yi, are the coordinates of the pupil and iris boundaries along the direction.

Normalization
For normalisation of iris regions a technique based on Daugmans rubber sheet model is employed. The centre of the pupil is considered as the reference point, and radial vectors pass through the iris region, as shown in Figure . A number of data points are selected along each radial line and this is defined as the radial resolution.  The number of radial lines going around the iris region is defined as the angular resolution. Since the pupil can be non-concentric to the iris, a remapping formula is needed to rescale points depending on the angle around the circle.

Fig3. normalization [1]

Result of Normalization Results For Normalization

Segmented image

Normalised eye Normalised eye pattern pattern

Noise free normalised pattern

Normalised eye pattern

This is the normalized eye pattern of the segmented image obtained from the applying remapping formula .

d EF s EF 2  E  r1 2 r !

Noise free normalised pattern

The noisy regions inside the normalized polar array are masked with NaN values. Nan values are assigned by averaging of the polar array.

Feature Extraction
Techniques
Gabor Filters Log-Gabor Filters Haar Wavelet Zero-crossings of the 1D wavelet

 Laplacian of Gaussian Filters

Feature Extraction
Log Gabor filter over the Image domain

f 2  (lo g ( )) f0 G ( f ) ! exp( ) W 2 (lo g ( )) f0 Where,

f0 =the centre frequency. =the bandwidth of the filter.

Feature Extraction
Result of Gabor filter
Template of 40 * 480 (logical)

Fig 4 Feature Encoding [1]

Feature Extraction
Haar wavelet over the Image domain

Fig 5 Haar wavelet transform [2]

if coef(i) >=0 then coef (i)=1 if coef(i) <=0 then coef (i)=0 Result: Template of 5 * 60(logical)

Matching
For matching, the Hamming distance is chosen as a metric for recognition, since bit-wise comparisons are necessary. This comparison is done by EX-OR logic. Hamming distance

HD ! N

1
N

x j ( X O R )Y

j 1

FAR-FRR

FAR =
FRR =

number of samples that are falsely accepted Total number of samples

number of samples that are falsely re ected total number of samples of the same eye

HD Decision
Hamming Distance FAR FRR 0.1 0.2 0.3 0.4 0.42 0.45 0.46 0.47 0.48 0.49 0.5 0.6 0.7 0.8 0.9 1.0 0 0 0 0 1 53 110 260 431 518 530 531 531 531 531 531 126 126 49 11 6 2 2 1 0 0 0 0 0 0 0 0

FAR-FRR
600 500 400
FAR,FRR

FAR FRR

300 200 100 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

Ham m ing Distance

Log Gabor F ilter

HD Decision
Hamming Distance FAR FRR 0.1 0.2 0.3 0.4 0.41 0.45 0.46 0.47 0.48 0.49 0.5 0.6 0.7 0.8 0.9 1.0 0 0 0 0 1 60 110 260 431 520 530 530 531 531 531 531 126 126 49 11 4 2 2 2 0 2 0 0 0 0 0 0

FAR-FRR
600

500 FA R FRR

400 F A R ,F R R

300

200

100

0 0.1

0.2

0.3

0.4

0.5 0.6 H am m ing D is tanc e

0.7

0.8

0.9

Haar Wavelet

Database
For the matching purpose, we are using database of CASIA version 1. The Chinese Academy of Sciences - Institute of Automation (CASIA) eye image database contains 756 greyscale eye images with 108 unique eyes or classes and 7 different images of each unique eye captured in two different sessions of one month difference. Three images were acquired in first session and four in second session. Due to specialised imaging conditions using near infra-red light, features in the iris region are highly visible and there is good contrast between pupil, iris and sclera regions.

Conclusion
 Segmentation is the critical stage of iris recognition, since areas that are wrongly identified as iris regions will corrupt biometric templates resulting in very poor recognition. Normalization is a process which makes encoding process very easy by mapping circular iris and pupil pattern into a rectangular sheet.  The encoding process only requires one 1D Log-Gabor filter to provide accurate recognition while matching is the very critical stage for recognition of an iris pattern. Haar Wavelet transform is used to decrease the template size. Iris recognition is a highly reliable and accurate biometric technology.

Bibilography
[1] Libor Masek, Recognition of Human Iris Patterns for Biometric Identification, presented at University of Western Australia,2003. [2] Shin Young Lim Et Al. Efficient Iris Recognition through Improvement of Feature Vector and Classifier published in ETRI Journal, Volume 23, No. 2, June 2001 [3] Cui, J., Wang, Y., Tan, T., Ma, L. and Sun, Z., A fast and robust iris localization method based on texture segmentation, SPIE Defense and Security Symposium, vol. 5404, pp. 401-408, 2004. [4] Chinese Academy of Sciences Institute of Automation (CASIA) Iris Database http://www.sinobiometrics.com [5] A.Basit, M.Y.Javed and M.A.Anjum,A Robust method of Complete Iris Segmentation, published at International Conference on Intelligent and Advanced Systems,2007.

Bibilography
[6] John G. Daugman, "High Confidence Visual Recognition of Persons by a Test of Statistical Independence", IEEE Trans. on Pattern Analysis and Machine Intelligence, 15(11), 1993, pp. 1148-1161. [7] Wildes, R.P., "Iris Recognition: An Emerging Biometric Technology", Proc. of the IEEE, 85(9), 1997, pp.1348-1363. [8] Wildes, R.P., Asmuth, J.C. et al., "A System for Automated Iris Recognition", Proc. Of the Second IEEE Workshop on Applications of Computer Vision, 1994, pp.121-128. [9] Boles, W.W. and Boashash, B., "A Human Identification Technique, Proc. of the IEEE, 85(9), 1997, pp.1348-1363. [10]J. Daugman, High confidence visual recognition of persons by a test of statistical independence, IEEE Trans. Pattern Analysis and Machine Intelligence, Vol.15, No.11, Nov.1993, pp.1148-1161.

Bibilography
[11] R. Wildes, Iris Recognition: An Emerging Biometric Technology, Proc. of the IEEE, vol.85, 1997. Proceedings of the Third International Conference on Information Technology and Applications (ICITA05) [12]W.W. Boles and B. Boashash., A Human Identification Technique Using Images of the Iris and Wavelet Transform, IEEE Transaction on Signal Processing, Vol.46, No. 4 ,1998.