Efficient Betti Matching Enables Topology-Aware 3D Segmentation via Persistent Homology
Nico Stucki, Vincent B\"urgin, Johannes C. Paetzold, Ulrich Bauer

TL;DR
This paper introduces an optimized Betti matching algorithm for topological data analysis, enabling topology-aware 3D segmentation with improved accuracy and computational efficiency.
Contribution
We develop a highly optimized C++ implementation of Betti matching, facilitating efficient topology-aware training of 3D segmentation networks.
Findings
Significant speedups over existing implementations.
Improved topological correctness in segmentation results.
Effective training of topology-aware neural networks.
Abstract
In this work, we propose an efficient algorithm for the calculation of the Betti matching, which can be used as a loss function to train topology aware segmentation networks. Betti matching loss builds on techniques from topological data analysis, specifically persistent homology. A major challenge is the computational cost of computing persistence barcodes. In response to this challenge, we propose a new, highly optimized implementation of Betti matching, implemented in C++ together with a python interface, which achieves significant speedups compared to the state-of-the-art implementation Cubical Ripser. We use Betti matching 3D to train segmentation networks with the Betti matching loss and demonstrate improved topological correctness of predicted segmentations across several datasets. The source code is available at https://github.com/nstucki/Betti-Matching-3D.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Medical Imaging and Analysis · 3D Shape Modeling and Analysis
MethodsAttentive Walk-Aggregating Graph Neural Network
