Papers
Topics
Authors
Recent
Search
2000 character limit reached

Domain Elastic Transform (DET)

Updated 4 July 2026
  • Domain Elastic Transform (DET) is a dual-framework where grid-free Bayesian registration aligns vector-valued functions on irregular domains and elastic ray tomography maps elastic parameters via ray integrals.
  • It employs a Bayesian model with Gaussian process priors to infer smooth spatial deformations, integrating both geometric and functional likelihoods for robust registration.
  • DET scales to atlas-level data using Nyström approximation and variance-guided importance sampling, while addressing challenges like low overlap and significant topological changes.

Searching arXiv for the two cited papers and closely related context. Domain Elastic Transform (DET) denotes a domain-centered elastic framework in which deformation or measurement is defined on the spatial support of scientific data rather than on a regular grid. In recent arXiv usage, the term has two technically distinct realizations. In one, DET is a grid-free Bayesian method for registering vector-valued functions on irregular point sets by inferring a smooth elastic deformation of the domain from a joint spatial–functional likelihood (Hirose et al., 22 Mar 2026). In the other, the elastic ray transform can be read as a DET for elastic wave tomography because it maps elastic parameter fields on the domain to ray-based line-integral data indexed by directions and polarizations, and at rank $2$ it corresponds to linearization of travel time of elastic waves, measured for all polarizations (Ilmavirta et al., 25 Feb 2025). The common structure is that the codomain records either correspondences or ray data induced by an elastic model acting on domain-supported fields, but the two settings address different inverse problems.

1. Scope of the term

The DET literature currently spans both nonrigid registration of irregular scientific data and tensor tomography for elastic media. The distinction is not terminological only; it reflects different mathematical objects, likelihoods, and identifiability statements.

Usage in recent literature Domain Output
Bayesian DET Point sets with attached feature vectors (ym,fY(ym))(y_m, f_Y(y_m)) Deformation, correspondences, and noise parameters
Elastic-ray DET Elastic tensor fields f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m} Ray integrals #1mv,qf(x)\#1{m}_{v,q} f(x)

In the registration setting, DET was introduced to resolve the split between point set registration, which aligns sparse geometries, and image registration, which aligns continuous intensity fields on regular grids. The motivating data are high-dimensional vector-valued functions defined on irregular, sparse manifolds, such as spatial transcriptomics. In the tomographic setting, the relevant transform acts on elastic mm-tensor fields and produces measurements along rays for all admissible polarizations. A plausible implication is that the two usages share a geometric philosophy—elastic structure is imposed on transformations of the domain—but they operate at different levels: Bayesian correspondence inference versus integral-geometric recovery (Hirose et al., 22 Mar 2026).

2. Bayesian DET for functions on irregular domains

In the registration formulation, DET is a training-free Bayesian algorithm for nonrigid registration of vector-valued functions defined on irregular point sets. The central objects are two functions

fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},

discretized as target points {xn}n=1N\{x_n\}_{n=1}^N with values

Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},

and source points {ym}m=1M\{y_m\}_{m=1}^M with values

Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.

The registration goal is to infer a deformation (ym,fY(ym))(y_m, f_Y(y_m))0 such that, for corresponding points (ym,fY(ym))(y_m, f_Y(y_m))1,

(ym,fY(ym))(y_m, f_Y(y_m))2

A defining feature of DET is that the transformation acts only on spatial coordinates. The codomain (ym,fY(ym))(y_m, f_Y(y_m))3 is not warped, rotated, or otherwise mixed into the ambient space. Instead, functional similarity constrains which spatial deformations are plausible. This directly addresses the failure mode of naive augmentation in (ym,fY(ym))(y_m, f_Y(y_m))4, where spatial and feature dimensions are treated as commensurate coordinates.

The Bayesian model introduces latent variables

(ym,fY(ym))(y_m, f_Y(y_m))5

