A Fast Large Scale Iris Database Classification with Optimum-Path Forest Technique: A Case Study

Majority of biometric researchers focus on the accuracy of matching using biometrics databases, including iris databases, while the scalability and speed issues have been neglected. In the applications such as identification in airports and borders, it is critical for the identification system to have low-time response. In this paper, a graph-based framework for pattern recognition, called Optimum-Path Forest (OPF), is utilized as a classifier in a pre-developed iris recognition system. The aim of this paper is to verify the effectiveness of OPF in the field of iris recognition, and its performance for various scale iris databases. This paper investigates several classifiers, which are widely used in iris recognition papers, and the response time along with accuracy. The existing Gauss-Laguerre Wavelet based iris coding scheme, which shows perfect discrimination with rotary Hamming distance classifier, is used for iris coding. The performance of classifiers is compared using small, medium, and large scale databases. Such comparison shows that OPF has faster response for large scale database, thus performing better than more accurate but slower Bayesian classifier.

Higher order turän inequalities

The celebrated Turân inequalities P 2 n(x)-P n-x(x)P n+1(x) ≥ 0, x ε[-1,1], n ≥ 1, where P n(x) denotes the Legendre polynomial of degree n, are extended to inequalities for sums of products of four classical orthogonal polynomials. The proof is based on an extension of the inequalities γ 2 n - γ n-1γ n+1 ≥ 0, n ≥ 1, which hold for the Maclaurin coefficients of the real entire function ψ in the Laguerre-Pölya class, ψ(x) = ∑ ∞ n=0 γ nx n / n!. ©1998 American Mathematical Society.

Landau and Kolmogoroff type polynomial inequalities II

Let 0 < j < m ≤ n. Kolmogoroff type inequalities of the form ∥f(j)∥2 ≤ A∥f(m)∥ 2 + B∥f∥2 which hold for algebraic polynomials of degree n are established. Here the norm is defined by ∫ f2(x)dμ(x), where dμ(x) is any distribution associated with the Jacobi, Laguerre or Bessel orthogonal polynomials. In particular we characterize completely the positive constants A and B, for which the Landau weighted polynomial inequalities ∥f′∥ 2 ≤ A∥f″∥2 + B∥f∥ 2 hold. © Dynamic Publishers, Inc.

Sharp Turán inequalities via very hyperbolic polynomials

We present new sharp inequalities for the Maclaurin coefficients of an entire function from the Laguerre-Pólya class. They are obtained by a new technique involving the so-called very hyperbolic polynomials. The results may be considered as extensions of the classical Turán inequalities. © 2010 Elsevier Inc.

Perturbations on the antidiagonals of Hankel matrices

Given a strongly regular Hankel matrix, and its associated sequence of moments which defines a quasi-definite moment linear functional, we study the perturbation of a fixed moment, i.e., a perturbation of one antidiagonal of the Hankel matrix. We define a linear functional whose action results in such a perturbation and establish necessary and sufficient conditions in order to preserve the quasi-definite character. A relation between the corresponding sequences of orthogonal polynomials is obtained, as well as the asymptotic behavior of their zeros. We also study the invariance of the Laguerre-Hahn class of linear functionals under such perturbation, and determine its relation with the so-called canonical linear spectral transformations. © 2013 Elsevier Ltd. All rights reserved.

O oscilador de Morse forçado e a influência do dipolo permanente na dissociação molecular

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Polinômios ortogonais e L-ortogonais associados a medidas relacionadas

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Zeros de Polinômios Ortogonais Gerados por uma Medida Perturbada

Pós-graduação em Matematica Aplicada e Computacional - FCT

Quasi-exactly-solvable confining solutions for spin-1 and spin-0 bosons in (1+1)-dimensions with a scalar linear potential

We point out a misleading treatment in the recent literature regarding confining solutions for a scalar potential in the context of the Duffin-Kemmer-Petiau theory. We further present the proper bound-state solutions in terms of the generalized Laguerre polynomials and show that the eigenvalues and eigenfunctions depend on the solutions of algebraic equations involving the potential parameter and the quantum number. (C) 2014 Elsevier Inc. All rights reserved.

Schur-Szegö composition of entire functions

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Higher order turán inequalities for the Riemann ξ-function

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Regra de Sinais de Descartes para polinômios ortogonais

Pós-graduação em Matematica Aplicada e Computacional - FCT

A moment symbolic representation of Lévy processes with applications

By using a symbolic method, known in the literature as the classical umbral calculus, a symbolic representation of Lévy processes is given and a new family of time-space harmonic polynomials with respect to such processes, which includes and generalizes the exponential complete Bell polynomials, is introduced. The usefulness of time-space harmonic polynomials with respect to Lévy processes is that it is a martingale the stochastic process obtained by replacing the indeterminate x of the polynomials with a Lévy process, whereas the Lévy process does not necessarily have this property. Therefore to find such polynomials could be particularly meaningful for applications. This new family includes Hermite polynomials, time-space harmonic with respect to Brownian motion, Poisson-Charlier polynomials with respect to Poisson processes, Laguerre and actuarial polynomials with respect to Gamma processes , Meixner polynomials of the first kind with respect to Pascal processes, Euler, Bernoulli, Krawtchuk, and pseudo-Narumi polynomials with respect to suitable random walks. The role played by cumulants is stressed and brought to the light, either in the symbolic representation of Lévy processes and their infinite divisibility property, either in the generalization, via umbral Kailath-Segall formula, of the well-known formulae giving elementary symmetric polynomials in terms of power sum symmetric polynomials. The expression of the family of time-space harmonic polynomials here introduced has some connections with the so-called moment representation of various families of multivariate polynomials. Such moment representation has been studied here for the first time in connection with the time-space harmonic property with respect to suitable symbolic multivariate Lévy processes. In particular, multivariate Hermite polynomials and their properties have been studied in connection with a symbolic version of the multivariate Brownian motion, while multivariate Bernoulli and Euler polynomials are represented as powers of multivariate polynomials which are time-space harmonic with respect to suitable multivariate Lévy processes.

Orthogonal gamma-based expansions for volatility option prices under jump-diffusion dynamics

In my work I derive closed-form pricing formulas for volatility based options by suitably approximating the volatility process risk-neutral density function. I exploit and adapt the idea, which stands behind popular techniques already employed in the context of equity options such as Edgeworth and Gram-Charlier expansions, of approximating the underlying process as a sum of some particular polynomials weighted by a kernel, which is typically a Gaussian distribution. I propose instead a Gamma kernel to adapt the methodology to the context of volatility options. VIX vanilla options closed-form pricing formulas are derived and their accuracy is tested for the Heston model (1993) as well as for the jump-diffusion SVJJ model proposed by Duffie et al. (2000).

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )