Parallel Implementation of Katsevich's FBP Algorithm
نویسندگان
چکیده
منابع مشابه
Parallel Implementation of Katsevich's FBP Algorithm
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, an...
متن کاملParallel Implementation of Apriori Algorithm
Association rule mining concept is used to show relation between items in a set of items. Apriori algorithm for mining frequent itemsets from large amount of database is used. Parallelism is used to reduce time and increase performance, Multi-core processor is used for parallelization. Mining in a Serial manner can consume time and reduce performance for mining. To solve this issue we are propo...
متن کاملNoise-weighted spatial domain FBP algorithm.
PURPOSE The purpose of this paper is to implement a noise-weighted filtered backprojection (FBP) algorithm in the form of "convolution" backprojection, but this "convolution" has a spatially variant integration kernel. METHODS Noise-weighted FBP algorithms have been developed in recent years, with filtering being performed in the Fourier domain. The noise weighting makes the ramp filter in th...
متن کاملFBP: A Frontier-Based Tree-Pruning Algorithm
A frontier-based tree-pruning algorithm (FBP) is proposed. The new method has comparable order of computational complexity, comparing with Cost-Complexity Pruning (CCP). Regarding tree pruning, it provides a full spectrum of information; specifically, (1) given the value of the penalization parameter λ, it gives the minimum size of a decision tree; (2) given the size of a decision tree, it prov...
متن کاملA parallel implementation of the QR-algorithm
In this paper a parallel implementation of the QR algorithm for the eigenvalues of a non-Hermitian matrix is proposed. The algorithm is designed to run eeciently on a linear array of processors that communicate by accessing their neighbors' memory. A module for building such arrays, the Maryland crab, is also described.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Biomedical Imaging
سال: 2006
ISSN: 1687-4188,1687-4196
DOI: 10.1155/ijbi/2006/17463