Digital tools for analyzing nondiffeomorphic shapes

The Euler Characteristic Transform (ECT) of Turner et al. provides a way to statistically analyze nondiffeomorphic shapes without relying on landmarks. In applications, this transform is typically approximated by a discrete set of directions and heights, which results in potential loss of information, as well as problems in inverting the transform. In this work, we present a fully digital algorithm for computing the ECT exactly, up to computer precision; we introduce the Ectoplasm package that implements this algorithm, and we demonstrate that this is fast and convenient enough to compute distances in real-life datasets. We also discuss the implications of this algorithm to related problems in shape analysis, such as shape inversion and subshape selection. We also show a proof-of-concept application for solving the shape alignment problem with gradient descent and adaptive grid search, which are two powerful methods, neither of which is possible using the discretized transform.

Authors

Institutions

Publication Details

Journal
Proceedings of the National Academy of Sciences
Published
2025-11-14
DOI
https://doi.org/10.1073/pnas.2426574122
Primary Topic
Morphological variations and asymmetry
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Digital tools for analyzing nondiffeomorphic shapes

Henry Kirveslahti, X.Z Wang
Proceedings of the National Academy of Sciences
Morphological variations and asymmetry
article

Digital tools for analyzing nondiffeomorphic shapes

Henry Kirveslahti, X.Z Wang
article en

Abstract

The Euler Characteristic Transform (ECT) of Turner et al. provides a way to statistically analyze nondiffeomorphic shapes without relying on landmarks. In applications, this transform is typically approximated by a discrete set of directions and heights, which results in potential loss of information, as well as problems in inverting the transform. In this work, we present a fully digital algorithm for computing the ECT exactly, up to computer precision; we introduce the Ectoplasm package that implements this algorithm, and we demonstrate that this is fast and convenient enough to compute distances in real-life datasets. We also discuss the implications of this algorithm to related problems in shape analysis, such as shape inversion and subshape selection. We also show a proof-of-concept application for solving the shape alignment problem with gradient descent and adaptive grid search, which are two powerful methods, neither of which is possible using the discretized transform.

Proceedings of the National Academy of SciencesVol. 122(46)
Nanyang Technological University (SG), University of Southern Denmark (DK), Joint Center for Quantum Information and Computer Science (US), Center for Neurosciences (US), Division of Mathematical Sciences (US), École Polytechnique Fédérale de Lausanne (CH)
Openalex Percentile: Top 60%
Morphological variations and asymmetry
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.