Fingerprint Verification Using Spectral Minutiae Representations

Most fingerprint recognition systems are based on the use of a minutiae set, which is an unordered collection of minutiae locations and orientations suffering from various deformations such as translation, rotation, and scaling. The spectral minutiae representation introduced in this paper is a novel method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. These characteristics enable the combination of fingerprint recognition systems with template protection schemes that require a fixed-length feature vector. This paper introduces the concept of algorithms for two representation methods: the location-based spectral minutiae representation and the orientation-based spectral minutiae representation. Both algorithms are evaluated using two correlation-based spectral minutiae matching algorithms. We present the performance of our algorithms on three fingerprint databases. We also show how the performance can be improved by using a fusion scheme and singular points

Likelihood-Ratio-Based Biometric Verification

The paper presents results on optimal similarity measures for biometric verification based on fixed-length feature vectors. First, we show that the verification of a single user is equivalent to the detection problem, which implies that, for single-user verification, the likelihood ratio is optimal. Second, we show that, under some general conditions, decisions based on posterior probabilities and likelihood ratios are equivalent and result in the same receiver operating curve. However, in a multi-user situation, these two methods lead to different average error rates. As a third result, we prove theoretically that, for multi-user verification, the use of the likelihood ratio is optimal in terms of average error rates. The superiority of this method is illustrated by experiments in fingerprint verification. It is shown that error rates below 10/sup -3/ can be achieved when using multiple fingerprints for template construction

Surface Networks

We study data-driven representations for three-dimensional triangle meshes, which are one of the prevalent objects used to represent 3D geometry. Recent works have developed models that exploit the intrinsic geometry of manifolds and graphs, namely the Graph Neural Networks (GNNs) and its spectral variants, which learn from the local metric tensor via the Laplacian operator. Despite offering excellent sample complexity and built-in invariances, intrinsic geometry alone is invariant to isometric deformations, making it unsuitable for many applications. To overcome this limitation, we propose several upgrades to GNNs to leverage extrinsic differential geometry properties of three-dimensional surfaces, increasing its modeling power. In particular, we propose to exploit the Dirac operator, whose spectrum detects principal curvature directions --- this is in stark contrast with the classical Laplace operator, which directly measures mean curvature. We coin the resulting models \emph{Surface Networks (SN)}. We prove that these models define shape representations that are stable to deformation and to discretization, and we demonstrate the efficiency and versatility of SNs on two challenging tasks: temporal prediction of mesh deformations under non-linear dynamics and generative models using a variational autoencoder framework with encoders/decoders given by SNs

Development modeling methods of analysis and synthesis of fingerprint deformations images

The current study is to develop modeling methods, Analysis and synthesis of fingerprints deformations images and their application in problems of automatic fingerprint identification. In the introduction justified urgency of the problem, is given a brief description of thematic publications. In this study will review of modern technologies of biometric technologies and methods of biometric identification, the review of fingerprint identification systems, investigate for distorting factors. The influence of deformations is singled out, the causes of deformation of fingerprints are analyzed. The review of modern ways of the account and modeling of deformations in problems of automatic fingerprint identification is given. The scientific novelty of the work is the development of information technologies for the analysis and synthesis of deformations of fingerprint images. The practical value of the work in the application of the developed methods, algorithms and information technologies in fingerprints identification systems. In addition, it has been found that our paper "devoted to research methods and synthesis of the fingerprint deformations" is a more appropriate choice than other papers

Additivity of Quadrupole Moments in Superdeformed Bands: Single-Particle Motion at Extreme Conditions

Quadrupole and hexadecapole moments of superdeformed bands in the $A$$\sim$150 mass region have been analyzed in the cranking Skyrme-Hartree-Fock model. It is demonstrated that, independently of the intrinsic configuration and of the proton and neutron numbers, the charge moments calculated with respect to the doubly-magic superdeformed core of $^{152}$Dy can be expressed very precisely in terms of independent contributions from the individual hole and particle orbitals. This result, together with earlier studies of the moments of inertia distributions, suggests that many features of the superdeformed bands in the $A$$\sim$150 mass region can be very well understood in terms of an almost undisturbed single-particle motion.Comment: 10 RevTeX pages, 1 uuencoded POSTSCRIPT figure include