L'objet de cette thèse est l'étude de l'option américaine dans un modèle exponentiel de Lévy général. Dans le premier chapitre nous étudions la continuité des réduites dans le cadre des processus de Markov de Feller. Ensuite, nous introduisons les processus de Lévy multidimensionnels et nous montrons la continuité des réduites associées à ceux-ci. Dans le deuxième chapitre, nous clarifions les propriétés basiques de la frontière libre du put américain dans un modèle exponentiel de Lévy général avec dividendes. Nous commençons par caractériser le prix de l'option américaine comme l'unique solution d'une inéquation variationnelle au sens des distributions. Ce qui nous permettra de montrer la continuité de la frontière libre et de donner une caractérisation explicite de la limite du prix critique près de l'échéance. Dans le troisième chapitre, nous étudions la continuité de la dérivée de la fonction valeur du put américain à horizon fini et du put perpétuel. Nous donnons des conditions nécessaires et d'autres suffisantes pour la vérification du principe de smooth-fit. Dans le quatrième chapitre, nous étudions la vitesse de convergence du prix critique vers sa limite à l'échéance dans le cadre d'un modèle exponentiel de Lévy, dans le cas de diffusion avec sauts, puis dans le cas d'un processus de Lévy sans partie Brownienne. Après, nous donnons cette vitesse dans le cas où le terme de diffusion est absent. Enfin, dans le dernier chapitre, nous introduisons deux méthodes numériques pour le calcul des prix des options américaines : la méthode de l'arbre multinomial et celle des différences finies. Nous comparons les deux approches et nous améliorons la convergence de la première dans certains modèles exponentiels de Lévy / Pas de résumé en anglais

No description available.

L'iris est considérée comme une des modalités les plus robustes et les plus performantes en biométrie à cause de ses faibles taux d'erreurs. Ces performances ont été observées dans des situations contrôlées, qui imposent des contraintes lors de l'acquisition pour l'obtention d'images de bonne qualité. Relâcher ces contraintes, au moins partiellement, implique des dégradations de la qualité des images acquises et par conséquent une réduction des performances de ces systèmes. Une des principales solutions proposées dans la littérature pour remédier à ces limites est d'améliorer l'étape de segmentation de l'iris. L'objectif principal de ce travail de thèse a été de proposer des méthodes originales pour la segmentation des images dégradées de l'iris. Les chaînes de Markov ont été déjà proposées dans la littérature pour résoudre des problèmes de segmentation d'images. Dans ce cadre, une étude de faisabilité d'une segmentation non supervisée des images dégradées d'iris en régions par les chaînes de Markov a été réalisée, en vue d'une future application en temps réel. Différentes transformations de l'image et différentes méthodes de segmentation grossière pour l'initialisation des paramètres ont été étudiées et comparées. Les modélisations optimales ont été introduites dans un système de reconnaissance de l'iris (avec des images en niveaux de gris) afin de produire une comparaison avec les méthodes existantes. Finalement une extension de la modélisation basée sur les chaînes de Markov cachées, pour une segmentation non supervisée des images d'iris acquises en visible, a été mise en place / Iris is considered as one of the most robust and efficient modalities in biometrics because of its low error rates. These performances were observed in controlled situations, which impose constraints during the acquisition in order to have good quality images. The renouncement of these constraints, at least partially, implies degradations in the quality of the acquired images and it is therefore a degradation of these systems’ performances. One of the main proposed solutions in the literature to take into account these limits is to propose a robust approach for iris segmentation. The main objective of this thesis is to propose original methods for the segmentation of degraded images of the iris. Markov chains have been well solicited to solve image segmentation problems. In this context, a feasibility study of unsupervised segmentation into regions of degraded iris images by Markov chains was performed. Different image transformations and different segmentation methods for parameters initialization have been studied and compared. Optimal modeling has been inserted in iris recognition system (with grayscale images) to produce a comparison with the existing methods. Finally, an extension of the modeling based on the hidden Markov chains has been developed in order to realize an unsupervised segmentation of the iris images acquired in visible light

