A mathematical framework for shape comparison based on mapping functions from the shape domain to a common reference domain is introduced and an interpretable morphometric is derived that quantifies shape similarity and reveals features such as skeletal topology and rotational symmetries.
Abstract
We introduce a mathematical framework for shape comparison based on mapping functions from the shape domain to a common reference domain. This Push-Forward Transform enables invariant and robust comparison of shapes, preserving intrinsic geometric information. Quantitatively comparing shapes and their temporal evolution is a fundamental challenge in image analysis. Meaningful shape comparison requires representations that are invariant to transformations that do not alter shape itself, such as translation, rotation, reflection, re-parametrization, and uniform scaling, while remaining sensitive to intrinsic geometric variation. Existing approaches often rely on sensitive parameterizations, landmark correspondence, or learned representations that are difficult to interpret and reproduce. We show that the Push-Forward Transform (PF-T) applied to Signed Distance Functions (SDFs) yields a continuous representation that captures both boundary and interior geometry. We derive an interpretable morphometric that quantifies shape similarity and reveals features such as skeletal topology and rotational symmetries. The push-forward transform applies consistently to two- and three-dimensional shapes, extends to time-evolving geometries, and supports the joint analysis of shape and additional scalar fields defined over shapes, such as intensity or molecular signals. We present the mathematical formulation, describe an efficient algorithm, and benchmark the approach on 2D, 3D, and temporal data sets.
Quantitative analysis of biological shape is central to understanding how form encodes function. Despite rapid advances in volumetric imaging and segmentation, analysis and of three-dimensional morphology remains challenging due to complex geometries and topologies found in biology. Existing approaches either rely on h...
Establishing meaningful point-to-point correspondences between distinct three-dimensional objects represents a foundational challenge in computer graphics, vision, and geometry processing. Traditional techniques have predominantly focused on isometric shapes, wherein intrinsic geodesic distances between points remain l...
Sebastian Huber, Charlotte Vogel· Journal of innovative resear...· 0 citations
This paper presents a unified framework for real-time deformation of three-dimensional Signed Distance Fields (SDFs). To address the lack of local control in conventional SDF deformation methods, we propose an effective local editing technique coupled with an inverse transformation pipeline. Each query point in the def...
Nuri Park, Da-Hye Kim, Seung-Hyun Yoon· IEEE Access· 0 citations
Feature-mapping methods represent structural designs by explicit geometric primitives on fixed analysis grids, an interpretable and parametric alternative to the density fields of density-based topology optimization (SIMP). In contrast to SIMP, however, feature-mapping optimization is sensitive to the initial design. W...
F. Wein, Patrick Jung, Arash Moradian et al.· 0 citations
This paper analyzes the local Taylor expansion of a continuous denoiser to motivate a strict invariance condition required for optimal, singlestep generation: the conservation of target identity, and demonstrates that solving this condition via the Method of Characteristics analytically yields the straight-line traject...
Flow-TAG is presented--a data-driven framework based on a generative flow model with a 1D U-Net backbone capable of mapping the geometry of a curve to the optimal parametrization for cubic B-splines that exhibits superior parameterization performance, robustness to noise in the input data, and strong generalization cap...
Roman Pavelkin, L. A. Zavala-Mondragón, Fons van der Sommen· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.