QQ客服 官方微博 反馈留言

	Parallel Implementation of Katsevich's FBP Algorithm
	Yang Jiansheng ; Guo Xiaohu ; Kong Qiang ; Zhou Tie ; Jiang Ming
	2006
英文摘要	For spiral cone-beam CT, parallel computing is an effective approach to resolving the problem of heavy computation burden. It is well known that the major computation time is spent in the backprojection step for either filtered-backprojection (FBP) or backprojected-filtration (BPF) algorithms. By the cone-beam cover method [1], the backprojection procedure is driven by cone-beam projections, and every cone-beam projection can be backprojected independently. Basing on this fact, we develop a parallel implementation of Katsevich's FBP algorithm. We do all the numerical experiments on a Linux cluster. In one typical experiment, the sequential reconstruction time is 781.3 seconds, while the parallel reconstruction time is 25.7 seconds with 32 processors.; PubMed; 0; 17463; 2006
语种	英语
出处	PubMed
出版者	international journal of biomedical imaging
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/157253]
专题	数学科学学院
推荐引用方式 GB/T 7714	Yang Jiansheng,Guo Xiaohu,Kong Qiang,et al. Parallel Implementation of Katsevich's FBP Algorithm. 2006-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。