Les modélisations par chaînes de Markov cachées permettent de résoudre un grand nombre de problèmes inverses se posant en traitement d’images ou de signaux. En particulier, le problème de segmentation figure parmi les problèmes où ces modèles ont été le plus sollicités. Selon ces modèles, la donnée observable est considérée comme une version bruitée de la segmentation recherchée qui peut être modélisée à travers une chaîne de Markov à états finis. Des techniques bayésiennes permettent ensuite d’estimer cette segmentation même dans le contexte non-supervisé grâce à des algorithmes qui permettent d’estimer les paramètres du modèle à partir de l’observation seule. Les chaînes de Markov cachées ont été ultérieurement généralisées aux chaînes de Markov couples et triplets, lesquelles offrent plus de possibilités de modélisation tout en présentant des complexités de calcul comparables, permettant ainsi de relever certains défis que les modélisations classiques ne supportent pas. Un lien intéressant a également été établi entre les modèles de Markov triplets et la théorie de l’évidence de Dempster-Shafer, ce qui confère à ces modèles la possibilité de mieux modéliser les données multi-senseurs. Ainsi, dans cette thèse, nous abordons trois difficultés qui posent problèmes aux modèles classiques : la non-stationnarité du processus caché et/ou du bruit, la corrélation du bruit et la multitude de sources de données. Dans ce cadre, nous proposons des modélisations originales fondées sur la très riche théorie des chaînes de Markov triplets. Dans un premier temps, nous introduisons les chaînes de Markov à bruit M-stationnaires qui tiennent compte de l’aspect hétérogène des distributions de bruit s’inspirant des chaînes de Markov cachées M-stationnaires. Les chaînes de Markov cachée ML-stationnaires, quant à elles, considèrent à la fois la loi a priori et les densités de bruit non-stationnaires. Dans un second temps, nous définissons deux types de chaînes de Markov couples non-stationnaires. Dans le cadre bayésien, nous introduisons les chaînes de Markov couples M-stationnaires puis les chaînes de Markov couples MM-stationnaires qui considèrent la donnée stationnaire par morceau. Dans le cadre évidentiel, nous définissons les chaînes de Markov couples évidentielles modélisant l’hétérogénéité du processus caché par une fonction de masse. Enfin, nous présentons les chaînes de Markov multi-senseurs non-stationnaires où la fusion de Dempster-Shafer est employée à la fois pour modéliser la non-stationnarité des données (à l’instar des chaînes de Markov évidentielles cachées) et pour fusionner les informations provenant des différents senseurs (comme dans les champs de Markov multi-senseurs). Pour chacune des modélisations proposées, nous décrivons les techniques de segmentation et d’estimation des paramètres associées. L’intérêt de chacune des modélisations par rapport aux modélisations classiques est ensuite démontré à travers des expériences menées sur des données synthétiques et réelles / Hidden Markov chains (HMCs) based approaches have been shown to be efficient to resolve a wide range of inverse problems occurring in image and signal processing. In particular, unsupervised segmentation of data is one of these problems where HMCs have been extensively applied. According to such models, the observed data are considered as a noised version of the requested segmentation that can be modeled through a finite Markov chain. Then, Bayesian techniques such as MPM can be applied to estimate this segmentation even in unsupervised way thanks to some algorithms that make it possible to estimate the model parameters from the only observed data. HMCs have then been generalized to pairwise Markov chains (PMCs) and triplet Markov chains (TMCs), which offer more modeling possibilities while showing comparable computational complexities, and thus, allow to consider some challenging situations that the conventional HMCs cannot support. An interesting link has also been established between the Dempster-Shafer theory of evidence and TMCs, which give to these latter the ability to handle multisensor data. Hence, in this thesis, we deal with three challenging difficulties that conventional HMCs cannot handle: nonstationarity of the a priori and/or noise distributions, noise correlation, multisensor information fusion. For this purpose, we propose some original models in accordance with the rich theory of TMCs. First, we introduce the M-stationary noise- HMC (also called jumping noise- HMC) that takes into account the nonstationary aspect of the noise distributions in an analogous manner with the switching-HMCs. Afterward, ML-stationary HMC consider nonstationarity of both the a priori and/or noise distributions. Second, we tackle the problem of non-stationary PMCs in two ways. In the Bayesian context, we define the M-stationary PMC and the MM-stationary PMC (also called switching PMCs) that partition the data into M stationary segments. In the evidential context, we propose the evidential PMC in which the realization of the hidden process is modeled through a mass function. Finally, we introduce the multisensor nonstationary HMCs in which the Dempster-Shafer fusion has been used on one hand, to model the data nonstationarity (as done in the hidden evidential Markov chains) and on the other hand, to fuse the information provided by the different sensors (as in the multisensor hidden Markov fields context). For each of the proposed models, we describe the associated segmentation and parameters estimation procedures. The interest of each model is also assessed, with respect to the former ones, through experiments conducted on synthetic and real data

Esta dissertação aborda o problema de redução do consumo de combustível para veículos. Com esse objetivo, realiza-se o levantamento de um modelo estocástico e de seus parâmetros, o desenvolvimento de um controlador para o veículo, e análise dos resultados. O problema considera a interação com o trânsito de outros veículos, que limita a aplicação de resultados antes disponíveis. Para isto, propõe-se modelar a dinâmica do problema de maneira aproximada, usando sistemas com saltos markovianos, e levantar as probabilidades de transição dos estados da cadeia através de um modelo mais completo para o trânsito no percurso. / This dissertation deals with control of vehicles aiming at the fuel consumption optimization, taking into account the interference of traffic. Stochastic interferences like this and other real world phenomena prevents us from directly applying available results. We propose to employ a relatively simple system with Markov jumping parameters as a model for the vehicle subject to traffic interference, and to obtain the transition probabilities from a separate model for the traffic. This dissertation presents the model identification, the solution of the new problem using dynamic programming, and simulation of the obtained control.

Thèse de doctorat : Traitement des images : Nice : 2002. / Bibliogr. p. 137-142. Résumés en français et en anglais.

Estimation of the number of hidden states is challenging in hidden Markov models. Motivated by the analysis of a specific type of cell adhesion experiments, a new frame-work based on hidden Markov model and double penalized order selection is proposed. The order selection procedure is shown to be consistent in estimating the number of states. A modified Expectation-Maximization algorithm is introduced to efficiently estimate parameters in the model. Simulations show that the proposed framework outperforms existing methods. Applications of the proposed methodology to real data demonstrate the accuracy of estimating receptor-ligand bond lifetimes and waiting times which are essential in kinetic parameter estimation. The second part of the thesis is concerned with prediction of a deterministic response function y at some untried sites given values of y at a chosen set of design sites. The intended application is to computer experiments in which y is the output from a computer simulation and each design site represents a particular configuration of the input variables. A Bayesian version of the cubic spline method commonly used in numerical analysis is proposed, in which the random function that represents prior uncertainty about y is taken to be a specific stationary Gaussian process. An MCMC procedure is given for updating the prior given the observed y values. Simulation examples and a real data application are given to compare the performance of the Bayesian cubic spline with that of two existing methods.