where (ym,fY(ym))(y_m, f_Y(y_m))6 is the displacement field, (ym,fY(ym))(y_m, f_Y(y_m))7 the mixture weights, (ym,fY(ym))(y_m, f_Y(y_m))8 the outlier flags, (ym,fY(ym))(y_m, f_Y(y_m))9 the correspondence indices, f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}0 the global similarity parameters, f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}1 the spatial variance, and f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}2 the functional covariance. The spatial transform applied to a source point is

f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}3

The joint spatial–functional likelihood is the model’s core coupling: f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}4 where f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}5 balances the functional term relative to the spatial term. Consequently, a target point is likely to match a source point only when both the deformed position and the attached feature vector are compatible. This gives DET its characteristic status as a unified geometric–functional registration model (Hirose et al., 22 Mar 2026).

3. Elastic motion prior, correspondence model, and variational inference

The adjective “elastic” in DET refers to the deformation prior. For each coordinate component f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}6, the displacement field is modeled as a Gaussian process

f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}7

so that, for the discrete vector f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}8,

f:Rn#2nmf : \mathbb{R}^n \to \#2{n}{m}9

with #1mv,qf(x)\#1{m}_{v,q} f(x)0. The stiffness parameter #1mv,qf(x)\#1{m}_{v,q} f(x)1 controls deformation magnitude: larger #1mv,qf(x)\#1{m}_{v,q} f(x)2 yields a stiffer prior. The associated quadratic form

#1mv,qf(x)\#1{m}_{v,q} f(x)3

penalizes rough or incoherent displacement fields.

For tissue-like data on manifolds, DET employs a surface coherence matrix that mixes Euclidean and geodesic distances: #1mv,qf(x)\#1{m}_{v,q} f(x)4 where #1mv,qf(x)\#1{m}_{v,q} f(x)5, #1mv,qf(x)\#1{m}_{v,q} f(x)6, and #1mv,qf(x)\#1{m}_{v,q} f(x)7. The geodesic distance is computed on a #1mv,qf(x)\#1{m}_{v,q} f(x)8-NN graph in a joint space of coordinates and weighted features. Because geodesic kernels can be indefinite, a fast PSD approximation is applied to obtain a valid covariance.

Inference proceeds by variational Bayes with structured mean-field factorization

#1mv,qf(x)\#1{m}_{v,q} f(x)9

where mm0 is a Dirac delta at the MAP parameters. The correspondence statistics are encoded by

mm1

with

mm2

The posterior over mixture weights is Dirichlet, the posterior over the displacement field is Gaussian, and the global similarity parameters mm3 are updated by a weighted Procrustes solution obtained from the SVD of mm4.

High-dimensional features are handled through a diagonal mm5, yielding per-feature noise variances

mm6

This is used as automatic relevance determination (ARD): inconsistent features receive large variance and are down-weighted, whereas informative features receive small variance and contribute more strongly to alignment. DET therefore generalizes Bayesian CPD from geometry-only registration to function-aware registration while preserving the probabilistic motion-coherence structure (Hirose et al., 22 Mar 2026).

4. Scalability, empirical behavior, and practical limitations

DET was designed for atlas-scale data. Its main computational bottlenecks are the matching-probability matrix mm7 and the kernel matrix mm8. The implementation uses Nyström approximation of mm9 and fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},0, k-D tree search to approximate sparse fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},1 in later iterations, and a three-stage pipeline consisting of downsampling, DET on the downsampled sets, and interpolation of the deformation back to the full data. The downsampling scheme is Variance-Guided Importance Sampling (VGIS), defined by

fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},2

so that both functional boundaries and geometric edges are preferentially retained.

