Skip to main content
  • 535 Accesses

Abstract

There exist several reconstruction methods for computing a volumetric representation of a scanned object from a set of two-dimensional X-ray projection images. However, the most commonly applied method in practical cone-beam CT systems is the approximate FDK method. After we give some prerequisites that are necessary to understand the following descriptions, we present in Section 2.2 the FDK method, discuss possible implementation strategies (Section 2.2.2) that can be applied to practical cone-beam systems and analyze the time complexity of the involved algorithmic steps (Section 2.2.3).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH

About this chapter

Cite this chapter

Scherl, H. (2011). Algorithms for Cone-Beam Image Reconstruction. In: Evaluation of State-of-the-Art Hardware Architectures for Fast Cone-Beam CT Reconstruction. Vieweg+Teubner. https://doi.org/10.1007/978-3-8348-8259-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-8348-8259-2_2

  • Publisher Name: Vieweg+Teubner

  • Print ISBN: 978-3-8348-1743-3

  • Online ISBN: 978-3-8348-8259-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics