P. 1
IRIS IRIS Recognition and Identification System Final

IRIS IRIS Recognition and Identification System Final

|Views: 87|Likes:
Published by Saurab Rajkarnikar

More info:

Published by: Saurab Rajkarnikar on Mar 17, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

03/15/2013

pdf

text

original

IRIS IRIS Recognition and Identification System Final Year Project Presentation

External Examiner
Mr. Deepak Rauniyar Karmachari Sanchaykosh

Internal Examiner
Mr. Bishesh Khanal Institute Of Engineering

Project Supervisors
Mr. Ananda Sharma Mr. Jitendra K. Manandhar

Members Ruchin Singh Sanjana Bajracharya Saurab Rajkarnikar

INTRODUCTION: Biometric System

Uniquely identify people according to physical or behavioral traits

2

INTRODUCTION: Biometric System

Uniquely identify people according to physical or behavioral traits

3

INTRODUCTION: Biometric System

Uniquely identify people according to physical or behavioral traits Biometric System
   

Iris Speech Face Fingerprint

4

OVERVIEW: Iris Recognition

Iris Circular colored part  Contains unique pattern Why Iris Recognition?
   

Externally visible Unique to all individual Remains same throughout the lifetime
5

OVERVIEW: Iris Recognition

How? 1. Acquisition 2. Segmentation 3. Feature Encoding 4. Matching

6

OVERVIEW: IRIS

IRIS Recognition and Identification System
7

SYSTEM OVERVIEW: Acquisition

Good and clear image CASIA(Institute of Automation, Chinese Academy of Sciences) database Specifically for iris recognition

8

SYSTEM OVERVIEW: Segmentation

Isolation of circular iris region

1. Gaussian Smoothing 2. Edge map generation 3. Non-max suppression 4. Hysteresis Thresholding 5. Circular Hough Transform

9

SEGMENTATION: Gaussian Smoothing

Removes noise Low pass filter Average weight more towards the value of the central pixels

10

SEGMENTATION: EdgeMap

Local Maximum

11

SEGMENTATION: Sobel Operator

Two Pass operator

12

SEGMENTATION: Non-max Suppression

Suppresses minimizing false edges Locates highest points in edge magnitude data

13

SEGMENTATION: Hysteresis Threshold

Lower and higher threshold I(x,y) > th edge neighborhood pixels value I(x,y) > tl weak edge

th= .2 and tl=.19 using trial and error

14

SEGMENTATION: Circular Hough Transform

Locates circles in edge image Returns the radius and center coordinates computationally intensive

15

SEGMENTATION: Circular Hough Transform

16

SEGMENTATION: Circular Hough Transform

Maximum and Minimum radius of circle are pre-determined Range kept to minimal pupil[27,58] and iris[110,115] rather than [27,115] First iris is determined and then pupil

17

SEGMENTATION: Eyelid Removal

Line detector algorithm detects horizontal eyelids Linear Hough Transform

18

SEGMENTATION: Eyelash Removal

Darker than background Removed using thresholding of 100

19

SYSTEM OVERVIEW: Normalisation

Unwrapping the segmented iris into constant rectangular dimension Takes into account pupil dilation and zoom factors

20

NORMALISATION: Rubber Sheet Model

Converts to polar coordinates radial resolution = 40 angular resolution = 240 Dynamic unwrapping for each point Polar noise mask

21

NORMALISATION: Rubber Sheet Model

Normalised Polar Image

Polar Noise Mask
22

SYSTEM OVERVIEW: Encoding

Converts normalised iris into bit-wise template Discriminating features are encoded

23

ENCODING: Log Gabor Filter

Only phase information are encoded Convolving with log-Gabor Filter Each pixel has 0 and 1 bits associated with them corresponding to sign bit

24

SYSTEM OVERVIEW: Matching

Measure of similarity or dissimilarity between two iris templates

25

MATCHING: Hamming Distance

Number of bits that do not correspond divided by total bits Modified Hamming Distance to account for noise

26

MATCHING: Hamming Distance

Shifting done to incorporate rotational inconsistency 1 shift = 1.5 degree, for 240 degrees angular resolution

27

RESULTS

FAR

accepting the wrong match rejecting the correct match

FRR

Threshold Hamming Distance = 0.36 FAR = 11.28% FRR = 3.09%
28

RESULTS : Snapshots

Authenticated User
29

RESULTS : Snapshots

Unauthenticated User
30

FUTURE ENHANCEMENT

Database design to enroll vast eye images Real time design Both iris template

31

AREAS OF APPLICATION

Airport Immigration Office Banks Forensics Organisation Secure Financial Transactions Driving License, other personal certificates
32

Thank You

33

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->