Differentiable Euler Characteristic Transforms for Shape Classification

Ernst Röell, Bastian Alexander Rieck
10/1/2023

No official code found. Best implementation: aidos-lab/dect-evaluation (17 stars, BSD-3-Clause, last commit 2024-06-18). 1 more below.

Abstract

The Euler Characteristic Transform (ECT) has proven to be a powerful representation, combining geometrical and topological characteristics of shapes and graphs. However, the ECT was hitherto unable to learn task-specific representations. We overcome this issue and develop a novel computational layer that enables learning the ECT in an end-to-end fashion. Our method, the Differentiable Euler Characteristic Transform (DECT), is fast and computationally efficient, while exhibiting performance on a par with more complex models in both graph and point cloud classification tasks. Moreover, we show that this seemingly simple statistic provides the same topological expressivity as more complex topological deep learning layers.

View on arXivView PDF

Code Implementations(2)

BSD-3-Clause

Differentiable Euler Characteristic Transform

170Python, Jupyter NotebookMay 8, 20232 years agoBSD-3-Clause
iclr2024topological-data-analysistopological-deep-learningtopological-machine-learning
aidos-lab/dectCommunity100%
BSD-3-Clause

Differentiable Euler Characteristic Transform

165Python, MakefileJun 20, 20247 months agoBSD-3-Clause
euler-characteristiceuler-characteristic-transformiclr2024topological-data-analysistopological-deep-learning+1 more

Similar Papers

Cite this paper

@article{rell2023differentiable,
  title  = {Differentiable Euler Characteristic Transforms for Shape Classification},
  author = {Ernst Röell and Bastian Alexander Rieck},
  year   = {2023},
  eprint = {2310.07630},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2310.07630},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.07630.svg)](https://codeofpaper.com/paper/2310.07630)

Discussion