Andrew K. Hrechak
Bio: Andrew K. Hrechak is an academic researcher from New Jersey Institute of Technology. The author has contributed to research in topics: Fingerprint recognition & Automation. The author has an hindex of 2, co-authored 2 publications receiving 252 citations.
TL;DR: This study will describe a structural model of fingerprints, based on local structural relations among features, and an associated automated recognition system which addresses the limitations of existing fingerprint models.
Abstract: Automated fingerprint recognition has received considerable attention over the past decade. Progress has been made on models of the structure of fingerprints, techniques for the acquisition of prints, and the development of commercial automated fingerprint recognition systems. Despite these advances, there remain considerable opportunities for improvement. The speed of retrieval, and the ability to recognize partial or distorted prints are prominent among those areas that require improvement. This study will describe a structural model of fingerprints, based on local structural relations among features, and an associated automated recognition system which addresses the limitations of existing fingerprint models.
01 Jan 1988
TL;DR: A filter-based fingerprint matching algorithm which uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length FingerCode and is able to achieve a verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms published in the open literature.
Abstract: Biometrics-based verification, especially fingerprint-based identification, is receiving a lot of attention. There are two major shortcomings of the traditional approaches to fingerprint representation. For a considerable fraction of population, the representations based on explicit detection of complete ridge structures in the fingerprint are difficult to extract automatically. The widely used minutiae-based representation does not utilize a significant component of the rich discriminatory information available in the fingerprints. Local ridge structures cannot be completely characterized by minutiae. Further, minutiae-based matching has difficulty in quickly matching two fingerprint images containing a different number of unregistered minutiae points. The proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean distance between the two corresponding FingerCodes and hence is extremely fast. We are able to achieve a verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms published in the open literature. Our system performs better than a state-of-the-art minutiae-based system when the performance requirement of the application system does not demand a very low false acceptance rate. Finally, we show that the matching performance can be improved by combining the decisions of the matchers based on complementary (minutiae-based and filter-based) fingerprint information.
TL;DR: This work presents a high-level categorization of the various vulnerabilities of a biometric system and discusses countermeasures that have been proposed to address these vulnerabilities.
Abstract: Biometric recognition offers a reliable solution to the problem of user authentication in identity management systems. With the widespread deployment of biometric systems in various applications, there are increasing concerns about the security and privacy of biometric technology. Public acceptance of biometrics technology will depend on the ability of system designers to demonstrate that these systems are robust, have low error rates, and are tamper proof. We present a high-level categorization of the various vulnerabilities of a biometric system and discuss countermeasures that have been proposed to address these vulnerabilities. In particular, we focus on biometric template security which is an important issue because, unlike passwords and tokens, compromised biometric templates cannot be revoked and reissued. Protecting the template is a challenging task due to intrauser variability in the acquired biometric traits. We present an overview of various biometric template protection schemes and discuss their advantages and limitations in terms of security, revocability, and impact on matching accuracy. A template protection scheme with provable security and acceptable recognition performance has thus far remained elusive. Development of such a scheme is crucial as biometric systems are beginning to proliferate into the core physical and information infrastructure of our society.
••01 Sep 1997
TL;DR: The design and implementation of a prototype automatic identity-authentication system that uses fingerprints to authenticate the identity of an individual is described and an improved minutiae-extraction algorithm is developed that is faster and more accurate than the earlier algorithm.
Abstract: Fingerprint verification is an important biometric technique for personal identification. We describe the design and implementation of a prototype automatic identity-authentication system that uses fingerprints to authenticate the identity of an individual. We have developed an improved minutiae-extraction algorithm that is faster and more accurate than our earlier algorithm (1995). An alignment-based minutiae-matching algorithm has been proposed. This algorithm is capable of finding the correspondences between input minutiae and the stored template without resorting to exhaustive search and has the ability to compensate adaptively for the nonlinear deformations and inexact transformations between an input and a template. To establish an objective assessment of our system, both the Michigan State University and the National Institute of Standards and Technology NIST 9 fingerprint data bases have been used to estimate the performance numbers. The experimental results reveal that our system can achieve a good performance on these data bases. We also have demonstrated that our system satisfies the response-time requirement. A complete authentication procedure, on average, takes about 1.4 seconds on a Sun ULTRA I workstation (it is expected to run as fast or faster on a 200 HMz Pentium).
TL;DR: The Minutia Cylinder-Code is introduced, a novel representation based on 3D data structures (called cylinders), built from minutiae distances and angles and the feasibility of obtaining a very effective fingerprint recognition implementation for light architectures is demonstrated.
Abstract: In this paper, we introduce the Minutia Cylinder-Code (MCC): a novel representation based on 3D data structures (called cylinders), built from minutiae distances and angles. The cylinders can be created starting from a subset of the mandatory features (minutiae position and direction) defined by standards like ISO/IEC 19794-2 (2005). Thanks to the cylinder invariance, fixed-length, and bit-oriented coding, some simple but very effective metrics can be defined to compute local similarities and to consolidate them into a global score. Extensive experiments over FVC2006 databases prove the superiority of MCC with respect to three well-known techniques and demonstrate the feasibility of obtaining a very effective (and interoperable) fingerprint recognition implementation for light architectures.
••01 Sep 2000
TL;DR: The proposed minutiae matching scheme is suitable for an online processing due to its high processing speed and experimental results show the performance of the proposed technique.
Abstract: Proposes a fingerprint minutia matching technique, which matches the fingerprint minutiae by using both the local and global structures of minutiae. The local structure of a minutia describes a rotation and translation invariant feature of the minutia in its neighborhood. It is used to find the correspondence of two minutiae sets and increase the reliability of the global matching. The global structure of minutiae reliably determines the uniqueness of fingerprint. Therefore, the local and global structures of minutiae together provide a solid basis for reliable and robust minutiae matching. The proposed minutiae matching scheme is suitable for an online processing due to its high processing speed. Experimental results show the performance of the proposed technique.