Fingerprint Classification by SOM

Wuzhili Vincent 99050056

Fingerprint Classification by SOM

Introduction Detailed Algorithms Result Analysis Demo
2

Fingerprint Classification by SOM

Introduction Why goes to this topic:
1. Explore the Industrial Usage of SOM
Fingerprint Classification Through Self Organizing Feature Maps Modified to Treat Uncertainties Proceedings of the IEEE, Vol 84, No 10, pp 1497-1512, October 1996

2. Easily start by extending from my Honors Project Fingerprint Matching

Fingerprint Classification by SOM

Introduction Topics about Fingerprint
Fingerprint Sensor Fingerprint Image Preprocessing Fingerprint Image Compression Fingerprint Classification
4

Fingerprint Matching

Fingerprint Manually Classified by Experts

Left Loop Right Loop
Delta Pore

Whorl

Arch

Tented Arch 5

Fingerprint Classification by SOM

Introduction - Automated Classification
1. Might not according to the traditional 5-class scheme 2. Any uniformly distributed categories 3. Consistently and correctly hash new fingerprints into the categories
Class1 Class2 Class3 Class4 Class n
6

How to Classify Fingerprints by SOM

Introduction - SOM
X1
w11 w13 w14 w12

1 3 2 4

X2

X3
An Input vector X = {x1,x2,x3}

2x2 SOM
7

How to Classify Fingerprints by SOM

For a well-trained SOM:
X1
w11 w13 w14 w12

1 3 2 4

Winning Node So the Input vector X is class 3 !

X2

X3
An Input vector X = {x1,x2,x3}

2x2 SOM
8

How to Classify Fingerprints by SOM

The Feature Vector of a Fingerprint X: 1. X has dimension 1 x 256: {x1,x2,.x256} 2. It is the directional Map

Extract the fingerprint region(right)

10

Extract the Effective Region

11

Locating Fingerprint Core

90% fingerprints centers are located

12

Uncertainty Value: [0, 1]

1. Directions in the good-quality region has good certainty; 2. In the Left figure: Larger certainty ->longer amplitude
13

Training Algorithm1: Original SOM

1. 2. 3. 4.

Contruct a MxM SOM, initialize all the weights Input a fingerprint vector: {x1,x2,.x256} Find the winning node dmin where: Dmin = min{||x-w||} Update the weight vectors:

W(new) =W(old) + Alpha*N*[x-w] Where N is the neighborhood function corresponding to the SOM node topology 5. Repeat 2-4 till Update is not significant

14

Training Algorithm2: Modified SOM

Note: Each fingerprint is associated with a certainty vector C 1. Contruct a MxM SOM, initialize all weights 2. Input a fingerprint vector: X{x1,x2,.x256} = C*X + (1-C)*Xavg; 3. Find the winning node dmin where: Dmin = min{||x-w||} 4. Update the weight vectors: W(new) =W(old) + Alpha*N*[x-w] * C Where N is the neighborhood function corresponding to the SOM node topology 5. Repeat 2-4 till Update is not significant
15

Experiment

Training Set (DataA) Fa Fb Fc..

Testing Set (DataB) FA FB FC

1. Fa and FA are from the same finger Fb and FB Fc and FC 2. Each fingerprint in DataA belongs to a class Class(Fa) = k , k within [1 ~ mxm]
16

Experiment

Training Set (DataA) Fa Fb Fc..

Testing Set (DataB) FA FB FC

Class(FA) = ClassX ClassX

Fa

The worst search price to find Fa is Size(ClassX) If all fingerprints are uniformly classified, Less accumulated worst search price -> Less DataA fingerprints are searched when indexing DataB

17

Results

Search% column : percentage searched in DataA Recognition% Column: percentage found for DataB
SEARCH% RECOGNIO 3x3 12.1 26.0 40.1 55.9 71.9 88.5 100 4x4 18.8 38.7 61.3 86.6 100 ON% 5x5 28.8 54.0 80.5 100 8x8 91.8 100 10x10 100

M S O M

10 20 30 40 50 60 70 80 90 100 10 20 30 40 50 60 70 80 90 100

S O M

19.6 39.6 57.3 72.9 86.3 97.5 100

16.4 38.1 60.9 84.8 100

26.4 53.1 82.5 100

40.0 100

62.7 100

18

Advanced work can be done: 1. Increase the layer of SOM to solve the crowded class with many fingerprints 2. Principle Component Analysis to reduce the feature vector from 256 to small dimensions. [40 dimensions are feasible]

19