The Push-Forward Transform for Continuous and Robust Comparison of Dynamic Shapes

• URL: http://arxiv.org/abs/2608.02306v1
• Date: Mon, 03 Aug 2026 14:31:21 GMT
• Title: The Push-Forward Transform for Continuous and Robust Comparison of Dynamic Shapes
• Abstract summary: We introduce a mathematical framework for shape comparison based on mapping functions from the shape domain to a common reference domain.<n>We derive an interpretable morphometric that quantifies shape similarity and reveals features such as skeletal topology and rotational symmetries.<n>We present the mathematical formulation, describe an efficient algorithm, and benchmark the approach on 2D, 3D, and temporal data sets.
• Score: 1.6058099298620423
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• GenSP: Consistent Spherical Parameterization via Learning Shape Generative Models [45.68408819044841]
  We introduce GenSP, a data-driven framework that learns consistent spherical parameterizations across a collection of genus-0 shapes.<n>We address several key challenges in learning such a generative model.<n>Experiments on the ShapeNet dataset demonstrate that our approach significantly reduces geometric distortion.
  arXiv  Detail & Related papers  (2026-07-01T06:19:55Z)
• A Continuous and Interpretable Morphometric for Robust Quantification of Dynamic Biological Shapes [1.37013665345905]
  PF-SDM compactly encodes geometric and topological properties of closed shapes.<n>It provides robust and interpretable features for shape comparison and machine learning.
  arXiv  Detail & Related papers  (2024-10-28T13:28:21Z)
• Spectral Meets Spatial: Harmonising 3D Shape Matching and Interpolation [50.376243444909136]
  We present a unified framework to predict both point-wise correspondences and shape between 3D shapes. We combine the deep functional map framework with classical surface deformation models to map shapes in both spectral and spatial domains.
  arXiv  Detail & Related papers  (2024-02-29T07:26:23Z)
• Geometrically Consistent Partial Shape Matching [50.29468769172704]
  Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics. An often neglected but essential property of matching geometrics is consistency. We propose a novel integer linear programming partial shape matching formulation.
  arXiv  Detail & Related papers  (2023-09-10T12:21:42Z)
• A Theory of Topological Derivatives for Inverse Rendering of Geometry [87.49881303178061]
  We introduce a theoretical framework for differentiable surface evolution that allows discrete topology changes through the use of topological derivatives. We validate the proposed theory with optimization of closed curves in 2D and surfaces in 3D to lend insights into limitations of current methods.
  arXiv  Detail & Related papers  (2023-08-19T00:55:55Z)
• Frame Averaging for Equivariant Shape Space Learning [85.42901997467754]
  A natural way to incorporate symmetries in shape space learning is to ask that the mapping to the shape space (encoder) and mapping from the shape space (decoder) are equivariant to the relevant symmetries. We present a framework for incorporating equivariance in encoders and decoders by introducing two contributions.
  arXiv  Detail & Related papers  (2021-12-03T06:41:19Z)
• Spectral Unions of Partial Deformable 3D Shapes [31.93707121229739]
  We introduce the first method to compute compositions of non-rigidly deforming shapes, without requiring to solve first for a dense correspondence between the given partial shapes. Our approach is data-driven, and can generalize to isometric and non-isometric deformations of the surface.
  arXiv  Detail & Related papers  (2021-03-31T14:19:18Z)
• Disentangling Geometric Deformation Spaces in Generative Latent Shape Models [5.582957809895198]
  A complete representation of 3D objects requires characterizing the space of deformations in an interpretable manner. We improve on a prior generative model of disentanglement for 3D shapes, wherein the space of object geometry is factorized into rigid orientation, non-rigid pose, and intrinsic shape. The resulting model can be trained from raw 3D shapes, without correspondences, labels, or even rigid alignment.
  arXiv  Detail & Related papers  (2021-02-27T06:54:31Z)
• ResNet-LDDMM: Advancing the LDDMM Framework Using Deep Residual Networks [86.37110868126548]
  In this work, we make use of deep residual neural networks to solve the non-stationary ODE (flow equation) based on a Euler's discretization scheme. We illustrate these ideas on diverse registration problems of 3D shapes under complex topology-preserving transformations.
  arXiv  Detail & Related papers  (2021-02-16T04:07:13Z)
• Disentangling images with Lie group transformations and sparse coding [3.3454373538792552]
  We train a model that learns to disentangle spatial patterns and their continuous transformations in a completely unsupervised manner. Training the model on a dataset consisting of controlled geometric transformations of specific MNIST digits shows that it can recover these transformations along with the digits.
  arXiv  Detail & Related papers  (2020-12-11T19:11:32Z)
• Deep Implicit Templates for 3D Shape Representation [70.9789507686618]
  We propose a new 3D shape representation that supports explicit correspondence reasoning in deep implicit representations. Our key idea is to formulate DIFs as conditional deformations of a template implicit function. We show that our method can not only learn a common implicit template for a collection of shapes, but also establish dense correspondences across all the shapes simultaneously without any supervision.
  arXiv  Detail & Related papers  (2020-11-30T06:01:49Z)
• Instant recovery of shape from spectrum via latent space connections [33.83258865005668]
  We introduce the first learning-based method for recovering shapes from Laplacian spectra. Given an auto-encoder, our model takes the form of a cycle-consistent module to map latent vectors to sequences of eigenvalues. Our data-driven approach replaces the need for ad-hoc regularizers required by prior methods, while providing more accurate results at a fraction of the computational cost.
  arXiv  Detail & Related papers  (2020-03-14T00:48:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.