Methods › Computer Vision › Backbone Architectures › M-S structure
Motion-Separable backbone structure
M-S structure
Introduced by Jian-Qing Zheng et al. in Residual Aligner-based Network (RAN): Motion-separable structure for coarse-to-fine discontinuous deformable registration
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Based on the theoretical analyses in RAN paper, a novel multi-scale backbone structure is designed in the paper. This structure enables the network to efficiently predict motion patterns with larger separable upper bounds by using optimized dilation convolution on high-resolution feature maps, while maintaining a capturable range of motion with low computational complexity.
To quantify the network's capacity for large deformation capturing, the accessible motion capture range is defined as:
Definition 1: Accessible Motion Range
The radius of capture range of the kᵗʰ-level registration by the registration moduleℛₖ is defined as the smallest upper bound of its accessible Deformation Displacement Field:
aₖ := minₓ({sup(‖φₖ[x]‖_∞)})
where ‖·‖_∞ denotes the L-∞ norm of a vector, sup(·) denotes the supremum or the maximum value of a given function with varying inputs and trainable weights of networks, and x denotes one coordinate entry of the images or Deformation Displacement Fields.
To quantify the Degree-of-Freedom limitation in the discontinuity of the estimated Deformation Displacement Field, we define the separability of the predicted motion:
Definition 2: Separability Bottleneck of Predicted Motion
The motion separability bottleneck is defined as the minimum value of the upper bound of the Chebyshev difference of a network's predicted DDF ϕ between two locations x, y ∈ℤᵈ with the specific Chebyshev distance p ∈ℤᵈ:
Δ_∞(p) := min_(x, y){sup(‖ϕ[x] - ϕ[y]‖_∞) : ‖x - y‖_∞ = p}
where p denotes the L-∞ distance between the two pixels.
Theorem: Regional Dependency
The upper boundary of motion difference is related to aₖ and pₖ:
∀x, y∈ℤᵈ, ‖x - y‖_∞ ≥ p_(k″) + 2∑_(k′=k″+1)ᵏ a_(k′), sup(‖ϕₖ[x] - ϕₖ[y]‖_∞) ≥ 2∑_(k′=k″)ᵏ a_(k′); ∃x, y∈ℤᵈ, ‖x - y‖_∞ < p_(k″-1) + 2∑_(k′=k″)ᵏ a_(k′), sup(‖ϕₖ[x] - ϕₖ[y]‖_∞) = 2∑_(k′=k″)ᵏ a_(k′);
where k″, k, denote two recursive numbers satisfying 0 ≤k″ < k, and x, y denote two coordinate entries of images or DDFs.
Thus a Motion-Separable structure is designed with the upsampled feature maps processed by the corresponding atrous convolution layers.
In Syntology code not checked for this name. The lookup matched a different name in Syntology's graph, 'STRUCTURE' (resolution: token_match), and its answer is about that name only, so it does not say whether this method has code. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2506.16895) is about this method is not checked.
Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.
- data structure for density estimation · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='data structure for density estimation') - Global Structure-Aware Diffusion Process · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='Global Structure-Aware Diffusion Process') - active causal structure learning with advice · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='active causal structure learning with advice') - amortized inference for causal structure learning · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='amortized inference for causal structure learning')
Origin paper of this answer, arXiv:2506.16895 (its page on Syntology).
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).
Papers archive 2025-07-28
archive papers tagged: 1 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 1 tagged papers has a Syntology run on record
Page 1 of 1: paper 1 of 1, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Residual Aligner-based Network (RAN): Motion-separable structure for coarse-to-fine discontinuous deformable registration 21 Nov 2023 · 1 repository
Tasks archive 2025-07-28
5 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Computed Tomography (CT) | 1 |
| Deformable Medical Image Registration | 1 |
| Image Registration | 1 |
| Medical Image Registration | 1 |
| Unsupervised Image Registration | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections