Resolution-free neural surrogates for geometric parameterization and mapping with spatially varying fields

• URL: http://arxiv.org/abs/2605.28551v2
• Date: Thu, 28 May 2026 08:10:06 GMT
• Title: Resolution-free neural surrogates for geometric parameterization and mapping with spatially varying fields
• Abstract summary: We propose a resolution-free neural surrogate for geometric parameterization and mapping problems.<n>We use a multi-resolution geometric encoding strategy that conditions the network on coordinate-augmented samples of the parameter field.
• Score: 2.7781405558373926
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many imaging problems require computing spatial transformations induced by spatially varying intensity, feature, or density fields. Canonical examples include distortion correction, deformable image registration, atlas-based segmentation, and deformation-driven image analysis. These tasks can be formulated as geometric mapping problems in which the transformation is constrained to preserve local structure, control boundary behavior, or regulate angular distortion. Such formulations typically lead to variational models, diffusion processes, or elliptic partial differential equations. However, repeatedly solving high-resolution systems becomes computationally expensive when the underlying parameter fields vary across instances. In this work, we propose a resolution-free neural surrogate for geometric parameterization and mapping problems. Given a spatially varying parameter field $p:Ω\to\mathbb{R}^m$ and query locations $\{x_i\}_{i=1}^N\subsetΩ$, the model predicts mapped locations $\{u(x_i)\}_{i=1}^N$ on arbitrary structured or unstructured point sets. To avoid dependence on a fixed grid, we use a multi-resolution geometric encoding strategy that conditions the network on coordinate-augmented samples of the parameter field. The model is trained without labeled solution data by enforcing geometry-aware constraints derived from variational energies, diffusion-based density equalization, and quasi-conformal theory. Experimental results on quasi-conformal mapping and density-equalizing mapping problems are presented to demonstrate the effectiveness of our proposed method.

Related papers

• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• GRIFDIR: Graph Resolution-Invariant FEM Diffusion Models in Function Spaces over Irregular Domains [56.121725064621295]
  Score-based diffusion models in function spaces offer a principled framework for modelling function-valued data.<n>However, practical implementations have struggled to fully realise these benefits.<n>We propose a novel architecture that represents generalised convolutional kernels as finite graph kernels.
  arXiv  Detail & Related papers  (2026-05-05T08:33:52Z)
• Graph-Instructed Neural Networks for parametric problems with varying boundary conditions [0.0]
  This work addresses the accurate and efficient simulation of physical phenomena governed by parametric Partial Differential Equations (PDEs)<n>We propose a novel methodology based on Graph-Instructed Neural Networks (GINNs)
  arXiv  Detail & Related papers  (2026-03-09T12:26:53Z)
• Visual Diffusion Models are Geometric Solvers [54.31602846693932]
  We show that visual diffusion models can serve as effective geometric solvers by working in pixel space.<n>We first demonstrate this on the Inscribed Square Problem, a long-standing problem in geometry.<n>We extend the approach to two other well-known hard geometric problems: the Steiner Tree Problem and the Simple Polygon Problem.
  arXiv  Detail & Related papers  (2025-10-24T17:57:31Z)
• Decoupled Geometric Parameterization and its Application in Deep Homography Estimation [52.96857897366727]
  Planar homography, with eight degrees of freedom (DOFs), is fundamental in numerous computer vision tasks.<n>This paper presents a novel geometric parameterization of homographies, leveraging the similarity- kernel-similarity decomposition for projective transformations.<n>Our proposed parameterization allows for direct homography estimation through matrix multiplication, eliminating the need for solving a linear system, and achieves performance comparable to the four-corner positional offsets in deep homography estimation.
  arXiv  Detail & Related papers  (2025-05-22T12:33:29Z)
• Geometry aware inference of steady state PDEs using Equivariant Neural Fields representations [0.30786914102688595]
  We introduce enf2enf, a neural field approach for predicting steady-state PDEs with geometric variability.<n>Our method encodes geometries into latent features anchored at specific spatial locations, preserving locality throughout the network.
  arXiv  Detail & Related papers  (2025-04-24T08:30:32Z)
• Shape-informed surrogate models based on signed distance function domain encoding [8.052704959617207]
  We propose a non-intrusive method to build surrogate models that approximate the solution of parameterized partial differential equations (PDEs) Our approach is based on the combination of two neural networks (NNs)
  arXiv  Detail & Related papers  (2024-09-19T01:47:04Z)
• Non-linear Independent Dual System (NIDS) for Discretization-independent Surrogate Modeling over Complex Geometries [0.0]
  Non-linear independent dual system (NIDS) is a deep learning surrogate model for discretization-independent, continuous representation of PDE solutions. NIDS can be used for prediction over domains with complex, variable geometries and mesh topologies. Test cases include a vehicle problem with complex geometry and data scarcity, enabled by a training method.
  arXiv  Detail & Related papers  (2021-09-14T23:38:41Z)
• 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)
• The Geometry of Deep Generative Image Models and its Applications [0.0]
  Generative adversarial networks (GANs) have emerged as a powerful unsupervised method to model the statistical patterns of real-world data sets. These networks are trained to map random inputs in their latent space to new samples representative of the learned data. The structure of the latent space is hard to intuit due to its high dimensionality and the non-linearity of the generator.
  arXiv  Detail & Related papers  (2021-01-15T07:57:33Z)
• Convex Geometry and Duality of Over-parameterized Neural Networks [70.15611146583068]
  We develop a convex analytic approach to analyze finite width two-layer ReLU networks. We show that an optimal solution to the regularized training problem can be characterized as extreme points of a convex set. In higher dimensions, we show that the training problem can be cast as a finite dimensional convex problem with infinitely many constraints.
  arXiv  Detail & Related papers  (2020-02-25T23:05:33Z)

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.