SOCR APS Apr 2023 ILT Shen

From SOCR
Revision as of 07:28, 27 April 2023 by Dinov (talk | contribs) (Paper & Slidedeck)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

SOCR News & Events: Numerical Methods and Analysis for Computing Forward and Inverse Laplace Transform For discrete and continuous signals

Presenter

Yueyang Shen (University of Michigan, SOCR, BIDS-TP).
Yueyang Shen is a PhD candidate in the Department of Computational Medicine and Bioinformatics and enrolled as Trainee in the Biomedical Informatics and Data Science Program at the University of Michigan.
Milen V. Velev (BTU)
Ivo D. Dinov (Michigan)

Session Logistics

Abstract

Specialized data maps transforming (probabilistic) state representations mapping the original signal representation into a more manipulatable state space capitalizes on contemporary computational advances and relates to well-known application scenarios, such as kernel machines, MDP transition dynamics modeling and policy optimization, and generative modeling. In this work we focus on the classic example of Laplace transform, which maps the subspace of differential equations to the space of algebraic equations, where the differential equation solution can be obtained by inverting the algebraic equation solution. Effective integral transformations enable simplification of mathematical modeling and computational inference. The Laplace transform (LT) with its inverse (ILT) represents a family of integral transforms that have direct applications in contemporary data science, statistical inference, and probabilistic modeling. However, practical computational challenges inhibit their utilization on complex or implicit functions, noisy observations, and incomplete data.
We propose a numerical LT-ILT computing framework, empirically robust, implemented in R, and facilitates numerical computations through appropriate parameter estimations and signal approximations. We illustrate an idealized analysis relaxing the data matrix construction assumptions to bound the smallest singular values to argue algorithmic stability according to theoretical results in random matrix theory.


Paper & Slidedeck

Slidedeck Version 1
Slidedeck Version 2

Example: Time-series to Kime-surface Mapping

The first animation shows a spatially-extended time-series wave, whereas the second animation illustrates the corresponding kime-surface obtained via the Laplace transform (LT). More details are available on the TCIU/Spacekime analytics website.

Spacekime/TCIU Project
Spacekime/TCIU Project

Background

References




Translate this page:

(default)
Uk flag.gif

Deutsch
De flag.gif

Español
Es flag.gif

Français
Fr flag.gif

Italiano
It flag.gif

Português
Pt flag.gif

日本語
Jp flag.gif

България
Bg flag.gif

الامارات العربية المتحدة
Ae flag.gif

Suomi
Fi flag.gif

इस भाषा में
In flag.gif

Norge
No flag.png

한국어
Kr flag.gif

中文
Cn flag.gif

繁体中文
Cn flag.gif

Русский
Ru flag.gif

Nederlands
Nl flag.gif

Ελληνικά
Gr flag.gif

Hrvatska
Hr flag.gif

Česká republika
Cz flag.gif

Danmark
Dk flag.gif

Polska
Pl flag.png

România
Ro flag.png

Sverige
Se flag.gif