Witnessed k-Distance

Distance functions to compact sets play a central role in several areas of computational geometry. Methods that rely on them are robust to the perturbations of the data by the Hausdorff noise, but fail in the presence of outliers. The recently introduced distance to a measure offers a solution by extending the distance function framework to reasoning about the geometry of probability measures, while maintaining theoretical guarantees about the quality of the inferred information. A combinatorial explosion hinders working with distance to a measure as an ordinary power distance function. In this paper, we analyze an approximation scheme that keeps the representation linear in the size of the input, while maintaining the guarantees on the inference quality close to those for the exact but costly representation.

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

[2]  Franz Aurenhammer,et al.  A new duality result concerning voronoi diagrams , 1986, ICALP.

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

[4]  M. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

[5]  Sanjoy Dasgupta,et al.  Learning mixtures of Gaussians , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[6]  P. Massart,et al.  Adaptive estimation of a quadratic functional by model selection , 2000 .

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

[8]  Alexander Russell,et al.  Computational topology: ambient isotopic approximation of 2-manifolds , 2003, Theor. Comput. Sci..

[9]  Leonidas J. Guibas,et al.  The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.

[10]  Piotr Indyk,et al.  Nearest Neighbors in High-Dimensional Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[11]  C. Villani,et al.  Quantitative Concentration Inequalities for Empirical Measures on Non-compact Spaces , 2005, math/0503123.

[12]  K. Clarkson.  Nearest-Neighbor Searching and Metric Space Dimensions , 2005 .

[13]  David Cohen-Steiner,et al.  Vines and vineyards by updating persistence in linear time , 2006, SCG '06.

[14]  Tamal K. Dey,et al.  Provable surface reconstruction from noisy samples , 2006, Comput. Geom..

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

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

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

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

[19]  Stephen Smale,et al.  A Topological View of Unsupervised Learning from Noisy Data , 2011, SIAM J. Comput..

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

[21]  Benoît R. Kloeckner.  Approximation by finitely supported measures , 2010, 1003.1035.

[22]  Roman Vershynin,et al.  Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.