Unverified 2026

Cutoff-Free ECT Perimeter Feature

Implementation & benchmark of arXiv:2607.28021 — The Euler Characteristic Transform from a Convex Geometric Perspective

Usefulness6/10
Difficulty5/10
Novelty7/10

Source paper: The Euler Characteristic Transform from a Convex Geometric Perspective arXiv:2607.28021 ⓘ · analyzed Aug 31, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Compute a translation- and rotation-robust perimeter feature from the Euler Characteristic Transform and append it to learned shape features. Unlike a finite-radius ECT comparison, the point-anchor subtraction cancels the constant Euler-characteristic tail exactly, eliminating the need to tune a spatial cutoff.

Formulas

$$\int_{\mathbb{S}^{1}}\int_{\mathbb{R}}\bigl(\operatorname{ECT}(M)(v,t)-\chi(M)\operatorname{ECT}(a)(v,t)\bigr)\,dt\,dv=\operatorname{Peri}(M).$$
$$\operatorname{ECT}(M)(v,t)=\chi\!\left(M\cap\{x\in\mathbb{R}^{2}:\langle x,v\rangle\le t\}\right),\qquad \operatorname{ECT}(a)(v,t)=\mathbf{1}\{\langle a,v\rangle\le t\}.$$
$$\widehat{\operatorname{Peri}}(M)=\sum_{k=1}^{K}w_k\sum_{j}\left(c_{k,j}-\chi(M)b_{k,j}\right)(t_{k,j+1}-t_{k,j}),\quad b_{k,j}=\mathbf{1}\{t_{k,j}\ge\langle a,v_k\rangle\}.$$

Mathematical statement

Theorem 1.1, the perimeter recovery theorem, states that for a compact tame planar shape M subset of R^2 and any anchor point a in R^2, the integral over directions v in the unit circle S^1 and heights t in R satisfies ∫_{S^1}∫_R [ECT(M)(v,t) − χ(M)ECT(a)(v,t)] dt dv = Peri(M). Here ECT(M)(v,t) is the Euler characteristic χ(M ∩ {x : <x,v> ≤ t}) of the directional sublevel set, χ(M) is the Euler characteristic of the full shape, ECT(a)(v,t) is the transform of the singleton anchor {a}, equal to 1[t ≥ <a,v>], and Peri(M) is the geometric perimeter. The subtraction makes the integrand vanish after the shape and anchor have both entered the filtration, so integration over a finite range up to the largest observed height is sufficient; no arbitrary cutoff radius is required. Numerically, use directions v_k with quadrature weights w_k and sorted critical heights t_{k,j}; if c_{k,j} is the Euler characteristic on the interval [t_{k,j}, t_{k,j+1}) and b_{k,j}=1[t_{k,j} ≥ <a,v_k>], estimate perimeter by P_hat = Σ_k w_k Σ_j (c_{k,j} − χ(M)b_{k,j})(t_{k,j+1}−t_{k,j}).

Implementation notes

(1) Integration point: use this as a fixed geometric side channel for a 2D shape classifier or as an auxiliary loss for a segmentation model. For classification, take a binary mask or point cloud M from each sample, compute a scalar perimeter estimate P_hat, normalize it by image width plus height, and concatenate it to the penultimate CNN or PointNet feature before the final MLP. For segmentation, compute P_hat on the predicted mask and add λ|P_hat(prediction)−P_target|, where P_target is computed once from the ground-truth mask. (2) Pseudocode: choose K directions v_k=(cos(2πk/K), sin(2πk/K)) and weights w_k=2π/K; choose anchor a=(0,0), or the image center after consistently centering coordinates. For each direction, assign every foreground pixel, cubical cell, or point its height h=<x,v_k>. Build a lower-star filtration by sorting distinct heights. At each height, update the Euler characteristic using χ=number of connected components minus number of holes for the current binary cubical complex; record c_{k,j} on each interval. Set b_{k,j}=1[t_{k,j}≥<a,v_k>] and accumulate (c_{k,j}−χ(M)b_{k,j})Δt. Average or median estimates over several direction rotations. (3) The theorem supplies the cancellation and equality to perimeter. The implementation estimates χ and critical heights from a pixel cubical complex, point-cloud alpha complex, or a differentiable/topologically relaxed complex. For segmentation, use the exact estimator in the forward pass with a straight-through gradient, or replace hard foreground membership by soft threshold samples and finite differences while retaining the theorem-based value as the evaluation metric. (4) First experiment: train a small ResNet-18 on rotated MNIST silhouettes, MPEG-7 binary shapes, or synthetic polygons and circles, comparing the baseline CNN, raw sampled ECT features, and CNN plus the single P_hat feature. Randomly translate and rotate test shapes while preserving labels. Measure clean and transformed accuracy, calibration, and feature variance across isometric copies; success is improved transformed accuracy and substantially lower P_hat variance across copies without more than a small CPU preprocessing cost. For segmentation, compare U-Net with and without the perimeter loss on noisy synthetic shapes and report boundary F-score, IoU, and whether thin spurious components are reduced at equal parameter count.

Verification

This idea has not been verified yet.

Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.

Artifacts

Artifacts unavailable.