Efficient and robust persistent homology for measures

A new paradigm for point cloud data analysis has emerged recently, where point clouds are no longer treated as mere compact sets but rather as empirical measures. A notion of distance to such measures has been defined and shown to be stable with respect to perturbations of the measure. This distance can easily be computed pointwise in the case of a point cloud, but its sublevel-sets, which carry the geometric information about the measure, remain hard to compute or approximate. This makes it challenging to adapt many powerful techniques based on the Euclidean distance to a point cloud to the more general setting of the distance to a measure on a metric space. We propose an efficient and reliable scheme to approximate the topological structure of the family of sublevel-sets of the distance to a measure. We obtain an algorithm for approximating the persistent homology of the distance to an empirical measure that works in arbitrary metric spaces. Precise quality and complexity guarantees are given with a discussion on the behavior of our approach in practice.

[1]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[2]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[3]  H. Edelsbrunner.  The union of balls and its dual shape , 1995 .

[4]  Sunil Arya,et al.  ANN: library for approximate nearest neighbor searching , 1998 .

[5]  Herbert Edelsbrunner,et al.  Topological persistence and simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6]  C. Villani.  Topics in Optimal Transportation , 2003 .

[7]  Afra Zomorodian,et al.  Computing Persistent Homology , 2004, SCG '04.

[8]  David Cohen-Steiner,et al.  Stability of Persistence Diagrams , 2005, Discret. Comput. Geom..

[9]  Afra Zomorodian,et al.  The conformal alpha shape filtration , 2006, The Visual Computer.

[10]  Stephen Smale,et al.  Finding the Homology of Submanifolds with High Confidence from Random Samples , 2008, Discret. Comput. Geom..

[11]  Steve Oudot,et al.  Towards persistence-based reconstruction in euclidean spaces , 2007, SCG '08.

[12]  Leonidas J. Guibas,et al.  Gromov‐Hausdorff Stable Signatures for Shapes using Persistence , 2009, Comput. Graph. Forum.

[13]  Leonidas J. Guibas,et al.  Proximity of persistence modules and their diagrams , 2009, SCG '09.

[14]  Gunnar E. Carlsson,et al.  Topology and data , 2009 .

[15]  Herbert Edelsbrunner,et al.  Computational Topology - an Introduction , 2009 .

[16]  Frédéric Chazal,et al.  A Sampling Theory for Compact Sets in Euclidean Space , 2009, Discret. Comput. Geom..

[17]  Frédéric Chazal,et al.  Geometric Inference for Probability Measures , 2011, Found. Comput. Math..

[18]  Leonidas J. Guibas,et al.  Witnessed k-Distance , 2011, Discrete & Computational Geometry.

[19]  Steve Oudot,et al.  Persistence stability for geometric complexes , 2012, ArXiv.

[20]  Don Sheehy,et al.  Linear-Size Approximations to the Vietoris–Rips Filtration , 2012, Discrete & Computational Geometry.

[21]  Tamal K. Dey,et al.  Computing Topological Persistence for Simplicial Maps , 2012, SoCG.

[22]  Steve Oudot,et al.  Zigzag Zoology: Rips Zigzags for Homology Inference , 2013, Foundations of Computational Mathematics.

[23]  Steve Oudot,et al.  The Structure and Stability of Persistence Modules , 2012, Springer Briefs in Mathematics.

[24]  Steve Oudot,et al.  Efficient and robust persistent homology for measures , 2016, Comput. Geom..

[25]  R. Ho.  Algebraic Topology , 2022 .