ArticleMedical physics2026
On the degrees of freedom of gridded control points in learning-based medical image registration.
Article in Medical physics, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
8 authors.
Funding
Abstract
backgroundMany registration problems are ill-posed in homogeneous/noisy regions, and dense voxel-wise decoders can be unnecessarily high-dimensional. A sparse control-point parameterization provides a compact, smooth deformation representation while reducing memory and improving stability. PURPOSE: This work investigates the required control points for learning-based registration network development. In particular, as sparse as
methodWe present GridReg, a learning-based registration frametwork that replaces dense voxel-wise decoding with displacement predictions at a sparse grid of control points. This design substantially cuts the parameter count and memory while retaining registration accuracy. Multiscale 3D encoder feature maps are flattened into a 1D token sequence with positional encoding to retain spatial context. The model then predicts a sparse gridded deformation field using a cross-attention module: Each control point attends to encoder tokens within its local grid neighborhood to estimate its displacement, which is subsequently interpolated to a dense field. We further introduce grid-adaptive training, enabling an adaptive model to operate at multiple grid sizes at inference without retraining.
resultsThis work quantitatively demonstrates the benefits of using sparse grids. Using three data sets for registering prostate gland, pelvic organs and neurological structures, the experimental results suggest a much improved computational efficiency, due to the prediction of sparse-grid-sampled displacements. Alternatively, the superior registration performance was obtained using the proposed approach, with the similiar or less compute cost, compared with existing algorithms that predict DDFs (e.g., VoxelMorph/TransMorph) or displacements sampled on scattered key points (KeyMorph).
conclusionWe conclude that predicting sparsely gridded displacements provides reduced computational cost and/or improved performance, independent of the encoder architecture, and can be readily implemented. Therefore, GridReg should potentially be considered for many registration tasks with adaptive grid sizes. The code is available via git@github.com:yanwenCi/GridReg.git.
Indexed as
Identifiers
What Socratic holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the Socratic graph.