Persistence curves: a canonical framework for summarizing persistence diagrams
This paper is concerned with topological summaries of persistence diagrams obtained from the computation of persistent homology (PH). PH extracts topological information from a dataset by tracking the changes in topological features over some varying parameter; these informations are then stored as a persistence diagram (PD). However, as would be required by machine learning algorithms, the PD space is not a Hilbert space. Thus, researchers propose various methods to map PD into a Hilbert space, a step which is known as summarizing PDs resulting in topological summaries. There are two techniques employed for summarizing PDs, namely kernel functions and PD vectorization. In this paper, the latter technique is chosen to propose a unifying framework of vectorizing PDs called persistence curves (PC). Once the PC framework is established, the authors show how PC suits existing PH summaries. For clarity, the authors show the following PD summaries by means of PC: lifespan curve, life entropy curve, PD thresholding, persistence landscape, persistence silhouette and Euler characteristics curve. In the context of stability analysis, Theorem 1 is constructed which can be used to any specific PC, except for persistence landscape. Using this theorem, stability analysis is performed for numerous PCs, for example, lifespan PC is reported to be conditionally stable with respect to Wasserstein distance (\(W_1\)) and unstable under bottleneck distance (\(W_{\infty}\)). In order to achieve a stable persistence summary, the authors propose two variations of PCs called normalized and entropy-based persistence curves. With lifespan PC as an example, they show that normalized lifespan PC is stable under \(W_1\) and conditionally stable under \(W_{\infty} \). This finding leads to another question: will a PC become stable under normalization? The authors propose three conditions in order for a PC to be stable after normalization, with caveat it is conditionally stable prior normalization. In a similar fashion, they show that a life entropy curve is conditionally stable with respect to \(W_1\) and \(W_{\infty}\). The Python implementation of PC is readily available in Github: \url{https://github.com/azlawson/PersistenceCurves} Next, they authors discuss the computational efficiency, efficacy and experimental stability of the proposed PCs using two applications: parameter determination for a discrete dynamical system and image texture classification. The comparisons among random forest classification results by PCs and other TDA methods are also included. The numerical experiments suggest that the stability and classification performance might not be highly correlated. For example, persistence landscape (which has proven to be stable) rather underperformed as compared to Betti curve and persistence statistics. Under the influence of Gaussian noise, persistence image outperformed the rest of PCs, whereas persistence statistics underperformed. In the final section, the authors warn the users by showing two distinct images producing similar PDs, which in turn will result in similar PCs. In addition, they note to choose suitable vector size for retaining the information of the input. They also suggest normalized life curve for practical application based on its performance, stability and computational efficiency.
- Functional summaries of persistence diagrams
- Generalized persistence diagrams
- On approximations of persistence diagrams
- Modelling persistence diagrams with planar point processes, and revealing topology with bagplots
- Persistent homology -- a survey
- Embeddings of persistence diagrams into Hilbert spaces
- Comparison of persistence diagrams
- Describing topology on the set of persistence diagrams
- Universality of persistence diagrams and the bottleneck and Wasserstein distances
- Efficient and robust persistent homology for measures
- \textit{giotto-tda}: a topological data analysis toolkit for machine learning and data exploration
- A Klein-bottle-based dictionary for texture representation
- A new entropy based summary function for topological data analysis
- Computational homology
- Computational topology. An introduction
- Computer Vision - ECCV 2004
- Computing persistent homology
- Coverage in sensor networks via persistent homology
- Embeddings of persistence diagrams into Hilbert spaces
- Functional summaries of persistence diagrams
- Gabor analysis and algorithms. Theory and applications
- scientific article; zbMATH DE number 41767 (Why is no real title available?)
- scientific article; zbMATH DE number 7559221 (Why is no real title available?)
- Lipschitz functions have \(L_{p}\)-stable persistence
- Persistence images: a stable vector representation of persistent homology
- Persistent homology of collaboration networks
- Persistent homology transform for modeling shapes and surfaces
- Probability measures on the space of persistence diagrams
- Same but different: distance correlations between topological summaries
- Scikit-learn: machine learning in Python
- Stability of persistence diagrams
- Statistical topological data analysis using persistence landscapes
- Stochastic convergence of persistence landscapes and silhouettes
- The persistence landscape and some of its properties
- The space of persistence diagrams fails to have Yu's property A
- Topological fidelity and image thresholding: a persistent homology approach
- Topological machine learning with persistence indicator functions
- Topological persistence and simplification
- Topological spaces of persistence modules and their properties
- Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport
- PersistenceCurves
- Persistence diagrams with linear machine learning models
- Continuation of point clouds via persistence diagrams
- A random persistence diagram generator
- A new non-Archimedean metric on persistent homology
- Instability of the Betti sequence for persistent homology and a stabilized version of the Betti sequence
- Geometry Helps to Compare Persistence Diagrams
- Persistence images: a stable vector representation of persistent homology
- Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space
- Approximating continuous functions on persistence diagrams using template functions
- Signatures, Lipschitz-Free Spaces, and Paths of Persistence Diagrams
- Bootstrapping persistent Betti numbers and other stabilizing statistics
- Detecting bifurcations in dynamical systems with CROCKER plots
- A topological data analysis based classifier
- Vector summaries of persistence diagrams for permutation-based hypothesis testing
- A topological approach for capturing high-order interactions in graph data with applications to anomaly detection in time-varying cryptocurrency transaction graphs
- Euler characteristic surfaces: a stable multiscale topological summary of time series data
- Coarse embeddability of Wasserstein space and the space of persistence diagrams
- Topological signatures of periodic-like signals
Uses Software
This page was built for publication: Persistence curves: a canonical framework for summarizing persistence diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667927)
