DeepAI AI Chat
Log In Sign Up

Reconstruction of univariate functions from directional persistence diagrams

by   Aina Ferrà, et al.

We describe a method for approximating a single-variable function f using persistence diagrams of sublevel sets of f from height functions in different directions. We provide algorithms for the piecewise linear case and for the smooth case. Three directions suffice to locate all local maxima and minima of a piecewise linear continuous function from its collection of directional persistence diagrams, while five directions are needed in the case of smooth functions with non-degenerate critical points. Our approximation of functions by means of persistence diagrams is motivated by a study of importance attribution in machine learning, where one seeks to reduce the number of critical points of signal functions without a significant loss of information for a neural network classifier.


page 1

page 2

page 3

page 4


Statistical Analysis of Persistence Intensity Functions

Persistence diagrams are two-dimensional plots that summarize the topolo...

Universality of the Bottleneck Distance for Extended Persistence Diagrams

The extended persistence diagram is an invariant of piecewise linear fun...

Persistence Diagrams for Efficient Simplicial Complex Reconstruction

Topological descriptors have been shown to be useful for summarizing and...

Adaptive Partitioning for Template Functions on Persistence Diagrams

As the field of Topological Data Analysis continues to show success in t...

A Geometric Condition for Uniqueness of Fréchet Means of Persistence Diagrams

The Fréchet mean is an important statistical summary and measure of cent...

Statistical Parameter Selection for Clustering Persistence Diagrams

In urgent decision making applications, ensemble simulations are an impo...

Steady and ranging sets in graph persistence

Generalised persistence functions (gp-functions) are defined on (ℝ, ≤)-i...