On MERFISH mouse-brain slice-to-slice alignment, the reported mean fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},3 std over fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},4 consecutive slice pairs were fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},5 Jaccard, fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},6 Topology Score, and fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},7 Smoothed PCC for DET; fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},8, fX:RDRD,fY:RDRD,f_X : \mathbb{R}^D \to \mathbb{R}^{D'}, \qquad f_Y : \mathbb{R}^D \to \mathbb{R}^{D'},9, and {xn}n=1N\{x_n\}_{n=1}^N0 for BCPD; and {xn}n=1N\{x_n\}_{n=1}^N1, {xn}n=1N\{x_n\}_{n=1}^N2, and {xn}n=1N\{x_n\}_{n=1}^N3 for PASTE. The abstract summarizes this as DET achieving 92\% topological preservation on MERFISH data where state-of-the-art optimal transport methods struggle {xn}n=1N\{x_n\}_{n=1}^N4. On Stereo-seq whole-embryo atlases, DET registered an E14.5 sagittal section with approximately {xn}n=1N\{x_n\}_{n=1}^N5k points to an E15.5 sagittal section with approximately {xn}n=1N\{x_n\}_{n=1}^N6k points, using the first {xn}n=1N\{x_n\}_{n=1}^N7 principal components of gene expression, while preserving overall tissue topology and maintaining clear organ boundaries. After acceleration, the reported complexity is approximately time {xn}n=1N\{x_n\}_{n=1}^N8 and memory {xn}n=1N\{x_n\}_{n=1}^N9; a runtime study on MacBook Air M1 reported roughly Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},0–Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},1 s with Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},2 landmarks and up to roughly Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},3 s with Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},4 (Hirose et al., 22 Mar 2026).

Several common misconceptions are explicitly excluded by the formulation. DET is grid-free, so it is not an image-registration method in disguise; it works directly on point clouds and avoids voxelization. It is training-free and unsupervised, so it does not depend on a pretrained network. It does not explicitly enforce diffeomorphisms, and there are no explicit formal guarantees of global diffeomorphism or topology preservation; continuity and coherence arise from the GP prior, smooth kernels, and moderate deformation scales. The paper also identifies typical failure modes: insufficient initial overlap, weak or batch-biased functional signal, and severe topological changes such as missing organs or appearance/disappearance of structures. These limitations define the present boundary of DET as a practical Bayesian registration method rather than a general theorem on topology-preserving correspondence (Hirose et al., 22 Mar 2026).

5. DET as the elastic ray transform in elastic wave tomography

In the tomographic usage, DET is realized by the elastic ray transform acting on elastic tensor fields. For dimensions Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},5 and integer Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},6, the paper defines elastic Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},7-tensors by

Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},8

