arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1707.06263cs.CVcs.LG
收藏

通过上下文特定度量聚集的学习的可变形配准

Deformable Registration through Learning of Context-Specific Metric Aggregation

Imperial College London(帝国理工学院);TheraPanacea;University of Oxford(牛津大学);CentraleSupelec(中央高等电力学院);INRIA(法国国家信息与自动化研究所);Universite Paris-Saclay(巴黎萨克雷大学)

Enzo Ferrante, Puneet K Dokania, Rafael Marini, Nikos Paragios

摘要:

我们提出了一种新的弱监督判别算法学习上下文特定的注册指标作为传统的相似性措施的线性组合。在过去的二十年中,传统的度量标准被广泛使用,因此它们的优点和局限性都是众所周知的。挑战在于找到形成配准算法的相似性度量的不同度量的最佳相对权重(或参数)。手动调整这些参数将导致次优解决方案,并随着度量数量的增加而迅速变得不可行。此外,这种手工制作的组合只能在全球范围内(整个体积)发生,因此将无法考虑不同的组织特性。我们提出了一个学习算法估计这些参数的本地,条件的数据语义类。我们制定的目标函数是一个特殊的情况下,非凸函数,凸函数的差异,我们优化使用凹凸过程。作为概念证明,我们展示了我们的方法对不同解剖结构和模式的三个具有挑战性的数据集的影响。

英文摘要:

We propose a novel weakly supervised discriminative algorithm for learning context specific registration metrics as a linear combination of conventional similarity measures. Conventional metrics have been extensively used over the past two decades and therefore both their strengths and limitations are known. The challenge is to find the optimal relative weighting (or parameters) of different metrics forming the similarity measure of the registration algorithm. Hand-tuning these parameters would result in sub optimal solutions and quickly become infeasible as the number of metrics increases. Furthermore, such hand-crafted combination can only happen at global scale (entire volume) and therefore will not be able to account for the different tissue properties. We propose a learning algorithm for estimating these parameters locally, conditioned to the data semantic classes. The objective function of our formulation is a special case of non-convex function, difference of convex function, which we optimize using the concave convex procedure. As a proof of concept, we show the impact of our approach on three challenging datasets for different anatomical structures and modalities.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