2009
DOI: 10.1007/978-3-642-03474-9_61
|View full text |Cite
|
Sign up to set email alerts
|

Fast and Accurate Proton Computed Tomography Image Reconstruction for Applications in Proton Therapy

Abstract: Abstract-Proton computed tomography has been suggested as a means for maximizing the potential benefits of proton radiation therapy. By measuring individual proton energy losses after traversing an object and predicting paths of maximum likelihood through the image space, relative stopping power maps can be generated for treatment planning and image guidance. However, the processes of proton interaction with the imaged object lead to a number of challenges in the image reconstruction procedure. In this work we… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 10 publications
0
9
0
Order By: Relevance
“…The total number of proton histories generated for each projection was 12 × 10 6 . An iterative algebraic reconstruction algorithm [27] was used to calculate the 3D RSP map of the HIGH_RES_HEAD taking WEPL, position and direction of individual protons as input [17]. …”
Section: Methodsmentioning
confidence: 99%
“…The total number of proton histories generated for each projection was 12 × 10 6 . An iterative algebraic reconstruction algorithm [27] was used to calculate the 3D RSP map of the HIGH_RES_HEAD taking WEPL, position and direction of individual protons as input [17]. …”
Section: Methodsmentioning
confidence: 99%
“…In the current work a block-iterative algorithm known as DROP [31] was used. This algorithm has been compared with other projection algorithms and has demonstrated minor noise and convergence rate advantages with pCT data [34].…”
Section: Iterative Reconstruction With Tvsmentioning
confidence: 99%
“…We consider an approach that mixes ISM and string-averaging algorithms (SA algorithms). The general form of the SA algorithm was proposed initially in [13] and applied in solving convex feasibility problems with algorithms that use projection methods [13,14,44]. Strings are created so that ISM (more generally, any ò-ISM) can be processed in an independent form for each string (by step operators).…”
Section: Introductionmentioning
confidence: 99%