用动态重定位匹配提升大形变医学图像配准效率
Efficient Large-Deformation Medical Image Registration via Recurrent Dynamic Correlation
- 通过循环相关机制逐步优化匹配区域位置,减少冗余计算
- 在非仿射OASIS数据集上达到顶尖精度,仅需RDP 9.5%的浮点运算量
- 适合需要高效高精度配准的医学影像分析场景
可变形图像配准通过空间变换估计图像间体素级对应关系,在医学影像中至关重要。尽管深度学习显著降低了运行时间,但高效处理大形变仍是难点。卷积网络虽能聚合局部特征,却无法直接建模体素对应关系,促使研究转向显式特征匹配。其中,体素到区域匹配通过邻域内计算相关特征,效率较高;而区域到区域匹配因跨大区域产生过多相关对,冗余度高。然而,体素到区域匹配的固有局部性限制了长距离对应关系的捕捉能力。为此,我们提出基于循环相关的方法,动态将匹配区域重定位至更优位置。每一步进行低成本局部匹配,利用估计偏移指导下一搜索区域,支持高效收敛至大形变。此外,采用轻量级循环更新模块,具备记忆能力,并解耦运动相关与纹理特征,抑制语义冗余。我们在脑部MRI和腹部CT数据集上进行了广泛实验,包含仿射预配准与无仿射预配准两种设置。结果表明,该方法在准确率-计算开销间取得强权衡,性能超越或匹配现有最优水平。例如,在非仿射OASIS数据集上表现相当,但仅需RDP(代表性高性能方法)9.5%的浮点运算量,且运行速度提升96%。
原文摘要 · Abstract (English)
Deformable image registration estimates voxel-wise correspondences between images through spatial transformations, and plays a key role in medical imaging. While deep learning methods have significantly reduced runtime, efficiently handling large deformations remains a challenging task. Convolutional networks aggregate local features but lack direct modeling of voxel correspondences, promoting recent works to explore explicit feature matching. Among them, voxel-to-region matching is more efficient for direct correspondence modeling by computing local correlation features whithin neighbourhoods, while region-to-region matching incurs higher redundancy due to excessive correlation pairs across large regions. However, the inherent locality of voxel-to-region matching hinders the capture of long-range correspondences required for large deformations. To address this, we propose a Recurrent Correlation-based framework that dynamically relocates the matching region toward more promising positions. At each step, local matching is performed with low cost, and the estimated offset guides the next search region, supporting efficient convergence toward large deformations. In addition, we uses a lightweight recurrent update module with memory capacity and decouples motion-related and texture features to suppress semantic redundancy. We conduct extensive experiments on brain MRI and abdominal CT datasets under two settings: with and without affine pre-registration. Results show that our method exibits a strong accuracy-computation trade-off, surpassing or matching the state-of-the-art performance. For example, it achieves comparable performance on the non-affine OASIS dataset, while using only 9.5% of the FLOPs and running 96% faster than RDP, a representative high-performing method.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。