Spectral representation of fingerprints

Most fingerprint recognition systems are based on the use of a minutiae set, which is an unordered collection of minutiae locations and directions 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 a template protection scheme, which requires a fixed-length feature vector. This paper introduces the idea and algorithm of spectral minutiae representation. A correlation based spectral minutiae\ud matching algorithm is presented and evaluated. The scheme shows a promising result, with an equal error rate of 0.2% on manually extracted minutiae

How hard is the euro area core? A wavelet analysis of growth cycles in Germany, France and Italy

Using recent advances in time-varying spectral methods, this research analyses the growth cycles of the core of the euro area in terms of frequency content and phasing of cycles. The methodology uses the continuous wavelet transform (CWT) and also Hilbert wavelet pairs in the setting of a non-decimated discrete wavelet transform in order to analyse bivariate time series in terms of conventional frequency domain measures from spectral analysis. The findings are that coherence and phasing between the three core members of the euro area (France, Germany and Italy) have increased since the launch of the euro

On the Typical Spectral Shape of an Economic Variable

In a classic article, Granger (1966) asserted that most economic time series measured in level have spectra that exhibit a smooth declining shape with considerable power at very low frequencies. There has been no systematic attempt to examine Granger,s assertion with international data. We estimate output level spectra for 58 countries, divided into developed, high-income developing, and low-income developing groups. We find the shapes of the estimated spectra to be strikingly similar to Granger"s typical shape, particularly for the developed countries.Spectral Analysis, Spectral Shape, Output Level, OECD, Developing Countries.

Geometric deep learning: going beyond Euclidean data

Many scientific fields study data with an underlying structure that is a non-Euclidean space. Some examples include social networks in computational social sciences, sensor networks in communications, functional networks in brain imaging, regulatory networks in genetics, and meshed surfaces in computer graphics. In many applications, such geometric data are large and complex (in the case of social networks, on the scale of billions), and are natural targets for machine learning techniques. In particular, we would like to use deep neural networks, which have recently proven to be powerful tools for a broad range of problems from computer vision, natural language processing, and audio analysis. However, these tools have been most successful on data with an underlying Euclidean or grid-like structure, and in cases where the invariances of these structures are built into networks used to model them. Geometric deep learning is an umbrella term for emerging techniques attempting to generalize (structured) deep neural models to non-Euclidean domains such as graphs and manifolds. The purpose of this paper is to overview different examples of geometric deep learning problems and present available solutions, key difficulties, applications, and future research directions in this nascent field