• Corpus ID: 237563000

A computationally efficient framework for vector representation of persistence diagrams

  title={A computationally efficient framework for vector representation of persistence diagrams},
  author={Kit C. Chan and Umar Islambekov and A. V. Luchinsky and Rebecca Sanders},
In Topological Data Analysis, a common way of quantifying the shape of data is to use a persistence diagram (PD). PDs are multisets of points in R computed using tools of algebraic topology. However, this multi-set structure limits the utility of PDs in applications. Therefore, in recent years efforts have been directed towards extracting informative and efficient summaries from PDs to broaden the scope of their use for machine learning tasks. We propose a computationally efficient framework to… 


Persistence Curves: A canonical framework for summarizing persistence diagrams
This paper develops a general and unifying framework of vectorizing diagrams that it is shown that several well-known summaries, such as Persistence Landscapes, fall under the PC framework, and proposes several new summaries based on PC framework that provide a theoretical foundation for their stability analysis.
Functional summaries of persistence diagrams
The definition of persistence landscape functions is generalized, several theoretical properties of the persistence functional summaries are established, and their performance in the context of classification using simulated prostate cancer histology data is demonstrated.
Persistence Images: A Stable Vector Representation of Persistent Homology
This work converts a PD to a finite-dimensional vector representation which it is called a persistence image, and proves the stability of this transformation with respect to small perturbations in the inputs.
Topological Machine Learning with Persistence Indicator Functions
This paper presents persistence indicator functions (PIFs), which summarize persistence diagrams, i.e., feature descriptors in topological data analysis, and demonstrates their usage in common data analysis scenarios, such as confidence set estimation and classification of complex structured data.
Statistical topological data analysis using persistence landscapes
  • Peter Bubenik
  • Mathematics, Computer Science
    J. Mach. Learn. Res.
  • 2015
A new topological summary for data that is easy to combine with tools from statistics and machine learning and obeys a strong law of large numbers and a central limit theorem is defined.
Persistence weighted Gaussian kernel for topological data analysis
A kernel method on persistence diagrams is proposed to develop a statistical framework in TDA and satisfies the stability property and provides explicit control on the effect of persistence.
Barcodes: The persistent topology of data
This article surveys recent work of Carlsson and collaborators on applications of computational algebraic topology to problems of feature detection and shape recognition in high-dimensional data. The
Statistical Analysis of Persistence Intensity Functions
Persistence diagrams are two-dimensional plots that summarize the topological features of functions and are an important part of topological data analysis. A problem that has received much attention
Persistence-Based Structural Recognition
It is shown that the so-called persistence diagrams built from functions defined on the objects can serve as compact and informative descriptors for images and shapes, complementary to the bag-of-features representation.
A stable multi-scale kernel for topological machine learning
This work designs a multi-scale kernel for persistence diagrams, a stable summary representation of topological features in data that is positive definite and proves its stability with respect to the 1-Wasserstein distance.