Efficient Betti Matching Enables Topology-Aware 3D Segmentation via Persistent Homology

• URL: http://arxiv.org/abs/2407.04683v1
• Date: Fri, 5 Jul 2024 17:44:08 GMT
• Title: Efficient Betti Matching Enables Topology-Aware 3D Segmentation via Persistent Homology
• Authors: Nico Stucki, Vincent Bürgin, Johannes C. Paetzold, Ulrich Bauer,
• Abstract summary: We propose an efficient algorithm for the calculation of the Betti matching, which can be used as a loss function to train segmentation networks. A major challenge is the computational cost of computing persistence barcodes. We propose a new, highly optimized implementation of Betti matching, implemented in C++ together with a python interface.
• Score: 2.0767088099870006
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• MeshConv3D: Efficient convolution and pooling operators for triangular 3D meshes [0.0]
  MeshConv3D is a 3D mesh-dedicated methodology integrating specialized convolution and face collapse-based pooling operators. The experimental results obtained on three distinct benchmark datasets show that the proposed approach makes it possible to achieve equivalent or superior classification results.
  arXiv  Detail & Related papers  (2025-01-07T14:41:26Z)
• Bayesian Self-Training for Semi-Supervised 3D Segmentation [59.544558398992386]
  3D segmentation is a core problem in computer vision. densely labeling 3D point clouds to employ fully-supervised training remains too labor intensive and expensive. Semi-supervised training provides a more practical alternative, where only a small set of labeled data is given, accompanied by a larger unlabeled set.
  arXiv  Detail & Related papers  (2024-09-12T14:54:31Z)
• SATR: Zero-Shot Semantic Segmentation of 3D Shapes [74.08209893396271]
  We explore the task of zero-shot semantic segmentation of 3D shapes by using large-scale off-the-shelf 2D image recognition models. We develop the Assignment with Topological Reweighting (SATR) algorithm and evaluate it on ShapeNetPart and our proposed FAUST benchmarks. SATR achieves state-of-the-art performance and outperforms a baseline algorithm by 1.3% and 4% average mIoU.
  arXiv  Detail & Related papers  (2023-04-11T00:43:16Z)
• NCP: Neural Correspondence Prior for Effective Unsupervised Shape Matching [31.61255365182462]
  We present Neural Correspondence Prior (NCP), a new paradigm for computing correspondences between 3D shapes. Our approach is fully unsupervised and can lead to high-quality correspondences even in challenging cases. We show that NCP is data-efficient, fast, and state-of-the-art results on many tasks.
  arXiv  Detail & Related papers  (2023-01-14T07:22:18Z)
• Topologically faithful image segmentation via induced matching of persistence barcodes [2.575096947175758]
  We propose the first topologically and feature-wise accurate metric and loss function for supervised image segmentation. We show how induced matchings guarantee the spatially correct matching between barcodes in a segmentation setting. We show that the Betti matching error is an interpretable metric to evaluate the topological correctness of segmentations.
  arXiv  Detail & Related papers  (2022-11-28T12:57:57Z)
• Comprehensive Graph-conditional Similarity Preserving Network for Unsupervised Cross-modal Hashing [97.44152794234405]
  Unsupervised cross-modal hashing (UCMH) has become a hot topic recently. In this paper, we devise a deep graph-neighbor coherence preserving network (DGCPN) DGCPN regulates comprehensive similarity preserving losses by exploiting three types of data similarities.
  arXiv  Detail & Related papers  (2020-12-25T07:40:59Z)
• Robustness to Missing Features using Hierarchical Clustering with Split Neural Networks [39.29536042476913]
  We propose a simple yet effective approach that clusters similar input features together using hierarchical clustering. We evaluate this approach on a series of benchmark datasets and show promising improvements even with simple imputation techniques.
  arXiv  Detail & Related papers  (2020-11-19T00:35:08Z)
• Road Network Metric Learning for Estimated Time of Arrival [93.0759529610483]
  In this paper, we propose the Road Network Metric Learning framework for Estimated Time of Arrival (ETA) It consists of two components: (1) a main regression task to predict the travel time, and (2) an auxiliary metric learning task to improve the quality of link embedding vectors. We show that our method outperforms the state-of-the-art model and the promotion concentrates on the cold links with few data.
  arXiv  Detail & Related papers  (2020-06-24T04:45:14Z)
• AutoML Segmentation for 3D Medical Image Data: Contribution to the MSD Challenge 2018 [2.9864637081333085]
  A 3D convolutional neural network with encoder-decoder architecture was developed and is presented in this paper. It works on anisotropic voxel-geometries and has anisotropic depth, i.e., the number of down steps is a task-specific parameter.
  arXiv  Detail & Related papers  (2020-05-20T11:47:02Z)
• clDice -- A Novel Topology-Preserving Loss Function for Tubular Structure Segmentation [57.20783326661043]
  We introduce a novel similarity measure termed centerlineDice (short clDice) We theoretically prove that clDice guarantees topology preservation up to homotopy equivalence for binary 2D and 3D segmentation. We benchmark the soft-clDice loss on five public datasets, including vessels, roads and neurons (2D and 3D)
  arXiv  Detail & Related papers  (2020-03-16T16:27:49Z)
• Learning to Hash with Graph Neural Networks for Recommender Systems [103.82479899868191]
  Graph representation learning has attracted much attention in supporting high quality candidate search at scale. Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous. We propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes.
  arXiv  Detail & Related papers  (2020-03-04T06:59:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.