Embedded Graph Reconstruction under Hausdorff Noise (2410.19410v1)
Abstract: Filamentary structures (topologically embedded graphs with a metric structure) are ubiquitous in science and engineering. A challenging problem in topological data analysis (TDA) is to reconstruct the topology and geometry of such an underlying (usually unknown) metric graph from possibly noisy data sampled around it. Reeb graphs have recently been successfully employed in abstract metric graph reconstruction under Gromov$\unicode{x2013}$Hausdorff noise: the sample is assumed to be metrically close to the ground truth. However, such a strong global density assumption is hardly achieved in applications, making the existing Reeb graph-based methods untractible. We relax the density assumption to give provable geometric reconstruction schemes, even when the sample is metrically close only locally. A very different yet more relevant paradigm focuses on the reconstruction of metric graphs$\unicode{x2014}$embedded in the Euclidean space$\unicode{x2014}$from Euclidean samples that are only Hausdorff-close. We further extend our methodologies to provide novel, provable guarantees for the successful geometric reconstruction of Euclidean graphs under the Hausdorff noise model. Our technique produces promising results in reconstructing earthquake plate tectonic boundaries from the global earthquake catalog.
- USGS Earthquake Hazards Program.
- Metric graph reconstruction from noisy data. In Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, SoCG ’11, page 37–46, New York, NY, USA, 2011. Association for Computing Machinery.
- Choosing thresholds for density-based map construction algorithms. In Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL ’15, pages 24:1–24:10, New York, NY, USA, 2015. ACM.
- A course in metric geometry, volume 33. American Mathematical Society, Providence, 2001.
- Gromov–Hausdorff approximation of filamentary structures using Reeb-type graphs. Discrete & Computational Geometry, 53(3):621–649, Apr 2015.
- Gromov-Hausdorff approximation of metric spaces with linear structure. CoRR, abs/1305.1172, 2013.
- Graph Reconstruction by Discrete Morse Theory. In Bettina Speckmann and Csaba D. Tóth, editors, 34th International Symposium on Computational Geometry (SoCG 2018), volume 99 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:15, Dagstuhl, Germany, 2018. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
- Data skeletonization via reeb graphs. In J. Shawe-Taylor, R. Zemel, P. Bartlett, F. Pereira, and K.Q. Weinberger, editors, Advances in Neural Information Processing Systems, volume 24. Curran Associates, Inc., 2011.
- Topological stability and Latschev-type reconstruction theorems for CAT(κ)CAT𝜅\mathrm{CAT}(\kappa)roman_CAT ( italic_κ ) spaces, 2024.
- Statistical analysis of metric graph reconstruction. J. Mach. Learn. Res., 15(1):3425–3446, January 2014.
- Sushovan Majhi. Vietoris–Rips complexes of metric spaces near a metric graph. Journal of Applied and Computational Topology, 7(4):741–770, May 2023.
- Duare: Automatic road extraction with aerial images and trajectory data at baidu maps. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD ’22, page 4321–4331, New York, NY, USA, 2022. Association for Computing Machinery.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.