---
title: Preconditioned Deformation Grids
url: https://www.emergentmind.com/topics/preconditioned-deformation-grids
type: topic
---

# Preconditioned Deformation Grids

Searching arXiv for the cited papers to ground the article and confirm bibliographic details.
Preconditioned Deformation Grids are a technique for dynamic surface reconstruction that estimates coherent deformation fields directly from unstructured point cloud sequences without requiring or forming explicit correspondences. The method represents motion with multi-resolution voxel grids and couples this representation to grid-based Sobolev preconditioning inside gradient-based optimization, so that a Chamfer loss between the input point clouds and an evolving template mesh, complemented by a weak isometry term on mesh edges, is sufficient to obtain accurate deformations [2509.18097]. In subsequent work, the same core idea was reformulated as a neural preconditioned latent-grid encoding in Neu-PiG, which parameterizes the deformation of an entire long sequence relative to a single keyframe surface and decodes per-frame 6-DoF deformations with a lightweight MLP while retaining Sobolev-preconditioned optimization [2602.22212].

## 1. Problem setting and conceptual scope

Dynamic surface reconstruction of objects from point cloud sequences is presented as a challenging field in computer graphics. The central difficulty is to recover temporally coherent surfaces from unstructured observations while avoiding over-smoothing, poor generalization to unseen objects and motions, or optimization drift over long sequences. Preconditioned Deformation Grids were introduced to address these limitations without depending on multiple regularization terms or extensive training data [2509.18097].

The method is explicitly positioned against two classes of alternatives. One class relies on incremental deformation optimization, which risks drift and requires long runtimes on very long sequences. The other relies on complex learned models that demand category-specific training. Neu-PiG states these limitations directly and proposes a fast deformation optimization method that optimizes “from scratch,” while PDG emphasizes direct estimation from unstructured point cloud sequences without explicit correspondences [2602.22212].

A common misconception is that coherent deformation estimation necessarily requires explicit correspondences or category-specific pretraining. The cited works reject this premise: PDG estimates deformation fields directly from unstructured point cloud sequences without requiring or forming explicit correspondences, and Neu-PiG states that it completely avoids the need for any explicit correspondences or further priors [2509.18097].

## 2. Multi-resolution deformation parameterization

In Preconditioned Deformation Grids, the deformation field is represented by a hierarchy of voxel grids
\[
G_t = \{ G_t^1, G_t^2, \dots, G_t^l, \dots, G_t^L \},
\]
with each level \(l\) covering the normalized domain \(D=[-1,1]^3\) by a regular lattice of cells \(C^l\). Level \(l\) has a cell-spacing \(\Delta^l \propto (2l-1)^{-1}\), and each cell \(c\in C^l\) stores a 6D transformation parameter
\[
T_t^{l,c} = [ z_t^{l,c} ; t_t^{l,c} ] \in \mathbb R^6,
\]
where \(z\in\mathbb R^3\) parameterizes rotation via the Cayley map and \(t\in\mathbb R^3\) is translation [2509.18097].

To deform a point \(x\in D\) at time \(t\), the method gathers the eight trilinear weights from the enclosing cell at each level and averages over all levels:
\[
\hat T_t(x)=\frac1L\sum_{l=1}^L\sum_{c\in\mathcal N^l(x)} w_t^{l,c}(x)\,T_t^{l,c}.
\]
Here \(\mathcal N^l(x)\) denotes the eight neighboring cells in level \(l\), and the factor \(1/L\) ensures equal contribution from each scale. This design captures overall motion at varying spatial scales and provides a flexible deformation representation [2509.18097].

Neu-PiG preserves the multi-resolution grid principle but replaces per-time-step transformation grids with a latent-grid encoding tied to a keyframe surface. It assumes a fixed reference mesh at keyframe \(t_{\rm key}\) with vertices \(\{\mathbf x_{i,t_{\rm key}}\}_{i=1}^{N}\) and normals \(\{\mathbf n_{i,t_{\rm key}}\}_{i=1}^{N}\). The method stores two voxel-grid hierarchies: a position grid \(G_p\) with \(L=8\) levels, where level \(l\) has resolution \((2^{l+0})^3\) and each cell stores a learnable 30-D feature, and a normal grid \(G_n\) of fixed resolution \(4^3\), where each cell stores a 2-D feature [2602.22212].

