You are on page 1of 33

IRIS IRIS Recognition and Identification System

Final Year Project Presentation

External Examiner

Mr. Deepak Rauniyar Karmachari Sanchaykosh

Project Supervisors

Mr. Ananda Sharma Mr. Jitendra K. Manandhar

Internal Examiner

Mr. Bishesh Khanal Institute Of Engineering

Members Ruchin Singh Sanjana Bajracharya Saurab Rajkarnikar

INTRODUCTION: Biometric System

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

Uniquely identify people according to physical or behavioral traits

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

INTRODUCTION: Biometric System

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

Uniquely identify people according to physical or behavioral traits

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

INTRODUCTION: Biometric System

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

Uniquely identify people according to physical or behavioral traits

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

Biometric System Iris Speech Face Fingerprint

OVERVIEW: Iris Recognition

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

Iris Circular colored part Contains unique pattern Why Iris Recognition? Externally visible Unique to all individual Remains same throughout the lifetime

OVERVIEW: Iris Recognition

OVERVIEW: Iris Recognition  How? 1. Acquisition 2. Segmentation 3. Feature Encoding 4. Matching 6

How? 1. Acquisition

OVERVIEW: Iris Recognition  How? 1. Acquisition 2. Segmentation 3. Feature Encoding 4. Matching 6
  • 2. Segmentation

  • 3. Feature Encoding

  • 4. Matching

OVERVIEW: IRIS

OVERVIEW: IRIS IRIS Recognition and Identification System 7

IRIS Recognition and Identification System

OVERVIEW: IRIS IRIS Recognition and Identification System 7
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

