首页> 外文会议>Computational imaging XIII >Acceleration of Iterative Image Reconstruction for X-Ray Imaging for Security Applications
【24h】

Acceleration of Iterative Image Reconstruction for X-Ray Imaging for Security Applications

机译:加速用于安全应用程序的X射线成像的迭代图像重建

获取原文
获取原文并翻译 | 示例

摘要

Three-dimensional image reconstruction for scanning baggage in security applications is becoming increasingly important. Compared to medical x-ray imaging, security imaging systems must be designed for a greater variety of objects. There is a lot of variation in attenuation and nearly every bag scanned has metal present, potentially yielding significant artifacts. Statistical iterative reconstruction algorithms are known to reduce metal artifacts and yield quantitatively more accurate estimates of attenuation than linear methods. For iterative image reconstruction algorithms to be deployed at security checkpoints, the images must be quantitatively accurate and the convergence speed must be increased dramatically. There are many approaches for increasing convergence; two approaches are described in detail in this paper. The first approach includes a scheduled change in the number of ordered subsets over iterations and a reformulation of convergent ordered subsets that was originally proposed by Ahn, Fessler et. al. The second approach is based on varying the multiplication factor in front of the additive step in the alternating minimization (AM) algorithm, resulting in more aggressive updates in iterations. Each approach is implemented on real data from a SureScan™ x1000 Explosive Detection System and compared to straightforward implementations of the alternating minimization algorithm of O'Sullivan and Benac with a Huber-type edge-preserving penalty, originally proposed by Lange.
机译:在安全应用中用于扫描行李的三维图像重建变得越来越重要。与医学X射线成像相比,安全成像系统必须设计用于更多种类的物体。衰减变化很大,几乎每个扫描过的袋子都存在金属,可能会产生明显的伪影。已知统计迭代重建算法可减少金属伪影,并在定量上产生比线性方法更准确的衰减估计。为了将迭代图像重建算法部署在安全检查点,图像必须在定量上准确,并且收敛速度必须大大提高。有很多方法可以提高收敛性。本文详细介绍了两种方法。第一种方法包括在迭代过程中有序子集数量的计划变化,以及由Ahn,Fessler等人最初提出的收敛有序子集的重新表述。等第二种方法基于改变交替最小化(AM)算法中加法步骤前的乘法因子,从而导致迭代中更具攻击性的更新。每种方法都是在SureScan™x1000爆炸物检测系统的真实数据上实现的,并且与最初由Lange提出的带有Huber型边沿保留罚分的O'Sullivan和Benac交替最小化算法的直接实现方式进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号