• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Optimal mass transport: a viable alternative to copulas in financial risk modeling? / Optimal masstransport som ett alternativ till copulas i finansiell riskmodellering

Orrenius, Johan January 2018 (has links)
Copulas as a description of joint probability distributions is today common when modeling financial risk. The optimal mass transport problem also describes dependence structures, although it is not well explored. This thesis explores the dependence structures of the entropy regularized optimal mass transport problem. The basic copula properties are replicated for the optimal mass transport problem. The estimation of the parameters of the optimal mass transport problem is attempted using a maximum likelihood analogy, but only successful when observing the general tendencies on a grid of the parameters. / Copulas som en beskrivning av simultanfördelning är idag en vanlig modell för finansiell risk. Optimala masstransport problemet beskriver också simultant beroende mellan fördelningar, även om det är mindre undersökt. Denna uppsats undersöker beroendestrukturer av det entropiregulariserade optimala masstransport problemet. De basala egenskaperna hos copulas är replikerade för det optimala masstransport problemet. Ett försök att skatta parametrarna i det optimala masstransport problemet görs med en maximum-likelihood liknande metod, men är endast framgångsrik i att uppsakata de generella tendenserna på en grid av parametrarna.
2

Efficient numerical method for solution of L² optimal mass transport problem

Rehman, Tauseef ur 11 January 2010 (has links)
In this thesis, a novel and efficient numerical method is presented for the computation of the L² optimal mass transport mapping in two and three dimensions. The method uses a direct variational approach. A new projection to the constraint technique has been formulated that can yield a good starting point for the method as well as a second order accurate discretization to the problem. The numerical experiments demonstrate that the algorithm yields accurate results in a relatively small number of iterations that are mesh independent. In the first part of the thesis, the theory and implementation details of the proposed method are presented. These include the reformulation of the Monge-Kantorovich problem using a variational approach and then using a consistent discretization in conjunction with the "discretize-then-optimize" approach to solve the resulting discrete system of differential equations. Advanced numerical methods such as multigrid and adaptive mesh refinement have been employed to solve the linear systems in practical time for even 3D applications. In the second part, the methods efficacy is shown via application to various image processing tasks. These include image registration and morphing. Application of (OMT) to registration is presented in the context of medical imaging and in particular image guided therapy where registration is used to align multiple data sets with each other and with the patient. It is shown that an elastic warping methodology based on the notion of mass transport is quite natural for several medical imaging applications where density can be a key measure of similarity between different data sets e.g. proton density based imagery provided by MR. An application is also presented of the two dimensional optimal mass transport algorithm to compute diffeomorphic correspondence maps between curves for geometric interpolation in an active contour based visual tracking application.

Page generated in 0.0938 seconds