Gromov-Hausdorff Approximation of Metric Spaces with Linear Structure

In many real-world applications data come as discrete metric spaces sampled around 1-dimensional filamentary structures that can be seen as metric graphs. In this paper we address the metric reconstruction problem of such filamentary structures from data sampled around them. We prove that they can be approximated, with respect to the Gromov-Hausdorff distance by well-chosen Reeb graphs (and some of their variants) and we provide an efficient and easy to implement algorithm to compute such approximations in almost linear time. We illustrate the performances of our algorithm on a few synthetic and real data sets.

[1]  M. Landsberg.  J. Dieudonné, Foundations of Modern Analysis. (Pure and Applied Mathematics, Vol. X) XIV + 316 S. New York 1960. Academic Press Inc. Preis geb. $ 8,50 , 1961 .

[2]  J. Hausmann.  On the Vietoris-Rips complexes and a Cohomology Theory for metric spaces , 1996 .

[3]  Jean-Francois Mangin,et al.  Detection of linear features in SAR images: application to road network extraction , 1998, IEEE Trans. Geosci. Remote. Sens..

[4]  M. Gromov.  Metric Structures for Riemannian and Non-Riemannian Spaces , 1999 .

[5]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[6]  Kurt Mehlhorn,et al.  Curve reconstruction: Connecting dots with good reason , 2000, Comput. Geom..

[7]  Tamal K. Dey,et al.  Reconstructing curves with sharp corners , 2001, Comput. Geom..

[8]  D. Burago,et al.  A Course in Metric Geometry , 2001 .

[9]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[10]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[11]  D. Donoho,et al.  Adaptive multiscale detection of filamentary structures embedded in a background of uniform random points , 2003 .

[12]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

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

[14]  Anupam Gupta,et al.  Improved embeddings of graph metrics into random trees , 2006, SODA '06.

[15]  Xiaoming Huo,et al.  ADAPTIVE MULTISCALE DETECTION OF FILAMENTARY STRUCTURES IN A BACKGROUND OF UNIFORM RANDOM POINTS 1 , 2006 .

[16]  Ittai Abraham,et al.  Reconstructing approximate tree metrics , 2007, PODC '07.

[17]  Piotr Indyk,et al.  Approximation algorithms for embedding general metrics into trees , 2007, SODA '07.

[18]  Facundo Mémoli,et al.  Topological Methods for the Analysis of High Dimensional Data Sets and 3D Object Recognition , 2007, PBG@Eurographics.

[19]  Feodor F. Dragan,et al.  Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs , 2008, Electron. Notes Discret. Math..

[20]  L. Wasserman,et al.  On the path density of a gradient field , 2008, 0805.4141.

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

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

[23]  Yusu Wang,et al.  A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes , 2010, SCG.

[24]  Leonidas J. Guibas,et al.  Road network reconstruction for organizing paths , 2010, SODA '10.

[25]  M. Strauss,et al.  Tracing the filamentary structure of the galaxy distribution at z∼0.8 , 2010, 1003.3239.

[26]  L. Wasserman,et al.  The Geometry of Nonparametric Filament Estimation , 2010, 1003.5536.

[27]  Leonidas J. Guibas,et al.  Metric graph reconstruction from noisy data , 2011, SoCG '11.

[28]  Tamal K. Dey,et al.  Reeb Graphs: Approximation and Persistence , 2011, SoCG '11.

[29]  Salman Parsa,et al.  A deterministic o(m log m) time algorithm for the reeb graph , 2012, SoCG '12.

[30]  Larry A. Wasserman,et al.  Nonparametric Ridge Estimation , 2012, ArXiv.

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

[32]  Tamal K. Dey,et al.  Graph induced complex on point data , 2013, SoCG '13.