{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/m-s-structure","slug":"m-s-structure","name":"M-S structure","full_name":"Motion-Separable backbone structure","full_name_withheld":false,"description_markdown":"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.\r\n\r\nTo quantify the network's capacity for large deformation capturing, the accessible motion capture range is defined as:\r\n\r\n**Definition 1: Accessible Motion Range**\r\n\r\nThe radius of capture range of the $k^{\\text{th}}$-level registration by the registration module$\\mathcal{R}_k$ is defined as the smallest upper bound of its accessible Deformation Displacement Field:\r\n\r\n$$\r\na_k := \\min_{\\mathbf{x}}(\\{\\sup(\\|\\varphi_{k}[\\mathbf{x}]\\|_{\\infty})\\})\r\n$$\r\n\r\nwhere $\\|\\cdot\\|_{\\infty}$ denotes the L-$\\infty$ norm of a vector, $\\sup(\\cdot)$ denotes the supremum or the maximum value of a given function with varying inputs and trainable weights of networks, and $\\mathbf{x}$ denotes one coordinate entry of the images or Deformation Displacement Fields.\r\n\r\n\r\nTo quantify the Degree-of-Freedom limitation in the discontinuity of the estimated Deformation Displacement Field, we define the separability of the predicted motion:\r\n\r\n\r\n**Definition 2: Separability Bottleneck of Predicted Motion**\r\n\r\nThe motion separability bottleneck is defined as the minimum value of the upper bound of the Chebyshev difference of a network's predicted DDF $\\phi$ between two locations $\\mathbf{x}, \\mathbf{y} \\in \\mathbb{Z}^d$ with the specific Chebyshev distance $p \\in \\mathbb{Z}^d$:\r\n\r\n$$\r\n\\Delta_\\infty(p) := \\min_{\\mathbf{x}, \\mathbf{y}}\\left\\{\\sup(\\|\\phi[\\mathbf{x}] - \\phi[\\mathbf{y}]\\|_{\\infty}) : \\|\\mathbf{x} - \\mathbf{y}\\|_{\\infty} = p\\right\\}\r\n$$\r\n\r\nwhere $p$ denotes the L-$\\infty$ distance between the two pixels.\r\n\r\n\r\n**Theorem: Regional Dependency** \r\n\r\nThe upper boundary of motion difference is related to $a_k$ and $p_k$:\r\n\r\n$$\r\n\\begin{align*}\r\n\\forall \\mathbf{x}, \\mathbf{y} \\in \\mathbb{Z}^d, \\|\\mathbf{x} - \\mathbf{y}\\|_\\infty \\geq p_{k''} + 2\\sum_{k'=k''+1}^{k} a_{k'}, &\\quad \\sup(\\|\\phi_{k}[\\mathbf{x}] - \\phi_{k}[\\mathbf{y}]\\|_\\infty) \\geq 2\\sum_{k'=k''}^{k} a_{k'}; \\\\\r\n\\exists \\mathbf{x}, \\mathbf{y} \\in \\mathbb{Z}^d, \\|\\mathbf{x} - \\mathbf{y}\\|_\\infty < p_{k''-1} + 2\\sum_{k'=k''}^{k} a_{k'}, &\\quad \\sup(\\|\\phi_{k}[\\mathbf{x}] - \\phi_{k}[\\mathbf{y}]\\|_\\infty) = 2\\sum_{k'=k''}^{k} a_{k'};\r\n\\end{align*}\r\n$$\r\n\r\nwhere $k'', k,$ denote two recursive numbers satisfying $0 \\leq k'' < k$, and $\\mathbf{x}, \\mathbf{y}$ denote two coordinate entries of images or DDFs.\r\n\r\n\r\nThus a **Motion-Separable structure** is designed with the upsampled feature maps processed by the corresponding atrous convolution layers.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Residual Aligner-based Network (RAN): Motion-separable structure for coarse-to-fine discontinuous deformable registration","paper":"/paper/residual-aligner-based-network-ran-motion","first_author":"Jian-Qing Zheng","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/residual-aligner-based-network-ran-motion"},"source":{"url":"https://doi.org/10.1016/j.media.2023.103038","title":"Residual Aligner-based Network (RAN): Motion-separable structure for coarse-to-fine discontinuous deformable registration","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Backbone Architectures","url":"/methods/category/backbone-architectures","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/residual-aligner-based-network-ran-motion","slug":"residual-aligner-based-network-ran-motion","title":"Residual Aligner-based Network (RAN): Motion-separable structure for coarse-to-fine discontinuous deformable registration","date":"2023-11-21","arxiv_id":null,"n_code_links":1,"syntology":null}],"papers_shown":1,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":1,"with_a_code_link":1,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":1,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/computed-tomography-ct","name":"Computed Tomography (CT)","papers":1},{"task":"/task/deformable-medical-image-registration","name":"Deformable Medical Image Registration","papers":1},{"task":"/task/image-registration","name":"Image Registration","papers":1},{"task":"/task/medical-image-registration","name":"Medical Image Registration","papers":1},{"task":"/task/unsupervised-image-registration","name":"Unsupervised Image Registration","papers":1}],"tasks_shown":5,"n_tasks":5,"usage_by_year":[{"year":"2023","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/m-s-structure"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=M-S%20structure","read_at":"2026-10-05T00:58:49+00:00","query":"M-S structure","kind":"method","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"STRUCTURE","origin_arxiv_id":"2506.16895"},"resolution":"token_match","resolved_name_differs":true,"absence_asserted":"for_this_exact_name_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2506.16895","citations":14},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'M-S structure'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"data structure for density estimation","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='data structure for density estimation')","origin_arxiv_id":"2306.11312"},{"name":"Global Structure-Aware Diffusion Process","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Global Structure-Aware Diffusion Process')","origin_arxiv_id":"2310.17577"},{"name":"active causal structure learning with advice","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='active causal structure learning with advice')","origin_arxiv_id":"2305.19588"},{"name":"amortized inference for causal structure learning","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='amortized inference for causal structure learning')","origin_arxiv_id":"2205.12934"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2506.16895","page":null,"syntology_url":"https://syntology.ai/paper/2506.16895","in_graph_layer":false,"samples":0},"line":"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.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["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)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"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."}},"syntology_have_state":"loaded","record_sha256":"d6fb192ad46e24913125f0798d3623a6717250b9e55eeaf016eb50018d7a1ba1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}