Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1708.07515 v1 pith:4OHXQOCR submitted 2017-08-24 physics.med-ph

Vladyslav Andriiashen , Danila Kozhevnikov This is my paper · ORCID
classification physics.med-ph
keywords algorithmalgorithmscone-beamfastmemorytimesaccelerationachieved
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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(N^{3.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 \times 2000 \times 720$ image. The algorithm is compared with other fast FDK algorithms.

Discussion (0). Continue with ORCID to comment.

Pith tools