A density-based approach to feature detection in persistence diagrams for firn data

Topological data analysis, and in particular persistence diagrams, are gaining popularity as tools for extracting topological information from noisy point cloud and digital data. Persistence diagrams track topological features in the form of \begin{document}$ k $\end{document} -dimensional holes in the data. Here, we construct a new, automated approach for identifying persistence diagram points that represent robust long-life features. These features may be used to provide a more accurate estimate of Betti numbers for the underlying space. This approach extends the established practice of using a lifespan cutoff on the features in order to take advantage of the observation that noisy features typically appear in clusters in the persistence diagram. We show that this approach offers more flexibility in partitioning features in the persistence diagram, resulting in greater accuracy in computed Betti numbers, especially in the case of high noise levels and varying image illumination. This work is motivated by 3-dimensional Micro-CT imaging of ice core samples, and is applicable for separating noise from robust signals in persistence diagrams from noisy data.

[1]  Frédéric Chazal,et al.  An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists , 2017, Frontiers in Artificial Intelligence.

[2]  Rocío González-Díaz,et al.  Persistent entropy for separating topological features from noise in vietoris-rips complexes , 2017, Journal of Intelligent Information Systems.

[3]  Alice Patania,et al.  Topological analysis of data , 2017, EPJ Data Science.

[4]  Sivaraman Balakrishnan,et al.  Confidence sets for persistence diagrams , 2013, The Annals of Statistics.

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

[6]  Ad'elie Garin,et al.  A Topological "Reading" Lesson: Classification of MNIST using TDA , 2019, 2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA).

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

[8]  Rocío González-Díaz,et al.  Separating Topological Noise from Features Using Persistent Entropy , 2016, STAF Workshops.

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

[10]  R. Adler,et al.  Persistent homology for random fields and complexes , 2010, 1003.1001.

[11]  Mason A. Porter,et al.  A roadmap for the computation of persistent homology , 2015, EPJ Data Science.

[12]  Sarah Day,et al.  Topological Fidelity and Image Thresholding: A Persistent Homology Approach , 2018, Journal of Mathematical Imaging and Vision.

[13]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[14]  C. Buizert,et al.  Firn Model Intercomparison Experiment (FirnMICE) , 2017, Journal of Glaciology.

[15]  Yasuaki Hiraoka,et al.  Persistence diagrams with linear machine learning models , 2017, Journal of Applied and Computational Topology.

[16]  L. Wasserman Topological Data Analysis , 2016, 1609.08227.

[17]  D. Etheridge,et al.  Firn-air δ15N in modern polar sites and glacial–interglacial ice: a model-data mismatch during glacial periods in Antarctica? , 2006 .

[18]  B. Stauffer,et al.  Age difference between polar ice and the air trapped in its bubbles , 1984, Nature.

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

[20]  I. Baker,et al.  The impact of ice layers on gas transport through firn at the North Greenland Eemian Ice Drilling (NEEM) site, Greenland , 2014 .

[21]  R. Ghrist Barcodes: The persistent topology of data , 2007 .

[22]  D. S. Sivia,et al.  Data Analysis , 1996, Encyclopedia of Evolutionary Psychological Science.