1. Master Thesis Presentation, 14Dec07 Pair Wise Distance Histogram Based Fingerprint Minutiae Matching Algorithm Developed By: Neeraj Sharma M.S. student, Dongseo University, Pusan South Korea.

2. 2Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Contents  Introduction  Why Fingerprints: some facts  Essential Preprocessing (Feature Extraction etc.)  Abstract  Previous Work  Problem Simulation  Steps of Algorithm  Flow Chart  Local Matching  Global Matching  Results  Comparison with Reference method (Wamelen et al)  Future work  Publications

3. 3Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Introduction  Fingerprints are most useful biometric feature in our body.  Due to their durability, stability and uniqueness fingerprints are considered the best passwords.  In places of access security, high degree authentication, and restricted entry, fingerprints suggests easy and cheap solutions.

4. 4Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Biometric Modalities

5. 5Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Market Capture by different Biometric modalities

6. 6Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr

7. 7Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Different fingerprints of two fingers

8. 8Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Different Features in a Fingerprint Ridge Ending Enclosure Bifurcation Island Texture Singular points

9. 9Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Feature points extracted

10. 10Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Extraction of minutiae Image skeleton Gray scale image Minutia features Feature Extraction with CUBS-2005 algorithm ( Developed by SHARAT et al)

11. 11Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Feature points pattern of same finger

12. 12Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr High level description of algorithms in FVC (Fingerprint Verification Competition)2004

13. 13Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Abstract  Thesis proposes a novel approach for matching of minutiae points in fingerprint patterns.  The key concept used in the approach is the neighborhood properties for each of the minutiae points.  One of those characteristics is pair wise distance histogram, that remains consistent after the addition of noise and changes too.

14. 14Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Previous Work  Fingerprint Identification is quite mature area of research. Its almost impossible to describe all the previous approaches in a short time here.  The previous methods closely related to this approach and also taken in reference are by Park et al.[2005] and Wamelen et al.[2004].  Park et al. used pair wise distances first ever to match fingerprints in their approach before two years.  Wamelen et al. gave the concept of matching in two steps, Local match and Global match.

15. 15Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Problem Simulation  The input fingerprint of the same finger seems to be different while taken on different times.  There may be some translational, rotational or scaling changes, depending upon situation.  Our aim is to calculate these changes as a composite transformation parameter “T”.  The verification is done after transforming the input with these parameters, new transformed pattern should satisfy desired degree closeness with template pattern. Template Input Pattern

16. 16Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Minutiae matching-Aligning two point sets Input Template

17. 17Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Algorithm Steps  The algorithm runs in two main steps:- (i) Local matching (ii) Global matching In local matching stepwise calculations are there: 1.Calculate “k” nearest neighbors for each and every point in both patterns. 2.Calculate histogram of pair wise distances in the neighborhood of every point. 3.Find out the average histogram difference between all the possible cases. 4.Set the threshold level of average histogram difference 5.Compare the average histogram differences with the threshold level.

18. 18Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Flow Chart No Point pattern “P” stored in database pattern “Q” is taken that is to be matched with “P” Select a local point and it’s “k” nearest neighbors in patterns P Select a local point and it’s “k” nearest neighbors in patterns Q Make pair wise distance Histogram Average histogram difference < Threshold level Calculate and store transformation parameter Iteration algorithm to calculate final Transformation Parameter Start All point’s in pattern p is examined End

19. 19Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Calculation of “k” Nearest neighbors (Local match)  For the given input fingerprint pattern and the template pattern, calculate “k” nearest neighbors in order to distances.  Here k is a constant can be calculated with the formula given by wamelen et al.(2004)

20. 20Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Histogram Calculation (Local Match)  Histogram of pair wise distances in their neighborhood for each and every point is calculated here. It describe the variety of distances of particular point in its neighborhood.  Here for one point “P 1 ”; P 1 n 1, P 1 n 2, P 1 n 3, P 1 n 4, P 1 n 5 are five nearest neighbors.  Note: step size is 0.04unit, here. P1n2P1n2 P1P1 P1n1P1n1 P1n2P1n2 P1n3P1n3 P1n4P1n4 P1n5P1n5 P1n1P1n1 P1n3P1n3 P1n4P1n4 P1n5P1n5 P1n2P1n2 P1n3P1n3 P1n4P1n4 P1n5P1n5 P1n3P1n3 P1n4P1n4 P1n5P1n5 P1n4P1n4 P1n5P1n5

