Metraipolis › archive › dc_45827f2b148e

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01078
License (as archived)
CC0-1.0
Archived
2026-11-03T18:26:47.886Z
SHA-256 of the archived text
7179743b08cacbcb06295e8b00ef1e4a6778cde5f42e0b691c9c0a565e00818e
Stable URL of this page
https://metraipolis.com/documento/dc_45827f2b148e

How to cite

CuPH: Parallel Cubical Persistent Homology via Level-Synchronous Component Tracking — arXiv:2611.01078 — arXiv (en), https://arxiv.org/abs/2611.01078 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_45827f2b148e (Metraipolis archive dc_45827f2b148e, sha256 7179743b08cacbcb06295e8b00ef1e4a6778cde5f42e0b691c9c0a565e00818e)
BibTeX
@misc{dc45827f2b148e,
  title = {CuPH: Parallel Cubical Persistent Homology via Level-Synchronous Component Tracking — arXiv:2611.01078},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01078},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_45827f2b148e; sha256 7179743b08cacbcb06295e8b00ef1e4a6778cde5f42e0b691c9c0a565e00818e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01078. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\Theta(n)$ parallel depth for an $n$-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 $\Theta(n)$ to $O(L\log n)$ for an image with $L$ intensity levels. We implement the level sweep as a single CUDA kernel, eliminating cross-level kernel-launch overhead. Empirically, CuPH is $18.6$--$99.6\times$ faster than the existing GPU baseline (CMP). As a drop-in PH backend, CuPH accelerates topology-aware classification ($4.2$--$16.7\times$) and segmentation ($8.3$--$44\times$) while preserving accuracy. It also enables computing full-image PH losses on high-resolution images, improving segmentation Dice by $2.2$--$4.6$ points over patch-local PH baselines and accelerating training by $25$--$31\times$.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Computational Geometry (cs.CG); Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2611.01078 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:10:22.849Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).