Search Results for author: Brittany Terese Fasy

Found 10 papers, 3 papers with code

Rapid and Precise Topological Comparison with Merge Tree Neural Networks

no code implementations8 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.

The Manifold Density Function: An Intrinsic Method for the Validation of Manifold Learning

no code implementations14 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.

Visualizing Topological Importance: A Class-Driven Approach

no code implementations22 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.

Feature Importance

A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clustering

no code implementations25 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.

Data Visualization Generative Adversarial Network

Functional Summaries of Persistence Diagrams

1 code implementation4 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

Introduction to the R package TDA

2 code implementations7 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

Subsampling Methods for Persistent Homology

no code implementations7 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

Stochastic Convergence of Persistence Landscapes and Silhouettes

no code implementations2 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

On the Bootstrap for Persistence Diagrams and Landscapes

1 code implementation2 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

Confidence sets for persistence diagrams

no code implementations28 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.