Download presentation

Presentation is loading. Please wait.

Published byMoshe Shelburne Modified over 2 years ago

1
Biomedical Person Identification via Eye Printing Masoud Alipour (malipour@ipm.ir) Ali Farhadi (farhadi@ipm.ir) Ali Farhadi (farhadi@ipm.ir) Nima Razavi (n_razavi@ce.sharif.edu) IPM – Scientific Computing Center Vision Group Institute for Studies in Theoretical Physics and Mathematics Tehran-Iran

2
Outline Introduction to human eye and Iris structure Human Eye and Iris structure and properties of Human Iris Human Eye and Iris structure and properties of Human Iris Image De-noising Application of wavelet analysis. Application of wavelet analysis. Iris Locating Creating Edge Image and Circular Hough Transform. Creating Edge Image and Circular Hough Transform. Find Ciliary and Pupillary Boundaries. Find Ciliary and Pupillary Boundaries. Feature Extraction Application of Higher Order Statistics (creating LPC Matrix). Application of Higher Order Statistics (creating LPC Matrix). Discrete Cosine Transform (DCT). Discrete Cosine Transform (DCT). Analysis of Geometric Characteristics of obtained Surface. Analysis of Geometric Characteristics of obtained Surface. Frequency Domain Analysis and FFT. Frequency Domain Analysis and FFT. Feature Classification

3
Introduction to human eye structure Eye Structure : Eye Structure : Fig1.Human Eye

4
Human Iris Structure Anterior layer of Human Iris : 1. Pigment frill 2. Pupillary area 3. Collarette 4. Ciliary area 5. Crypts 6. Pigment spot

5
Biometric Properties Of Human Iris features 1. crypts.1. crypts. 2. pigment spot.2. pigment spot. 3. radial and concentric furrows.3. radial and concentric furrows. 4. collarette.4. collarette. 5. pigment frill.5. pigment frill. Concentric furrows Collarette Radial furrows

6
Outline Introduction to human eye and Iris structure Human Eye and Iris structure and properties of Human Iris Human Eye and Iris structure and properties of Human Iris Image De-noising Application of wavelet analysis. Application of wavelet analysis. Iris Locating Creating Edge Image and Circular Hough Transform. Creating Edge Image and Circular Hough Transform. Find Ciliary and Pupillary Boundaries. Find Ciliary and Pupillary Boundaries. Feature Extraction Application of Higher Order Statistics. Application of Higher Order Statistics. Discrete Cosine Transform (DCT). Discrete Cosine Transform (DCT). Analysis of Geometric Characteristics of obtained Surface. Analysis of Geometric Characteristics of obtained Surface. Frequency Domain Analysis and FFT. Frequency Domain Analysis and FFT. Feature Classification

7
Image De-noising Application of Daubechies wavelet to remove 1.High frequency noise introduced by camera 2.Reflection noise

8
Outline Introduction to human eye and Iris structure Human Eye and Iris structure and properties of Human Iris Human Eye and Iris structure and properties of Human Iris Image De-noising Application of wavelet analysis. Application of wavelet analysis. Iris Locating Creating Edge Image and Circular Hough Transform. Creating Edge Image and Circular Hough Transform. Find Ciliary and Pupillary Boundaries. Find Ciliary and Pupillary Boundaries. Feature Extraction Application of Higher Order Statistics. Application of Higher Order Statistics. Discrete Cosine Transform (DCT). Discrete Cosine Transform (DCT). Analysis of Geometric Characteristics of obtained Surface. Analysis of Geometric Characteristics of obtained Surface. Frequency Domain Analysis and FFT. Frequency Domain Analysis and FFT. Feature Classification Neural Networks for classification Neural Networks for classification

9
Iris Locating Iris Locating is achieved by : Creating Edge-Image Creating Edge-Image Circular Hough Transform of Edge Image. Circular Hough Transform of Edge Image. Locating Ciliary Boundary. Locating Ciliary Boundary. Locating Pupillary Boundary. Locating Pupillary Boundary. Creating Iris Image ( Polar indices ). Creating Iris Image ( Polar indices ).