21. 21Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Average Histogram Difference and Threshold Setting (Local Match)  To calculate average histogram differences for two points, first subtract the their histograms. It comes in a form of matrix. To calculate average, just normalize it on corresponding scale. H 1 =[4 2 0 0 2 0 1 2 3 1] H 2 =[1 3 2 5 0 0 2 3 0 1] H 1 - H 2 =[3 -1 -2 -5 2 0 -1 -1 3 0] Average histogram diff.(ΔH avg )=(1/10)*Σ(| H 1 - H 2 | i ) Setting of threshold depends on the size of point pattern. Larger the number of points, smaller the threshold count. Every matching pair is related with a transformation function. That transformation parameter is calculated mathematically.

22. 22Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Threshold check for a 20 points pattern input 01.222.41.21.60.81.6 0.82.82 2.42.82.41.62.8 1 1.20.41.21.60.81.2 1.621.22.81.6 22 21.20.81.21.61.22.4 1.62.41.2 1.6 2.81.60.81.63 2.41.60.80.41.60.82.4221.620.81.21.61.21.621.21.6 4 1.20.81.620.41.60.81.21.61.22.41.6 1.21.6225 0.8 1.202.41.6 0.821.21.6 2 6 0.81.62.42.81.22.401.62 3.22.4 1.62.42.8 7 1.61.222.40.81.6 00.81.622.4 21.61.21.6 2.81.68 22.41.21.620.801.622.42.822.422 2.82.49 0.8 1.6 0.8 1.6 021.222221.622.4210 2.82.4 223.222202.4 1.6 1.22.422.81.611 21.60.81.2 222 20.40.81.6 2 1.22212 2.81.61.21.6 2.4 2.822.41.20 1.6 1.21.6 13 21.21.620.81.62 2 1.20.421.2221.6 14 2.81.6 2.41.62.421.62 200.820.420.815 2.81.61.221.622.41.62.4 1.621.21.60.80.420.821.216 1.6 22.41.21.6 2 2.421.62.42201.63.2217 2.42 2.81.62.4 1.62.421.621.21.62 2.81.618 2.81.6 2.8222.4221.60.81.61.22.41.60.81.219 2.81.622 2.81.62.421.62.41.6 0.8 2 2020 1234567891011121314151617181920

23. 23Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Transformation Parameter calculation  On the basis of histogram differences, we can make decision on local matching pairs. Then the transformation parameter is calculated in the following way by least squire method. Here “r” represents the corresponding Transformation Parameter.

24. 24Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Axial Representation of all Transformation Parameters after Local match  Three axes represent the translational (in both x& y direction), rotaional and scale changes.  The most dense part in graph represents the correct transformation parameters only. We need to conclude our results to that part.

25. 25Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Mean and Standard Deviation  Mean and standard deviation is calculated with the following mathematical equations.

26. 26Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Global Matching (Iteration Algorithm)  Iteration method is used to converge the result towards dense part of the graph.  For applying this method we need to calculate mean and standard deviation of the distribution.  In the graph all transformation parameters are present, calculated after local matching step.  The mean for this distribution is shown by the “triangle” in centre.

27. 27Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Result after first iteration  In this graph, black triangle is describing the mean for the distribution.  After one iteration step some of the transformation parameters, due to false local match got removed.

28. 28Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Result after second iteration  After second iteration, mean converges more towards the dense area.  Black triangle is the mean point for this distribution shown here.

29. 29Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr After third iteration  Performing iterations to converge the result, gives the distribution having least standard deviation.  Black star in this graph is the desired transformation parameter i.e. “r”

30. 30Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Verification by transforming the template with calculated parameters Template Pattern in Database Transformed version with Parameter ”r”Verification by Overlapping with original input pattern Transformed With parameter “r”

31. 31Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Matching Result for Ideal point sets  No missing point  N=60  Exactly matching

32. 32Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Random and Normalized Noise pattern (a) (b) (c) (d)

33. 33Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Results With Randomly Missing Points  Missing points =20  Total points=60  Matching points=36  Matching factor= 0.76  Noise factor=0.031

34. 34Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Matching results after missing points  Half no. of points (30) missing from pattern  Missing points =30  Total points=60  Matching points=16  Matching factor= 0.91  Noise factor=0.021

35. 35Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Definitions  t= λ *r/(2*√n)  t is distance of closeness which can be some fraction of minimum pair-wise distance  λ is called “ matching factor ”, depends on point pattern  r=maximum pair-wise distance/2  N is no. of points in the pattern  η is “ noise factor ” shows the extent of noise added to point pattern  η= added average error/mean pair-wise distance

36. Master Thesis Presentation, 14Dec07 Results for different λ and η Total pointsMatching factor(λ) Noise factor(η) Time of match(sec) Accuracy(% ) 500.5080.0241.9799 601.120.0162.5398 704.730.0193.1294 701.230.03673.1092 803.670.01984.0193 802.780.02763.8090 800.89540.04314.0089 906.010.0195.0098 902.750.0264.8495 902.220.03984.9390 0.85510.0494.8683 1000.61590.0186.06397 1002.20810.02266.0093 1003.28260.0355.8690 1001.430.0396.0088 1002.400.04356.01685

