http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Pair Wise Distance Histogram Based Fingerprint Minutiae Matching Algorithm
니라즈 샤르마 동서대학교 디자인&IT전문대학원 2008 국내석사
Existing security measures rely on knowledge-based approaches like passwords or token-based approaches such as swipe cards and passports to control access to physical and virtual spaces. Though ubiquitous, such methods are not very secure. Tokens such as badges and access cards may be shared or stolen. Furthermore, they cannot differentiate between authorized user and a person having access to the tokens or passwords. Biometrics such as fingerprint, face and voice print offers means of reliable personal authentication that can address these problems and is gaining citizen and government acceptance. Fingerprints were one of the first forms of biometric authentication to be used for law enforcement and civilian applications. Contrary to popular belief and despite decades of research in fingerprints, reliable fingerprint recognition is still an open problem. In this thesis, we present a specific contribution to advance the state of the art in this field. Here, we introduced a randomized algorithm which utilizes pair wise distances between the pairs of minutiae, as a basic feature for match. The method undergoes two steps for completion i.e. first it performs the matching locally then global matching parameters are calculated in second step. In local matching step, Wamelen’s approach for calculating “k” nearest neighbors has been taken in reference. The global matching parameters are computed by a statistics approach of iteration method finally. Proposed method is robust to common problems that fingerprint matching faces, such as scaling, rotation, translational changes and missing points etc. The algorithm has been examined over various randomly generated minutiae and real fingerprints as well. The results of tests resemble that the method is faster and accurate than many conventional methods.