A real-time matching system for large fingerprint databases

Abstract

Abstract-With the current rapid growth in multimedia technology, there is an imminent need for efficient techniclues to search and query large image databases. Because of their unique and peculiar needs, image databases cannot be treated iri a similar fashion to other types of digital libraries. The contextual dependencies present in images, and the complex nature of two-dimensional image data make the representation issues more difficult for image databases. An invariant representation of an image is still an open research issue. For these reasons, it is difficult to find a universal content-based retrieval technique. Current approaches based on shape, texture, and color for indexing image databases have met with limited success. Further, these techniques have not been adequately tested in the presence of noise and distortions. A given application domain offers stronger constraints for improving the retrieval performance. Fingerprint databases are characterized by their large size as well as noisy and distorted query images.Distortions are very common in fingerprint images due to elasticity of the skin. In this paper, a method of indexincl large fingerprint image databases is presented. The approach integrates a number of domain-specific high-level features such as pattern class and ridge density at higher levels of the search. At the lowest level, it incorporates elastic structural feature-based matching for indexing the database. With a multilevel indexing approach, we have been able to reduce the search space. The search engine has also been implemented on Splash 2-a field programmable gate array (FPGA)-based array processor to obtain near-,4SIC level speed of matching. Our approach has been tested on a locally collected test data and on NIST-9, a large fingerprint database available in the public domain. index Terms-Image database, fingerprint matching, minutiae points, image registration, indexing, field programmable gate array.

An asymmetric fingerprint matching algorithm for Java Card TM

“…The Hough transform-based approach is quite popular for resolving the fingerprint match: the transformation parameters space, which can relate two sets of points, is firstly discretized, then the correct parameters can be derived by accumulating evidences in this space, and, finally the most ''voted'' transformation will be chosen [11]. The use of an algebraic technique for point pattern matching is, instead, described in [12].…”

Generation of Reliable PINs from Fingerprints

“…Fingerprint is the most widely used biometric authentication technology [3], [7]. A human fingerprint contains a rather smooth flow of ridges.…”

Feature Extraction Using a Chaincoded Contour Representation of Fingerprint Images

“…Feature (minutiae) extraction is a key step in accurate functioning of any AFIS. Due to imperfections of the image acquisition process, minutiae extraction methods are prone to missing some real minutiae while picking up spurious points (artifacts) [3,8]. Image imperfections can also cause errors in determining the location coordinates of the true minutiae and their relative orientation in the image.…”