Efficient and robust persistent homology for measures
From MaRDI portal
(Redirected from Publication:340536)
Abstract: We extend the notion of the distance to a measure from Euclidean space to probability measures on general metric spaces as a way to do topological data analysis in a way that is robust to noise and outliers. We then give an efficient way to approximate the sub-level sets of this function by a union of metric balls and extend previous results on sparse Rips filtrations to this setting. This robust and efficient approach to topological data analysis is illustrated with several examples from an implementation.
Recommendations
Cites work
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- A sampling theory for compact sets in Euclidean space
- Applications of random sampling in computational geometry. II
- Computational topology. An introduction
- Computing persistent homology
- Computing topological persistence for simplicial maps (extended abstract)
- Finding the homology of submanifolds with high confidence from random samples
- Geometric inference for probability measures
- Persistence stability for geometric complexes
- Proximity of persistence modules and their diagrams
- Stability of persistence diagrams
- The structure and stability of persistence modules
- Topological persistence and simplification
- Topology and data
- Towards persistence-based reconstruction in euclidean spaces
- Witnessed k-distance
- Zigzag zoology
Cited in
(36)- Essential Simplices in Persistent Homology and Subtle Admixture Detection
- An efficient algorithm for 1-dimensional (Persistent) path homology
- Sparse Dowker nerves
- Analysis of scalar fields over point cloud data
- A comparison framework for interleaved persistence modules
- Rigorous cubical approximation and persistent homology of continuous functions
- Computing with Point Cloud Data
- Alpha magnitude
- Spatiotemporal persistent homology for dynamic metric spaces
- Persistent homology for resource coverage: a case study of access to polling sites
- The density of expected persistence diagrams and its kernel based estimation
- A limit theorem for persistence diagrams of random filtered complexes built over marked point processes
- Weighted persistent homology
- Persistent homology for low-complexity models
- Rates of convergence for robust geometric inference
- Efficient Computation of Persistent Homology for Cubical Data
- DTM-based filtrations
- Persistent homology as stopping-criterion for Voronoi interpolation
- Persistent Homology under Non-uniform Error
- Computational tools in weighted persistent homology
- DTM-based filtrations
- Stable volumes for persistent homology
- Geometric Approaches to Persistent Homology
- Dimensionality reduction for \(k\)-distance applied to persistent homology
- A topological data analysis approach on predicting phenotypes from gene expression data
- Detection of small holes by the scale-invariant robust density-aware distance (RDAD) filtration
- Measuring the error in approximating the sub-level set topology of sampled scalar data
- Recovering the homology of immersed manifolds
- Scalar field analysis over point cloud data
- Efficient and robust persistent homology for measures
- Adaptive approximation of persistent homology
- Stabilizing the unstable output of persistent homology computations
- Persistence curves: a canonical framework for summarizing persistence diagrams
- Compression for \(2\)-parameter persistent homology
- Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch collapse
This page was built for publication: Efficient and robust persistent homology for measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340536)
