• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>SPIE Medical Imaging Conference >Stack transition artifact removal for cardiac CT using patch-based similarities
【24h】

Stack transition artifact removal for cardiac CT using patch-based similarities

机译：使用基于补丁的相似性去除心脏CT的堆栈过渡伪像

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Cardiac CT can be achieved by performing short scans with prospective gating. As the collimation of multi-slice CT scanners generally docs not allow for a coverage of the entire heart, sequence scans, also known as step-and-shoot, can be used, where irradiation is performed multiple times for varying positions. Each of these short scans yields data, generally with a longitudinal overlap, that can be reconstructed into a sub-volume, or stack. The latter ideally corresponds to the same phase. The issue addressed in this work is irregular motion, such as irregular heart motion. It leads to stacks that do not represent exactly the same volume, resulting in discontinuities at stack transitions when assembling the complete CT volume. We propose a stack transition artifact removal method including a simple symmetric registration approach. Originating from a set of control points in overlap regions between adjacent stacks, the algorithm symmetrically searches for matching sub volumes in the two neighboring stacks, respectively. The offsets to the respective control points of matching sub volumes is used to compute two deformation vector fields that match the two stacks to each other. The deformation vector fields are extended from the overlapping regions in order to maintain smooth and anatomically meaningful images. We validated the method using clinical data sets. By applying a straightforward symmetric registration method to cardiac data, we show that the stack transition artifacts can be addressed in this fashion. The artifact removal was able to considerably improve image quality and constitutes a framework that can be enhanced and expanded on in future.
机译：心脏CT可以通过使用前景门控的短扫描来实现。随着多切片CT扫描仪的准直，通常不能用于整个心脏的覆盖，可以使用序列扫描，也可以使用，其中逐步拍摄，其中多次进行辐射以进行不同的位置。这些短扫描中的每一个通常产生数据，通常具有纵向重叠，其可以重建为子体积或堆叠。后者理想地对应于相同的阶段。在这项工作中解决的问题是不规则的运动，例如不规则的心动。它导致堆栈不代表完全相同的卷，从而在组装完整的CT卷时堆叠过渡时不连续。我们提出了一种堆栈转换伪影删除方法，包括简单的对称登记方法。来自相邻堆栈之间的重叠区域中的一组控制点，该算法分别对称地搜索两个相邻堆栈中的匹配子卷。匹配子卷的各个控制点的偏移用于计算彼此匹配两个堆叠匹配的两个变形矢量字段。变形矢量场从重叠区域延伸，以保持平滑和解剖学上有意义的图像。我们通过临床数据集验证了该方法。通过对心脏数据应用直接的对称登记方法，我们表明堆栈过渡伪像可以以这种方式解决。伪影拆除能够显着提高图像质量，并构成可以在将来增强和扩展的框架。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号