首页> 外文会议>International Conference on Information Technology and Intelligent Transportation Systems >Sparse Projection CT Image Reconstruction Based on the Split Bregman Less Iteration
【24h】

Sparse Projection CT Image Reconstruction Based on the Split Bregman Less Iteration

机译:基于拆分Bregman的稀疏投影CT图像重建不太迭代

获取原文

摘要

Sparse angle projectionCT image reconstruction inmedical diagnosis and industrial non-destructive testing has important theoretical significance and practical application value. In the paper, L1 norm was introduced as the CT images of regular constraint and optimization reconstruction model, and the method to solve it was presented based on the Split Bregman algorithm. Shepp-Logan numerical simulation experiments show that the image reconstructed by the traditional algebraic reconstruction algorithm ofART for sparse projection CT is poor. The Split Bregman may solve L1 regularization constraint model of sparse projection of CT with less number of iterations, fast reconstruction and good reconstruction quality. For the splitting factor of the algorithm, in a numerical range, the greater the reconstruction quality is better.
机译:稀疏角度投影电视图像重建在医疗诊断和工业的非破坏性测试具有重要的理论意义和实际应用价值。本文介绍了L1规范作为常规约束和优化重建模型的CT图像,并基于分割BREGMAN算法呈现解决方法。 SHEPP-Logan数值模拟实验表明,由传统代数重建算法ORART用于稀疏投影CT的图像差。拆分BREGMAN可以解决CT的稀疏投影的L1正则化约束模型,具有较少数量的迭代,快速重建和良好的重建质量。对于算法的分裂因子,在数值范围内,重建质量越大越大。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号