Iris Biometrics Flashcards

(15 cards)

1
Q

Iris Recognition Strategy

A

Find outer boundary

Find inner boundary

Obtain region

Obtain Code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Iris Recognition Problems

A

Lighting
Eyebrows
Peculiarities
Eyelids

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Iris Recog Advantages

A

Uniqueness
Stable
Non Contact

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

First Iris Recog Approach

A

Near Infra Red Images are used because they reduce reflections and reveal clear iris texture.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Detecting the Iris

A

A mathematical operator searches for circular edges in the image, to find the pupil and iris boundaries.

The function searches the image for the maximum blurred (gaussian) partial derivative over all radii r and centre positions x0,y0.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Extracting the Iris Region

A

Region extraction and polar to Cartesian coordinate transformation - uses rubber sheet model.

This standardises pupil shape despite pupil dilation, eye rotation or head movement.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Encoding the Iris Pattern

A

Local regions of an iris are projected onto ‘quadrature 2D Gabor Wavelets’.

Each wavelet produces a complex number which define a phasor in the complex plane.

The angle of the phase is quantised to one of four quadrants, each with a unique 2 bit code.

This section of the iris is given this 2 bit code and the process is repeated.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Hamming Distances for Iris Recognition

A

Hamming distance is used to measure how different two strings are by counting how many bits are different.

Can calculate iris dissimilarity as normalised masked XOR between codes.

Millions of tested irises produced binomial distribution, almost all had a HD of 0.5 (random match). Very unlikely that two different iris are considered similar.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Quantile-Quantile (Q-Q Plot)

A

Observed cumulative vs Predicted Binomial Hamming Distances. If the results follow a perfect binomial distribution, the plot should be a straight line (x=y)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Iris Recognition Performance

A

In ideal conditions (same camera, distance, lighting), matching irises will have very low hamming distance peaking at 0, all different irises should hove around 0.5 HD.

In unfavourable conditions, the spread of HDs for the matching iris will be greater (0-~0.33) but the HDs for different Iris should stay the same.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Iris recognition in twins

A

Genotype (DNA) vs Phenotype (The displayed characteristic)

Twins have the same DNA but different Irises.

Genetically identical eyes also roughly followed binomial spread of HDs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Iris Recognition Deployment

A

UK Immigration
Access control in Japan
Children’s Identification and
Location Database (CHILD)
UAE watch list
Afghan Refuges
Airports
Military
Criminal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Iris Databases

A

Chinese Academy of Sciences (CASIA 1 and 3)
Iris Challenge Evaluation ICE
University of Bath
Multimedia University
West Virginia University

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Using Texture to detect fake irises

A

Fake irises have sharper edges and smoother texture compared to the course natural texture of live ones.

Grey-level co-occurrence features measure how often different pixel intensities appear next to each other and can detect fake irises.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Iris Quality Assessment

A

Coarse Localisation of the pupil

Fourier Transform of two local regions

The mean of two local quality descriptors

SVM based decision

How well did you know this?
1
Not at all
2
3
4
5
Perfectly