首页> 美国卫生研究院文献>Medical Physics >Computing global minimizers to a constrained B-spline image registration problem from optimal l1 perturbations to block match data
【2h】

Computing global minimizers to a constrained B-spline image registration problem from optimal l1 perturbations to block match data

机译:计算全局最小化器以解决从最佳l1扰动到块匹配数据的约束B样条图像配准问题

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

>Purpose: Block matching is a well-known strategy for estimating corresponding voxel locations between a pair of images according to an image similarity metric. Though robust to issues such as image noise and large magnitude voxel displacements, the estimated point matches are not guaranteed to be spatially accurate. However, the underlying optimization problem solved by the block matching procedure is similar in structure to the class of optimization problem associated with B-spline based registration methods. By exploiting this relationship, the authors derive a numerical method for computing a global minimizer to a constrained B-spline registration problem that incorporates the robustness of block matching with the global smoothness properties inherent to B-spline parameterization.>Methods: The method reformulates the traditional B-spline registration problem as a basis pursuit problem describing the minimal l1-perturbation to block match pairs required to produce a B-spline fitting error within a given tolerance. The sparsity pattern of the optimal perturbation then defines a voxel point cloud subset on which the B-spline fit is a global minimizer to a constrained variant of the B-spline registration problem. As opposed to traditional B-spline algorithms, the optimization step involving the actual image data is addressed by block matching.>Results: The performance of the method is measured in terms of spatial accuracy using ten inhale/exhale thoracic CT image pairs (available for download at ) obtained from the COPDgene dataset and corresponding sets of expert-determined landmark point pairs. The results of the validation procedure demonstrate that the method can achieve a high spatial accuracy on a significantly complex image set.>Conclusions: The proposed methodology is demonstrated to achieve a high spatial accuracy and is generalizable in that in can employ any displacement field parameterization described as a least squares fit to block match generated estimates. Thus, the framework allows for a wide range of image similarity block match metric and physical modeling combinations.
机译:>目的:块匹配是一种众所周知的策略,用于根据图像相似性度量来估计一对图像之间的对应体素位置。尽管对图像噪声和大尺寸体素位移等问题具有鲁棒性,但不能保证估计的点匹配在空间上是准确的。但是,通过块匹配过程解决的基础优化问题在结构上类似于与基于B样条的配准方法相关的优化问题。通过利用这种关系,作者得出了一种数值方法,用于计算约束B样条配准问题的全局最小化方法,该问题将块匹配的健壮性与B样条参数化固有的全局平滑性结合在一起。>方法:该方法将传统的B样条配准问题重新描述为基本追踪问题,描述了最小的l1扰动以阻止在给定公差内产生B样条拟合误差所需的匹配对。然后,最优摄动的稀疏性模式定义了一个体素点云子集,在该子集上,B样条拟合是B样条配准问题的受约束变体的全局最小化子。与传统的B样条算法相反,涉及实际图像数据的优化步骤通过块匹配来解决。>结果:该方法的性能是使用十个吸气/呼气胸腔以空间精度衡量的从COPDgene数据集和专家确定的地标点对的相应集合获得的CT图像对(可从下载)。验证过程的结果表明,该方法可以在非常复杂的图像集上实现较高的空间精度。>结论:所提出的方法论证明具有较高的空间精度,并且可以推广使用。采用描述为最小二乘拟合的任何位移场参数化来阻止匹配生成的估计。因此,该框架允许广泛的图像相似度块匹配度量和物理建模组合。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号