Fast optimal decomposed modification of FDK with potential decreasing of memory consuming

Abstract

We present a new algorithm for 3D cone-beam tomography. The algorithm is based on decomposition of the cone-beam backprojection operation and angular decimation. It has computational complexity of O(N3.5) and allows considerable reduction of peak memory usage in comparison with conventional algorithms. Tests with real data demonstrate the acceleration, achieved by using our algorithm instead of FDK, with 20-fold speedup for a 2000 × 2000 × 720 image. The algorithm is compared with other fast FDK algorithms.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…