API Reference¶
Distances¶
Perform the Wasserstein distance matching between persistence diagrams. |
|
Perform the Bottleneck distance matching between persistence diagrams. |
|
Implementation of Sliced Wasserstein distance as described in Sliced Wasserstein Kernel for Persistence Diagrams by Mathieu Carriere, Marco Cuturi, Steve Oudot (https://arxiv.org/abs/1706.03358) |
|
Return the pseudo-metric between two diagrams based on the continuous heat kernel as described in “A Stable Multi-Scale Kernel for Topological Machine Learning” by Jan Reininghaus, Stefan Huber, Ulrich Bauer, and Roland Kwitt (CVPR 2015) |
|
Estimate the mGH distance between simple unweighted graphs, represented as compact metric spaces based on their shortest path lengths. |
Persistence Images¶
Transformer which converts persistence diagrams into persistence images. |
|
Initialize a persistence image generator. |
Persistence Landscapes¶
Diagram Visualization¶
A helper function to plot persistence diagrams. |
|
Visualize bottleneck matching between two diagrams |
|
Visualize bottleneck matching between two diagrams |
Persistence barcode measure¶
The persistent entropy has been defined in [1]. |