Analyzing the sub-level sets of the distance to a compact sub-manifold of R d is a common method in TDA to understand its topology. The distance to measure (DTM) was introduced by Chazal, Cohen-Steiner and Merigot in [7] to face the non-robustness of the distance to a compact set to noise and outliers. This function makes possible the inference of the topology of a compact subset of R d from a noisy cloud of n points lying nearby in the Wasserstein sense. In practice, these sub-level sets may be computed using approximations of the DTM such as the q-witnessed distance [10] or other power distance [6]. These approaches lead eventually to compute the homology of unions of n growing balls, that might become intractable whenever n is large. To simultaneously face the two problems of large number of points and noise, we introduce the k-power distance to measure (k-PDTM). This new approximation of the distance to measure may be thought of as a k-coreset based approximation of the DTM. Its sublevel sets consist in union of k-balls, k << n, and this distance is also proved robust to noise. We assess the quality of this approximation for k possibly dramatically smaller than n, for instance k = n 1 3 is proved to be optimal for 2-dimensional shapes. We also provide an algorithm to compute this k-PDTM.
[1]
S. Mendelson,et al.
Entropy and the combinatorial dimension
,
2002,
math/0203275.
[2]
S. Boucheron,et al.
Theory of classification : a survey of some recent advances
,
2005
.
[3]
Gábor Lugosi,et al.
Concentration Inequalities
,
2008,
COLT.
[4]
C. Aaron,et al.
On boundary detection
,
2016,
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques.
[5]
Frédéric Chazal,et al.
Geometric Inference for Probability Measures
,
2011,
Found. Comput. Math..
[6]
Quentin Mérigot.
Lower bounds for k-distance approximation
,
2013,
SoCG '13.
[7]
Clément Levrard,et al.
Stability and Minimax Optimality of Tangential Delaunay Complexes for Manifold Reconstruction
,
2015,
Discret. Comput. Geom..
[8]
Steve Oudot,et al.
Efficient and robust persistent homology for measures
,
2013,
Comput. Geom..
[9]
Frédéric Chazal,et al.
Convergence rates for persistence diagram estimation in topological data analysis
,
2014,
J. Mach. Learn. Res..
[10]
Mariette Yvinec,et al.
Geometric and Topological Inference
,
2018
.
[11]
Bei Wang,et al.
Geometric Inference on Kernel Density Estimates
,
2013,
SoCG.
[12]
Herbert Edelsbrunner,et al.
Weighted alpha shapes
,
1992
.
[13]
Leonidas J. Guibas,et al.
Witnessed k-Distance
,
2011,
Discrete & Computational Geometry.