SYSTEM OVERVIEW: Acquisition    Good and clear image CASIA(Institute of Automation, Chinese Academy of
SYSTEM OVERVIEW: Acquisition    Good and clear image CASIA(Institute of Automation, Chinese Academy of

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

SYSTEM OVERVIEW: Segmentation  Isolation of circular iris region 1. Gaussian Smoothing 2. Edge map generation
SYSTEM OVERVIEW: Segmentation  Isolation of circular iris region 1. Gaussian Smoothing 2. Edge map generation

SEGMENTATION: Gaussian Smoothing

Removes noise Low pass filter

Average weight more towards the value of the central pixels

SEGMENTATION: Gaussian Smoothing   Removes noise Low pass filter  Average weight more towards the
SEGMENTATION: Gaussian Smoothing   Removes noise Low pass filter  Average weight more towards the
SEGMENTATION: Gaussian Smoothing   Removes noise Low pass filter  Average weight more towards the

10

SEGMENTATION: EdgeMap

Local Maximum

SEGMENTATION: EdgeMap  Local Maximum 11
SEGMENTATION: EdgeMap  Local Maximum 11
SEGMENTATION: EdgeMap  Local Maximum 11

SEGMENTATION: Sobel Operator

Two Pass operator

SEGMENTATION: Sobel Operator  Two Pass operator 12
SEGMENTATION: Sobel Operator  Two Pass operator 12
SEGMENTATION: Sobel Operator  Two Pass operator 12
SEGMENTATION: Sobel Operator  Two Pass operator 12
SEGMENTATION: Sobel Operator  Two Pass operator 12
SEGMENTATION: Sobel Operator  Two Pass operator 12

SEGMENTATION: Non-max Suppression

SEGMENTATION: Non-max Suppression  Suppresses minimizing false edges  Locates highest points in edge magnitude data

Suppresses minimizing false edges

Locates highest points in edge magnitude data

SEGMENTATION: Non-max Suppression  Suppresses minimizing false edges  Locates highest points in edge magnitude data
SEGMENTATION: Non-max Suppression  Suppresses minimizing false edges  Locates highest points in edge magnitude data

SEGMENTATION: Hysteresis Threshold

SEGMENTATION: Hysteresis Threshold     Lower and higher threshold I(x,y) > t edge neighborhood

Lower and higher threshold I(x,y) > t h edge neighborhood pixels value I(x,y) > t l weak edge t h = .2 and t l =.19 using trial and error

SEGMENTATION: Hysteresis Threshold     Lower and higher threshold I(x,y) > t edge neighborhood
SEGMENTATION: Hysteresis Threshold     Lower and higher threshold I(x,y) > t edge neighborhood
SEGMENTATION: Circular Hough Transform    Locates circles in edge image Returns the radius and

SEGMENTATION: Circular Hough Transform

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

SEGMENTATION: Circular Hough Transform    Locates circles in edge image Returns the radius and
SEGMENTATION: Circular Hough Transform 16

SEGMENTATION: Circular Hough Transform

SEGMENTATION: Circular Hough Transform 16
SEGMENTATION: Circular Hough Transform 16
SEGMENTATION: Circular Hough Transform 16

16

SEGMENTATION: Circular Hough Transform    Maximum and Minimum radius of circle are pre-determined Range

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

SEGMENTATION: Circular Hough Transform    Maximum and Minimum radius of circle are pre-determined Range

SEGMENTATION: Eyelid Removal

SEGMENTATION: Eyelid Removal   Line detector algorithm detects horizontal eyelids Linear Hough Transform 18
 

Line detector algorithm detects horizontal eyelids Linear Hough Transform

SEGMENTATION: Eyelash Removal

SEGMENTATION: Eyelash Removal   Darker than background Removed using thresholding of 100 19
 

Darker than background Removed using thresholding of 100

SYSTEM OVERVIEW: Normalisation

SYSTEM OVERVIEW: Normalisation  Unwrapping the segmented iris into constant rectangular dimension  Takes into account

Unwrapping the segmented iris into constant rectangular dimension

Takes into account pupil dilation and zoom factors

SYSTEM OVERVIEW: Normalisation  Unwrapping the segmented iris into constant rectangular dimension  Takes into account
SYSTEM OVERVIEW: Normalisation  Unwrapping the segmented iris into constant rectangular dimension  Takes into account

NORMALISATION: Rubber Sheet Model

NORMALISATION: Rubber Sheet Model  Converts to polar co- ordinates  radial resolution = 40 angular

Converts to polar co- ordinates

radial resolution = 40 angular resolution = 240

Dynamic unwrapping for each point Polar noise mask

NORMALISATION: Rubber Sheet Model  Converts to polar co- ordinates  radial resolution = 40 angular

NORMALISATION: Rubber Sheet Model

NORMALISATION: Rubber Sheet Model Normalised Polar Image Polar Noise Mask 22
NORMALISATION: Rubber Sheet Model Normalised Polar Image Polar Noise Mask 22

Normalised Polar Image

NORMALISATION: Rubber Sheet Model Normalised Polar Image Polar Noise Mask 22

Polar Noise Mask

SYSTEM OVERVIEW: Encoding

Converts normalised iris into bit-wise template

Discriminating features are encoded

SYSTEM OVERVIEW: Encoding  Converts normalised iris into bit-wise template  Discriminating features are encoded 23
SYSTEM OVERVIEW: Encoding  Converts normalised iris into bit-wise template  Discriminating features are encoded 23

ENCODING: Log Gabor Filter

ENCODING: Log Gabor Filter    Only phase information are encoded Convolving with 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

SYSTEM OVERVIEW: Matching

Measure of similarity or dissimilarity between two iris templates

SYSTEM OVERVIEW: Matching  Measure of similarity or dissimilarity between two iris templates 25
SYSTEM OVERVIEW: Matching  Measure of similarity or dissimilarity between two iris templates 25

MATCHING: Hamming Distance

MATCHING: Hamming Distance   Number of bits that do not correspond divided by total bits
 

Number of bits that do not correspond divided by total bits

Modified Hamming Distance to account for noise

MATCHING: Hamming Distance   Number of bits that do not correspond divided by total bits

MATCHING: Hamming Distance

MATCHING: Hamming Distance   Shifting done to incorporate rotational inconsistency 1 shift = 1.5 degree,
 

Shifting done to incorporate rotational inconsistency

1 shift = 1.5 degree, for 240 degrees angular resolution

RESULTS

RESULTS    FAR  accepting the wrong match FRR  rejecting the correct match
  

FAR

accepting the wrong match

FRR

rejecting the correct match

Threshold Hamming Distance = 0.36

FAR = 11.28% FRR = 3.09%

RESULTS : Snapshots

RESULTS : Snapshots Authenticated User 29
RESULTS : Snapshots Authenticated User 29

Authenticated User

RESULTS : Snapshots

RESULTS : Snapshots Unauthenticated User 30
RESULTS : Snapshots Unauthenticated User 30

Unauthenticated User

FUTURE ENHANCEMENT

FUTURE ENHANCEMENT  Database design to enroll vast eye images   Real time design Both
FUTURE ENHANCEMENT  Database design to enroll vast eye images   Real time design Both

Database design to enroll vast eye images

Real time design Both iris template

AREAS OF APPLICATION

AREAS OF APPLICATION        Airport Immigration Office Banks Forensics Organisation
      

Airport Immigration Office Banks Forensics Organisation Secure Financial Transactions

Driving License, other personal certificates

Thank You 33

Thank You

Thank You 33