In recent times, credit risk analysis has grown to become one of the most important problems dealt with in the mathematical finance literature. Fundamentally, the problem deals with estimating the probability that an obligor defaults on their debt in a certain time. To obtain such a probability, several methods have been developed which are regulated by the Basel Accord. This establishes a legal framework for dealing with credit and market risks, and empowers banks to perform their own methodologies according to their interests under certain criteria. Credit risk analysis is founded on the rating system, which is an assessment of the capability of an obligor to make its payments in full and on time, in order to estimate risks and make the investor decisions easier.Credit risk models can be classified into several different categories. In structural form models (SFM), that are founded on the Black & Scholes theory for option pricing and the Merton model, it is assumed that default occurs if a firm's market value is lower than a threshold, most often its liabilities. The problem is that this is clearly is an unrealistic assumption. The factors models (FM) attempt to predict the random default time by assuming a hazard rate based on latent exogenous and endogenous variables. Reduced form models (RFM) mainly focus on the accuracy of the probability of default (PD), to such an extent that it is given more importance than an intuitive economical interpretation. Portfolio reduced form models (PRFM) belong to the RFM family, and were developed to overcome the SFM's difficulties.Most of these models are based on the assumption of having an underlying Markovian process, either in discrete or continuous time. For a discrete process, the main information is containted in a transition matrix, from which we obtain migration probabilities. However, according to previous analysis, it has been found that this approach contains embedding problems. The continuous time Markov process (CTMP) has its main information contained in a matrix Q of constant instantaneous transition rates between states. Both approaches assume that the future depends only on the present, though previous empirical analysis has proved that the probability of changing rating depends on the time a firm maintains the same rating. In order to face this difficulty we approach the PD with the continuous time semi-Markov process (CTSMP), which relaxes the exponential waiting time distribution assumption of the Markovian analogue.In this work we have relaxed the constant transition rate assumption and assumed that it depends on the residence time, thus we have derived CTSMP forward integral and differential equations respectively and the corresponding equations for the particular cases of exponential, gamma and power law waiting time distributions, we have also obtained a numerical solution of the migration probability by the Monte Carlo Method and compared the results with the Markovian models in discrete and continuous time respectively, and the discrete time semi-Markov process. We have focused on firms from U.S.A. and Canada classified as financial sector according to Global Industry Classification Standard and we have concluded that the gamma and Weibull distribution are the best adjustment models.

Esta dissertação aborda o problema de redução do consumo de combustível para veículos. Com esse objetivo, realiza-se o levantamento de um modelo estocástico e de seus parâmetros, o desenvolvimento de um controlador para o veículo, e análise dos resultados. O problema considera a interação com o trânsito de outros veículos, que limita a aplicação de resultados antes disponíveis. Para isto, propõe-se modelar a dinâmica do problema de maneira aproximada, usando sistemas com saltos markovianos, e levantar as probabilidades de transição dos estados da cadeia através de um modelo mais completo para o trânsito no percurso. / This dissertation deals with control of vehicles aiming at the fuel consumption optimization, taking into account the interference of traffic. Stochastic interferences like this and other real world phenomena prevents us from directly applying available results. We propose to employ a relatively simple system with Markov jumping parameters as a model for the vehicle subject to traffic interference, and to obtain the transition probabilities from a separate model for the traffic. This dissertation presents the model identification, the solution of the new problem using dynamic programming, and simulation of the obtained control.

This study attempts to improve forecasts of solar energy production (SEP), so that energy trading companies can propose more accurate bids to Nord Pool. The aim ismake solar energy a more lucrative business, and therefore lead to more investments in this green energy form. The model that is introduced is a hidden Markov model (HMM) that we call a Time-dynamic Markov-chain (TDMC). The TDMC is presented in general, but applied to the energy sector SE4 in south of Sweden. A simple linear regression model is used to compare with the performance of the TDMC model. Regarding the mean absolute error (MAE) and the root-mean-square error (RMSE), the TDMC model outperforms a simple linear regression; both when the training data is relatively fresh and also when the training data has not been updated in over 300 days. A paired t-test also shows a non-significant deviation from the true SEP per day, at the 0.05 significance level, when simulating the first two months of 2023 with the TDMC model. The simple linear regression model, however, shows a significant difference from reality, in comparison.