RETRIEVAL OF NOISY FINGERPRINT PATTERNS USING METRIC ATTRACTOR NETWORKS

Abstract

This work experimentally analyzes the learning and retrieval capabilities of the diluted metric attractor neural network when applied to collections of fingerprint images. The computational cost of the network decreases with the dilution, so we can increase the region of interest to cover almost the complete fingerprint. The network retrieval was successfully tested for different noisy configurations of the fingerprints, and proved to be robust with a large basin of attraction. We showed that network topologies with a 2D-Grid arrangement adapt better to the fingerprints spatial structure, outperforming the typical 1D-Ring configuration. An optimal ratio of local connections to random shortcuts that better represent the intrinsic spatial structure of the fingerprints was found, and its influence on the retrieval quality was characterized in a phase diagram. Since the present model is a set of nonlinear equations, it is possible to go beyond the naïve static solution (consisting in matching two fingerprints using a fixed distance threshold value), and a crossing evolution of similarities was shown, leading to the retrieval of the right fingerprint from an apparently more distant candidate. This feature could be very useful for fingerprint verification to discriminate between fingerprints pairs.