Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/93558
Full metadata record
DC FieldValueLanguage
dc.date.accessioned2022-04-13T05:35:23Z-
dc.date.available2022-04-13T05:35:23Z-
dc.date.issued2006-
dc.identifier.citationPsaila, M. (2006). Fingerprint identification using Delaunay triangulations (Bachelor's dissertation).en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar/handle/123456789/93558-
dc.descriptionB.Sc. IT (Hons)(Melit.)en_GB
dc.description.abstractAlthough not scientifically proven, it is strongly believed that fingerprints are unique and so fingerprint recognition is one of the most popular and reliable biometric identification technique. Fingerprint identification systems are negatively affected by noise and image transformations which reduce the number of common characteristics of the matching fingerprints, making it more difficult to identify a matching pair. Our aim is to propose a new fingerprint representation and matching techniques resistant to noise and trans formations. The objective is to implement and test one of the proposed techniques to perform evaluation and draw conclusions. This dissertation includes a detailed analysis of the existing fingerprint techniques which helped to familiarise with conventional fingerprint systems, image enhancement practices and other existing technologies. We propose three new fingerprint matching techniques. The first one is a graph matching technique similar to graph isomorphism which can tolerate certain discrepancies. The second technique is based on building a common Delaunay triangulation set. Finally the third technique relies on topological representations including both minutiae and ridge structure and interprets fingerprints as graphs with the use of ridge counts as an alternative distance unit. The original idea was to apply Delaunay triangulations on fingerprint minutiae to obtain planar graph representations which allow the use of linear time graph isomorphism algorithms. However it was observed that this approach did not work out because the Delaunay triangulations matching fingerprints were not identical. The third alternative proposed techniques, based on Delaunay triangulations was developed and tested and the results obtained are very promising. This proofs that the adopted technique is capable to identify fingerprints. When tested on a sample of 200 fingerprints from the standard NIST Special Database 4 it classified 80% of the fingerprints in the best 30 identifications.en_GB
dc.language.isoenen_GB
dc.rightsinfo:eu-repo/semantics/restrictedAccessen_GB
dc.subjectFingerprintsen_GB
dc.subjectIdentificationen_GB
dc.subjectElectronic data processingen_GB
dc.titleFingerprint identification using Delaunay triangulationsen_GB
dc.typebachelorThesisen_GB
dc.rights.holderThe copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.en_GB
dc.publisher.institutionUniversity of Maltaen_GB
dc.publisher.departmentFaculty of Information and Communication Technology. Department of Computer Scienceen_GB
dc.description.reviewedN/Aen_GB
dc.contributor.creatorPsaila, Mario (2006)-
Appears in Collections:Dissertations - FacICT - 1999-2009
Dissertations - FacICTCS - 1999-2007

Files in This Item:
File Description SizeFormat 
B.SC.(HONS)IT_Psaila_Mario_2006.PDF
  Restricted Access
10.12 MBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.