that is, symmetric rank-Fx=(fX(x1),,fX(xN))RD×N,F_x = \big(f_X(x_1), \dots, f_X(x_N)\big) \in \mathbb{R}^{D' \times N},9 tensors over the symmetric square of {ym}m=1M\{y_m\}_{m=1}^M0. These are not fully symmetric tensors of rank {ym}m=1M\{y_m\}_{m=1}^M1; they carry the elastic symmetries of elasticity theory. For {ym}m=1M\{y_m\}_{m=1}^M2,

{ym}m=1M\{y_m\}_{m=1}^M3

For a direction {ym}m=1M\{y_m\}_{m=1}^M4, the admissible polarizations are

{ym}m=1M\{y_m\}_{m=1}^M5

Thus both longitudinal {ym}m=1M\{y_m\}_{m=1}^M6 and shear {ym}m=1M\{y_m\}_{m=1}^M7 polarizations are included. The elastic ray transform of {ym}m=1M\{y_m\}_{m=1}^M8 is

{ym}m=1M\{y_m\}_{m=1}^M9

and, for Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.0,

Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.1

Each operator extends from Schwartz space to Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.2,

Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.3

The physical motivation is the elastic wave equation

Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.4

with principal symbol given by the Christoffel matrix

Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.5

In an isotropic, homogeneous background, Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.6 has one simple P-wave eigenvalue with polarization parallel to Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.7 and one shear eigenvalue of multiplicity Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.8 with polarizations orthogonal to Fy=(fY(y1),,fY(yM))RD×M.F_y = \big(f_Y(y_1), \dots, f_Y(y_M)\big) \in \mathbb{R}^{D' \times M}.9. At rank (ym,fY(ym))(y_m, f_Y(y_m))00, the transform corresponds to a linearization of travel time for all frozen polarizations,

(ym,fY(ym))(y_m, f_Y(y_m))01

so that, conceptually, domain elastic parameters are mapped to ray-based travel-time-like data indexed by (ym,fY(ym))(y_m, f_Y(y_m))02. The paper states this explicitly: “At rank 2 it corresponds to linearization of travel time of elastic waves, measured for all polarizations” (Ilmavirta et al., 25 Feb 2025).

6. Kernel structure, identifiability, and relation to classical tensor tomography

The transform-theoretic DET has a kernel structure that differs from standard symmetric tensor tomography because the relevant potential operators are not purely first-order. For general rank (ym,fY(ym))(y_m, f_Y(y_m))03, the paper defines

(ym,fY(ym))(y_m, f_Y(y_m))04

with

(ym,fY(ym))(y_m, f_Y(y_m))05

and proves

(ym,fY(ym))(y_m, f_Y(y_m))06

At rank (ym,fY(ym))(y_m, f_Y(y_m))07,

(ym,fY(ym))(y_m, f_Y(y_m))08

At rank (ym,fY(ym))(y_m, f_Y(y_m))09, two potential operators enter: (ym,fY(ym))(y_m, f_Y(y_m))10 with formal adjoints

(ym,fY(ym))(y_m, f_Y(y_m))11

The central result is

(ym,fY(ym))(y_m, f_Y(y_m))12

together with solenoidal injectivity,

(ym,fY(ym))(y_m, f_Y(y_m))13

This yields an elastic Helmholtz-type decomposition

(ym,fY(ym))(y_m, f_Y(y_m))14

where (ym,fY(ym))(y_m, f_Y(y_m))15 is the closure of fields of the form (ym,fY(ym))(y_m, f_Y(y_m))16 and (ym,fY(ym))(y_m, f_Y(y_m))17 is the closure of fields satisfying (ym,fY(ym))(y_m, f_Y(y_m))18 and (ym,fY(ym))(y_m, f_Y(y_m))19.

The Fourier analysis is correspondingly refined. For rank (ym,fY(ym))(y_m, f_Y(y_m))20, the Fourier slice theorem states that (ym,fY(ym))(y_m, f_Y(y_m))21 is equivalent to (ym,fY(ym))(y_m, f_Y(y_m))22 and

(ym,fY(ym))(y_m, f_Y(y_m))23

for all (ym,fY(ym))(y_m, f_Y(y_m))24, (ym,fY(ym))(y_m, f_Y(y_m))25, and (ym,fY(ym))(y_m, f_Y(y_m))26. At each nonzero frequency, the symbol-level decomposition

(ym,fY(ym))(y_m, f_Y(y_m))27

separates (ym,fY(ym))(y_m, f_Y(y_m))28-generated, (ym,fY(ym))(y_m, f_Y(y_m))29-generated, and jointly solenoidal components. This is the frequency-domain mechanism underlying the kernel characterization.

The identifiability statement is therefore conditional. In general anisotropic settings, only the solenoidal component is recoverable; the potential components are gauge freedoms invisible to all ray–polarization data in the model. Under isotropic perturbations,

(ym,fY(ym))(y_m, f_Y(y_m))30

the situation simplifies. For (ym,fY(ym))(y_m, f_Y(y_m))31,

(ym,fY(ym))(y_m, f_Y(y_m))32

and for (ym,fY(ym))(y_m, f_Y(y_m))33,

(ym,fY(ym))(y_m, f_Y(y_m))34

Since (ym,fY(ym))(y_m, f_Y(y_m))35 is injective, (ym,fY(ym))(y_m, f_Y(y_m))36 and (ym,fY(ym))(y_m, f_Y(y_m))37 are uniquely determined. Relative to the classical longitudinal X-ray transform, the elastic-ray DET is therefore a hybrid longitudinal–mixed transform with an elastic-specific kernel generated by second-order potentials and the first-order operator (ym,fY(ym))(y_m, f_Y(y_m))38, rather than only by the symmetrized gradient familiar from standard tensor tomography (Ilmavirta et al., 25 Feb 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (2)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Domain Elastic Transform (DET).