On the Effectiveness of Persistent Homology

Renata Turkes, Guido F. Montúfar, Nina Otter

TL;DR

While Persistent Homology (PH) is a staple of Topological Data Analysis, the exact reasons behind its effectiveness are often elusive. This paper demonstrates that PH is not just for capturing global topology; it is also a powerful, data-efficient tool for detecting local geometric features like curvature and convexity. In noisy or data-scarce environments, PH frequently outperforms deep learning models like PointNet.

The Problem: Why Does PH Work So Well?

In the last decade, Persistent Homology has been applied to everything from protein folding to fingerprint classification. However, researchers often use PH as a black-box feature extractor without a clear understanding of which specific geometric or topological properties are being captured.

The authors aim to bridge this gap by testing PH against three fundamental shape analysis tasks:

  1. Hole Detection: Counting 1-dimensional holes in 2D and 3D point clouds.
  2. Curvature Estimation: Predicting the curvature of a surface from a sampled disk.
  3. Convexity Detection: Distinguishing between convex and concave shapes.

The core question is whether PH can outperform specialized deep learning architectures like PointNet, and whether it is robust enough to handle noise, transformations, and limited training data.

Methodology

The authors utilize a standard PH pipeline but introduce a novel mathematical twist for convexity detection.

  • The Standard Pipeline: Point clouds are transformed into simplicial complexes (such as Alpha or Vietoris-Rips complexes). A filtration is applied—essentially growing balls around points and tracking when topological features (like holes or connected components) appear and disappear. These lifespans are summarized in Persistence Diagrams (PDs) and then converted into machine-learning-ready signatures like Persistence Images (PI) or Persistence Landscapes (PL).
  • Tubular Filtration (The Novelty): To detect convexity, the authors introduce a "tubular filtration." Instead of the standard distance-to-points filtration, they measure the distance of points from a specific line. They prove theoretically that a shape is convex if and only if this filtration results in exactly one connected component for every possible line.
  • Baselines: They compare PH against traditional Machine Learning (SVMs and Neural Networks trained on distance matrices) and PointNet, a deep learning architecture specifically designed for point cloud data.

Datasets

The study uses a mix of synthetic benchmarks and real-world data to evaluate the models:

  • Holes Dataset: 20 different 2D and 3D shapes with varying numbers of holes (0, 1, 2, 4, or 9).
Examples of 2D and 3D shapes categorized by their number of holes.
  • Curvature Dataset: 1,010 point clouds sampled from unit disks on surfaces of constant curvature (Euclidean, spherical, and hyperbolic).
  • Convexity Dataset: A balanced set of "regular" shapes (triangles, squares) and "random" shapes generated via convex hulls and alpha shapes.
  • FLAVIA: A real-world dataset of plant leaf images used to validate convexity detection performance on complex, natural shapes.

Key Insights

  • The Geometry-Topology Bridge: The paper reinforces the idea that "long" persistence intervals represent global topology (like holes), while "short" intervals capture local geometry (like curvature). Interestingly, for convexity, the "second-longest" interval in a tubular filtration is the key indicator of concavity.
  • Data Efficiency: PH-based models require significantly less training data than deep learning models. Because PH extracts mathematically rigorous features, the classifier doesn't need thousands of examples to "learn" what a hole or a curve looks like.
  • Inherent Robustness: PH is naturally invariant to rigid transformations like rotation and translation. While PointNet struggles when test data is rotated or translated relative to the training set, PH maintains high accuracy.

Key Results

The empirical results strongly support the theoretical advantages of Persistent Homology:

  • Hole Detection: PH achieved nearly 100% accuracy and significantly outperformed PointNet when the data was subjected to affine transformations or Gaussian noise.
Accuracy of different methods across various transformations and noise, highlighting PH's robustness compared to PointNet.
  • Curvature: In the regression task, PH (specifically 0-dimensional PH) achieved a Mean Squared Error (MSE) of 0.06, while PointNet struggled with an MSE of 578.28, completely failing to capture the underlying geometric trend.
  • Convexity: PH outperformed all baselines in "out-of-distribution" scenarios—for example, when trained on simple regular shapes but tested on complex random shapes. It also successfully provided a continuous "measure" of convexity for the real-world FLAVIA leaf dataset.

Limitations and Future Work

The authors acknowledge that their comparison is a focused look at PH versus popular baselines, rather than an exhaustive benchmark against every state-of-the-art shape analysis tool. Additionally, the tubular filtration for convexity can miss very subtle concavities if the chosen lines aren't oriented correctly or if the resolution of the cubical complex is too low.

Future directions include: * Exploring multiparameter persistence to handle noise and geometry simultaneously. * Integrating PH signatures as differentiable layers within deep learning architectures. This could combine the "best of both worlds": the feature-learning power of CNNs and the topological rigor of TDA.

Summary updated

Abstract

Persistent homology (PH) is one of the most popular methods in Topological Data Analysis. Even though PH has been used in many different types of applications, the reasons behind its success remain elusive; in particular, it is not known for which classes of problems it is most effective, or to what extent it can detect geometric or topological features. The goal of this work is to identify some types of problems where PH performs well or even better than other methods in data analysis. We consider three fundamental shape analysis tasks: the detection of the number of holes, curvature and convexity from 2D and 3D point clouds sampled from shapes. Experiments demonstrate that PH is successful in these tasks, outperforming several baselines, including PointNet, an architecture inspired precisely by the properties of point clouds. In addition, we observe that PH remains effective for limited computational resources and limited training data, as well as out-of-distribution test data, including various data transformations and noise. For convexity detection, we provide a theoretical guarantee that PH is effective for this task in $\mathbb{R}^d$, and demonstrate the detection of a convexity measure on the FLAVIA data set of plant leaf images. Due to the crucial role of shape classification in understanding mathematical and physical structures and objects, and in many applications, the findings of this work will provide some knowledge about the types of problems that are appropriate for PH, so that it can - to borrow the words from Wigner 1960 - ``remain valid in future research, and extend, to our pleasure", but to our lesser bafflement, to a variety of applications.
BibTeX
@inproceedings{turkes2022effectiveness,
  author = {Renata Turkes and Guido F. Montúfar and Nina Otter},
  title = {{On the Effectiveness of Persistent Homology}},
  booktitle = {Advances in Neural Information Processing Systems},
  year = {2022},
}
Figure