Gromov–Hausdorff Approximation of Filamentary Structures Using Reeb-Type Graphs

In many real-world applications, data appear to be sampled around 1-dimensional filamentary structures that can be seen as topological 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 provide an efficient and easy-to-implement algorithm to compute such approximations in almost linear time. We illustrate the performance of our algorithm on a few datasets.

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

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

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

[4]  Arcwise Isometries,et al.  A Course in Metric Geometry , 2001 .

[5]  J. Dieudonne.  Foundations of Modern Analysis , 1969 .

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

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

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

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

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

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

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

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

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

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

[16]  Jian Sun,et al.  Gromov-Hausdorff Approximation of Filament Structure Using Reeb-type Graph , 2014, SoCG.

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

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

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

[20]  Kurt Mehlhorn,et al.  Curve reconstruction: connecting dots with good reason , 1999, SCG '99.

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

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

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

[24]  Mikhail Belkin,et al.  Data Skeletonization via Reeb Graphs , 2011, NIPS.

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

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

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

[28]  Ulrich Bauer,et al.  Measuring Distance between Reeb Graphs , 2013, SoCG.

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

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

[31]  David Eppstein,et al.  The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

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

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

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