cs.CVOct 31, 2026

CuPH: Parallel Cubical Persistent Homology via Level-Synchronous Component Tracking

Authors: Guangyu Meng, Pengfei Gu, Erin Wolf Chambers, Danny Z. Chen

Organizations: Dept. of Computer Science and Engineering, University of Notre Dame · Dept. of Computer Science, The University of Texas Rio Grande Valley

Abstract

Persistent homology (PH) is a mathematically principled multi-scale topological descriptor of shape and connectivity in data. It is widely applied in image classification, segmentation, and shape analysis across medical and aerial imaging, providing structural information that pixel-wise deep learning may overlook. Standard cubical PH decomposes an image into cubical cells (vertices, edges, and squares) and reduces them sequentially in filtration order. This sequential reduction has Θ(n)Θ(n) parallel depth for an nn-pixel image, limiting within-image GPU parallelism and constraining its use in topology-aware deep learning. We introduce CuPH, a GPU-based parallel algorithm for computing cubical PH on 2D images that operates directly on pixels rather than cubical cells. CuPH buckets pixels by filtration values, activates them with a level-synchronous sweep, and tracks connected components with a lock-free union-find method. We prove that CuPH produces persistence diagrams identical to standard cubical PH on integer inputs, with a stability bound for floating-point inputs. CuPH reduces parallel depth from Θ(n)Θ(n) to O(Llog⁡n)O(L\log n) for an image with LL intensity levels. We implement the level sweep as a single CUDA kernel, eliminating cross-level kernel-launch overhead. Empirically, CuPH is 18.618.6--99.6×99.6\times faster than the existing GPU baseline (CMP). As a drop-in PH backend, CuPH accelerates topology-aware classification (4.24.2--16.7×16.7\times) and segmentation (8.38.3--44×44\times) while preserving accuracy. It also enables computing full-image PH losses on high-resolution images, improving segmentation Dice by 2.22.2--4.64.6 points over patch-local PH baselines and accelerating training by 2525--31×31\times.

Figures & tables

Appendix figures & tables9 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Sparse cubical complexes for efficient topology-preservation in image data

    Sep 29, 2026Alexander H. Berger, Marco Fontana, Daniel Rueckert +3Image SegmentationTopology-Preserving Image Segmentation

  2. GPU-Accelerated Computation of Persistent Homology for Topological Analysis of Image Data

    Oct 7, 2026Fan Wang, Hubert Wagner, Rezaul Chowdhury +1Persistent HomologyTopological Data Analysis

  3. Fast Cubical Persistent Homology on 2D and 3D Images via Union-Find, Pruning, and Lookup Tables

    Jun 3, 2026Titouan Le Breton, Karol Szustakowski, Marie PiraudPersistent HomologyTopological Data Analysis