no code implementations • 8 Apr 2024 • Yu Qin, Brittany Terese Fasy, Carola Wenk, Brian Summa
Merge trees are a valuable tool in the scientific visualization of scalar fields; however, current methods for merge tree comparisons are computationally expensive, primarily due to the exhaustive matching between tree nodes.
no code implementations • 14 Feb 2024 • Benjamin Holmgren, Eli Quist, Jordan Schupbach, Brittany Terese Fasy, Bastian Rieck
We introduce the manifold density function, which is an intrinsic method to validate manifold learning techniques.
no code implementations • 22 Sep 2023 • Yu Qin, Brittany Terese Fasy, Carola Wenk, Brian Summa
This paper presents the first approach to visualize the importance of topological features that define classes of data.
no code implementations • 25 May 2021 • Yu Qin, Brittany Terese Fasy, Carola Wenk, Brian Summa
In this paper, we propose a persistence diagram hashing framework that learns a binary code representation of persistence diagrams, which allows for fast computation of distances.
1 code implementation • 4 Apr 2018 • Eric Berry, Yen-Chi Chen, Jessi Cisewski-Kehe, Brittany Terese Fasy
First, we review the various functional summaries in the literature and propose a unified framework for the functional summaries.
Methodology
2 code implementations • 7 Nov 2014 • Brittany Terese Fasy, Jisu Kim, Fabrizio Lecci, Clément Maria
The salient topological features of the sublevel sets (or superlevel sets) of these functions can be quantified with persistent homology.
Mathematical Software Computational Geometry Computation
no code implementations • 7 Jun 2014 • Frédéric Chazal, Brittany Terese Fasy, Fabrizio Lecci, Bertrand Michel, Alessandro Rinaldo, Larry Wasserman
Persistent homology is a multiscale method for analyzing the shape of sets and functions from point cloud data arising from an unknown distribution supported on those sets.
Algebraic Topology Computational Geometry Applications
no code implementations • 2 Dec 2013 • Frédéric Chazal, Brittany Terese Fasy, Fabrizio Lecci, Alessandro Rinaldo, Larry Wasserman
Persistent homology is a widely used tool in Topological Data Analysis that encodes multiscale topological information as a multi-set of points in the plane called a persistence diagram.
Statistics Theory Computational Geometry Algebraic Topology Statistics Theory
1 code implementation • 2 Nov 2013 • Frédéric Chazal, Brittany Terese Fasy, Fabrizio Lecci, Alessandro Rinaldo, Aarti Singh, Larry Wasserman
Persistent homology probes topological properties from point clouds and functions.
Algebraic Topology Computational Geometry Applications
no code implementations • 28 Mar 2013 • Brittany Terese Fasy, Fabrizio Lecci, Alessandro Rinaldo, Larry Wasserman, Sivaraman Balakrishnan, Aarti Singh
Persistent homology is a method for probing topological properties of point clouds and functions.