Please use this identifier to cite or link to this item:
Title: Fingerprint minutiae matching algorithm sorted regional information gradient approach
Authors: Usman, Nazir
Department: Department of Computer Science
Issue Date: 2005
Award: Won the Third Prize (Undergraduate Section) in the IEEE Hong Kong Section Paper Contest 2004.
Supervisor: Dr. Choy, Marian
Type: Article
Abstract: This paper presents a non-core based fingerprint minutiae matching algorithm that has been implemented and tested in simulation. Fingerprint matching is the decision making part of a fingerprint identification system and thus it must be reliable and efficient enough to be used in a real-time application. A non-core based fingerprint minutiae matching algorithm is used because it eliminates the strenuous process of aligning the fingerprints to be matched, does not run the risk of selecting a false core point and carries the potential to cater for almost all the inconsistencies in the representation of the fingerprint data. The algorithm presented in this project takes care of most of these inconsistencies: translation, rotation, missing points, additional points and noise. The algorithm presented is tested to be reliable and the computational complexity of the algorithm is O(n2k) that makes it very desirable to be used in real-time fingerprint matching applications.
Appears in Collections:Student Works With External Awards

Files in This Item:
File Description SizeFormat 
award_news.html152 BHTMLView/Open
award_winning_work.html154 BHTMLView/Open

Items in Digital CityU Collections are protected by copyright, with all rights reserved, unless otherwise indicated.