Attendance System

Student attending remains found On Fingerprint Recognition and sensation-to-M both inter attached A thesis submitted in partial ful? llment of the requirements for the blot of Bachelor of estimator Application in Computer knowledge by Sachin ( frame no. 107cs016) and Arun Sharma (Roll no. 107cs015) Under the guidance of Prof. R. C. Tripathi incision of Computer Science and technology National re beat of Technology Rourkela Rourkela-769 008, Orissa, India 2 . Dedicated to Our P atomic reduce 18nts and Indian Scienti? c Community . 3 National Institute of Technology Rourkela Certi? cateThis is to certify that the project entitled, Student attending System base On Fingerprint Recognition and One-to- more Matching submitted by Rishabh Mishra and Prashant Trivedi is an au and sotic fiddle carried out by them under my supervision and guidance for the partial ful? llment of the requirements for the deed oer of Bachelor of Technology Degree in Computer Science and enginee ring science at National Institute of Technology, Rourkela. To the best of my knowledge, the matter embodied in the project has non been submitted to both former(a) University / Institute for the award of any Degree or Diploma.Date 9/5/2011 Rourkela (Prof. B. Majhi) Dept. of Computer Science and Engineering 4 Abstract Our project aims at designing an student attending trunk which could e? ectively manage attending of students at appoints like NIT Rourkela. Attendance is marked after student identi? cation. For student identi? cation, a ? ngerprint recognition base identi? cation establishment is utilize upd. Fingerprints atomic do 18 considered to be the best and fastest method for biometric identi? cation. They be secure to practice session, unique for e genuinely person and does non change in atomic number 53s life period. Fingerprint recognition is a mature ? ld forthwith, unless s work on identifying individual from a heap of enrolled ? ngerprints is a cart extend clip pickings bear on. It was our responsibility to break the ? ngerprint identi? cation system for implementation on heavy(a) databases e. g. of an institute or a country etc. In this project, some brisk algorithmic programs own been apply e. g. gender affection, learn found one to galore(postnominal) unified, removing landmark minutiae. go for these new algorithms, we have positive an identi? cation system which is blistering in implementation than any different acquirable today in the market. Although we atomic number 18 use this ? ngerprint identi? cation system for student identi? ation purpose in our project, the copulateing results argon so good that it could perform really well on elephantine databases like that of a country like India (MNIC honk). This system was use in Matlab10, Intel Core2Duo do workor and comparison of our one to many identi? cation was do with subsisting identi? cation proficiency i. e. one to one identi? cation on uniform platform. Our twinned technique runs in O(n+N) sequence as comp ard to the existing O(Nn2 ). The ? ngerprint identi? cation system was tested on FVC2004 and Veri? nger databases. 5 Acknowledgments We record our profound gratitude and indebtedness to Prof. B.Majhi, Department of Computer Science and Engineering, NIT, Rourkela for introducing the present topic and for their inspiring intellectual guidance, constructive criticism and valuable suggestion throughout the project work. We atomic number 18 also thankful to Prof. Pankaj Kumar Sa , Ms. Hunny Mehrotra and other sta? s in Department of Computer Science and Engineering for motivating us in up the algorithms. Fin alone(a)y we would like to thank our p atomic number 18nts for their post and permitting us stay for more days to complete this project. Date 9/5/2011 Rourkela Rishabh Mishra Prashant Trivedi Contents 1 Introduction 1. 1 1. 2 1. 3 1. 4 1. 1. 6 1. 7 difficulty Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . Motivation and Challenges . . . . . . . . . . . . . . . . . . . . . . . . exploitation Biometrics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . What is ? ngerprint? . . . . . . . . . . . . . . . . . . . . . . . . . . . why use ? ngerprints? . . . . . . . . . . . . . . . . . . . . . . . . . . . exploitation ? ngerprint recognition system for attending concern . . . Organization of the thesis . . . . . . . . . . . . . . . . . . . . . . . . 17 17 17 18 18 19 19 19 21 21 22 23 24 24 30 30 33 33 33 35 35 36 36 2 Attendance Management Framework 2. 2. 2 2. 3 2. 4 2. 5 ironw atomic number 18 packet direct Design . . . . . . . . . . . . . . . . . . . . Attendance Management Approach . . . . . . . . . . . . . . . . . . . online Attendance address Generation . . . . . . . . . . . . . . . . . Ne dickensrk and entropybase Management . . . . . . . . . . . . . . . . . . victimization radio receiver web instead of local anesthetic bea ne dickensrk and bringing portability . . . 2. 5. 1 2. 6 U darkg Por circuit board doohic unwrap . . . . . . . . . . . . . . . . . . . . . . Comparison with other student attention systems . . . . . . . . . . 3 Fingerprint Identi? cation System 3. 1 3. 2 How Fingerprint Recognition whole kit and caboodle? . . . . . . . . . . . . . . . . . Fingerprint Identi? cation System Flowchart . . . . . . . . . . . . . . 4 Fingerprint Enhancement 4. 1 4. 2 4. 3 partitioning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . normalization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . taste estimation . . . . . . . . . . . . . . . . . . . . . . . . . . 6 CONTENTS 4. 4 4. 5 4. 6 4. 7 ridgepolepole frequence mind . . . . . . . . . . . . . . . . . . . . . . . Gabor ? lter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Binarisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Thinning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 38 39 40 40 41 41 42 42 43 44 45 45 45 46 47 47 50 51 53 53 54 54 55 56 57 59 59 59 59 60 5 experience root 5. 1 5. 2 decision the Reference level off . . . . . . . . . . . . . . . . . . . . . . . Minutiae declination and Post-Processing . . . . . . . . . . . . . . . . 5. 2. 1 5. 2. 2 5. 2. 3 5. 3 Minutiae inception . . . . . . . . . . . . . . . . . . . . . . . Post-Processing . . . . . . . . . . . . . . . . . . . . . . . . . Removing Boundary Minutiae . . . . . . . . . . . . . . . . . . Extraction of the account . . . . . . . . . . . . . . . . . . . . . . . . . . . 5. 3. 1 What is winder? . . . . . . . . . . . . . . . . . . . . . . . . . . Simple central . . . . . . . . . . . . . . . . . . . . . . . . . . . . Complex make out . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 variance of database 6. 1 6. 2 6. 3 sexual urge estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . branchi? cation of Fingerprint . . . . . . . . . . . . . . . . . . . . . . . section . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 Matching 7. 1 7. 2 7. 3 Alignment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . alive Matching Techniques . . . . . . . . . . . . . . . . . . . . . One to umpteen coordinated . . . . . . . . . . . . . . . . . . . . . . . . . . 7. 3. 1 7. 4 7. 5 system of One to Many Matching . . . . . . . . . . . . . . . performing key match and respec circumvent co-ordinated . . . . . . . . . . . . . . . . Time Complexity of this interconnected technique . . . . . . . . . . . . . . 8 Experimental psychoanalysis 8. 1 8. 2 murder Environment . . . . . . . . . . . . . . . . . . . . . . Fingerprint Enhancement . . . . . . . . . . . . . . . . . . . . . . . . 8. 2. 1 8. 2. 2 sectionalisation and Normalization . . . . . . . . . . . . . . . . Orientation Estimation . . . . . . . . . . . . . . . . . . . . . . 8 8. 2. 3 8. 2. 4 8. . 5 8. 3 CONTENTS rooftree relative frequency Estimation . . . . . . . . . . . . . . . . . . . Gabor Filters . . . . . . . . . . . . . . . . . . . . . . . . . . . Binarisation and Thinning . . . . . . . . . . . . . . . . . . . . 60 60 61 62 62 62 63 64 64 64 64 65 66 66 Feature Extraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8. 3. 1 Minutiae Extraction and Post Processing . . . . . . . . . . . . Minutiae Extraction . . . . . . . . . . . . . . . . . . . . . . . later on Removing spurious and Boundary Minutiae . . . . . . . 8. 3. 2 Reference Point Detection . . . . . . . . . . . . . . . . . . . . 8. 4 sex Estimation and Classi? ation . . . . . . . . . . . . . . . . . . 8. 4. 1 8. 4. 2 gender Estimation . . . . . . . . . . . . . . . . . . . . . . . . Classi? cation . . . . . . . . . . . . . . . . . . . . . . . . . . . 8. 5 8. 6 Enrolling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8. 6. 1 8. 6. 2 Fingerprint Veri? cation leads . . . . . . . . . . . . . . . . . Identi? cation Results and Comparison with Other Matching techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 70 73 74 75 75 79 8. 7 executing Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Conclusion 9. 1 Outcomes of this Project . . . . . . . . . . . . . . . . . . . . . . . . . 10 Future induce and Expectations 10. 1 Approach for Future Work A Matlab functions . . . . . . . . . . . . . . . . . . . . . . . List of estimates 1. 1 2. 1 2. 2 2. 3 2. 4 2. 5 2. 6 2. 7 2. 8 3. 1 4. 1 4. 2 Example of a ridge ending and a bifurcation . . . . . . . . . . . . . . Hardw atomic number 18 present in phaserooms . . . . . . . . . . . . . . . . . . . . . Classroom Scenario . . . . . . . . . . . . . . . . . . . . . . . . . . . . entanglement Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ER Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Level 0 DFD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Level 1 DFD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Level 2 DFD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Portable gubbins . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Fingerprint Identi? cation System Flowchart . . . . . . . . . . . . . . Orientation Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . (a)Original look, (b) raise mental two-baser, (c)Binarised find out, (d)Thinned Image . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5. 1 Row 1 ? lter solvent c1k , k = 3, 2, and 1. Row 2 ? lter answer c2k , k = 3, 2, and 1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5. 2 5. 3 Examples of (a)ridge-ending (CN=1) and (b)bifurcation pel (CN=3) 42 43 40 18 22 23 25 26 27 27 28 29 34 37 Examples of typical senseless minutiae structures (a)Spur, (b)Hole, (c)Triangle, (d)Spike . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 44 44 45 48 5. 4 5. 5 5. 6 6. 1 Skeleton of windowpanepane centered at frontier minutiae . . . . . . . . . . ground substance Representation of boundary minutiae . . . . . . . . . . . . . linchpin Representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . Gender Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 10 6. 2 6. 3 LIST OF FIGURES 135o throngs of a ? ngerprint . . . . . . . . . . . . . . . . . . . . . . . . Fingerprint Classes (a)Left Loop, (b)Right Loop, (c)Whorl, (d1) condescending, (d2)Tented Arch . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6. 4 7. 1 8. 1 8. 2 8. 3 8. 4 8. 5 8. 6 8. 7 8. 8 8. 9 sectionalization Database . . . . . . . . . . . . . . . . . . . . . . . . . . One to Many Matching . . . . . . . . . . . . . . . . . . . . . . . . . . Normalized Image . . . . . . . . . . . . . . . . . . . . . . . . . . . . Orientation Image . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ridge Frequency Image . . . . . . . . . . . . . . . . . . . . . . . . . . Left-Original Image, Right- intensify Image . . . . . . . . . . . . . . Binarised Image . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Thinned Image . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . either Extracted Minutiae . . . . . . . . . . . . . . . . . . . . . . . . . . conglomerate Image with spurious and boundary minutiae . . . . . . . . Minutiae Image after post-processing . . . . . . . . . . . . . . . . . 51 52 57 59 60 60 61 61 62 62 63 63 64 65 50 8. 10 Composite Image after post-processing . . . . . . . . . . . . . . . . . 8. 11 Plotted Minutiae with Reference Point(Black Spot) . . . . . . . . . . 8. 12 graph Time taken for Identi? cation vs sizing of Database(key based one to many identi? cation) . . . . . . . . . . . . . . . . . . . . . . . . 8. 13 graph Time taken for Identi? cation vs Size of Database (n2 identi? cation) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 . 14 Expected chart for comparison Time taken for Identi? cation vs Size of Database(1 million) . . . . . . . . . . . . . . . . . . . . . . . . . 68 69 71 List of Tables 2. 1 5. 1 8. 1 8. 2 8. 3 8. 4 8. 5 8. 6 8. 7 8. 8 Estimated cipher . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Properties of Crossing human activity . . . . . . . . . . . . . . . . . . . . . 22 43 64 65 66 66 67 67 68 ordinary flesh of Minutiae before and after post-processing . . . . Ridge parsimony Calculation Results . . . . . . . . . . . . . . . . . . . . Classi? cation Results on Original Image . . . . . . . . . . . . . . . . Classi? cation Results on Enhanced Image . . . . . . . . . . . . . . . Time taken for Classi? cation . . . . . . . . . . . . . . . . . . . . . . .Time taken for Enrolling . . . . . . . . . . . . . . . . . . . . . . . . . Error Rates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Performance of ours and n2 matching based identi? cation techniques on a d atabase of coat 150 . . . . . . . . . . . . . . . . . . . . . . . . . 70 11 List of Algorithms 1 2 3 4 Key Extraction Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . Gender Estimation Algorithm . . . . . . . . . . . . . . . . . . . . . . . Key found One to Many Matching Algorithm . . . . . . . . . . . . . . Matching Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 49 55 56 12Chapter 1 Introduction 1. 1 Problem Statement Designing a student attending management system based on ? ngerprint recognition and faster one to many identi? cation that manages records for attention in institutes like NIT Rourkela. 1. 2 Motivation and Challenges Every organization whether it be an educational institution or business organization, it has to maintain a good record of attention of students or employees for e? ective functioning of organization. Designing a better attending management system for students so that records be keep with ease and accuracy was an i mportant key behind motivating this project.This would improve accuracy of attention records because it go out polish off all the hassles of roll occupational group and go forth save valuable time of the students as well as t individuallyers. Image processing and ? ngerprint recognition argon very advanced today in terms of technology. It was our responsibility to improve ? ngerprint identi? cation system. We decreased matching time by partitioning the database to one-tenth and improved matching development key based one to many matching. 13 14 CHAPTER 1. INTRODUCTION 1. 3 victimisation Biometrics Biometric Identi? cation Systems atomic number 18 widely utilize for unique identi? cation of gentleman mainly for veri? cation and identi? ation. Biometrics is employ as a form of individuation access management and access control. So use of biometrics in student attention management system is a secure approach. in that location are many fibres of biometric systems like ? ngerprint recognition, face recognition, voice recognition, iris recognition, wield recognition etc. In this project, we utilise ? ngerprint recognition system. 1. 4 What is ? ngerprint? A ? ngerprint is the pattern of ridges and valleys on the surface of a ? ngertip. The endpoints and crossing points of ridges are called minutiae. It is a widely take for granteded as bosomption that the minutiae pattern of to from severally one one ? ger is unique and does not change during ones life. Ridge endings are the points where the ridge cut back terminates, and bifurcations are where a ridge splits from a single path to two paths at a Y-junction. turn 1 illustrates an example of a ridge ending and a bifurcation. In this example, the black picture elements flout to the ridges, and the blanched picture elements correspond to the valleys. prefigure 1. 1 Example of a ridge ending and a bifurcation When human ? ngerprint experts determine if two ? ngerprints are from the same ? nger, the matching degree in the midst of two minutiae pattern is one of the about important factors.Thanks to the comparison to the way of human ? ngerprint experts and compactness of templates, the minutiae-based matching method is the most widely studied matching method. 1. 5. WHY USE fingermarkS? 15 1. 5 Why use ? ngerprints? Fingerprints are considered to be the best and fastest method for biometric identi? cation. They are secure to use, unique for all(prenominal) person and does not change in ones lifetime. Besides these, implementation of ? ngerprint recognition system is cheap, at large(p) and accurate up to satis? ability. Fingerprint recognition has been widely used in both forensic and civilian applications.Compared with other biometrics blows , ? ngerprint-based biometrics is the most proven technique and has the largest market shares . Not only it is faster than other techniques save also the energy consumption by such systems is everyplacely less. 1. 6 Using ? nge rprint recognition system for attendance management Managing attendance records of students of an institute is a tedious task. It consumes time and paper both. To make all the attendance tie in work automatic and on-line, we have designed an attendance management system which could be implemented in NIT Rourkela.It uses a ? ngerprint identi? cation system developed in this project. This ? ngerprint identi? cation system uses existing as well as new techniques in ? ngerprint recognition and matching. A new one to many matching algorithm for large databases has been introduced in this identi? cation system. 1. 7 Organization of the thesis This thesis has been organized into ten chapters. Chapter 1 introduces with our project. Chapter 2 explains the proposed design of attendance management system. Chapter 3 explains the ? ngerprint identi? cation system used in this project.Chapter 4 explains sweetener techniques, Chapter 5 explains feature prolongion methods, Chapter 6 explains our database partitioning approach . Chapter 7 explains matching technique. Chapter 8 explains experimental work done and performance analysis. Chapter 9 allows conclusions and Chapter 10 introduces proposed future work. Chapter 2 Attendance Management Framework manual(a) attendance taking and report generation has its limitations. It is well enough for 30-60 students but when it comes to taking attendance of students large in number, it is di? cult. For taking attendance for a lecture, a conference, etc. oll calling and manual attendance system is a failure. Time decompose over solvents of students, waste of paper etc. are the disadvantages of manual attendance system. Moreover, the attendance report is also not generated on time. Attendance report which is circulated over NITR webmail is two months old. To overcome these non-optimal situations, it is obligatory that we should use an automatic on-line attendance management system. So we present an implementable attendance manageme nt framework. Student attendance system framework is divided into trinity parts Hardware/Software Design, Attendance Management Approach and on-line(a) Report Generation. from each one of these is explained below. 2. 1 Hardware Software Level Design necessary ironware used should be easy to maintain, implement and easily available. Proposed hardware consists next parts (1)Fingerprint S dismissner, (2)LCD/Display Module (optional), (3)Computer 16 2. 2. attendance forethought APPROACH Table 2. 1 Estimated Budget Device Cost of Number of add Name One Unit Units Required Unit Budget S rout outner 500 100 50000 PC 21000 100 2100000 Total 21,50,000 (4)local area network confederation 17 Fingerprint s push asidener conk outing be used to arousal ? ngerprint of instructors/students into the lookr software.LCD present allow for be displaying rolls of those whose attendance is marked. Computer Software bequeath be interfacing ? ngerprint s roll in the hayner and LCD and wi lling be connected to the network. It will insert ? ngerprint, will process it and extract features for matching. later on matching, it will update database attendance records of the students. contour 2. 1 Hardware present in crystalizerooms Estimated Budget Estimated romaine lettucet of the hardware for implementation of this system is shown in the table 2. 1. Total number of classrooms in NIT Rourkela is near 100. So number of units demand will be 100. 2. 2 Attendance Management ApproachThis part explains how students and teachers will use this attendance management system. Following points will make confident(predicate) that attendance is marked correctly, without any problem (1)All the hardware will be inwardly classroom. So outside interference will be absent. (2)To shift unauthorized access and unwanted attempt to corrupt the hardware by students, all the hardware except ? ngerprint s squeeze outner could be put inside a small 18 CHAPTER 2. ATTENDANCE MANAGEMENT mod el cabin. As an alternate solution, we bay window install CCTV cameras to counter unprivileged activities. (3)When teacher enters the classroom, the attendance brand will start.Computer software will start the process after commentaryting ? ngerprint of teacher. It will ? nd the Subject ID, and Current Semester use the ID of the teacher or could be secure manually on the software. If teacher doesnt enter classroom, attendance marking will not start. (4)After some time, say 20 minutes of this process, no attendance will be given because of late entrance. This time period can be increased or decreased as per requirements. framing 2. 2 Classroom Scenario 2. 3 On-Line Attendance Report Generation Database for attendance would be a table having avocation ? elds as a combination for primary ? ld (1)Day,(2)Roll,(3)Subject and following non-primary ? elds (1)Attendance,(2)Semester. Using this table, all the attendance can be managed for a student. For on-line report generation, a dewy-eyed website can be hosted on NIT Rourkela servers, 2. 4. interlocking AND DATABASE MANAGEMENT 19 which will access this table for showing attendance of students. The sql queries will be used for report generation. Following doubtfulness will give total rime of classes held in subject CS423 SELECT COUNT(DISTINCT Day) FROM AttendanceTable WHERE SUBJECT = CS423 AND Attendance = 1 For attendance of oll 107CS016, against this subject, following motion will be used SELECT COUNT(Day) FROM AttendanceTable WHERE Roll = 107CS016 AND SUBJECT = CS423 AND Attendance = 1 Now the attendance percent can easily be calculated ClassesAttended ? 100 ClassesHeld Attendance = (2. 1) 2. 4 Network and Database Management This attendance system will be spread over a wide network from classrooms via intranet to network. Network diagram is shown in ? g. 2. 3. Using this network, attendance reports will be made available over internet and e-mail. A monthly report will be sent to each student via em ail and website will show the updated attendance.Entity relationship diagram for database of students and attendance records is shown in ? g. 2. 4. In ER diagram, primary ? elds are Roll, Date, SubjectID and TeacherID. Four tables are Student, Attendance, Subject and Teacher. Using this database, attendance could easily be maintained for students. Data? ow is shown in data ? ow diagrams (DFD) shown in ? gures 2. 5, 2. 6 and 2. 7. 2. 5 Using radiocommunication network instead of LAN and bringing portability We are using LAN for communication among servers and hardwares in the classrooms. We can instead use tuner LAN with portable guiles.Portable crook will have an embedded ? ngerprint scanner, wireless connection, a microprocessor loaded with a software, remembrance and a display terminal, see ? gure 2. 5. Size of gimmick could be small like a alert surround depending upon how well the maneuver is manufactured. 20 CHAPTER 2. ATTENDANCE MANAGEMENT FRAMEWORK Figure 2. 3 Network Diagram 2. 5. USING WIRELESS NETWORK quite OF LAN AND BRINGING PORTABILITY21 Figure 2. 4 ER Diagram 22 CHAPTER 2. ATTENDANCE MANAGEMENT FRAMEWORK Figure 2. 5 Level 0 DFD Figure 2. 6 Level 1 DFD 2. 5. USING WIRELESS NETWORK INSTEAD OF LAN AND BRINGING PORTABILITY23 Figure 2. Level 2 DFD 24 CHAPTER 2. ATTENDANCE MANAGEMENT FRAMEWORK This blind should have a wireless connection. Using this wireless connection, Figure 2. 8 Portable Device attendance taken would be updated automatically when device is in network of the nodes which are storing the attendance records. Database of enrolled ? ngerprints will be in this portable device. Size of enrolled database was 12. 1 MB when 150 ? ngerprints were enrolled in this project. So for 10000 students, at to the lowest degree 807 MB or more space would be required for storing enrolled database. For this purpose, a removable memory chip could be used.We cannot use wireless LAN here because channel data using wireless LAN will not be possible because of less range of wireless devices. So enrolled data would be on chip itself. Attendance results will be updated when portable device will be in the range of nodes which are storing attendance reports. We whitethorn update all the records online via the mobile network provided by di? erent companies. Today 3G network provides su? cient throughput which can be used for updating attendance records automatically without pass near nodes. In such case, 2. 6. COMPARISON WITH OTHER STUDENT ATTENDANCE SYSTEMS 25 he need of database inside memory chip will not be mandatory. It will be fetched by using 3G mobile network from central database repository. The design of such a portable device is the task of embedded system engineers. 2. 5. 1 Using Portable Device In this section, we suggest the working of portable device and the method of using it for marking attendance. The device may either be having touchscreen input/display or buttons with lcd display. A software specially designed for the device will be running on it. Teachers will verify his/her ? ngerprint on the device before giving it to students for marking attendance.After verifying the teachers identity, software will ask for course and and other required education about the class which he or she is going to teach. Software will ask teacher the time after which device will not mark any attendance. This time can vary depending on the teachers mood but our suggested think of is 25 minutes. This is done to prevent late entrance of students. This amount will hardly take a some(prenominal) seconds. thusly students will be given device for their ? ngerprint identi? cation and attendance marking. In the continuation, teacher will start his/her lecture.Students will hand over the device to other students whose attendance is not marked. After 25 minutes or the time decided by teacher, device will not input any attendance. After the class is over, teacher will take device and will end the lecture. The main function of software running on the device will be ? ngerprint identi? cation of students followed by report generation and send reports to servers using 3G network. Other functions will be downloading and updating the database available on the device from central database repository. 2. 6 Comparison with other student attendance systemsThere are various other kind of student attendance management systems available like RFID based student attendance system and GSM-GPRS based student attendance system. These systems have their own pros and cons. Our system is better because ? rst it saves time that could be used for teaching. Second is portability. Portability 26 CHAPTER 2. ATTENDANCE MANAGEMENT FRAMEWORK has its own advantage because the device could be taken to any class wherever it is scheduled. While GSM-GPRS based systems use shoes of class for attendance marking which is not dynamic and if schedule or location of the class changes, wrong attendance might be marked.Problem wit h RFID based systems is that students have to declare RFID cards and also the RFID detectors are needed to be installed. Nonetheless, students may give proxies easily using friends RFID card. These problems are not in our system. We used ? ngerprints as recognition criteria so proxies cannot be given. If portable devices are used, attendance marking will be done at any place and any time. So our student attendance system is further better to be implemented at NITR. Chapter 3 Fingerprint Identi? cation System An identi? cation system is one which helps in identifying an individual among any people when fine reading is not available. It may involve matching available features of prognosis like ? ngerprints with those already enrolled in database. 3. 1 How Fingerprint Recognition deeds? Fingerprint see to its that are found or scanned are not of best quality. So we remove make noises and enhance their quality. We extract features like minutiae and others for matching. If the invests of minutiae are matched with those in the database, we call it an identi? ed ? ngerprint. After matching, we perform post-matching locomote which may include showing details of identi? ed candidate, marking attendance etc.A brief ? owchart is shown in next section. 3. 2 Fingerprint Identi? cation System Flowchart A brief methodology of our Fingerprint Identi? cation System is shown here in following ? owchart. Each of these are explained in the later chapters. 27 28 CHAPTER 3. FINGERPRINT designation SYSTEM Figure 3. 1 Fingerprint Identi? cation System Flowchart Chapter 4 Fingerprint Enhancement The stick out acquired from scanner is sometimes not of pure(a) quality . It gets corrupted ascribable to irregularities and non-uniformity in the impression taken and due to variations in the skin and the presence of the scars, humidity, irt etc. To overcome these problems , to reduce noise and enhance the de? nition of ridges against valleys, various techniques are applied as following. 4. 1 Segmentation Image segmentation 1 withdraws the foreground regions and the ground regions in the image. The foreground regions refers to the take place ? ngerprint area which deems the ridges and valleys. This is the area of interest. The terra firma regions refers to the regions which is outside the borders of the main ? ngerprint area, which does not contain any important or valid ? ngerprint information.The origination of noisy and infatuated minutiae can be done by applying minutiae extraction algorithm to the background regions of the image. Thus, segmentation is a process by which we can discard these background regions, which results in more reliable extraction of minutiae points. We are going to use a method based on variance thresholding . The background regions adjoin a very low grey scale variance assess , whereas the foreground regions have a very high variance . first of all , the image is divided into kiboshs and the grey-scale variance is calculated for each exclude in the image .If the variance is less than the global threshold , past the distract is assigned to be part of background region or else 29 30 CHAPTER 4. FINGERPRINT sweetener it is part of foreground . The grey aim variance for a hamper of surface S x S can be calculated as 1 V ar(k) = 2 S S? 1 S? 1 (G(i, j) ? M (k))2 i=0 j=0 (4. 1) where Var(k) is the grey take aim variance for the block k , G(i,j) is the grey direct value at pixel (i,j) , and M(k) denotes the intend grey level value for the corresponding block k . 4. 2 Normalization Image normalization is the next step in ? ngerprint sweetener process.Normalization 1 is a process of standardizing the intensity determine in an image so that these intensity values lies inwardly a certain desired range. It can be done by adjusting the range of grey-level values in the image. let G(i, j) denotes the grey-level value at pixel (i, j), and N(i, j) represent the normalized grey-level value at pi xel (i, j). Then the normalized image can de? ned as ? ? M + 0 N (i, j) = ? M ? 0 V0 (G(i,j)? M )2 V V0 (G(i,j)? M )2 V , if I(i, j) M , otherwise where M0 and V0 are the estimated mean and variance of I(i, j), respectively . 4. 3 Orientation estimation The druthers ? eld of a ? ngerprint image de? es the local orientation of the ridges contained in the ? ngerprint . The orientation estimation is a fundamental step in the enhancement process as the subsequent Gabor ? ltering stage relies on the local orientation in order to e? ectively enhance the ? ngerprint image. The least mean square estimation method used by Raymond Siamese 1 is used to compute the orientation image. However, instead of estimating the orientation block-wise, we have elect to extend their method into a pixel-wise scheme, which take a craps a ? ner and more accurate estimation of the orientation ? eld. The steps for calculating the orientation at pixel i, j) are as follows 4. 3. ORIENTATION ESTIMATION 31 1. F irstly , a block of size W x W is centered at pixel (i, j) in the normalized ? ngerprint image. 2. For each pixel in the block, compute the gradients dx (i, j) and dy (i, j), which are the gradient magnitudes in the x and y directions, respectively. The horizontal Sobel operator6 is used to compute dx(i, j) 1 0 -1 2 0 -21 0 -1 Figure 4. 1 Orientation Estimation 3. The local orientation at pixel (i j) can so be estimated using the following equations i+ W 2 j+ W 2 Vx (i, j) = u=i? W 2 i+ W 2 v=j? W 2 j+ W 2 2? x (u, v)? y (u, v) (4. 2) Vy (i, j) = u=i? W v=j? W 2 2 2 2 ? (u, v) ? ?y (u, v), (4. 3) ?(i, j) = 1 Vy (i, j) tan? 1 , 2 Vx (i, j) (4. 4) where ? (i, j) is the least square estimate of the local orientation at the block centered at pixel (i, j). 4. Smooth the orientation ? eld in a local neighborhood using a Gaussian ? lter. The orientation image is ? rstly converted into a continuous vector ? eld, which is de? ned as ? x (i, j) = cos 2? (i, j), ? y (i, j) = sin 2? (i, j), ( 4. 5) (4. 6) where ? x and ? y are the x and y components of the vector ? eld, respectively. After 32 CHAPTER 4. FINGERPRINT ENHANCEMENT the vector ? eld has been computed, Gaussian smoothing is then performed as follows w? w? 2 ?x (i, j) = w? u=? 2 w? v=? 2 G(u, v)? x (i ? uw, j ? vw), (4. 7) w? 2 w? 2 ?y (i, j) = w? u=? 2 w? v=? 2 G(u, v)? y (i ? uw, j ? vw), (4. 8) where G is a Gaussian low-pass ? lter of size w? x w? . 5. The ? nal smoothed orientation ? eld O at pixel (i, j) is de? ned as O(i, j) = ? y (i, j) 1 tan? 1 2 ? x (i, j) (4. 9) 4. 4 Ridge Frequency Estimation other important parameter,in addition to the orientation image, that can be used in the construction of the Gabor ? lter is the local ridge frequency. The local frequency of the ridges in a ? ngerprint is represented by the frequency image. The ? st step is to divide the image into blocks of size W x W. In the next step we project the greylevel values of each pixels located inside each block along a direction pe rpendicular to the local ridge orientation. This projection results in an close sinusoidal-shape wave with the local minimum points denoting the ridges in the ? ngerprint. It involves smoothing the projected waveform using a Gaussian lowpass ? lter of size W x W which helps in simplification the e? ect of noise in the projection. The ridge lay S(i, j) is then calculated by counting the median number of pixels between the consecutive minima points in the projected waveform.The ridge frequency F(i, j) for a block centered at pixel (i, j) is de? ned as F (i, j) = 1 S(i, j) (4. 10) 4. 5. GABOR interpenetrate 33 4. 5 Gabor ? lter Gabor ? lters 1 are used because they have orientation-selective and frequencyselective properties. Gabor ? lters are called the come of all other ? lters as other ? lter can be derived using this ? lter. Therefore, applying a properly tuned Gabor ? lter can preserve the ridge structures while trim back noise. An even-symmetric Gabor ? lter in the spatial d omain is de? ned as 1 x2 y2 G(x, y, ? , f ) = exp? ? + ? cos 2? f x? , 2 2 2 ? x ? y (4. 11) x? = x cos ? + y sin ? , (4. 12) y? ? x sin ? + y cos ? , (4. 13) where ? is the orientation of the Gabor ? lter, f is the frequency of the cosine wave, ? x and ? y are the standard deviations of the Gaussian gasbag along the x and y axes, respectively, and x? and y? de? ne the x and y axes of the ? lter coordinate frame respectively. The Gabor Filter is applied to the ? ngerprint image by spatially convolving the image with the ? lter. The convolution of a pixel (i,j) in the image requires the corresponding orientation value O(i,j) and the ridge frequency value F(i,j) of that pixel . wy 2 wx 2 E(i, j) = u=? wx 2 w v=? 2y G(u, v, O(i, j), F (i, j))N (i ? u, j ? v), (4. 4) where O is the orientation image, F is the ridge frequency image, N is the normalized ? ngerprint image, and wx and wy are the width and height of the Gabor ? lter mask, respectively. 34 CHAPTER 4. FINGERPRINT ENHANCEMEN T 4. 6 Binarisation Most minutiae extraction algorithms operate on basically binary images where in that location are only two levels of interest the black pixels represent ridges, and the white pixels represent valleys. Binarisation 1 converts a greylevel image into a binary image. This helps in improving the contrast between the ridges and valleys in a ? ngerprint image, and consequently facilitates the extraction of minutiae.One very useful property of the Gabor ? lter is that it contains a DC component of zero, which indicates that the resulting ? ltered image has a zero mean pixel value. Hence, binarisation of the image can be done by using a global threshold of zero. Binarisation involves examining the grey-level value of both pixel in the intensify image, and, if the grey-level value is greater than the prede? ned global threshold, then the pixel value is set to value one else, it is set to zero. The subject of binarisation is a binary image which contains two levels of i nformation, the background valleys and the foreground ridges. . 7 Thinning Thinning is a morphological achievement which is used to remove selected foreground pixels from the binary images. A standard press clipping algorithm from 1 is used, which performs this operation using two subiterations. The algorithm can be accessed by a software MATLAB via the thin operation of the bwmorph function. Each subiteration starts by examining the neighborhood of every pixel in the binary image, and on the stern of a finicky set of pixel-deletion criteria, it decides whether the pixel can be take away or not. These subiterations goes on until no more pixels can be removed.Figure 4. 2 (a)Original Image, (b)Enhanced Image, (c)Binarised Image, (d)Thinned Image Chapter 5 Feature Extraction After improving quality of the ? ngerprint image we extract features from binarised and slashed images. We extract annexe point, minutiae and key(used for one to many matching). 5. 1 contracting the Referen ce Point Reference point is very important feature in advanced matching algorithms because it provides the location of origin for marking minutiae. We ? nd the mention point using the algorithm as in 2. Then we ? nd the relative position of minutiae and estimate the orientation ? ld of the reference point or the singular point. The technique is to extract nerve centre and delta points using Poincare Index. The value of Poincare index is 180o , ? 180o and 0o for a core, a delta and an ordinary point respectively. Complex ? lters are used to produce blur at di? erent resolutions. Singular point (SP) or reference point is the point of maximum ? lter response of these ? lters applied on image. Complex ? lters , exp(im? ) , of order m (= 1 and -1) are used to produce ? lter response. Four level resolutions are used herelevel 0, level 1, level 2, level 3.Level 3 is lowest resolution and level 0 is highest resolution. Only ? lters of ? rst order are used h = (x + iy)m g(x, y) where g(x, y) is a Gaussian de? ned as g(x, y) = exp? ((x2 + y 2 )/2? 2 ) and m = 1, ? 1. Filters are applied to the complex valued orientation tensor ? eld image z(x, y) = (fx + ify )2 and not directly to the image. here f x is the derivative of the original image in the x-direction and f y is the derivative in the y-direction. To ? nd the position of a possible 35 36 CHAPTER 5. FEATURE bloodline Figure 5. 1 Row 1 ? lter response c1k , k = 3, 2, and 1. Row 2 ? ter response c2k , k = 3, 2, and 1. SP in a ? ngerprint the maximum ? lter response is extracted in image c13 and in c23 (i. e. ?lter response at m = 1 and level 3 (c13 ) and at m = ? 1 and level 3 (c23 )). The lookup is done in a window computed in the introductory high level (low resolution). The ? lter response at lower level (high resolution) is used for ? nding response at higher level (low resolution). At a certain resolution (level k), if cnk (xj , yj ) is higher than a threshold an SP is found and its position (xj , yj ) an d the complex ? lter response cnk (xj , yj ) are noted. 5. 2 5. 2. 1Minutiae Extraction and Post-Processing Minutiae Extraction The most commonly assiduous method of minutiae extraction is the Crossing Number (CN) concept 1 . This method involves the use of the skeleton image where the ridge ? ow pattern is eight-connected. The minutiae are extracted by see the local neighborhood of each ridge pixel in the image using a 3 x 3 window. The CN value is then computed, which is de? ned as half the sum of the di? erences between pairs of adjacent pixels in the eight-neighborhood. Using the properties of the CN as shown in ? gure 5, the ridge pixel can then be classi? d as a ridge ending, bifurcation or non-minutiae point. For example, a ridge pixel with a CN of one corresponds to a ridge ending, and a CN of 3 corresponds to a bifurcation. 5. 2. MINUTIAE EXTRACTION AND POST-PROCESSING Table 5. 1 Properties of Crossing Number CN place 0 Isolated Point 1 Ridge Ending Point 2 Continuing R idge Point 3 Bifurcation Point 4 Crossing Point 37 Figure 5. 2 Examples of (a)ridge-ending (CN=1) and (b)bifurcation pixel (CN=3) 5. 2. 2 Post-Processing fancied minutiae may be introduced into the image due to factors such as noisy images, and image artefacts created by the thinning process.Hence, after the minutiae are extracted, it is necessary to employ a post-processing 1 stage in order to validate the minutiae. Figure 5. 3 illustrates some examples of false minutiae structures, which include the spur, hole, triangle and spike structures . It can be seen that the spur structure generates false ridge endings, where as both the hole and triangle structures generate false bifurcations. The spike structure creates a false bifurcation and a false ridge ending point. Figure 5. 3 Examples of typical false minutiae structures (c)Triangle, (d)Spike (a)Spur, (b)Hole, 38 CHAPTER 5.FEATURE EXTRACTION 5. 2. 3 Removing Boundary Minutiae For removing boundary minutiae, we used pixel- assidu ousness approach. Any point on the boundary will have less white pixel compactness in a window centered at it, as compared to inner minutiae. We calculated the limit, which indicated that pixel concentration less than that means it is a boundary minutiae. We calculated it according to following formula limit = ( w w ? (ridgedensity)) ? Wf req 2 (5. 1) where w is the window size, Wf req is the window size used to compute ridge density. Figure 5. 4 Skeleton of window centered at boundary minutiaeFigure 5. 5 matrix Representation of boundary minutiae Now, in thinned image, we sum all the pixels in the window of size w centered at the boundary minutiae. If sum is less than limit, the minutiae is considered as boundary minutiae and is discarded. 5. 3. EXTRACTION OF THE KEY 39 5. 3 5. 3. 1 Extraction of the key What is key? Key is used as a hashing tool in this project. Key is small set of few minutiae closest to reference point. We match minutiae sets, if the keys of type and inquir y ? ngerprints matches. Keys are stored along with minutiae sets in the database.Advantage of using key is that, we do not perform broad(a) matching every time for non-matching minutiae sets, as it would be time consuming. For large databases, if we go on matching abundant minutiae set for every enrolled ? ngerprint, it would waste time unnecessarily. Two types of keys are proposed simple and complex. Simple key has been used in this project. Figure 5. 6 Key Representation Simple Key This type of key has been used in this project. Minutiae which constitute this key are ten minutiae closest to the reference point or centroid of all minutiae, in sorted 40 CHAPTER 5. FEATURE EXTRACTION order. Five ? lds are stored for each key value i. e. (x, y, ? , t, r). (x, y) is the location of minutiae, ? is the value of orientation of ridge related to minutia with respect to orientation of reference point, t is type of minutiae, and r is surpass of minutiae from origin. Due to inaccuracy and imperfection of reference point detection algorithm, we used centroid of all minutiae for construction of key. Complex Key The complex key stores more information and is structurally more complex. It stores vector of minutiae in which next minutiae is closest to previous minutiae, starting with reference point or centroid of all minutiae.It stores x, y, ? , t, r, d, ? . Here x,y,t,r,? are same, d is distance from previous minutiae entry and ? is di? erence in ridge orientation from previous minutiae. Data minutiaelist = Minutiae Set, refx = x-cordinate of centroid, refy = y-cordinate of centroid Result Key d(10)=null for j = 1 to 10 do for i = 1 to rows(minutiaelist) do d(i) Chapter 6 Partitioning of Database Before we partition the database, we perform gender estimation and classi? cation. 6. 1 Gender Estimation In 3, study on 100 manlys and 100 fe manfuls revealed that signi? slope sex di? erences occur in the ? ngerprint ridge density.Henceforth, gender of the candidate can be estimated on the basis of given ? ngerprint data. Henceforth, gender of the candidate can be estimated on the basis of given ? ngerprint data. ground on this estimation, scrutinizing for a record in the database can be made faster. Method for ? nding mean ridge density and estimated gender The highest and lowest values for male and womanish ridge densities will be se revoltinged. If ridge density of query ? ngerprint is less than the lowest ridge density value of females, the query ? ngerprint is seemingly of a male. Similarly, if it is higher than highest ridge density value of males, the query ? gerprint is of a female. So the searching will be carried out in male or female domains. If the value is between these values, we search on the basis of whether the mean of these values is less than the density of query image or higher. 41 42 CHAPTER 6. PARTITIONING OF DATABASE Figure 6. 1 Gender Estimation 6. 1. GENDER ESTIMATION Data Size of Database = N Ridge tautness of query ? n gerprint = s Result Estimated Gender i. e. male or female maleupperlimit=0 femalelowerlimit=20 mean=0 for image femalelowerlimit then femalelowerlimit 43 if s maleupperlimit then estimatedgender 44 CHAPTER 6.PARTITIONING OF DATABASE 6. 2 Classi? cation of Fingerprint We divide ? ngerprint into ? ve classes arch or tented arch, left loop, right loop, bowl and unclassi? ed. The algorithm for classi? cation 4 is used in this project. They used a ridge classi? cation algorithm that involves three categories of ridge structuresnonrecurring ridges, type I recurring ridges and type II recurring ridges. N1 and N2 represent number of type I recurring ridges and type II recurring ridges respectively. Nc and Nd are number of core and delta in the ? ngerprint. To ? nd core and delta, separate 135o blocks from orientation image. 35o blocks are shown in following ? gures. Figure 6. 2 135o blocks of a ? ngerprint Based on number of such blocks and their relative positions, the core and delta a re found using Poincare index method. After these, classi? cation is done as following 1. If (N2 0) and (Nc = 2) and (Nd = 2), then a whorl is identi? ed. 2. If (N1 = 0) and (N2 = 0) and (Nc = 0) and (Nd = 0), then an arch is identi? ed. 3. If (N1 0) and (N2 = 0) and (Nc = 1) and (Nd = 1), then break the input using the core and delta sound judgment algorithm4. 4. If (N2 T2) and (Nc 0), then a whorl is identi? ed. 5.If (N1 T1) and (N2 = 0) and (Nc = 1) then classify the input using the core and delta assessment algorithm4. 6. If (Nc = 2), then a whorl is identi? ed. 7. If (Nc = 1) and (Nd = 1), then classify the input using the core and delta assessment algorithm4. 8. If (N1 0) and (Nc = 1), then classify the input using the core and delta assessment algorithm. 6. 3. PARTITIONING 9. If (Nc = 0) and (Nd = 0), then an arch is identi? ed. 10. If none of the above conditions is satis? ed, then correct the ? ngerprint. 45 Figure 6. 3 Fingerprint Classes (a)Left Loop, (b)Right Lo op, (c)Whorl, (d1)Arch, (d2)Tented Arch . 3 Partitioning After we estimate gender and ? nd the class of ? ngerprint, we know which ? ngerprints to be searched in the database. We some divide database into one-tenth using the above parameters. This would roughly reduce identi? cation time to one-tenth. 46 CHAPTER 6. PARTITIONING OF DATABASE Figure 6. 4 Partitioning Database Chapter 7 Matching Matching means ? nding most appropriate corresponding ? ngerprint to query ? ngerprint. Fingerprints are matched by matching set of minutiae extracted. Minutiae sets never match completely, so we compute match score of matching. If match score satis? s accuracy needs, we call it productive matching. We used a new key based one to many matching intended for large databases. 7. 1 Alignment Before we go for matching, minutiae set need to be aligned(registered) with each other. For alignment problems, we used hough transform based registration technique standardized to one used by Ratha et al5. M inutiae alignment is done in two steps minutiae registration and pairing. Minutiae registration involves aligning minutiae using parameters ? x, ? y, ? which range at bottom speci? ed limits. (? x, ? y) are translational parameters and ? is rotational parameter.Using these parameters, minutiae sets are rotated and translated within parameters limits. Then we ? nd pairing scores of each geological fault and renewal giving maximum score is registered as alignment transformation. Using this transformation ? x, ? y, ? , we align query minutiae set with the database minutiae set. Algorithm is same as in 5 but we have excluded factor ? s i. e. the scaling parameter because it does not a? ect much the alignment process. ? lies from -20 degrees to 20 degrees in steps of 1 or 2 generalized as ? 1 , ? 2 , ? 3 ? k where k is number of rotations applied.For every query minutiae i we check if ? k + ? i = ? j where ? i and ? j are orientation 47 48 CHAPTER 7. interconnected parameters of ith minutia of query minutiae set and j th minutia of database minutiae set. If condition is satis? ed, A(i,j,k) is ? agged as 1 else 0. For all these ? agged values, (? x, ? y) is calculated using following formula ? (? x , ? y ) = qj ? ? cos? sin? ? ? ? pi , (7. 1) ?sin? cos? where qj and pi are the coordinates of j th minutiae of database minutiae set and ith minutiae of query minutiae set respectively. Using these ? x, ?y, ? k values, whole query minutiae set is aligned.This aligned minutiae set is used to compute pairing score. Two minutiae are said to be paired only when they lie in same bounding box and have same orientation. Pairing score is (number of paired minutiae)/(total number of minutiae). The i,j,k values which have highest pairing score are ? nally used to align minutiae set. Co-ordinates of aligned minutiae are found using the formula ? qj = ? cos? sin? ? ? ? pi + (? x , ? y ), (7. 2) ?sin? cos? After alignment, minutiae are stored in sorted order of their dista nce from their centroid or core. 7. 2 Existing Matching TechniquesMost popular matching technique of today is the simple mind n2 matching where n is number of minutiae. In this matching each minutiae of query ? ngerprint is matched with n minutiae of sample ? ngerprint giving total number of n2 comparisons. This matching is very orthodox and gives headache when identi? cation is done on large databases. 7. 3 One to Many matching Few algorithms are proposed by many researchers around the world which are better than normal n2 matching. But all of them are one to one veri? cation or one to one identi? cation matching types. We developed a one to many matching technique which uses key as the hashing tool.Initially, we do not match minutiae sets instead we per- 7. 3. ONE TO MANY MATCHING 49 form key matching with many keys of database. Those database ? ngerprints whose keys match with key of query ? ngerprint, are allowed for copious minutiae matching. Key matching and full matching a re performed using k*n matching algorithm discussed in later section. Following section gives method for one to many matching. Data Query Fingerprint Result Matching Results Acquire Fingerprint, Perform Enhancement, Find Fingerprint Class, Extract Minutiae, Remove Spurious and Boundary Minutiae, Extract Key,Estimate Gender M . 3. 1 Method of One to Many Matching The matching algorithm will be involving matching the key of the query ? ngerprint with the many(M) keys of the database. Those which matches ,their full matching will be processed, else the query key will be matched with next M keys and so on. 50 Data Gender, Class, i Result Matching Results egender CHAPTER 7. MATCHING if keymatchstatus = success then eminutiae 7. 4 Performing key match and full matching Both key matching and full matching are performed using our k*n matching technique. Here k is a constant quantity(recommended value is 15) chosen by us.In this method, we match ith minutiae of query set with k whimsical mi nutiae of sample set. Both the query sets and sample sets must be in sorted order of distance from reference point or centroid. ith minutia of query minutiae list is matched with top k unmatched minutiae of database minutiae set. This type of matching reduces matching time of n2 to k*n. If minutiae are 80 in number and we chose k to be 15, the total number of comparisons will reduce from 80*80=6400 to 80*15=1200. And this means our matching will be k/n times faster than n2 matching. 7. 5. fourth dimension COMPLEXITY OF THIS MATCHING TECHNIQUE 51 Figure 7. One to Many Matching 7. 5 Time Complexity of this matching technique allow s = size of the key, n = number of minutiae, N = number of ? ngerprints matched till successful identi? cation, k = constant (see previous section). There would be N-1 ruined key matches, one successful key match, one successful full match. Time for N-1 unsuccessful key matches is (N-1)*s*k (in worst case), for successful full match is s*k and for full m atch is n*k. Total time is (N-1)*s*k+n*k+s*k = k(s*N+n). Here s=10 and we have trim back database to be searched to 1/10th ,so N matching technique, it would have been O(Nn2 ).For large databases, our matching technique is best to use. Averaging for every ? ngerprint, we have O(1+n/N) in this identi? cation process which comes to O(1) when N n. So we can say that our identi? cation system has constant average matching time when database size is millions. Chapter 8 Experimental Analysis 8. 1 Implementation Environment We tested our algorithm on some(prenominal) databases like FVC2004, FVC2000 and Veri? nger databases. We used a computer with 2GB RAM and 1. 83 gigacycle Intel Core2Duo processor and softwares like Matlab10 and MS entrance fee10. 8. 2 8. 2. 1 Fingerprint Enhancement Segmentation and NormalizationSegmentation was performed and it generated a mask matrix which has values as 1 for ridges and 0 for background . Normalization was done with mean = 0 and variance = 1 (? g 8. 1). Figure 8. 1 Normalized Image 52 8. 2. FINGERPRINT ENHANCEMENT 53 8. 2. 2 Orientation Estimation In orientation estimation, we used block size = 3*3. Orientations are shown in ? gure 8. 2. Figure 8. 2 Orientation Image 8. 2. 3 Ridge Frequency Estimation Ridge density and mean ridge density were calculated. Darker blocks indicated low ridge density and vice-versa. Ridge frequencies are shown in ? gure 8. 3. Figure 8. 3 Ridge Frequency Image 8. 2. 4Gabor Filters Gabor ? lters were employ to enhance quality of image. Orientation estimation and ridge frequency images are requirements for implementing gabor ? lters. ?x and ? y are taken 0. 5 in Raymond Thai, but we used ? x = 0. 7 and ? y = 0. 7. Based on these values , we got results which were satis? able and are shown in ? gure 8. 4. 54 CHAPTER 8. experimental compendium Figure 8. 4 Left-Original Image, Right-Enhanced Image 8. 2. 5 Binarisation and Thinning After the ? ngerprint image is enhanced, it is then converted to bina ry form, and submitted to the thinning algorithm which reduces the ridge thickness to one pixel wide.Results of binarisation are shown in ? gure 8. 5 and of thinning are shown in ? gure 8. 6. Figure 8. 5 Binarised Image 8. 3. FEATURE EXTRACTION 55 Figure 8. 6 Thinned Image 8. 3 8. 3. 1 Feature Extraction Minutiae Extraction and Post Processing Minutiae Extraction Using the crossing number method, we extracted minutiae. For this we used skeleton image or the thinned image. Due to low quality of ? ngerprint, a lot of false and boundary minutiae were found. So we moved forward for post-processing step. Results are shown in ? gure 8. 7 and 8. 8. Figure 8. 7 All Extracted Minutiae 56 CHAPTER 8. EXPERIMENTAL ANALYSISFigure 8. 8 Composite Image with spurious and boundary minutiae After Removing Spurious and Boundary Minutiae False minutiae were removed using method described in earlier section. For removing boundary minutiae, we employed our algorithm which worked ? ne and minutiae extract ion results are shown in table 8. 2. Results are shown in ? gure 8. 9 and 8. 10. Figure 8. 9 Minutiae Image after post-processing As we can see from table 8. 2 that removing boundary minutiae considerably trim the number of false minutiae from minutiae extraction results. 8. 4. GENDER ESTIMATION AND CLASSIFICATION 57 Figure 8. 0 Composite Image after post-processing Table 8. 1 Average Number of Minutiae before and after post-processing DB After After Removing After Removing Used Extraction Spurious Ones Boundary Minutiae FVC2004DB4 218 186 93 FVC2004DB3 222 196 55 8. 3. 2 Reference Point Detection For reference point extraction we used complex ? lters as described earlier. For a database size of 300, reference point was found with success rate of 67. 66 percent. 8. 4 8. 4. 1 Gender Estimation and Classi? cation Gender Estimation Average ridge density was calculated along with minimum and maximum ridge densities shown in table 8. . Mean ridge density was used to divide the database into two parts. This trim down database size to be searched by half. Based on the information available about the gender of enrolled student, we can apply our gender estimation algorithm which will further increase the speed of identi? cation. 8. 4. 2 Classi? cation Fingerprint classi? cation was performed on both original and enhanced images. Results were more accurate on the enhanced image. We used same algorithm as in sec 6. 2 to classify the ? ngerprint into ? ve classes arch, left loop, right loop, whorl and 58 CHAPTER 8.EXPERIMENTAL ANALYSIS Figure 8. 11 Plotted Minutiae with Reference Point(Black Spot) Table 8. 2 Ridge immersion Calculation Results Window Minimum Maximum Mean Total Average Size Ridge Ridge Ridge Time Time taken Density Density Density Taken Taken 36 6. 25 9. 50 7. 87 193. 76 sec 1. 46 sec unclassi? ed. This classi? cation was used to divide the database into ? ve parts which would reduce the database to be searched to one-? fth and ultimately making this identi? cation process ? ve times faster. Results of classi? cation are shown in table 8. 4, 8. 5 and 8. 6. 8. 5 EnrollingAt the time of enrolling personal details like name, semester, gender, age, roll number etc. were asked to input by the user and following features of ? ngerprint were saved in the database (1)Minutiae Set (2)Key (3)Ridge Density (4)Class Total and average time taken for enrolling ? ngerprints in database is shown in table 8. 6. MATCHING Table 8. 3 Classi? cation Results on Original Image Class No. of (1-5) Images 1 2 2 2 3 3 4 4 5 121 Table 8. 4 Classi? cation Results on Enhanced Image Class No. of (1-5) Images 1 8 2 3 3 3 4 6 5 112 59 8. 7. All the personal details were stored in the MS access code database and were modi? d by running sql queries inside matlab. Fingerprint features were stored in txt format inside a separate folder. When txt ? le were used, the process of enrolling was faster as compared to storing the values in MS Access DB. It was due to the overhead of connections, running sql queries for MS Access DB. 8. 6 Matching Fingerprint matching is required by both veri? cation and identi? cation processes. 8. 6. 1 Fingerprint Veri? cation Results Fingerprint veri? cation is the process of matching two ? ngerprints against each other to verify whether they belong to same person or not. When a ? gerprint matches with the ? ngerprint of same individual, we call it true accept or if it doesnt, we call it false reject. In the same way if the ? ngerprint of di? erent individuals match, we call it a false accept or if it rejects them, it is true reject. False Accept Rate ( far-off) and False eliminate Rate (FRR) are the error rates which are used to express matching trustability. FAR is de? ned by the formula 60 CHAPTER 8. EXPERIMENTAL ANALYSIS Table 8. 5 Time taken for Classi? cation Image Average Total Taken Time(sec) Time(sec) Original 0. 5233 69. 07 Enhanced 0. 8891 117. 36 Table 8. Time taken for Enrolling No. of Storage Ave rage Total Images Type Time(sec) Time(hrs) 294 MS Access DB 24. 55 2. 046 60 MS Access DB 29. 37 0. 49 150 TXT ? les 15. 06 1. 255 F AR = FA ? 100, N (8. 1) FA = Number of False Accepts, N = Total number of veri? cations FRR is de? ned by the formula FR ? 100, N F RR = (8. 2) FR = Number of False Rejects. FAR and FRR calculated over six templates of Veri? nger DB are shown in table 8. 8. This process took around 7 hours. 8. 6. 2 Identi? cation Results and Comparison with Other Matching techniques Fingerprint identi? cation is the process of identifying a query ? gerprint from a set of enrolled ? ngerprints. Identi? cation is usually a slow-moving process because we have to search over a large database. soon we match minutiae set of query ? ngerprint with the minutiae sets of enrolled ? ngerprints. In this project, we store key in the database at the time of enrolling. This key as explained in sec 5. 3 helps in 8. 6. MATCHING Table 8. 7 Error Rates FAR FRR 4. 56 12. 5 14. 72 4. 0 2 61 Figure 8. 12 Graph Time taken for Identi? cation vs Size of Database(key based one to many identi? cation) reducing matching time over non-matching ? ngerprints. For non-matching enrolled ? gerprints, we dont perform full matching, instead a key matching. Among one or many keys which matched in one iteration of one to many matching, we allow full minutiae set matching. Then if any full matching succeeds, we perform post matching steps. This identi? cation scheme has lesser time complexity as compared to conventional n2 one to one identi? cation. Identi? cation results are shown in table 8. 9. The graph of time versus N is shown in ? gure 8. 13. Here N is the index of ? ngerprint to be identi? ed from a set of enrolled ? ngerprints. Size of database of enrolled ? ngerprints was 150. So N can vary from