一种内存优化的代数重建算法及其快速实现  

A Novel Algebraic Reconstruction Technique of Memory Optimization and Its Fast Implementation

作　　者：秦中元[1] 牟轩沁[1] 王平[1] 蔡元龙[1] 

机构地区：[1]西安交通大学电子与信息工程学院,陕西西安710049

出　　处：《电子学报》2003年第9期1327-1329,共3页Acta Electronica Sinica

基　　金：国家自然科学基金(No .30 0 70 2 2 5);教育部高等学校骨干教师基金

摘　　要：本文提出一种在图像的代数重建算法 (ART)中能够有效地减少内存占用的快速实现方法 ,将直接ART方法中的每个投影每条射线的系数矩阵分解为射线矩阵和单条射线的系数矩阵 .射线矩阵保存每条射线的斜率和截距 ,系数矩阵在每次迭代之前计算得到 ,考虑到同一投影角下每条射线的相关性 ,系数矩阵可以递推计算 ,从而极大地节省了时间 .实验选用Shepp logan模型 。An efficient implement for Algebraic Reconstruction Technique (ART) is presented in this paper.The coefficient matrix in the original ART is split into radial matrix and the coefficient matrix of the radial.The slope and intercept of each radial are kept in the radial matrix.The coefficient matrix of the radial is calculated before iteration,and considering the correlation of the lines with the same projection angle it can be computed iteratively,with much time saved.The experiments using Shepp logan phantom show that the results of this method are as good as the traditional one with great reduction of memory.

关 键 词：代数重建算法 图像重建 内存优化 递推算法 

分 类 号：R445[医药卫生—影像医学与核医学]