For a reference vertex, trilinear interpolation is performed in both the position and normal grids. The position features are averaged across levels to obtain \(\mathbf z_p(\mathbf x)\in\mathbb R^{30}\), while the normal feature gives \(\mathbf z_n(\mathbf n)\in\mathbb R^2\). Each reference vertex is thereby associated with a 32-D latent
\[
\mathbf z_i = \bigl[\mathbf z_n(\mathbf n_{i,t_{\rm key}});\mathbf z_p(\mathbf x_{i,t_{\rm key}})\bigr]\in\mathbb R^{32}.
\]
This suggests a shift from explicit per-frame grid transforms to a surface-conditioned latent field that encodes entire deformations across all time steps [2602.22212].

## 3. Sobolev preconditioning and its role in optimization

The defining technical feature of Preconditioned Deformation Grids is the use of Sobolev preconditioning in the optimization loop. The continuous formulation introduces the \(H^s\) inner product for scalar fields \(u,v\) on \(D\):
\[
\langle u,v\rangle_{H_s}
= \int_D \sum_{|\alpha|\le s} D^\alpha u(x)\,D^\alpha v(x)\,dx.
\]
For \(s=1\), this recovers a penalty on function value and gradient. The discrete version is built from a sparse graph Laplacian \(L^l\) defined on the voxel adjacency graph at each grid level [2509.18097].

At level \(l\), all transform components are stacked into a vector \(T^l\in\mathbb R^{6\cdot |C^l|}\). A discrete Sobolev inner product is written as
\[
\langle u,v\rangle_{H_1}^{\rm disc} = u^T(\mathbf I+\lambda L^l)v,
\]
with
\[
P^l = I+\lambda L^l
\]
as the preconditioner matrix. Given a loss \(L\) and gradient \(g^l=\partial L/\partial T^l\), the Sobolev-preconditioned descent direction is
\[
g_{H_1}^l=(P^l)^{-1}g^l.
\]
In practice, the paper uses the symmetric form \((P^l)^{-2}\) inside each update:
\[
T^l \leftarrow T^l - \eta (P^l)^{-2}\frac{\partial L}{\partial T^l}.
\]
Because \(L^l\) is fixed, \((P^l)^{-1}\) or \((P^l)^{-2}\) can be applied by a sparse-linear solve at each iteration [2509.18097].

Neu-PiG transfers the same principle to latent-grid features. At each level \(l\), all cell features are stacked into \(\mathbf z^l\), and with \(\mathbf L^l\) the discrete Laplacian matrix on the voxel graph, one step of Sobolev-preconditioned gradient descent is
\[
\mathbf z^l \leftarrow \mathbf z^l - \eta(\mathbf I+\lambda^l\mathbf L^l)^{-2}\bigl(\nabla_{\mathbf z^l}\mathcal L\bigr).
\]
Equivalently, with \(\Delta^l=-\mathbf L^l\),
\[
(\mathbf I-\lambda^l\Delta^l)^2\mathbf g_{\rm pre}=\nabla_{\mathbf z^l}\mathcal L.
\]
The implementation uses two successive sparse solves with conjugate-gradient, or a small number of Jacobi/Gauss–Seidel iterations [2602.22212].

The stated purpose of preconditioning is not merely regularization in the conventional sense. Unpreconditioned grid optimization treats each cell’s latent update independently, which is reported to cause slow convergence, high-frequency artifacts, and drift over time. By contrast, the operator \((\mathbf I+\lambda \mathbf L)^{-2}\) directly low-pass filters the gradient each step, couples each cell with its immediate neighbors, suppresses high-frequency noise at the source, accelerates convergence, and eliminates drift. Neu-PiG reports convergence that is often 5–10× faster per epoch and stable reconstructions on sequences of 100+ frames [2602.22212].

## 4. Objective functions and optimization pipeline

The PDG objective couples data fitting and weak geometric regularity. Given two point sets \(P,Q\subset\mathbb R^3\), the squared Chamfer distance is
\[
L_{\rm Chamfer}(P,Q)
=\sum_{p\in P}\min_{q\in Q}\|p-q\|^2
+\sum_{q\in Q}\min_{p\in P}\|q-p\|^2.
\]
An initial template mesh \(X_0\) is maintained and deformed through cumulative transforms to obtain \(\hat X_t\). The transform fitting term is
\[
L_{\rm transform}
= \frac1T\sum_{t=1}^T {\rm CD}(\hat X_t,P_t).
\]
The method also defines a weak isometry loss over the edge set \(E\) of the reference mesh:
\[
L_{\rm iso}
= \frac1T\sum_{t=1}^T\sum_{(i,j)\in E}
\bigl(\ell_{ij}(t)-\ell_{ij}(0)\bigr)^2,
\]
which softly enforces preservation of intrinsic edge lengths. The full objective is
\[
L = L_{\rm transform}+\lambda_{\rm iso}L_{\rm iso},
\]
with \(\lambda_{\rm iso}\approx 250\), chosen so that \(L_{\rm iso}\) contributes only a weak (\(\sim 25\%\)) regularization [2509.18097].

