跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22101 · v1

An Omnidirectional WECT: Closed-Form Computation of the Directionally Integrated Weighted Euler Characteristic Transform

首次提交 2026-11-17 10:35
版本更新 2026-11-17 10:35
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

The weighted Euler characteristic transform (WECT) and related directional descriptors have become popular, efficiently computable tools for shape analysis across a variety of domains. In practice, however, they are approximated over a finite set of filtration directions, and thus the vectorized descriptor depends on this choice of directions and the rotational orientation of the data. In this manuscript, we formally introduce the directionally integrated weighted Euler characteristic transform (DIWECT), which averages the WECT over all directions s∈Sns \in \mathbb{S}^n for a weighted simplicial complex immersed in Rn+1\mathbb{R}^{n+1}. A framework for computing the DIWECT exactly, without sampling directions, is outlined: for each simplex, we partition Sn\mathbb{S}^n into the sets of directions in which a given vertex enters the filtration last, and then the DIWECT at height tt reduces to measuring intersections of these regions with a set of directions in which the simplex has entered the filtration by height~tt. We provide implementations for complexes immersed in R2\mathbb{R}^2 and R3\mathbb{R}^3, in which case the problem reduces to computing arc lengths and spherical areas. Experiments on synthetic and real-world data show that the DIWECT, while resulting in more compact vectorizations, also successfully encodes shape information and discards noise from data orientation. On a barley seed classification task, it outperforms the WECT in every pose except a hand-curated frame, whose advantage disappears under a two-degree rotation error. Compared with averaging the WECT over sampled directions, the DIWECT is often faster at matched accuracy. In one instance, this is upwards of a 50×50 \times speedup on a one-million-cell image with an error of 10−310^{-3}.

作者备注:27 pages, 12 figures

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 10:35 · 最新观测版本

An Omnidirectional WECT: Closed-Form Computation of the Directionally Integrated Weighted Euler Characteristic Transform

The weighted Euler characteristic transform (WECT) and related directional descriptors have become popular, efficiently computable tools for shape analysis across a variety of domains. In practice, however, they are approximated over a finite set of filtration directions, and thus the vectorized descriptor depends on this choice of directions and the rotational orientation of the data. In this manuscript, we formally introduce the directionally integrated weighted Euler characteristic transform (DIWECT), which averages the WECT over all directions s∈Sns \in \mathbb{S}^n for a weighted simplicial complex immersed in Rn+1\mathbb{R}^{n+1}. A framework for computing the DIWECT exactly, without sampling directions, is outlined: for each simplex, we partition Sn\mathbb{S}^n into the sets of directions in which a given vertex enters the filtration last, and then the DIWECT at height tt reduces to measuring intersections of these regions with a set of directions in which the simplex has entered the filtration by height~tt. We provide implementations for complexes immersed in R2\mathbb{R}^2 and R3\mathbb{R}^3, in which case the problem reduces to computing arc lengths and spherical areas. Experiments on synthetic and real-world data show that the DIWECT, while resulting in more compact vectorizations, also successfully encodes shape information and discards noise from data orientation. On a barley seed classification task, it outperforms the WECT in every pose except a hand-curated frame, whose advantage disappears under a two-degree rotation error. Compared with averaging the WECT over sampled directions, the DIWECT is often faster at matched accuracy. In one instance, this is upwards of a 50×50 \times speedup on a one-million-cell image with an error of 10−310^{-3}.

查看此版本解读 →查看此版本原文 ↗