Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Vidal, Jules"'
This paper presents a computational framework for the Principal Geodesic Analysis of merge trees (MT-PGA), a novel adaptation of the celebrated Principal Component Analysis (PCA) framework [87] to the Wasserstein metric space of merge trees [92]. We
Externí odkaz:
http://arxiv.org/abs/2207.10960
This paper introduces an efficient algorithm for persistence diagram computation, given an input piecewise linear scalar field $f$ defined on a $d$-dimensional simplicial complex $K$, with $d \leq 3$. Our work revisits the seminal algorithm "PairSimp
Externí odkaz:
http://arxiv.org/abs/2206.13932
Autor:
Brown, Nick, Nash, Rupert, Poletti, Piero, Guzzetta, Giorgio, Manica, Mattia, Zardini, Agnese, Flatken, Markus, Vidal, Jules, Gueunet, Charles, Belikov, Evgenij, Tierny, Julien, Podobas, Artur, Der Chien, Wei, Markidis, Stefano, Gerndt, Andreas
It is estimated that around 80\% of the world's population live in areas susceptible to at-least one major vector borne disease, and approximately 20% of global communicable diseases are spread by mosquitoes. Furthermore, the outbreaks of such diseas
Externí odkaz:
http://arxiv.org/abs/2111.05654
Autor:
Vidal, Jules, Tierny, Julien
This paper presents an algorithm for the efficient approximation of the saddle-extremum persistence diagram of a scalar field. Vidal et al. introduced recently a fast algorithm for such an approximation (by interrupting a progressive computation fram
Externí odkaz:
http://arxiv.org/abs/2108.05766
This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [106] and introduce a new metric, called the Wasserstein distance between merg
Externí odkaz:
http://arxiv.org/abs/2107.07789
This paper introduces progressive algorithms for the topological analysis of scalar data. Our approach is based on a hierarchical representation of the input data and the fast identification of topologically invariant vertices, which are vertices tha
Externí odkaz:
http://arxiv.org/abs/2007.14766
In urgent decision making applications, ensemble simulations are an important way to determine different outcome scenarios based on currently available data. In this paper, we will analyze the output of ensemble simulations by considering so-called p
Externí odkaz:
http://arxiv.org/abs/1910.08398
This paper presents an efficient algorithm for the progressive approximation of Wasserstein barycenters of persistence diagrams, with applications to the visual analysis of ensemble data. Given a set of scalar fields, our approach enables the computa
Externí odkaz:
http://arxiv.org/abs/1907.04565
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.