The optimization is simultaneous over template-mesh vertices \(X_0\) and voxel-grid transforms \(T_t^{l,c}\) for all \(t\) and \(l\). The mesh is preconditioned with its own Laplacian and \(\lambda\approx 16\), with learning rate \(\approx 1\cdot 10^{-4}\). The grid uses a base learning rate \(5\cdot 10^{-3}\), strengthened per finer level by a factor \(1.1^{(l-1)}\), while the smoothing weight is
\[
\lambda^l = 0.25\cdot 1.5^{(l-1)}.
\]
All levels are updated in parallel via Adam plus preconditioning [2509.18097].

To prevent drift over long sequences, PDG includes a confidence-weighted Chamfer term:
\[
w_{\rm conf}(t)
= \prod_{\tau=1}^t
\Bigl[1 + \max\bigl(0,{\rm CD}(\hat X_\tau,P_\tau)-cd_{\max}\bigr)\Bigr]^{-\delta(e)},
\]
where \(\delta(e)\to 0\) over epochs so that later frames gradually regain full weight. The implementation description further specifies normalization of input points and mesh to \([-1,1]^3\), keyframe selection by maximizing occupied voxels near the temporal midpoint, reconstruction of \(X_0\) via screened Poisson, pruning of inactive cells, and output as a temporally coherent mesh sequence \(\{\hat X_t\}\) [2509.18097].

Neu-PiG retains a two-term loss. Let \(\hat X_t=\{\hat{\mathbf x}_{i,t}\}\) be the deformed mesh at time \(t\) and \(P_t\) the input point cloud. The deformation term is
\[
\mathcal L_{\rm def}
=\frac1T\sum_{t=1}^T w_{\rm conf}(t)\;{\rm CD}(\hat X_t,P_t),
\]
and the total loss is
\[
\mathcal L = \mathcal L_{\rm def}+w_{\rm iso}\mathcal L_{\rm iso},
\]
with \(w_{\rm iso}=100\) so that \(\mathcal L_{\rm iso}\) contributes roughly 10% of \(\mathcal L\). The isometry term is stated to preserve local shape and prevent folding [2602.22212].

## 5. Neu-PiG as a neural reformulation of preconditioned grids

Neu-PiG can be understood as a neural reformulation of the preconditioned-grid idea for long sequences. Rather than storing a separate 6D transform field for every frame and scale, it encodes entire deformations across all time steps at various spatial scales into a multi-resolution latent grid parameterized by the position and normal direction of a reference surface from a single keyframe. This latent representation is then augmented for time modulation and decoded into per-frame 6-DoF deformations via a lightweight MLP [2602.22212].

For frame \(t\), Neu-PiG computes a Fourier time embedding, with normalized time \(\tilde t=(t-1)/(T-1)\in[0,1]\) and
\[
\boldsymbol\gamma(t)
=\bigl[\sin(\pi2^{j-1}\tilde t),\cos(\pi2^{j-1}\tilde t)\bigr]_{j=1}^4
\in\mathbb R^8.
\]
The decoder input for vertex \(i\) is
\[
\mathbf y_i(t)
=\bigl[\mathbf z_n(\mathbf n_{i,t_{\rm key}});\mathbf z_p(\mathbf x_{i,t_{\rm key}});\gamma(t)\bigr]
\in\mathbb R^{40}.
\]
This 40-D vector is fed into a shallow MLP \(\psi\) with three fully-connected layers of width 512 and LeakyReLU activations [2602.22212].

The final linear layer outputs a 7-D vector \([\mathbf q;\mathbf d]\in\mathbb R^7\). The component \(\mathbf q\in\mathbb R^4\) parameterizes rotation via a quaternion offset \(q_w\mapsto 1+q_w\) and unit-normalization, while \(\mathbf d\in\mathbb R^3\) is passed through \(\tanh(0.1\cdot)\) to bound translations. The resulting rigid transform \((\mathbf R(\mathbf q),\mathbf d)\) is applied to \(\mathbf x_{i,t_{\rm key}}\) to yield \(\hat{\mathbf x}_{i,t}\) [2602.22212].

This suggests that Neu-PiG preserves the optimization-centered character of PDG while compressing the spatio-temporal deformation field into a single latent representation anchored to a reference surface. The paper’s explicit comparison to PDG’s per-frame preconditioning further indicates that the principal innovation is not the abandonment of preconditioning, but its relocation from transform parameters to a unified latent grid over all time steps [2602.22212].

