11 resultados para Map-matching
em Cochin University of Science
Resumo:
This thesis is a study of discrete nonlinear systems represented by one dimensional mappings.As one dimensional interative maps represent Poincarre sections of higher dimensional flows,they offer a convenient means to understand the dynamical evolution of many physical systems.It highlighting the basic ideas of deterministic chaos.Qualitative and quantitative measures for the detection and characterization of chaos in nonlinear systems are discussed.Some simple mathematical models exhibiting chaos are presented.The bifurcation scenario and the possible routes to chaos are explained.It present the results of the numerical computational of the Lyapunov exponents (λ) of one dimensional maps.This thesis focuses on the results obtained by our investigations on combinations maps,scaling behaviour of the Lyapunov characteristic exponents of one dimensional maps and the nature of bifurcations in a discontinous logistic map.It gives a review of the major routes to chaos in dissipative systems,namely, Period-doubling ,Intermittency and Crises.This study gives a theoretical understanding of the route to chaos in discontinous systems.A detailed analysis of the dynamics of a discontinous logistic map is carried out, both analytically and numerically ,to understand the route it follows to chaos.The present analysis deals only with the case of the discontinuity parameter applied to the right half of the interval of mapping.A detailed analysis for the n –furcations of various periodicities can be made and a more general theory for the map with discontinuities applied at different positions can be on a similar footing
Resumo:
Usage of a dielectric multilayer around a dielectric Sample is studied as a means for improving the efficiency in multimode microwave- heating cavities. The results show that by using additional dielectric constant layers the appearance of undesired reflections at the sample-air interface is avoided and higher power -absorption rates within the sample and high -efficiency designs are obtained
Resumo:
We present the analytical investigations on a logistic map with a discontinuity at the centre. An explanation for the bifurcation phenomenon in discontinuous systems is presented. We establish that whenever the elements of an n-cycle (n > 1) approach the discontinuities of the nth iterate of the map, a bifurcation other than the usual period-doubling one takes place. The periods of the cycles decrease in an arithmetic progression, as the control parameter is varied. The system also shows the presence of multiple attractors. Our results are verified by numerical experiments as well.
Resumo:
We consider the stability properties of spatial and temporal periodic orbits of one-dimensional coupled-map lattices. The stability matrices for them are of the block-circulant form. This helps us to reduce the problem of stability of spatially periodic orbits to the smaller orbits corresponding to the building blocks of spatial periodicity, enabling us to obtain the conditions for stability in terms of those for smaller orbits.
Resumo:
By introducing a periodic perturbation in the control parameter of the logistic map we have investigated the period locking properties of the map. The map then gets locked onto the periodicity of the perturbation for a wide range of values of the parameter and hence can lead to a control of the chaotic regime. This parametrically perturbed map exhibits many other interesting features like the presence of bubble structures, repeated reappearance of periodic cycles beyond the chaotic regime, dependence of the escape parameter on the seed value and also on the initial phase of the perturbation etc.
Resumo:
We have studied the bifurcation structure of the logistic map with a time dependant control parameter. By introducing a specific nonlinear variation for the parameter, we show that the bifurcation structure is modified qualitatively as well as quantitatively from the first bifurcation onwards. We have also computed the two Lyapunov exponents of the system and find that the modulated logistic map is less chaotic compared to the logistic map.
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.
Resumo:
We analyse numerically the bifurcation structure of a two-dimensional noninvertible map and show that different periodic cycles are arranged in it exactly in the same order as in the case of the logistic map. We also show that this map satisfies the general criteria for the existence of Sarkovskii ordering, which supports our numerical result. Incidently, this is the first report of the existence of Sarkovskii ordering in a two-dimensional map.
Resumo:
We study the period-doubling bifurcations to chaos in a logistic map with a nonlinearly modulated parameter and show that the bifurcation structure is modified significantly. Using the renormalisation method due to Derrida et al. we establish the universal behaviour of the system at the onset of chaos.
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
Resumo:
This paper proposes a content based image retrieval (CBIR) system using the local colour and texture features of selected image sub-blocks and global colour and shape features of the image. The image sub-blocks are roughly identified by segmenting the image into partitions of different configuration, finding the edge density in each partition using edge thresholding, morphological dilation. The colour and texture features of the identified regions are computed from the histograms of the quantized HSV colour space and Gray Level Co- occurrence Matrix (GLCM) respectively. A combined colour and texture feature vector is computed for each region. The shape features are computed from the Edge Histogram Descriptor (EHD). A modified Integrated Region Matching (IRM) algorithm is used for finding the minimum distance between the sub-blocks of the query and target image. Experimental results show that the proposed method provides better retrieving result than retrieval using some of the existing methods