10
Circular Hough Transform 1. Description of circular Hough space 1. Description of circular Hough space 2. Normalizing the Hough Space 2. Normalizing the Hough Space 3. Locating center and radius of the cilirary boundary. 3. Locating center and radius of the cilirary boundary. y r2 r1 (x,y)rx

11
Iris Locating Results : Results : Fig 1. Fig 2. Original Image Edge-Image

12
Iris Locating Fig 3. Maximum point Fig 4. Circular Hough Space (one layer) (one layer) Iris Image

13
Outline Introduction to human eye and Iris structure Human Eye and Iris structure and properties of Human Iris Human Eye and Iris structure and properties of Human Iris Image De-noising Application of wavelet analysis. Application of wavelet analysis. Iris Locating Creating Edge Image and Circular Hough Transform. Creating Edge Image and Circular Hough Transform. Find Ciliary and Pupillary Boundaries. Find Ciliary and Pupillary Boundaries. Feature Extraction Application of Higher Order Statistics. Application of Higher Order Statistics. Discrete Cosine Transform (DCT). Discrete Cosine Transform (DCT). Analysis of Geometric Characteristics of obtained Surface. Analysis of Geometric Characteristics of obtained Surface. Frequency Domain Analysis and FFT. Frequency Domain Analysis and FFT. Feature Classification

14
Feature Extraction -Application of Higher Order Statistics. -Application of Higher Order Statistics. -Discrete Cosine Transform (DCT) Analysis. -Discrete Cosine Transform (DCT) Analysis. -Analysis of Geometric Characteristics of Surface -Analysis of Geometric Characteristics of Surface of LPC coefficients. of LPC coefficients. -Frequency Domain Analysis and FFT. -Frequency Domain Analysis and FFT. - Circular DCT - Circular DCT

15
Higher Order Statistics Creating Sectors 1.Each sector is defined by 4 parameters (r min,r max,th min,th max ) 2.We create sectors from r min to r max and moving counter-clockwise from th min to th max with large overlaps. overlapping Sectors overlapping Sectors

16
Higher Order Statistics Definition of LPC Coefficients zoom Neighborhood Configuration

17
Higher Order Statistics Definition of LPC Coefficients Linear Predictive Coding Linear Predictive Coding S = Sector Index N N = neighborhood configuration (o N ) X(p) = brightness of pixel p (value of the pixel)

19
DCT Analysis 1.From the average of the nearest four horizontal and vertical neighbors we obtain a matrix A. For ease of references we call this matrix as PLPC. 2.Defining a square w * w window W on the PLPC Matrix. 3. Computing DCT Coef of each window. 4.As window W moves along a row, the curve C is obtained by calculating ||Differences of DCT coefficients of two contiguous windows || 2 ||Differences of DCT coefficients of two contiguous windows || 2 5.Hence for each row we obtain a curve. Averaging these curves over different rows, we obtain a curve which we call FC. 6.Curve FC is the first part of our feature vector.

20
Feature Vector A1A2A3A4A5A6A7A8A9BCDEFG DCT of PLPC ?

21
Geometric Characteristics of PLPC Surface Each sector is identified by Each sector is identified by initial ρ and θ. initial ρ and θ. Each ( ρ,θ ) together with corresponding entry of PLPC matrix give a surface (PLPC surface). Each ( ρ,θ ) together with corresponding entry of PLPC matrix give a surface (PLPC surface).

22
PLPC Surface ZsZsZsZs Z s’

23
Geometric Characteristics of PLPC Surface 1.Trinagulation of PLPC Surface. 1.Trinagulation of PLPC Surface. 2. Mapping gravity center of each triangle on plate z=0 2. Mapping gravity center of each triangle on plate z=0 3. Centroid Matrix 3. Centroid Matrix 4. Statistical invariants of Centroid matrix are next elements of the feature vector. 4. Statistical invariants of Centroid matrix are next elements of the feature vector.

24
Triangulation

25
6333 31542364 Centroid Matrix

26
Statistical invariants of Centroid matrix We make use of Mean, Variance and Kurtosis of Centroid Matrix. We make use of Mean, Variance and Kurtosis of Centroid Matrix. These three invariants are next 3 elements of the feature vector. These three invariants are next 3 elements of the feature vector. Recall that Kurtosis(X) =E[X 4 ] – 3*E[X 2 ] 2.

27
Feature Vector A1A2A3A4A5A6A7A8A9BCDEFG DCT of PLPC Mean of Centroid Matrix Variance of Centroid Matrix Kurtosis of Centroid Matrix ?

28
Frequency Domain Analysis and FFT 1.Let D be the differences of consecutive columns in matrix of LPC Coef. 2.These quantities can be regarded as function on set of 20 points. 3.Calculate FFT of this function. Thus transferring data to Frequency Domain. (resulted in C 20 ) 4.Make use of absolute values to transfer data to R 20. 5.Projecting the data to 3D subspace. 6.Application of Geometric Properties of 3d obtained scatter plots

29
Geometric Properties of 3D scatter plots The next member of The feature vector is the volume of the convex closure of the projected data. The next member of The feature vector is the volume of the convex closure of the projected data.

30
Feature Vector A1A2A3A4A5A6A7A8A9BCDEFG DCT of PLPC Mean of Centroid Matrix Variance of Centroid Matrix Kurtosis of Centroid Matrix Volume of the convex closure of fft coef ?

31
Circular DCT 1.Scanning the Iris Layer by Layer( Each Layer is a circle ) and obtain Vector C. 2.Calculating DCT coefficients of C. 3.By merging results of all layers, we obtain a Matrix. 4.Kurtosis of this matrix is the next element of the Feature Vector.

32
Feature Vector A1A2A3A4A5A6A7A8A9BCDEFG DCT of PLPC Mean of Centroid Matrix Variance of Centroid Matrix Kurtosis of Centroid Matrix Volume of the convex closure of fft coef Kurtosis of circular DCT

33
Analysis of geometric characteristics of CDCT 1.Applying Circular DCT, we obtain a high dimensional data set. 2.Make use of projection to reduce dimensionality of the data to 1D data (by average) 1D data (by average) 3. Triangulation of PLPC Surface. 4.Mapping mass center of each triangle on plate z=0 5.Centroid Matrix 6.Kurtosis of centroid matrix is the last element of the feature vector.

34
Feature Vector A1A2A3A4A5A6A7A8A9BCDEFG DCT of PLPC Mean of Centroid Matrix Variance of Centroid Matrix Kurtosis of Centroid Matrix Volume of the convex closure of fft coef Kurtosis of circular DCT Kurtosis of Centroid Matrix of circular DCT

35
Feature Classification Feature vector has been tested on a small data base of about 35 irises. Feature vector has been tested on a small data base of about 35 irises. So far has produced no type 1 or type 2 errors. So far has produced no type 1 or type 2 errors. Remains to be tested on a large data base. Remains to be tested on a large data base.

36
Questions? Questions?

Similar presentations

OK

1/20 Obtaining Shape from Scanning Electron Microscope Using Hopfield Neural Network Yuji Iwahori 1, Haruki Kawanaka 1, Shinji Fukui 2 and Kenji Funahashi.

1/20 Obtaining Shape from Scanning Electron Microscope Using Hopfield Neural Network Yuji Iwahori 1, Haruki Kawanaka 1, Shinji Fukui 2 and Kenji Funahashi.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Fun ppt on biomes of the world Hrm ppt on recruitment and selection Ppt on fibonacci numbers definition Ppt on astronomy and astrophysics review Ppt on cse related topics about computer Ppt on save water free download Ppt on water scarcity in south Ppt on alternative sources of energy Ppt on leadership skills for students Ppt on solar power system