37. 37Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Performance with missing points regionally

38. 38Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Performance with missing points regionally

39. 39Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Performance with missing points regionally

40. 40Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Performance with a real fingerprint

41. 41Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Results with real and random fingerprints  The algorithm was tested on both randomly generated point pattern and real data base.  The results shows correct identification in more than 93.73% cases out of 500 tests, with randomly generated data.  For real fingerprint data, method was tested on some FVC (Fingerprint Verification Competition) 2004 samples. In most of the cases performance was found satisfactory.

42. 42Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Comparative Performances of two methods over randomly data Total points to match Missing PointsExternal noise added (%) Translation [x y] Time of match with wamelen’s method (sec.) Time of match with histogram method (sec.) 30102.41.5 2.11.361.01 40151.851.2 1.82.071.40 50202.12.1 2.02.901.88 60253.11.4 1.83.962.43 70302.31.7 1.65.013.10 80351.91.2 1.96.303.90 90403.21.3 1.17.724.83 100452.92.1 1.79.265.88 110452.62.2 1.811.107.00 120502.52.1 1.712.958.31

43. 43Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Comparison of performances

44. 44Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Advantages of the Method over others Proposed earlier  This algorithm undergoes two steps, so accuracy is good and false acceptance rate is low.  Calculation is less complex with comparison to other methods proposed yet. Here, histogram is a basis to select the local matching pairs, while in other randomize algorithms are lacking in any basic attribute to compare.  Performance is better in case with missing points from a specific region.

45. 45Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Limitations  This algorithm is dependent on accuracy of feature extraction method used for minutiae extraction.  Method performs well if the number of missing points in the pattern is less than 50% of total minutiae points.

46. 46Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Future Work  To enhance the performance of algorithm on real fingerprint data is also a big challenge.  To calculate the computational complexity in big “O” notation.  One important task is to develop an independent method for feature points extraction from fingerprints.

47. 47Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Publications Journal: 1.Sharma Neeraj, Lee Joon Jae “Fingerprint Minutiae Matching Algorithm Using Distance Histogram Of Neighborhood”, Journal of KMMS. (To be published in Dec. 2007 edition) International Conferences: 1.Sharma Neeraj, Choi Nam Seok, Lee Joon Jae, “Fingerprint Minutiae Matching Algorithm Using Distance Distribution Of Neighborhood”, MITA (2007), 21-24. 2.Lye Wei Shi, Sharma Neeraj, Choi Nam Seok, Lee Joon Jae, Lee Byung Gook, “Matching Of Point Patterns By Unit Circle”, APIS(2007), 263-266.

48. 48Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr References 1. Wamelen P. B. Van, Li Z., and Iyengar S. S.: “A fast expected time algorithm for the 2-D point pattern matching problem. Pattern Recognition” 37, Elsevier Ltd, (2004), 1699-1711. 2. Park Chul-Hyun, Smith Mark J.T., Boutin Mireille, Lee J.J.: “Fingerprint Matching Using the Distribution of the Pairwise Distance Between Minutiae”, AVBPA (2005), LNCS 3546 (2005), 693-701. 3.Sakata Koji, Maeda Takuji, Matsushita Masahito, Sasakawa Koichi, Tamaki Hishashi: “Fingerprint Authentication based on matching scores with other data”, ICB, LNCS 3832, (2006), 280-286. 4.Maltoni D., Maio D., Jain A.K., Prabhakar S. :”Handbook of Fingerprint Recognition”, Springer 2003. 5.Chang S.H., Cheng F. H., Hsu Wen-Hsing, Wu Guo-Zua: “Fast algorithm for point pattern matching: Invariant to translation, rotations and scale changes.” Pattern Recognition, Elsevier Ltd., Vol-30, No.-2, (1997), 311- 320. 6.Irani S., Raghavan P.:” Combinatorial and Experimental Result on randomized point matching algorithms”, Proceeding of the 12th Annual ACM symposium on computational geometry, Philadelphia, PA, (1996), 68-77. 7.Adjeroh D.A., Nwosu K.C.: ”Multimedia Database Management – Requirements and Issues”, IEEE Multimedia. Vol. 4, No. 3, 1997, pp 24-33.

49. 49Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr Thanks for your kind attention.

50. 50Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr

51. 51Master Thesis Presentation: 14DEC07 Presented by:neeraj@dit.dongseo.ac.kr (a) (b) (c) (d)