YANG Juan, HOU Hui-ling, SHI Lang
(Key Laboratory of Instrumentation Science & Dynamic Measurement (North University of China), Ministry of Education, Taiyuan 030051, China)
Abstract： For sparse storage and quick access to projection matrix based on vector type, this paper proposes a method to solve the problems of the repetitive computation of projection coefficient, the large space occupation and low retrieval efficiency of projection matrix in iterative reconstruction algorithms, which calculates only once the projection coefficient and stores the data sparsely in binary format based on the variable size of library vector type. In the iterative reconstruction process, these binary files are accessed iteratively and the vector type is used to quickly obtain projection coefficients of each ray. The results of the experiments show that the method reduces the memory space occupation of the projection matrix and the computation of projection coefficient in iterative process, and accelerates the reconstruction speed.
Key words： projection matrix; sparse storage; quick access; vector type
CLD number： TP391Document code： A
Article ID： 1674-8042（2015）01-0053-04 doi： 10.3969/j.issn.1674-8042.2015.01.010
References
［1］ ZENG Geng-sheng. Medical image reconstruction. Beijing: Higher Education Press, 2010: 21-125.
［2］ JIANG Ming, WANG Ge. Convergence studies on iterative algorithms for image reconstruction. IEEE Transactions on Medical Imaging, 2003, 22(5): 569-579.
［3］ ZHANG Shun-li, ZHANG Ding-hua, ZHAO Xin-bo. Research of fast image reconstruction on ART algorithm. Computer Engineering and Applications, 2006, 24: 1-4.
［4］ ZHOU Bin, WANG Lian-tang, WANG Jun-jie, et al. Fast projection coefficient computation method in algebraic reconstruction technique. Computer Engineering and Applications, 2008, 44(25): 46-47.
［5］ Lippman S B, Lajoie J, Moo B E. C++ Primer. 4th Edition. American: Addison Wesley Professional, 2005: 158-167.
［6］ CHEN Hong-lei, HE Jian-feng, LIU Jun-qing. Projection matrix algorithm based on two-dimensional index. Computer Engineering, 2013, 39(2): 229-232.
一种基于容器的对投影矩阵稀疏存储与快速访问的方法
杨娟， 侯慧玲， 石浪
（中北大学 仪器科学与动态测试教育部重点实验室， 山西 太原 030051）
摘要:针对迭代重建算法中投影系数的重复计算， 以及投影矩阵存储占用空间大， 检索效率低等问题， 本文提出一种基于vector容器的投影矩阵稀疏存储与快速访问方法。 该方法只计算一次投影系数， 并利用容器的大小可变性将投影系数以二进制格式进行稀疏存储。 在迭代重建过程中， 循环访问这些二进制文件， 并使用容器快速检索获得每一条射线的投影系数。 实验证明， 本文提出的方法有效地减少了投影矩阵占用的内存， 减少了迭代过程中计算投影系数的运算量， 加快了重建速度。
关键词:投影矩阵； 稀疏存储； 快速访问； 容器
引用格式：YANG Juan, HOU Hui-ling, SHI Lang. A method based on vector type for sparse storage and quick access to projection matrix. Journal of Measurement Science and Instrumentation, 2015, 6(1): 53-56. ［doi: 10.3969/j.issn.1674-8042.2015.01.010］
[full text view]
