A Study On Improvements for Fingerprint Identification

A Study On Improvements for Fingerprint Identification

StudentYu-Ren Lai

AdvisorTsong-Wuu Lin

A Thesis
Submitted to Department of Computer and Information Science
School of Business
Soochow University

May 2008

Taipei, Taiwan, Republic of China

K-plets CBFS
Convex-Hull

CBFS

Convex-Hull

ii


In this paper, we present a fast geometric fingerprint matching based on graph matching
principles. We use a representation called K-plets to match local neighborhood minutia, and
we use the other presentation called CBFS that is a graph traversal algorithm for consolidating
the local neighborhood matches. The proposed method is making effort to decrease the
computational complexity. Then we use convex-hull algorithm to narrow down fingerprint
minutiae for matching and reducing the matching time. In the other hand, fingerprint database
classification method is our concerned. We use fingerprints ridges and estimate which
fingerprint cluster is. We hope automated fingerprint identification system will be used in our
daily life. In our experiment, our proposed method shows not only the same recognition ratio
but also less matching time.

Keywords: Fingerprint matching; Minutiae; Verification; Identification; Breadth first search;

Convex-Hull; Database classification; Henrys classification;

iii

----------------------------------------------------------------------------------------------- i
---------------------------------------------------------------------------------------------- ii
---------------------------------------------------------------------------------------------- iii
---------------------------------------------------------------------------------------------------- iv
------------------------------------------------------------------------------------------------- v
------------------------------------------------------------------------------------------------- vi
1.
--------------------------------------------------------------------------------------- 1
1.1
------------------------------------------------------------------------------ 1
1.2
--------------------------------------------------------------------- 1
1.3
--------------------------------------------------------------------- 3
1.4
------------------------------------------------------------------------------ 3
2.
----------------------------------------------------- 4
2.1
--------------------------------------------------------------------------- 4
2.2
--------------------------------------------------------------------------- 5
2.3
------------------------------------------------------------------ 6
2.4
--------------------------------------------------------------- 7
2.4.1
-------------------------------------------------------------------------- 7
2.4.2
-------------------------------------------------------------------------- 7
2.4.3
----------------------------------------------------------------------- 8
2.4.4
-------------------------------------------------------------------------- 9
2.5
------------------------------------------------------------------ 9
2.5.1
----------------------------------------------------------------------------- 10
2.5.2
----------------------------------------------------------------------------- 11
2.6
------------------------------------------------------------------ 12
3.
--------------------------------------------------------------- 15
3.1
----------------------------------------- 15
3.2
Convex-Hull CBFS ----------------------------------- 16
3.3
GeCore-M CBFS ------------------------------------- 17
3.4
-------------------------------------------------- 18
3.5
Convex-Hull CBFS ------------------------------------------- 19
3.6
-------------------------------------------------- 22
4.
------------------------------------------------------------ 27
4.1
--------------------------------------------------------------------- 27
4.2
--------------------------------------------------------------------- 28
4.2.1
------------------------------------------------ 28
4.2.2
GeCore-M CBFS ----------------------------- 29
4.2.3
------------------------------------ 30
4.2.4
--------------------------------------- 31
4.2.5
GeCore-M CBFS ----------------------------------- 32
4.2.6
--------------------------------------------------- 33
5.
------------------------------------------------------------------------ 34
---------------------------------------------------------------------------------------------- 35
iv


1. .........................................................................................5
2. ..................................................................................13
3. .........................................................18
4. ......................................................................................19
5. .............................................................25
6. .............................................................29
7. GeCore-M CBFS .............................................30
8. ............................................................................31
9. .................................................................31
10. ..............................................................................33


1. 2007 ...........................................................2
2. ......................................................................................................3
3. , ........................................................4
4. ...............................................................4
5. Henry`s Classification ..................................................................5
6. Orientation Field .............................................................6
7. Orientation Field................................................6
8. .................................................................................7
9. .................................................................................8
10. ...........................................................................8
11. ...............................................................................9
12. Gabor Filters ........................................10
13. Bounding Box ......................................11
14. BFS ........................................................11
15. Mi Secondary Feature...................................................................12
16. k K-plet ..............................................12
17. bottom-up ...........................................................................13
18. .............................................................13
19. ........................................................................14
20. ...........................................................................14
21. Convex-Hull .....................................................................................15
22. Convex-Hull............................16
23. Convex-Hull...............................17
24. CBFS........................................................18

vi

 25. (core,delta)..................22
26. (core,delta)...................................................23
27. ......................................................23
28. ......................................................................................24
29. ...........................................................................25
30. FVC2002..................................................................................28
31. GeCore-M CBFS ..................................30
32. ............................................................................32
33. GeCore-M CBFS ..................................................................33

vii

1.

1.1

21

DNA
21

(Radio Frequency Identification, RFID)

1880
Henry Faulds Francis Galton
1902

1.2

( 1)
33.6% 25.3%
[1](Automated Fingerprint Identification Systems, AFIS)
(Minutiae
Matching)(False Accept Rate, FAR)(False Reject Rate, FRR)

(AFIS)(Fingerprint Minutiae Matching)

-1-

(Fingerprint Database Classification)

(Minutiae)

(Fingerprint Core)

Biometric Market by Technology, 2007

4.0%

2.9%

25.3%

33.6%

5.1%

4.7%

3.0%

()
3.2%

12.9%

5.4%

1. 2007
(: International Biometric Group; IEK-ITIS , 2007 )

-2-

1.3

Sharat Chikkerur CBFS K-plets

( 2)

2.

1.4

-3-

2.

2.1

(Local Matching) (Global

Matching)

( 3)(Ridge Bifurcation)
(Ridge Ending)
( 4)
(Core)(Delta)

3. ,

4.

-4-

2.2

(Henrys Classification)( 5)

Henry Faulds ( 1)

(Fingerprint Clusters)

1.

(Plain Arch)

(Tented Arch)

(Right Loop)

(Left Loop)

(Whorl)

(Central Pocket
Loop Whorl)

(Double Loop
Whorl)

(Accidental Loop
Whorl)

5. Henrys Classification

-5-

2.3

(Singular Point, SP)

(Landmark Point)
(Curvature)
( 6)

(Orientation Field)
( 6)( 7)
(Core)(Delta)
[6]

6. Orientation Field

7. Orientation Field

-6-

2.4

2.4.1

( 8)

8.

2.4.2

-7-

( 9)

9.

2.4.3

( 10)

10.

-8-

2.4.4
CBFS

( 11)

11.

2.5

(Global Matching)(Local Matching)

-9-

2.5.1

( 12)(Square Tessellation)
Gabor Filters (Filter Image)
8-bit (0 ~ 255)(Ridge Feature Map)
[2]
( 13)(Bounding Box)

(Real-Time
System)[3]

( 14)(Breadth First Search)

(Coupled Breadth First Search, CBFS)
[4](Threshold)

12. Gabor Filters

- 10 -

 13. Bounding Box

14. BFS

2.5.2

(Ridge Bifurcation and Ridge

Ending)
( 15)(Mi, N0, N1)
(Secondary Feature)[5]
( 16) k
k-plets[4]k-plets
k

- 11 -

 15. Mi Secondary Feature

16. k K-plet

2.6

(AFIS)(Error Rate)

(Henrys Classification)[7]
(Bottom-up)(Ridge Pattern)( 17)( 18)
(Finite State Machine)
- 12 -

17. bottom-up

18.

( 2)[8]

2.
plain arch
3.7%

tented arch
2.9%

left loop
33.8%

right loop
31.7%

Whorl
27.9%

( 19)(Tessellation)

- 13 -


[8]
(Absolute Magnitude)
(Directional Image) KDA/GSVD ( 20)[10]

19.

20.

- 14 -

3.

3.1

CBFS[4]
Convex-Hull
CBFS

GeCore-M CBFS

Convex-Hull Algorithm
(21)
Convex-Hull
(Core)
(Core)
Convex-Hull(CBFS)

21. Convex-Hull

- 15 -

3.2

Convex-Hull CBFS
K-plets CBFS K-plets

mi K {m1, m2 mk} CBFS

K-plets CBFS CBFS

Convex-Hull CBFS GeCore-M CBFS Convex-Hull

CBFS convex hull
convex-hull ( 22) convex-hull

convex-hull

22. Convex-Hull

- 16 -

3.3

GeCore-M CBFS

GeCore-M CBFS Convex-Hull CBFS

Convex-Hull CBFS
GeCore-M CBFS
(Geometric Center)
(Geometric
Core)(m1, m2, m3, ...)( 23)
CBFS

M GeCore-M CBFS
M

23. Convex-Hull

(Ridge Bifurcation)(Ridge
Ending) CBFS
RmBn m n
(m + n)
m n
- 17 -

 k m (k m)
n

( 24)

24. CBFS

3.4

Convex-Hull

32.27 ( 3)

3.
Method \ Result

Matching time (second)

Minutiae No.

Accuracy rate

CBFS

49.694

32.27

100.00%

Convex-Hull CBFS

19.554

21.03

100.00%

GeCore-M CBFS

14.678

19.36

99.00%

- 18 -

 Divide-M 1
( 4)
(M-1)

4.
Method \
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
minutiae number
Divide-2

Divide-3

* *

Divide-4

* * *

Divide-5

* * * *

Divide-6

* * * * *

* * * * *

* * * * *

* *

Divide-2&3

3.5

*
* *

* *

* * *

*
* *

* * *

* * * *
*

*
* *

* * *

* * * *
*

*
* *

*
* *

* * *
* * * *
*

Convex-Hull CBFS

CBFS

Convex-HullCBFS
Convex-Hull
Convex-Hull(GeCore)
(Ridge Type)
Convex-HullConvex-Hull

Algorithm: Convex-Hull Algorithm

Input
a set S = {P = (P.x, P.y)} of N points
Sort S by increasing x- and then y-coordinate.

- 19 -

Let P[ ] be the sorted array of N points.

(1) Get the points with 1st x min or max and 2nd y min or max
minmin = index of P with min x first and min y second
minmax = index of P with min x first and max y second
maxmin = index of P with max x first and min y second
maxmax = index of P with max x first and max y second
(2) Compute the lower hull stack as follows:
A. Let L_min be the lower line joining P[minmin] with P[maxmin].
B. Push P[minmin] onto the stack.
C. for i = minmax+1 to maxmin-1 (between the min and max)
{
if (P[i] is above or on L_min)
Ignore it and continue.
while (there are at least 2 points on the stack)
{
Let PT1 = the top point on the stack.
Let PT2 = the second point on the stack.
if (P[i] is strictly left of the line from PT2 to PT1)
break out of this while loop.
Pop the top point PT1 off the stack.
}
Push P[i] onto the stack.
}
D. Push P[maxmin] onto the stack.
Similarly, compute the upper hull stack.
Let W = the join of the lower and upper hulls.
- 20 -

(3) Output
W = the convex hull of S.

Convex-HullCoupled Breadth First Search

Algorithm:Coupled Breadth First Search

InputG(V, E) and H(V, E) corresponding to reference and test fingerprint imge
source node in graph G
source node in graph H
(1) Let HQ and GQ represent a FIFO queue
(2) Let M represent a set of matched vertex pairs <g, h>
(3) Initialize
For each vertex g in G(V, E) and h in H(G, E)

A.
i.

color[g] = WHITE

ii.

color[h] = WHITE

B.

color[i] = GRAY

C.

color[j] = GRAY

D.

M = M + <g[i], h[j]>

E.

ENQUEUE(GQ)

F.

ENQUEUE(HQ)

(4) While (GQ is not empty and HQ is not empty)

A.

gu = DEQUEUE(GQ)

B.

hu = DEQUEUE(HQ)

C.

Find matching neighbors of gu, hu using dynamic programming

D.

For each matching neighbor gv (of gu) and hv (of gv)

E.

If (color[gv] == WHITE and color[hv] == WHITE)

i.

M = M + <gv, hv>
- 21 -

ii.

ENQUEUE(GQ, gv)

iii.

ENQUEUE(HQ, hv)

(5) Return M

3.6

(Core)
M1, M2, M3, M4(25)

25. (core,delta)

- 22 -

(26)

0180Left-0(, 0)180360Right-1
(, 1)(27)Left-0Right-1
Class-N (N = 1, 2, 3, , 16)(
28)(5)

26. (core,delta)

27.

- 23 -

28.

- 24 -

M1M2M3M4

M2M4 ( 29)

5.
/

M1M2M3M4

Tented arch

Plain arch

Left loop

Right loop

Whorl

1100

1100

1101

1000

1001

29.

- 25 -


Step1.
Step2.
Step3.
Step4.
Step5.
Step6.
Step7.

(Tented arch)(Plain arch)

(Left loop)(Right loop)(Whorl)(Plain arch)
(Left loop)(Right loop)(Whorl)

- 26 -

4.
4.1

(AFIS) convex-hull

1. (Minutia Matching)

2. (Database Classification)

(CPU) P4 - 2.8G (RAM) 1G

(Operating System) Windows XP
professional

C++
Visual Studio2005 Matlab (MATrix LABoratory)
(Toolbox)
[13]

( 30) Handbook of Fingerprint Recognition

FVC2002 [14]

- 27 -

[15]
MatLab SFinGe
( 2)

30. FVC2002

4.2

4.2.1
FVC2002 DataBase1
Convex-Hull CBFS
Convex-Hull CBFS (

- 28 -

6) Convex-Hull CBFS
GeCore-M CBFS

M 10 M 10 20

6.
Method \ Result

Matching time (second)

Minutiae No.

Accuracy rate

CBFS

49.694(s)

32.27(20)

100.00%

Convex-Hull CBFS

19.554(s)

21.03(20)

100.00%

GeCore-M CBFS, M=10

14.678(s)

19.36(20)

99.00%

GeCore-M CBFS, M=9

12.245(s)

17.82(20)

96.00%

GeCore-M CBFS, M=8

9.809

16.11(20)

94.00%

GeCore-M CBFS, M=5

3.338(s)

10.18(20)

95.00%

4.2.2 GeCore-M CBFS

GeCore-M CBFS
GeCore-5 CBFS

CBFS CBFS
( 31)
( 7)GeCore-M CBFS

- 29 -

 7. GeCore-M CBFS
Method \ Result

Matching time
(second)

Minutiae No.

Accuracy rate

GeCore-5 CBFS

3.338

10.18

95.00%

GeCore-6 CBFS

5.023

11.26

91.00%

GeCore-7 CBFS

7.261

13.82

95.00%

GeCore-8 CBFS

9.809

16.11

94.00%

GeCore-9 CBFS

12.245

17.82

96.00%

GeCore-10 CBFS

14.678

19.36

99.00%

GeCore-11 CBFS

17.039

20.80

100.00%

GeCore-12 CBFS

19.573

22.42

100.00%

GeCore-13 CBFS

24.225

24.05

100.00%

GeCore-14 CBFS

24.728

25.33

100.00%

GeCore-15 CBFS

27.262

26.52

100.00%

31. GeCore-M CBFS

4.2.3

RmBn

(Ridge Bifurcation)(Ridge Ending)

- 30 -

 CBFS

(
8)

8.
Method \ Result

Matching time
(second)

Minutiae No.

Accuracy rate

R20B0

11.583

16.25

98.00%

R15B5

13.850

18.87

100.00%

R10B10

14.390

19.53

95.00%

R5B15

12.522

18.04

99.00%

R0B20

9.303

14.63

100.00%

4.2.4

M 20
Divide-M M
( 4)*( 9)

9.
Method \ Result

Matching time
(second)

Minutiae No.

Accuracy rate

Divide-2

8.473

15.20

97.00%

Divide-3

12.882

18.33

98.00%

Divide-4

13.932

19.19

100.00%

Divide-5

14.414

19.47

100.00%

Divide-6

14.690

19.62

97.00%

Divide-2&3

3.187

9.85

97.00%

- 31 -

4.2.5 GeCore-M CBFS

FAR(False Acceptance Rate)
FRR(False Rejected Rate)FAR
FAR FRR
FRR EER(Equal
Error Rate) FAR FRR ( 32)EER
FAR FRR
EER

32.
FVC2002 Database1-a
GeCore-M CBFS
FAR FRR
x y FRR
C = 0.005
C FAR FRR
20 0.0177%( 33)

- 32 -

 33. GeCore-M CBFS

4.2.6

( 5)

Whorl

10.

Plain Arch

59

0.000

1.000

Left loop

21

270

0.077

0.923

Right loop

19

254

0.074

0.926

Tented arch

46

0.065

0.935

Whorl

32

223

0.143

0.857

Total

75

852

0.088

0.912

- 33 -

5.

K-plet CBFS
Convex-Hull CBFS GeCore-M
CBFS CBFS

- 34 -


[1] International Biometric Group; IEK-ITIS . 2007 .
http://www.itri.org.tw/chi/services/service_index.jsp

[2] Arun Ross, Anil Jain, James Reisman. A hybrid fingerprint matcher. Pattern Recognition 36 (2003)
1661 1673

[3] Ying Jie,YuanYi fang, Zhang Renjie, Song Qifa. Fingerprint minutiae matching algorithm for real
time system. Pattern Recognition 39 (2006) 143 146

[4] Sharat Chikkerur, Alexander N. Cartwright and Venu Govindaraju. K-plet and CBFS: A Graph
based Fingerprint Representation and Matching Algorithm. Center for Unified Biometrics and
Sensors, University at Buffalo, NY, USA.

[5] Tsai-Yang Jea, Venu Govindaraju. A minutia-based partial fingerprint recognition system. Pattern
Recognition 38 (2005) 1672 1684

[6] Kenneth Nilsson, Josef Bigun. Localization of corresponding points in fingerprints by complex
filtering. School of Information Science, Computer and Electrical Engineering (IDE) Halmstad
University, P.O. Box 823, SE-301 18 Halmstad, Sweden.

[7] E.R. Henry, C.S.I..Classification And Uses of Fingerprints.

http://galton.org/galton/fingerprints/books/henry/henry-classification.pdf

[8] Jeng-Horng Chang, Kuo-Chin Fan. A new model for fingerprint classification by ridge distribution
sequences. Pattern Recognition 35 (2002) 1209 1223

[9] Manhua Liu, Xudong Jiang, Alex Chichung Kot. Efficient fingerprint search based on database
clustering. Pattern Recognition 40 (2007) 1793 1803

[10] Cheong Hee Park, Haesun Park. Fingerprint classification using fast Fourier transform and
nonlinear discriminant analysis. Pattern Recognition 38 (2005) 495 503

[11] Dan Sunday Convex Hull of a 2D Simple Polyline.

http://www.softsurfer.com/Archive/algorithm_0203/algorithm_0203.htm

[12] Markus Adhiwiyogo, Samuel Chong, Joseph Huang, Weechoon Teo Final Report 18-551
Fingerprint Recognition.
- 35 -

http://www.ece.cmu.edu/~ee551/Old_projects/projects/s99_19/finalreport.html

[13] CUBS Matlab Toolbox for Fingerprint Verification. http://www.cubs.buffalo.edu/index.shtml

[14] Handbook of fingerprint recognition. http://bias.csr.unibo.it/research/biolab/

[15] Fingerprint Verification Competition, FVC2002. http://bias.csr.unibo.it/fvc2002/

[16] Lin Wang, Mo Dai. Application of a new type of singular points in fingerprint classification. Pattern
Recognition Letters 28 (2007) 16401650

[17] Jun Lia, Wei-YunYau, HanWang. Combining singular points and orientation image information for
fingerprint classification. Pattern Recognition 41 (2008) 353 366

[18] Qinzhi Zhang, HongYan. Fingerprint classification based on extraction and analysis of
singularities and pseudo ridges. Pattern Recognition 37 (2004) 2233 2243

[19] F. Benhammadi, M.N. Amirouche, H. Hentous, K. Bey Beghdad, M. Aissani. Fingerprint matching
from minutiae texture maps. Pattern Recognition 40 (2007) 189 197

[20] Raffaele Cappelli, Alessandra Lumini, Dario Maio, Davide Maltoni. Fingerprint Image
Reconstruction from Standard Templates. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND
MACHINE INTELLIGENCE, VOL. 29, NO. 9, SEPTEMBER 2007

- 36 -