3 resultados para Universality

em Cochin University of Science


Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper is a review of the work done on the dynamics of modulated logistic systems. Three different problems are treated, viz, the modulated logistic map, the parametrically perturbed logistic map and the combination map obtained by combining two maps of the quadratic family. Many of the interesting features displayed by these systems are discussed.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This is a sequel to our earlier work on the modulated logistic map. Here, we first show that the map comes under the universality class of Feigenbaum. We then give evidence for the fact that our model can generate strange attractors in the unit square for an uncountable number of parameter values in the range μ∞<μ<1. Numerical plots of the attractor for several values of μ are given and the self-similar structure is explicity shown in one case. The fractal and information dimensions of the attractors for many values of μ are shown to be greater than one and the variation in their structure is analysed using the two Lyapunov exponents of the system. Our results suggest that the map can be considered as an analogue of the logistic map in two dimensions and may be useful in describing certain higher dimensional chaotic phenomena.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Biometrics deals with the physiological and behavioral characteristics of an individual to establish identity. Fingerprint based authentication is the most advanced biometric authentication technology. The minutiae based fingerprint identification method offer reasonable identification rate. The feature minutiae map consists of about 70-100 minutia points and matching accuracy is dropping down while the size of database is growing up. Hence it is inevitable to make the size of the fingerprint feature code to be as smaller as possible so that identification may be much easier. In this research, a novel global singularity based fingerprint representation is proposed. Fingerprint baseline, which is the line between distal and intermediate phalangeal joint line in the fingerprint, is taken as the reference line. A polygon is formed with the singularities and the fingerprint baseline. The feature vectors are the polygonal angle, sides, area, type and the ridge counts in between the singularities. 100% recognition rate is achieved in this method. The method is compared with the conventional minutiae based recognition method in terms of computation time, receiver operator characteristics (ROC) and the feature vector length. Speech is a behavioural biometric modality and can be used for identification of a speaker. In this work, MFCC of text dependant speeches are computed and clustered using k-means algorithm. A backpropagation based Artificial Neural Network is trained to identify the clustered speech code. The performance of the neural network classifier is compared with the VQ based Euclidean minimum classifier. Biometric systems that use a single modality are usually affected by problems like noisy sensor data, non-universality and/or lack of distinctiveness of the biometric trait, unacceptable error rates, and spoof attacks. Multifinger feature level fusion based fingerprint recognition is developed and the performances are measured in terms of the ROC curve. Score level fusion of fingerprint and speech based recognition system is done and 100% accuracy is achieved for a considerable range of matching threshold