## 6. Empirical profile, reported gains, and interpretation

The empirical claims reported for PDG and Neu-PiG emphasize both fidelity and runtime, especially on long sequences. PDG states that extensive evaluations demonstrate superior results, particularly for long sequences, compared to state-of-the-art techniques. Its implementation details report \(L=10\) by default, a coarse level \(8^3\) and level \(10\) roughly \(512^3\) with pruning of inactive cells, approximately 50% reduction in memory from pruning, GPU memory \(<2\,\mathrm{GB}\) on an RTX 4090 for a 17-frame sequence with \(\sim 5\mathrm{k}\) points/frame, and runtime \(\approx 7\) minutes for \(T=17\) [2509.18097].

Neu-PiG reports results on three standard benchmarks—DFAUST, AMA, and DT4D—and states that it outperforms all training-free baselines in both accuracy and runtime. The reported benchmark values are as follows [2602.22212]:

| Dataset | Baseline PDG Time | Neu-PiG Time |
|---|---:|---:|
| DFAUST | 7 min | 32 s |
| DT4D | 7 min | 32 s |
| AMA | 7 min | 32 s |

For the same datasets, Neu-PiG reports Chamfer, NC, F-score@0.5%, and Corr. values: DFAUST with \(0.39\times 10^{-5}\), \(0.968\), \(0.989\), \(0.009\); DT4D with \(0.87\times 10^{-5}\), \(0.969\), \(0.968\), \(0.034\); and AMA with \(0.44\times 10^{-5}\), \(0.951\), \(0.988\), \(0.018\) [2602.22212].

The paper summarizes these results by stating that Neu-PiG runs \(\gtrsim 60\times\) faster than prior training-free optimizers, from 7 min to 32 s, and matches or exceeds the accuracy of category-specific learned methods such as M2V and CaDeX without any pretraining. It also states that inference speeds are on the same order as heavy pretrained models and that high-fidelity, drift-free surface reconstructions are obtained in seconds [2602.22212].

A useful synopsis of the method family is:

| Aspect | PDG | Neu-PiG |
|---|---|---|
| Core representation | Multi-resolution voxel grids with 6D cell transforms | Position and normal latent grids on a keyframe surface |
| Optimization variable | \(T_t^{l,c}\) and template mesh \(X_0\) | Latent voxel features and decoder weights |
| Temporal strategy | Cumulative transforms and confidence-weighted Chamfer | Unified latent grid with time-modulated MLP |

The principal interpretation supported by the cited material is that preconditioning is the organizing idea across both methods. In PDG, it structures optimization over explicit deformation grids; in Neu-PiG, it structures optimization over latent grids that encode entire long sequences. A plausible implication is that the reported gains in speed and stability are tied less to any single loss term than to the combination of multi-scale spatial encoding with Sobolev-filtered gradient updates [2509.18097].

## 7. Relation between PDG and Neu-PiG

The relationship between the two papers is cumulative rather than discontinuous. Preconditioned Deformation Grids introduced the core ingredients: multi-resolution voxel grids, Sobolev preconditioning applied per grid level, Chamfer-based fitting to point clouds, a weak isometry prior on mesh edges, and a confidence-weighted mechanism to prevent drift over long sequences [2509.18097].

Neu-PiG explicitly states that it gives a focused, end-to-end technical description of its core, the neural preconditioned deformation grids, beginning with the multi-resolution latent grid, deriving the Sobolev preconditioner used during training, writing out the reconstruction and isometry losses, describing the time-modulated MLP decoder in detail, and explaining why preconditioning yields fast, drift-free convergence. It then closes with a concise summary of empirical speedups and fidelity gains [2602.22212].

The later method therefore preserves the same foundational commitments—optimization from scratch, no explicit correspondences, spatial smoothness induced through Sobolev operators, and temporally consistent reconstruction from point cloud sequences—while altering the representation and decoder. Compared to PDG’s per-frame preconditioning, Neu-PiG’s single, unified latent grid enforces smoothness across all time steps, which the paper associates with stable reconstructions on sequences of 100+ frames [2602.22212].

Within this lineage, “preconditioned deformation grids” denotes both a specific 2025 method and a broader methodological template for dynamic surface reconstruction: represent deformations on multi-scale grids, optimize them directly from geometric losses, and shape the optimization trajectory by applying Sobolev structure to the gradient rather than relying on explicit correspondences or category-specific pretraining [2509.18097].

Source: https://www.emergentmind.com/topics/preconditioned-deformation-grids