# Browsing by Subject "Persistent homology"

###### Results Per Page

###### Sort Options

Item Open Access AN APPLICATION OF GRAPH DIFFUSION FOR GESTURE CLASSIFICATION(2020) Voisin, Perry SamuelReliable and widely available robotic prostheses have long been a dream of science fiction writers and researchers alike. The problem of sufficiently generalizable gesture recognition algorithms and technology remains a barrier to these ambitions despite numerous advances in computer science, engineering, and machine learning. Often the failure of a particular algorithm to generalize to the population at large is due to superficial characteristics of subjects in the training data set. These superficial characteristics are captured and integrated into the signal intended to capture the gesture being performed. This work applies methods developed in computer vision

and graph theory to the problem of identifying pertinent features in a set of time series modalities.

Item Open Access Applications of Persistent Homology to Time Varying Systems(2013) Munch, ElizabethThis dissertation extends the theory of persistent homology to time varying systems. Most of the previous work has been dedicated to using this powerful tool in topological data analysis to study static point clouds. In particular, given a point cloud, we can construct its persistence diagram. Since the diagram varies continuously as the point cloud varies continuously, we study the space of time varying persistence diagrams, called vineyards when they were introduced by Cohen-Steiner, Edelsbrunner, and Morozov.

We will first show that with a good choice of metric, these vineyards are stable for small perturbations of their associated point clouds. We will also define a new mean for a set of persistence diagrams based on the work of Mileyko et al. which, unlike the previously defined mean, is continuous for geodesic vineyards.

Next, we study the sensor network problem posed by Ghrist and de Silva, and their application of persistent homology to understand when a set of sensors covers a given region. Giving each of these sensors a probability of failure over time, we show that an exact computation of the probability of failure of the whole system is NP-hard, but give an algorithm which can predict failure in the case of a monitored system.

Finally, we apply these methods to an automated system which can cluster agents moving in aerial images by their behaviors. We build a data structure for storing and querying the information in real-time, and define behavior vectors which quantify behaviors of interest. This clustering by behavior can be used to find groups of interest, for which we can also quantify behaviors in order to determine whether the group is working together to achieve a common goal, and we speculate that this work can be extended to improving tracking algorithms as well as behavioral predictors.

Item Open Access Homological Illusions of Persistence and Stability(2008-08-04) Morozov, DmitriyIn this thesis we explore and extend the theory of persistent homology, which captures topological features of a function by pairing its critical values. The result is represented by a collection of points in the extended plane called persistence diagram.

We start with the question of ridding the function of topological noise as suggested by its persistence diagram. We give an algorithm for hierarchically finding such epsilon-simplifications on 2-manifolds as well as answer the question of when it is impossible to simplify a function in higher dimensions.

We continue by examining time-varying functions. The original algorithm computes the persistence pairing from an ordering of the simplices in a triangulation and takes worst-case time cubic in the number of simplices. We describe how to maintain the pairing in linear time per transposition of consecutive simplices. A side effect of the update algorithm is an elementary proof of the stability of persistence diagrams. We introduce a parametrized family of persistence diagrams called persistence vineyards and illustrate the concept with a vineyard describing a folding of a small peptide. We also base a simple algorithm to compute the rank invariant of a collection of functions on the update procedure.

Guided by the desire to reconstruct stratified spaces from noisy samples, we use the vineyard of the distance function restricted to a 1-parameter family of neighborhoods of a point to assess the local homology of a sampled stratified space at that point. We prove the correctness of this assessment under the assumption of a sufficiently dense sample. We also give an algorithm that constructs the vineyard and makes the local assessment in time at most cubic in the size of the Delaunay triangulation of the point sample.

Finally, to refine the measurement of local homology the thesis extends the notion of persistent homology to sequences of kernels, images, and cokernels of maps induced by inclusions in a filtration of pairs of spaces. Specifically, we note that persistence in this context is well defined, we prove that the persistence diagrams are stable, and we explain how to compute them. Additionally, we use image persistence to cope with functions on noisy domains.

Item Open Access Invariants and Metrics for Multiparameter Persistent Homology(2019) Thomas, AshleighThis dissertation is about building fundamental techniques for comparing data via a geometric and topological data analysis method called multiparameter persistent homology. The techniques used are largely algebraic. A new summary statistic, called the multirank function, is introduced as a measure of persistence output that detects relationships between important features of the data being analyzed. Also introduced is a technique for modifying existing metrics on the space of persistence outputs. Existing metrics can return infinite distances, which do not give as much information as a finite distance; the proposed modification gives fewer such situations. The final chapter of this dissertation details work in a long-term biology research project. Persistence is used to study the relationship between continuous morphological variation and rates of topologically abnormal morphologies in populations of fruit flies. Some preliminary computations showing proof of concept are included. Future plans involve using theoretical contributions from this dissertation for final analysis of the fly data.

The distance modification is joint work with Ezra Miller and the biology application is joint with Surabhi Beriwal, Ezra Miller, and biologists at the Houle Lab at Florida State University.

Item Open Access Persistent Cohomology Operations(2011) HB, Aubrey RaeThe work presented in this dissertation includes the study of cohomology and cohomological operations within the framework of Persistence. Although Persistence was originally defined for homology, recent research has developed persistent approaches to other algebraic topology invariants. The work in this document extends the field of persistence to include cohomology classes, cohomology operations and characteristic classes.

By starting with presenting a combinatorial formula to compute the Stiefel-Whitney homology class, we set up the groundwork for Persistent Characteristic Classes. To discuss persistence for the more general cohomology classes, we construct an algorithm that allows us to find the Poincar'{e} Dual to a homology class. Then, we develop two algorithms that compute persistent cohomology, the general case and one for a specific cohomology class. We follow this with defining and composing an algorithm for extended persistent cohomology.

In addition, we construct an algorithm for determining when a cohomology class is decomposible and compose it in the context of persistence. Lastly, we provide a proof for a concise formula for the first Steenrod Square of a given cohomology class and then develop an algorithm to determine when a cohomology class is a Steenrod Square of a lower dimensional cohomology class.

Item Open Access Persistent Homology Analysis of Brain Artery Trees.(Ann Appl Stat) Bendich, P; Marron, JS; Miller, E; Pieloch, A; Skwerer, SNew representations of tree-structured data objects, using ideas from topological data analysis, enable improved statistical analyses of a population of brain artery trees. A number of representations of each data tree arise from persistence diagrams that quantify branching and looping of vessels at multiple scales. Novel approaches to the statistical analysis, through various summaries of the persistence diagrams, lead to heightened correlations with covariates such as age and sex, relative to earlier analyses of this data set. The correlation with age continues to be significant even after controlling for correlations from earlier significant summaries.Item Open Access Statistical analysis of fruit fly wing vein topology(2018-04) Beriwal, SurabhiThe fruit fly Drosophila melanogaster is a commonly used model organism for evolution given that the species showcases interesting behaviors and is easy to modify and rear. Among other things, the Drosophila wings are studied because their structure is tractable, consistent, and traceable developmentally. Along with Dr. Ezra Miller and Ashleigh Thomas, I studied evolutionary changes to Drosophila melanogaster wings using persistent homology. The biological hypothesis posits that selecting for continuous wing deformation leads to higher rates of topological novelty. We are interested in understanding whether selection on a continuous trait can itself cause higher rates of variation of a (separate) discrete trait. We work joint with Dr. David Houle at Florida State University.