Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/92798
Title: | Iris recognition for person identification |
Authors: | Plaehn, Lukas (2013) |
Keywords: | Biometric identification Algorithms MATLAB |
Issue Date: | 2013 |
Citation: | Plaehn, L. (2013). Iris recognition for person identification (Bachelor's dissertation). |
Abstract: | Security has always been an important issue. It has developed drastically over the years and today there is a sector of security, known as 'Biometrics', which deals with identifying a person though unique personal traits, through methods such as: Facial Recognition, Fingerprint Recognition, Retina Scanning, Hand Geometry, Signature Dynamics, Speaker Verification, Palm print and Hand Vein. All of the methods are good, but some perform better than others in certain situations. The reliability and effectiveness of a system depends on how it is implemented and for which reason. Iris recognition for example has the lowest error rate when compared to all other biometric systems due to the large number of degrees of freedom it has. Iris recognition systems implemented in the market all use the method John G. Daugman developed and his algorithms. This involves a process of obtaining the image, image segmentation, image normalization, data extraction, template comparisons. This thesis will aim to emulate Daugman's Algorithms through MATLAB, by using some of Daugman's algorithms together with other more time efficient methods and comparing results at the end. |
Description: | B.SC.(HONS)COMPUTER ENG. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/92798 |
Appears in Collections: | Dissertations - FacICT - 2013 Dissertations - FacICTCCE - 1999-2013 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
B.SC.(HONS)ICT_Plaehn_Lukas_2013.PDF Restricted Access | 3.76 MB | Adobe PDF | View/Open Request a copy | |
Plaehn_Lukas_acc.material.pdf Restricted Access | 64.46 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.