Non-isotropic Persistent Homology: Leveraging the Metric Dependency of PH
Vincent P. Grande, Michael T. Schaub
TL;DR
Non-Isotropic Persistent Homology (NIPH) addresses the limitation that standard persistent homology depends on a single metric and may miss geometric structure. It introduces a pipeline that varies the distance function along directions with scaling factors, computes persistence diagrams, matches death distributions via optimal transport, and extracts orientation $\varphi$, orientational variance $V$, and scaling $s$ by optimizing peak alignment. The method is demonstrated on synthetic data and road networks, showing accurate orientation recovery and meaningful scaling/variance estimates, outperforming PCA in orientation detection. This work provides a general framework to encode geometric information through metric variations, with potential applications in shape analysis and network data.
Abstract
Persistent Homology is a widely used topological data analysis tool that creates a concise description of the topological properties of a point cloud based on a specified filtration. Most filtrations used for persistent homology depend (implicitly) on a chosen metric, which is typically agnostically chosen as the standard Euclidean metric on $\mathbb{R}^n$. Recent work has tried to uncover the 'true' metric on the point cloud using distance-to-measure functions, in order to obtain more meaningful persistent homology results. Here we propose an alternative look at this problem: we posit that information on the point cloud is lost when restricting persistent homology to a single (correct) distance function. Instead, we show how by varying the distance function on the underlying space and analysing the corresponding shifts in the persistence diagrams, we can extract additional topological and geometrical information. Finally, we numerically show that non-isotropic persistent homology can extract information on orientation, orientational variance, and scaling of randomly generated point clouds with good accuracy and conduct some experiments on real-world data.
