Efficient and robust persistent homology for measures
From MaRDI portal
Publication:340536
DOI10.1016/J.COMGEO.2016.07.001zbMATH Open1357.65022arXiv1306.0039OpenAlexW2201541687MaRDI QIDQ340536FDOQ340536
Mickaël Buchet, Steve Y. Oudot, Frédéric Chazal, Donald R. Sheehy
Publication date: 14 November 2016
Published in: Computational Geometry (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1306.0039
Recommendations
- Efficient and robust persistent homology for measures
- Linear-size approximations to the Vietoris-Rips filtration
- Linear-size approximations to the Vietoris-Rips filtration
- Convergence rates for persistence diagram estimation in topological data analysis
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch collapse
Cites Work
- Finding the homology of submanifolds with high confidence from random samples
- The Structure and Stability of Persistence Modules
- Towards persistence-based reconstruction in euclidean spaces
- Topology and data
- Computational topology. An introduction
- Title not available (Why is that?)
- Geometric inference for probability measures
- Stability of persistence diagrams
- Computing persistent homology
- Topological persistence and simplification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications of random sampling in computational geometry. II
- Persistence stability for geometric complexes
- Proximity of persistence modules and their diagrams
- Witnessed \(k\)-distance
- Computing Topological Persistence for Simplicial Maps
- Zigzag zoology
- A sampling theory for compact sets in Euclidean space
- Linear-size approximations to the Vietoris-Rips filtration
Cited In (28)
- Essential Simplices in Persistent Homology and Subtle Admixture Detection
- Title not available (Why is that?)
- An efficient algorithm for 1-dimensional (Persistent) path homology
- Sparse Dowker nerves
- A comparison framework for interleaved persistence modules
- Computing with Point Cloud Data
- Rigorous cubical approximation and persistent homology of continuous functions
- Linear-size approximations to the Vietoris-Rips filtration
- Alpha magnitude
- DTM-Based Filtrations
- A limit theorem for persistence diagrams of random filtered complexes built over marked point processes
- Weighted persistent homology
- A Topological Data Analysis Approach on Predicting Phenotypes from Gene Expression Data
- Persistent homology for low-complexity models
- Rates of convergence for robust geometric inference
- Efficient Computation of Persistent Homology for Cubical Data
- Persistent homology as stopping-criterion for Voronoi interpolation
- Persistent Homology under Non-uniform Error
- Computational tools in weighted persistent homology
- Stable volumes for persistent homology
- Geometric Approaches to Persistent Homology
- Dimensionality reduction for \(k\)-distance applied to persistent homology
- Detection of small holes by the scale-invariant robust density-aware distance (RDAD) filtration
- Recovering the homology of immersed manifolds
- Title not available (Why is that?)
- Stabilizing the unstable output of persistent homology computations
- Persistence curves: a canonical framework for summarizing persistence diagrams
- Compression for \(2\)-parameter persistent homology
Uses Software
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)
