Scholarlink

<p>The stationary velocity field (SVF) approach allows to build parametrizations of invertible deformation fields, which is often a desirable property in image registration. Its expressiveness is particularly attractive when used as a block following a machine learning-inspired network. However, it can struggle with large deformations. We extend the SVF approach to matrix groups, in particular <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\({{\,\textrm{SE}\,}}(3)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mspace width="0.166667em" /> <mtext>SE</mtext> <mspace width="0.166667em" /> </mrow> <mo stretchy="false">(</mo> <mn>3</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. This moves Euclidean transformations into the low-frequency part, toward which network architectures are often naturally biased, so that larger motions can be recovered more easily. This requires an extension of the flow equation, for which we provide sufficient conditions for existence. We further prove a decomposition condition that allows us to apply a scaling-and-squaring approach for efficient numerical integration of the flow equation. We numerically validate the approach on inter-patient registration of 3D MRI images of the human brain</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Stationary Velocity Fields on Matrix Groups for Deformable Image Registration

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年2月17日

查看全文
  • Johannes Bostelmann,
  • Ole Gildemeister,
  • Jan Lellmann

摘要

The stationary velocity field (SVF) approach allows to build parametrizations of invertible deformation fields, which is often a desirable property in image registration. Its expressiveness is particularly attractive when used as a block following a machine learning-inspired network. However, it can struggle with large deformations. We extend the SVF approach to matrix groups, in particular \({{\,\textrm{SE}\,}}(3)\) SE ( 3 ) . This moves Euclidean transformations into the low-frequency part, toward which network architectures are often naturally biased, so that larger motions can be recovered more easily. This requires an extension of the flow equation, for which we provide sufficient conditions for existence. We further prove a decomposition condition that allows us to apply a scaling-and-squaring approach for efficient numerical integration of the flow equation. We numerically validate the approach on inter-patient registration of 3D MRI images of the human brain