检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:程志勇 王明泉[1] 许娜 侯慧玲[1] 张浩杰 李一丹 Cheng Zhiyong;Wang Mingquan;Xu Na;Hou Huiling;Zhang Haojie;Li Yidan(Key Laboratory of Instrumentation Science and Dynamic Measurement of Ministry of Education,North University of China,Taiyuan 030051,China)
机构地区:[1]中北大学仪器科学与动态测试教育部重点实验室,太原030051
出 处:《国外电子测量技术》2021年第3期6-9,共4页Foreign Electronic Measurement Technology
基 金:国家自然科学基金(61171177);国家重大科学仪器设备开发专项(2013YQ240803)资助。
摘 要:代数重建算法(algebraic reconstruction technique,ART)因计算量大,重建速度慢,限制了其在工业和医学等领域的应用,而投影系数的计算更是影响重建速度的关键因素。基于长度加权模型求解投影系数,通过射线与网格相交的不同情况,快速求解出射线穿过网格的总长度,通过对应比例关系快速求出相应的网格交线长度,不仅减少了求解投影系数的计算量,并且适用于CUDA并行加速。实验结果表明,与Siddon算法相比,该算法在保证重建图像质量不损失的前提下,重建速度提高了12倍多。Due to the large amount of calculation and the slow speed in algebraic iterative reconstruction technique,which limits its application in the fields of industry and medicine,and the calculation of the projection coefficient is a key factor affecting reconstruction speed.Based on the length weighted model to solve projection coefficient,through different situations of the intersection of the ray and grid,the total length of the ray passing through can be quickly solved,and the corresponding length of the grid intersection can be obtained through the corresponding proportional relation,which not only reduces the calculation amount of solving the projection coefficient,but also is suitable for CUDA parallel acceleration.The experimental results show that this algorithm is 12 times faster than the Siddon algorithms on the premise of guaranteeing the reconstruction image quality without loss.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222