A Fully-Automated Intensity-Modulated Radiation Therapy Planning System

Size: px
Start display at page:

Download "A Fully-Automated Intensity-Modulated Radiation Therapy Planning System"

Transcription

1 A Fully-Automated Intensity-Modulated Radiation Therapy Planning System Shabbir Ahmed, Ozan Gozbasi, Martin Savelsbergh Georgia Institute of Technology Ian Crocker, Tim Fox, Eduard Schreibmann Emory University Abstract We designed and implemented a linear programming based IMRT treatment plan generation technology that effectively and efficiently optimizes beam geometry as well as beam intensities. The core of the technology is a fluence map optimization model that approximates partial dose volume constraints using conditional value-at-risk constraints. Conditional value-at-risk constraints require careful tuning of their parameters to achieve desirable plan quality and therefore we developed an automated search strategy for parameter tuning. Another novel feature of our fluence map optimization model is the use of virtual critical structures to control coverage and conformity. Finally, beam angle selection has been integrated with fluence map optimization. The beam angle selection scheme employs a bi-criteria weighting of beam angle geometries and a selection mechanism to choose from among the set of non-dominated geometries. The technology is fully automated and generates several high-quality treatment plans satisfying dose prescription requirements in a single invocation and without human guidance. The technology has been tested on various real patient cases with uniform success. Solution times are an order of magnitude faster than what is possible with currently available commercial planning systems and the quality of the generated treatment plans is at least as good as the quality of the plans produced with existing technology. 1 Introduction External beam irradiation is used to treat over 500,000 cancer patients annually in the United States. External beam radiation therapy uses multiple beams of radiation from different directions to cross-fire at a cancerous tumor volume. Thus, radiation exposure of normal tissue is kept at low levels, while the desired dose to the tumor volume is delivered. The key to the effectiveness of radiation therapy for the treatment of cancer lies in the fact that the repair mechanisms for 1

2 cancerous cells are less efficient than those of normal cells. Intensity-modulated radiation therapy (IMRT) is a relatively recent advance in treatment delivery in radiation therapy. In IMRT, the beam intensity is varied across each treatment field. Rather than being treated with a large uniform beam, the patient is treated instead with many small pencil beams (referred to as beamlets), each of which can have a different intensity. For many types of cancer, such as prostate cancer and head and neck cancer, the use of intensity modulation allows more concentrated treatment of the tumor volume, while limiting the radiation dose to adjacent healthy tissue (see Veldeman et al. [20] for comparisons of IMRT and non-imrt treatments on different tumor sites). IMRT treatment planning is concerned with selecting a beam geometry and beamlet intensities to produce the best dose distribution. Because of the many possible beam geometries, the large number of beamlets, and the range of beamlet intensities, there is an infinite number of treatment plans, and consistently and efficiently generating high-quality treatment plans is beyond human capability. Consequently, it is necessary to design and implement optimization-based decision support systems that can construct and suggest high-quality treatment plans in a short period of time. That is the goal of our research and the subject of this paper. Constructing an IMRT treatment plan that radiates the cancerous tumor volume without impacting normal structures is virtually impossible. Therefore, trade-offs have to be made. Radiation oncologists have developed a variety of measures to evaluate these trade-offs and to assess the quality of a treatment plan, such as the coverage of a target volume by a prescription dose, the conformity of a prescription dose around a target volume, the highest and the lowest doses received by a target volume. Furthermore, radiation oncologists review dose-volume histograms (DVHs) depicting the dose distributions at various structures (both target volumes and organs at risk) of treatment plans. Typically, a radiation oncologist specifies a set of dose-related minimum requirements (a set of prescriptions) that have to be satisfied in any acceptable treatment plan. The measures and DVHs are then used to choose among acceptable treatment plans. Further complicating the evaluation of treatment plans is the fact that the minimum requirements and their relative importance are subjective as are the underlying trade-offs they are trying to capture. As a result, most existing IMRT treatment planning systems are iterative in nature and necessitate human evaluation and guidance throughout the treatment plan construction process. This makes the process time-consuming and costly. One of the primary goals of our research is the development of fully-automated treatment plan generation technology that completely eliminates human intervention, thereby saving valuable time for the radiation oncologist and physicist. 2

3 Natural models of dose-volume requirements result in nonlinear and/or mixed integer programs, which are notoriously hard to solve. Recently, Romeijn et al. ([18]) observed that conditional value-at-risk constraints (C-VaR constraints), which are popular and commonly used in financial engineering, can be used to approximate dose-volume constraints. The use of C-VaR constraints has significant computational advantages as they can be handled using linear programming models, which are easily and efficiently solved. However, the parameters controlling the C-VaR constraints have to be chosen carefully to get an accurate approximation of the dose-volume constraints. Our treatment plan generation technology, which is based on an optimization model using C-VaR constraints, embeds an effective and efficient parameter search scheme to ensure high-quality approximations of the dose-volume constraints. Another innovation in our treatment plan generation technology is the use of virtual critical structures. Virtual critical structures surround target volumes and are implemented to control the dose deposits specifically at the boundary of the target volume. Our treatment plan generation technology incorporates an effective and efficient scheme for the selection of beam geometries, which is ignored in many commercial planning systems as it adds another layer of complexity to the search for high-quality treatment plans. Most commercial planning systems consider only beam geometries involving a small number of equi-distant beam angles around a circle (on the order of 5 to 8). Because of the computational efficiency of our core plan generation technology, we are able to embed a scheme that optimizes the beam geometry. At the heart of the scheme is a multi-attribute beam scoring mechanism based on a treatment plan constructed for a beam geometry involving a large number of beam angles (on the order of to 24). In summary, we have developed treatment plan generation technology that optimizes both beam geometry and beamlet intensities in a short amount of time. The technology is fully automated and generates several high-quality treatment plans satisfying the provided minimum requirements in a single invocation and without human guidance. The technology has been tested on various real patient cases with great success. Solution times range from a few minutes to a quarter of an hour, which is an order of magnitude faster than what is possible with currently available commercial planning systems. Furthermore, the quality of the generated treatment plans is at least as good as those produced with existing technology. The remainder of the paper is organized as follows. In Section 2, we introduce IMRT treatment plan generation and evaluation in more detail. In Section 3, we describe the core components of the IMRT treatment plan generation technology that we have developed. Finally, in Section 4, we 3

4 present the results of an extensive computational study. 2 Problem Description Intensity-modulated radiation therapy (IMRT) is an advanced mode of high-precision radiotherapy that utilizes computer-controlled mega-voltage x-ray accelerators to deliver precise radiation doses to a cancerous tumor or specific areas within the tumor. The radiation dose is designed to conform to the three-dimensional (3-D) shape of the tumor by modulating or controlling - the intensity of the radiation beam to focus a higher radiation dose to the tumor while minimizing radiation exposure to surrounding normal tissues. Typically, combinations of several intensity-modulated fields coming from different beam directions produce a custom tailored radiation dose that maximizes tumor dose while also protecting adjacent normal tissues. IMRT is being used to treat cancers of the prostate, head and neck, breast, thyroid, lung, liver, brain tumors, lymphomas and sarcomas. Radiation therapy, including IMRT, stops cancer cells from dividing and growing, thus slowing tumor growth. In many cases, radiation therapy is capable of killing cancer cells, thus shrinking or eliminating tumors. For a more detailed description, review, history, and physical basis of IMRT, see Bortfeld ([3]), Boyer et al. ([4]), Shepard ([19]), and Webb ([21]). An IMRT treatment plan has to specify a beam geometry (a set of beam directions) and for each beam direction a fluence map (a set of beamlet intensities; a beam can be thought of as consisting of a number of beamlets that can be controlled individually). Typically, a small number of equi-spaced coplanar beam directions are used. Coplanar beam directions are obtained by rotating the gantry while keeping the treatment couch in a fixed position parallel to the gantry axis of rotation. There are practical reasons for limiting the number of beam directions (between 5 and 8) as it reduces patient positioning times, chances for patient positioning errors, and delivery time, but considering only a restricted set of beam geometries is driven primarily by the computational complexity it introduces in the treatment planning process. For modeling purposes, the structures (target and critical structures) are discretized into cubes called voxels (e.g., cubes of mm) and the dose delivered to each voxel per intensity of each beamlet is calculated (see Ahnesjo [1], Mackie et al. [12], and Mohan et al. [13] for dose calculation methods). The total dose received by a voxel is assumed to be the sum of doses deposited from each beamlet. The goal is to build a treatment plan that creates a dose distribution that will destroy, or at least damage, target cells while sparing healthy tissue by choosing proper beam directions and 4

5 beamlet intensities. In order to guide the construction of a treatment plan, a radiation oncologist specifies a set of requirements that have to be satisfied in any acceptable treatment plan. These requirements are in the form of a minimum prescription dose for target structure voxels and a maximum tolerance dose for nearby critical structure voxels. A prescription dose is the dose level necessary to destroy or damage target cells, while a tolerance dose is the dose level above which complications for healthy tissues may occur. The requirements are grouped into two types: (1) full-volume constraints and (2) partial-volume constraints. Full-volume constraints specify dose limits that have to be satisfied by all voxels of a structure. Partial-volume constraints, on the other hand, specify dose limits that have to be satisfied by a specified fraction of the voxels of a structure. The choice of a full-volume or a partial-volume constraint for a healthy structure depends on the functionality of the organ. For example, a partial-volume constraint is used when the organ at risk will not be damaged as long as a specified volume receives a dose below the tolerance dose. In addition to the set of dose requirements defining acceptable treatment plans, clinical oncologists use a set of evaluation metrics to assess the quality of a treatment plan. The cold spot and hot spot metrics are evaluation measures that consider the minimum and maximum dose received by a voxel in a structure relative to the prescription dose. The coverage metric considers the fraction of voxels in the target structure receiving a dose greater than the prescription dose. The conformity metric considers the ratio of the number of voxels in the target region and surrounding tissue receiving a dose greater than the prescription dose to the number of voxels in the target structure itself receiving a dose greater than the prescription dose. More formally, these evaluation metrics are defined as follows. Let N denote the set of beamlets, S the set of critical structures, T the set of target structures, V s the number of voxels in structure s, and z js the dose received by voxel j of structure s. (Of course z js depends on the treatment plan.) The cold spot of target structure s T is defined as the ratio of the minimum dose received by any of the voxels of the structure to the prescription dose for that structure, i.e. cold spot(s) = min{z js : j = 1,..., V s } P D s, (1) where P D s is the prescription dose for target structure s. Similarly, the hot spot of target structure s T is defined as the ratio of the maximum dose received by any of the voxels of the structure to 5

6 the prescription dose, i.e. hot spot(s) = max{z js : j = 1,..., V s } P D s. (2) Ideally, every voxel in a target structure receives exactly the prescription dose. The cold spot metric and hot spot metric measure the deviation from this ideal situation by examining the voxel receiving the smallest dose and the voxel receiving the largest dose. The coverage of target structure s T is the proportion of voxels receiving a dose greater than or equal to the prescription dose P D s, i.e. coverage(s) = V s I + (z js P D s ) V s, (3) where I + is the indicator function for the non-negative real line, i.e., I + (a) is equal to 1 if a 0 and 0 otherwise. For simplicity assume that T = {s}. Note that 0 coverage(s) 1 and that values closer to 1 are preferable. The conformity of target structure s is the ratio of the number of voxels in the structure and its surrounding tissue receiving a dose greater than or equal to the prescription dose P D s to the number of voxels in the structure itself receiving greater than or equal to the prescription dose, i.e., conformity(s) = V s s S T V s I + (z js P D s ) I + (z js P D s ) = 1 + V s I + (z js P D s ) s S V s I + (z js P D s ). (4) Note that 1 conformity(s) and that values closer to 1 are preferable. The coverage and conformity metrics are illustrated in Figure 1. In the schematic on the left, the set of voxels receiving a dose greater than or equal to the prescription dose is exactly the set of voxels in target structure s and thus coverage(s) = conformity(s) = 1; this is the ideal solution. In the schematic in the center the set of voxels receiving a dose greater than or equal to the prescription dose is twice the size of the set of voxels in target structure s (and includes all the voxels of s) and thus coverage(s) = 1 and conformity(s) = 2. Finally, in the schematic on the right, the set of voxels receiving a dose greater than or equal to the prescription dose is exactly half the set of voxels in target structure s and thus coverage(s) = 0.5 and conformity(s) = 1. Ideally, every voxel in a target structure receives exactly the prescription dose and all the voxels in the surrounding tissue (e.g., in the nearby critical structures) receive no dose at all. The coverage metric measures how well we cover the voxels in 6

7 TARGET TARGET TARGET Coverage = 1 Conformity = 1 Coverage = 1 Conformity = 2 Coverage = 0.5 Conformity = 1 Prescription Dose Region Figure 1: Coverage and conformity metrics the target structure. The conformity metric measures, in a sense, what happens at the boundary of the target structure. It measures the price that has to be paid, in terms of exposure of healthy tissue, to achieve high coverage. Due to the fact that coverage and conformity consider the target as a whole, these metrics are typically considered of higher importance than the cold spot and hot spot metrics. (See Lee et al. ([8, 9]) for earlier use of these metrics for plan evaluation.) As we will see in the next section, the evaluation metrics are optimized implicitly; the evaluation metrics are not incorporated explicitly in the optimization problem. 3 Methodology In this section, we describe the key components of the proposed IMRT treatment plan generation technology. The core of the technology is a fluence map optimization (FMO) model based on linear programming. This model is similar to the one proposed by Romeijn et al. ([18]) and approximates partial volume constraints using conditional value-at-risk (C-VaR) constraints. C- VaR constraints require careful tuning of their parameters to achieve desirable plan quality and therefore an automated search strategy for parameter tuning has been developed. (See Preciado- Walters et al. [14] and Lee et al. [8] for exact mixed integer programming formulations of partial volume constraints.) A novel feature of the fluence map optimization model is the use of virtual 7

8 critical structures to control coverage and conformity. Finally, beam angle selection has been integrated with fluence map optimization. The beam angle selection scheme employs a bi-criteria weighting of beam angle geometries and a selection mechanism to choose from among the set of non-dominated geometries. 3.1 Fluence Map Optimization Model Recall that N denotes the set of beamlets, S the set of critical structures, T the set of target structures, V s the number of voxels in structure s, and D ijs the dose received by voxel j of structure s per unit intensity of beamlet i. Let x i be the intensity of beamlet i, i.e., a decision variable, then the dose z js received by voxel j of structure s, is z js = i N D ijs x i j = 1,..., V s ; s S T. (5) Full volume constraints Let L s and U s be the prescribed lower and upper dose limits for structure s, respectively. The full-volume constraints for dose limits are L s z js U s j = 1,..., V s ; s S T. (6) Partial volume constraints The dose-volume constraints for target structures are formulated as 1 V s c s (c s z js ) + L α s s T. (7) This C-VaR constraint enforces that the average dose in the (1 α s )-fraction of voxels of target structure s receiving the lowest amount of dose is greater than or equal to L α s. When satisfied at least α s 100 per cent of the voxels will receive a dose greater than or equal to L α s. For example, with α s = 0.9 and L α s = 30 at least 90% of the voxels will receive a dose greater than 30 Gy. Here c s is a free variable associated with the dose-volume constraint of structure s. Similarly, the partial-volume constraints for critical structures are 1 V s c s + (z js c s ) + Us α s S. (8) 8

9 For critical structure s the average dose in the subset of size (1 α s ) receiving the highest amount of dose is required to be less than or equal to U α s. When satisfied at least α s percent of the voxels will receive a dose less than or equal to U α s. Cold spot and hot spot requirements As mentioned before the cold spot metric (1) for a target structure s T is defined as the ratio of the minimum dose received by the voxels of the target structure to the prescription dose, and the hot spot metric (2) for a target structure s T is defined as the ratio of the maximum dose received by the voxels of the target structure to the prescription dose. Prescribed requirements on cold spot and hot spot can be enforced by the bounds L s and U s in the full volume constraints (6). Coverage requirements The coverage metric (3) of a target structure s T is the proportion of voxels receiving a dose greater than or equal to the prescription dose P D s. Due to the indicator function in the expression (3), requirements on coverage are hard to model using convex constraints. Instead, we use partial volume constraints to enforce the coverage requirements using the following result. Proposition 1 Given α s (0, 1), if there exists a c s such that 1 V s c s (c s z js ) + P D s (9) then coverage(s) α s. (10) A proof of this proposition can be found in the appendix. Thus coverage(s) can be increased by increasing α s in the partial volume constraints (7) with L α s = P D s. Of course α s = 1 is most preferable but such an aggressive value may lead to problem infeasibility. Note that in this case (i.e. when α s = 1) the partial volume constraint reduces to a full volume constraint. Conformity requirements The conformity metric (4) of a target structure s T is the ratio of the total number of voxels in the body receiving a dose greater than or equal to the target prescription dose P D s to the number of voxels in the target receiving greater than or equal to prescription dose in the target structure. 9

10 Unlike cold spot, hot spot and coverage; conformity requirements cannot be directly enforced by full or partial volume constraints on the dose on the target structure. This is because the conformity metric needs to consider dose deposited outside the target. In order to keep track of the intended dose for the target s that is deposited outside the target, we introduce a virtual critical structure around the target structure s. This is typically a 30 mm band around the target structure s, denoted by b(s), which is included in S. Price et al. ([15]) and Lee et al. ([9]) showed on clinical cases that limiting or minimizing the dose on virtual critical structures around the target structures can improve the conformity of the plans. Girinsky et al. ([6]) also used virtual critical structures to avoid high doses around the tumor volume. Assuming that all of the dose intended for the target s T will be deposited in the voxels in s and in b(s), the only structures in S that can have more than the prescribed dose P D s will be b(s). Then from (4) conformity(s) = 1 + V b(s) V s I + (z js P D s ) I + (z js P D s ) = 1 + coverage(b(s)) V b(s) coverage(s) V s, where the second equality follows from the definition of coverage. We know that by enforcing the partial volume constraint (7) on s with L α s = P D s and given α s (0, 1) we ensure coverage(s) α s. Similarly, it can be shown that by enforcing the partial volume constraint (8) on b(s) with U α b(s) = P D s and given α b(s) (0, 1), we ensure coverage(b(s)) (1 α b(s) ). Thus conformity(s) 1 + (1 α b(s)) V b(s) α s V s. (11) Therefore we can reduce conformity(s) by increasing α s as well as by increasing α b(s). Setting these parameters at their maximum value of 1 typically leads to problem infeasibility, and so a careful selection has to be made. This is further discussed in Section

11 The LP model The final formulation of our FMO model is min 1 V s s S V s z js s T 1 V s V s z js (12) s.t. z js = i N D ijs x i j = 1,..., V s ; s S T (13) L s z js U s j = 1,..., V s ; s S T (14) 1 V s c s + (z js c s ) + Us α s S (15) (1 α s )V s 1 V s c s (c s z js ) + L α s s T (16) (1 α s )V s x i 0 i = 1,..., N (17) z js 0 j = 1,..., V s ; s S T (18) c s free s S T. (19) The objective function (12) attempts to decrease the average dose on the critical structures while increasing the average dose on the target structures. (See Kessler et al. [7] and Yang and Xing [23] for objective functions used in IMRT formulations). Constraint (13) calculates the total dose z js deposited on to voxel j of structure s from all beamlets. Constraints (14) are the full volume constraints on the structures according to the prescribed dose limits and the cold spot and hot spot considerations. Constraints (15) are the partial volume constraints on the critical structures. Since S includes the virtual critical structure b(s) for each target s T, these constraints serve to enforce conformity requirements. Constraints (16) are the partial volume constraints on the target structures and enforce coverage requirements. Finally, the beamlet intensities and total dose deposited are required to be non-negative while the artificial variables c s are free. Note that the nonlinear function ( ) + in the partial volume constraint can be linearized in the standard way leading to a linear programming formulation of the above FMO model. 3.2 Parameter Search As mentioned before, the coverage and conformity corresponding to a target structure s T in a treatment plan resulting from the FMO model (12)-(19) depends on the values of the parameters α b(s) and α s in the upper and lower partial volume constraints (15) and (16) for b(s) and s T, respectively. In this section, we describe a search technique for appropriate values of these 11

12 parameters. For simplicity of exposition we assume that there is only one target structure, i.e., T = {t}. Recall that, for good coverage and conformity for the target t, high values of α b(t) and α t are preferable, however this may lead to problem infeasibility. Let F t = {(α b(t), α t ) (0, 1) 2 : The FMO model (12)-(19) is feasible}. Note that if (α t, α b(t) ) F t, α t α t and α b(t) α b(t), then (α t, α b(t) ) F t. Assuming F t is non-empty we would like to maximize α t and α b(t) over F t. Such solutions will lie on the upper boundary of F t. Our search technique starts with an initial solution and goes through several search phases to identify solutions on the upper boundary of F t. Figure 2 illustrates the search phases, which are now detailed. Initial values of the parameters α t and α b(t) are chosen based on a minimum coverage requirement M incov and a maximum allowed conformity value M axconf. In particular α 0 t = MinCov β (20) α 0 b(t) = (1 MinCov(MaxConf 1)V t V b(t) ) β (21) where 0 < β < 1 is scaling factor to account for the fact that the bounds (10) and (11) are conservative. In our implementation for case studies we used β = 0.9. We solve the FMO model (12)-(19) with the initial parameter values (α 0 b(t), α0 t ). If the problem is infeasible, i.e. (α 0 b(t), α0 t ) F t, then we execute Phase 0. Here we decrease both parameters by λ, where 0 < λ < 1, and resolve the FMO model. This is continued until a feasible set of parameters is found. The structure of the set F t guarantees that if F t is non-empty, then Phase 0 will produce a feasible set of parameters. Once we have initial feasible parameters, we execute Phase 1, where we increase both α b(t) and α t by λ and resolve the FMO model. This is repeated until we reach an infeasible set of parameters. The last set of feasible parameters, denoted by (α 1 b(t), α1 t ), then is a solution near the upper boundary of F t. Next we execute Phase 2 where, starting from (α 1 b(t), α1 t ), we increase α 1 t by λ until we reach an infeasible set of parameters. The motivation here is that, since increasing α t improves both coverage and conformity, we want to obtain additional solutions with good coverage and conformity values. The last feasible solution from Phase 2 is denoted by (α 2 b(t), α2 t ). In order to find additional candidate solutions on the boundary of F t, we execute Phase 3. Here we first reduce α b(t) by λ, and then start Phase 2 to increase α t. Note that in the solutions produced 12

13 a t (Until Infeasibility) F t (a b(t), a t ) (a b(t) 3, a t 3 ) Final Values (Until Infeasibility) Phase 3 Phase 2 (a b(t) 2, a t 2 ) (Until Infeasibility) 0 0 (a b(t), a t ) Initial Values Phase 0 Phase 1 (a b(t) 1, a t 1 ) Phase 4 F t (a b(t), a t ) (Until Infeasibility) (Until a Feasible Solution) a b(t) Figure 2: Parameter Search for α t and α b(t) 13

14 in this phase the conformity values may be worse than those from Phase 2, however coverage will not worsen. Finally, if Phases 2 and 3 are not able to produce feasible parameters that are greater than (αb(t) 1, α1 t ), then we execute Phase 4. Here we increase α b(t) by λ in order to find additional solutions near the upper boundary of F t. The step size λ is an important component of the search process. From initial experimentations, we chose this to be λ = Beam Selection Careful selection of beam angles is an important part of creating IMRT plans as these angles provide the candidate beamlets for which the intensities are optimized. Holder et al. ([5]) provide a rigorous presentation of the beam selection problem and some comparisons of current algorithms on phantom cases. (See Webb [2] for a classification of beam selection algorithms proposed in the literature.) Clinical use of the beam selection algorithms are rare and most commercial planning systems still rely on manual selection of beam angles by planners (Pugachev and Xing [17]). In this section, we describe a scheme for selecting a set of beam angles (geometry/configuration) to deliver the treatment from. Suppose there are 18 candidate angles and we wish to select 8 delivery angles, then there are 43,758 choices making complete enumeration clinically impossible. (See Liu et al. [11] for a complete enumeration based method.) Instead of evaluating all possible combinations using fluence optimization, we use a bi-criteria scoring approach to limit our choices to a relatively small number of non-dominated combinations. We compare our beam selection methodology with scoring-based approach of Pugachev and Xing ([16]) in Section 4. The first step is to use the FMO model and parameter search to determine a treatment plan satisfying prescription criteria assuming that all candidate beam angles (say there are M of these) can be used. Let x i be the intensity of beamlet i in beam (angle) B (where B = 1,..., M) and z jt be the dose delivered to voxel j of the target structure t (PTV) in this treatment plan. Each beam (angle) B is then assigned the following two weights: Total Dose Delivered to PTV. The total dose delivered to PTV by beam B is computed as DP T V B = i B V t D ijt x i. (22) Preferring beams with a higher value of DP T V B favors beams that deliver higher dose to the target. The disadvantage of this measure is that it does not directly consider the dose 14

15 received by PTV voxels in the lower tail of the dose distribution, i.e., cold spots, and cold spots have a significant effect on treatment quality. Weighted Sum of Dose Delivered to the Cold Region of PTV. We define the cold region C t of PTV as the set of voxels which receive a dose less than 10% above the minimum dose observed in PTV, i.e., C t = {j = 1,..., V t : z jt 1.10 min j (z jt)}. (23) The weighted sum of dose delivered to the cold region of PTV from beam angle B is computed as W P T V B = D ijt x 1 i max{z (24) i B j C t jt, ɛ}, where ɛ > 0 is included to avoid division by zero. Preferring beams with higher value of W P T V B favors beams that deliver more dose to the cold region of the target. Note that we distinguish voxels in the cold region by assigning weights inversely proportional to the actual dose received by these voxels. Thus, a beam delivering the same amount of dose as another beam but to colder voxels will have a higher score. The advantage of this measure is that it can help to identify beams, the blocking of which may result in a significant loss of dose delivery to the cold region of PTV and thus lower tumor control. However, a scoring mechanism purely based on W P T V B values may lead to formation of new cold spots, because these beams are likely to intersect at the same part of PTV and may be ineffective in other parts of PTV. Next, we consider each possible choice of L delivery angles from the total M angles. (Note there are ( M L ) possibilities.) For each of the possible configurations, i.e., a set of beam angles C {1,..., M} such that C = L, we compute the configuration weights, i.e., DP T V (C) = B C DP T V B, and W P T V (C) = B C W P T V B. Next, we identify a set K of non-dominated configurations, i.e., K = {C : D s.t. DP T V (D) > DP T V (C) and W P T V (D) > W P T V (C)}. Ideally, to choose between the non-dominated configurations in K, we would generate an optimized treatment plan for each (using the FMO model with parameter search) and select the one with the 15

16 highest quality. However this may be too time consuming. Instead, we perform a greedy search. We start with an arbitrary configuration C K and execute Phase 1 and Phase 2 of the parameter search. Let the resulting set of parameter values be (αb(t) 2, α2 t ). Next, we search for a configuration Ĉ K for which (αb(t) 2, α2 t + λ) is feasible. If no such configuration Ĉ exists, then configuration C is selected. On the other hand, if such a configuration Ĉ exists, we iterate and execute Phase 1 and Phase 2 of the parameter search for Ĉ starting from (α2 b(t), α2 t ). 4 Computational Study In this section, we present the results of a computational study conducted using three real-life cases: a pediatric brain case, a head and neck case, and a prostate case. The computational study focuses on the value of the techniques and solution schemes introduced above: (1) the use of virtual critical structures to construct high-quality treatment plans in terms of coverage and conformity, (2) the development of an automated, systematic parameter search scheme for treatment plan construction models using conditional value at risk constraints to model partial dose volume constraints, and (3) the development of an efficient and effective beam angle selection scheme. 4.1 Case Descriptions The computational study is conducted using three real-life cases: a pediatric brain case, a headand-neck case, and a prostate case. As these cases represent different parts of the body, and thus a variety of challenges in terms of treatment plan generation, their use will demonstrate the robustness of our approach; no tuning is necessary for the specific cases. Information concerning the prescription requirements for the tumor as well as for the critical structures (organs at risk) in terms of full volume and partial volume dose constraints for the three cases can be found in Tables 1, 2, and 3. Partial dose volume constraints for the tumor (PTV) and the virtual critical structure (VCS) are computed using the formulas presented in Section 3 using a minimum coverage requirement of 0.95 and a maximum conformity requirement of 1.2. Observe that there are no partial dose-volume constraints for critical structures in the pediatric brain case. To be able to analyze and judge the value of the different techniques and solution schemes we have developed, we start with base settings in each of the three cases. With base settings radiation is delivered from 8 equi-spaced beams in the pediatric brain case, from 8 equi-spaced beams in the head and neck case, and from 6 equi-spaced beams in the prostate case. Furthermore, the full and 16

17 Constraint Type Structure #Voxels Percentage LB (cgy) UB (cgy) PTV 1, ,300 Hypothalamus ,160 Right cochlea ,260 Full volume Left cochlea ,260 Pituitary ,160 Left eye Right eye VCS 6, ,300 Partial volume PTV 1, ,060 - VCS 6, ,060 Table 1: Brain Case - Structures and Constraints partial dose volume constraints as specified in Tables 1, 2, and 3 are used except for those related to the virtual critical structure. 4.2 Value of the Virtual Critical Structure The virtual critical structure was introduced to improve conformity. Our first computational experiment focuses on whether the introduction of the virtual critical structure indeed improves conformity and, if so, by how much. This simply means that we compare the base setting with and without the full and partial dose volume constraints related to the virtual critical structure. The results are presented in Table 4. We see that the effect of introducing the virtual critical structure is dramatic. For all three cases, the conformity is significantly improved. We also observe that the coverage is improved in all three cases, although only slightly. We pay a small price in terms of the coldspot; for both the head and neck case and the prostate case, the minimum dose has decreased slightly. 4.3 Value of the Parameter Search As the treatment plan construction model only indirectly attempts to optimize coverage and conformity, we may be able to improve coverage and conformity by judiciously adjusting the parameters α P T V and α V CS. In Section 3.2, we have outlined an automated, systematic parameter search 17

18 Constraint Type Structure #Voxels Percentage LB (cgy) UB (cgy) PTV 2, ,120 Brainstem 1, ,400 Spinal cord ,500 Globe LT ,000 Globe RT ,000 Full volume Optic chiasm ,400 Optic nerve LT ,400 Optic nerve RT ,400 Parotid LT ,400 Parotid RT ,400 VCS 7, ,120 PTV 2, ,100 - Partial volume Parotid LT ,600 Parotid RT ,600 VCS 7, ,100 Table 2: Head & Neck Case - Structures and Constraints scheme to produce treatment plans with better coverage and conformity than the plans produced with the initial parameter values. In the next computational experiment, we focus on the improvement in coverage and conformity that can be achieved through the parameter search. We compare the base settings (with full and partial dose volume constraints for the virtual critical structure included) with and without parameter search. The results are presented in Table 5. We observe that there are significant improvements for coverage and conformity for the brain and the prostate case. However, for the head-and-neck case the slight improvement in coverage is offset by a deterioration in conformity. The parameter search for the brain case and for the head and neck case end with a Phase 3 iteration, in which the virtual critical structure constraint is relaxed to see if that allows for treatment plans with higher coverage. As a result, the value of conformity increases slightly in the last iteration. More details are provided in Figure 3 where we plot the change in the evaluation metrics during the course of the parameter search. 18

19 Constraint Type Structure #Voxels Percentage LB (cgy) UB (cgy) PTV ,300 Full volume Rectum 1, ,160 Bladder 1, ,260 VCS 2, ,300 PTV ,560 - Rectum 2, ,560 Partial volume Rectum 2, ,500 Bladder 1, ,500 VCS 2, ,560 Table 3: Prostate Case - Structures and Constraints Brain Head & Neck Prostate without VCS with VCS without VCS with VCS without VCS with VCS Coverage Conformity Coldspot Hotspot Table 4: Value of Virtual Critical Structure 4.4 Beam Angle Selection Carefully selecting beam angles may significantly enhance the ability to construct high-quality treatment plans. However, due to the large number of possible beam angles and the complexity of generating high-quality treatment plans given a set of beam angles, beam angle selection has not been extensively investigated and few effective schemes for beam angle selection exist. In the next computational experiments, we focus on the effect of the beam angle selection scheme we have developed. A core ingredient of our scheme is identifying non-dominated beam configurations with respect to two quantities computed for a treatment plan in which all candidate beam angles are available for use: (1) the dose delivered to the PTV and (2) the dose delivered to cold regions of the PTV. In Figures 4, 5, and 6, we plot the scores for all 8-beam configurations for the brain 19

20 Brain Head & Neck Prostate without with without with without with parameter parameter parameter parameter parameter parameter search search search search search search Coverage Conformity Coldspot Hotspot Table 5: Value of Parameter Search and head and neck cases and all 6-beam configurations for the prostate case selected from 18 equispaced candidate beams and highlight the configurations that are non-dominated. The figures show that few non-dominated configurations exist. In Table 6, we provide additional information to support the observation that very few non-dominated configurations exist. For configurations of different sizes, we report the total number of configurations as well as the number of non-dominated configurations. Next, we explore the effect of carefully selecting beam angles, and thus of integrating all the techniques and solution schemes developed. The results are presented in Table 7. The results are mostly self-explanatory. They clearly demonstrate the value of the various techniques and solution schemes we have introduced. However, these evaluation metrics only tell part of the story. Clinicians like to examine dose volume histograms as well. We show dose volume histograms in Figures 7, 8, and 9 for the brain case, the head and neck case, and the prostate case, respectively. Each of the figures displays dose volume histograms for three treatment plans: (1) a plan with equispaced beams obtained by solving the model, but without parameter search, (2) a plan with equispaced beams obtained by solving the model incorporating parameter search, and (3) a plan with optimized beam angles obtained by solving the model incorporating parameter search. The dose volume histograms show that improving coverage and conformity (i.e., by performing a parameter search) can have a negative impact on the dose volume histograms of the organs at risk (increased doses delivered), but that by carefully selecting the beam angles these undesirable effects can be mostly negated. This can be observed especially well in the head and neck case; consider for example the brainstem. 20

21 Configuration Size # Non-Dominated Configurations # Configurations Brain Head & Neck Prostate , , , , , ,620 Table 6: Number of Non-dominated Configurations for Various Configuration Sizes Comparison with another Beam Selection Algorithm To further validate our approach, we compare our results to the results obtained by selecting the beam angles according to the pseudo Beam s-eye-view (pbev) scores introduced by Pugachev and Xing ([16]). The steps for the pbev calculation of a given beam angle are as follows: 1. Find the voxels crossed by each beamlet of the beam angle; 2. Assign each beamlet an intensity that delivers a dose equal to or higher than the prescription dose in every target voxel; 3. For each OAR or normal tissue voxel crossed by the beamlet, calculate the factor by which the beamlet intensity has to be multiplied to ensure the tolerance dose is not exceeded (factor less than or equal to 1); 4. Find the minimum factor among the ones calculated in Step 3; 5. Adjust the beamlet intensities obtained in Step 2 using the minimum factor. The resulting values, referred to as the maximum beam intensity profile, represent the maximum usable intensity of the beamlet; 6. Perform a forward dose calculation using the maximum beam intensity profile; 21

22 Case Evaluation Equi-spaced Equi-spaced & Equi-spaced & Optimized angles & measure VCS VCS & VCS & Parameter search Parameter search Coverage Brain Conformity Coldspot Hotspot Coverage Head & Conformity Neck Coldspot Hotspot Coverage Prostate Conformity Coldspot Hotspot Table 7: Evaluation Metrics for Different Schemes 7. Compute the score for chosen beam angle i according to an empiric score function as follows: S i = 1 V t V t ( d ij P D t ) 2 (25) where d ij is the dose delivered to voxel j from beam angle i, V t is the number of voxels in the target, and P D t is the target prescription dose. We selected the final configuration simply by picking the highest scoring beams. (In [16], Pugachev and Xing manually pick the beams in the case examples when some high-scoring angles are too close to each other to create a separation.) We computed beam angle configurations for the cases using pbev scores and our proposed scores, and then performed fluence map optimization using our technology. Multiple solutions are produced for each case by varying the number of beam angles. The configuration sizes are 6, 7, 8 and 9 for both brain and head and neck cases, and 4, 5, 6 for the prostate case. The average values of the evaluation metrics (over the different configuration sizes) are presented in Table 8. The values of coverage and conformity are better in all cases with our proposed scheme. 22

23 Case Evaluation pbev Optimized Angles meatric Coverage Brain Conformity Coldspot Hotspot Coverage Head & Conformity Neck Coldspot Hotspot Coverage Prostate Conformity Coldspot Hotspot Table 8: Comparison of Evaluation Metrics for Beam Angles Selected with pbev and Our Scheme The improvement is significant especially for the brain case. The main difference between our scoring scheme and the pbev scoring scheme is that we score beams based on their exact contributions to the delivered doses to target structures in an optimized solution rather than just using their geometric properties. Another important difference is that we consider multiple beam configurations in the parameter search phase, which allows us to adjust dynamically in response to observed interaction effects between beams. In the pbev algorithm there is only one configuration which is chosen based on initial parameter values. 4.5 Beam Configuration Size The results presented so far assumed that the desired number of beam angles was decided in advance. We have seen that by carefully selecting beam angles substantially better treatment plans can be generated. This suggests that it may be possible to get high-quality treatment plans with fewer beam angles. Table 9 presents the values of the evaluation criteria for different sizes of beam configurations. The same information is displayed graphically in Figure 10. A number of observations can be made. As expected, there are diminishing returns when we 23

24 2 beams 3 beams 4 beams 5 beams 6 beams 7 beams 8 beams 9 beams Coverage Brain Conformity Coldspot Hotspot Coverage Head & Neck Conformity Coldspot Hotspot Coverage Prostate Conformity Coldspot Hotspot Table 9: Metric Values for Different Beam Configuration Sizes continue to increase the size of the configuration. (This is especially clear for the prostate case where treatment plans of almost equal quality are produced for configurations of size 4 and up.) Furthermore, treatment plans with good quality can already be achieved with configurations of relatively small size (which has many practical advantages). If we compare the results presented in Table 7 to those presented in Table 9, we see that carefully selecting beam angles allows us to construct treatment plans of equal or better quality than those that can be obtained with equispaced beams with fewer beams. The above results indicate that our beam angle selection scheme produces beam configurations that allow the construction of high-quality treatment plans. However, it is possible that other beam configurations may allow even better treatment plans. Therefore, to further assess the quality of the beam angle configurations produced by our scheme, we compare the beam configurations produced by our scheme to those produced by an optimization approach based on an integer programming formulation (Lee et al. [8, 9], Yang et al. [22], and Lim et al. [10]). Due to the computational requirements of the optimization approach this comparison can only be performed for settings with a relatively small number of candidate beam angles. We experimented with selecting 5 beam angles out of 8 equi-spaced candidate beam angles for the brain and the head and neck case. Both times, our selection scheme produced the optimal configuration, i.e., the same configuration that the optimization approach produced. It is informative to look at the difference in required computation time; see Table 10. It is clear that the optimization approach will become computationally prohibitive when 10 or more candidate beam angles are used. 24

25 Time (secs.) Ratio Scheme MIP Brain 348 5,676 1 : 16 Head & Neck ,988 1 : 46 Table 10: Comparison with Mixed Integer Programming Approach Voxels Beamlets #cons #vars primal dual barrier simplex simplex Brain 8,668 1,010 17,881 16,871 1,548 1, Head & Neck 14,178 1,599 27,705 26,106 31,118 4, Table 11: Run Time (seconds) for Various Linear Programming Algorithms 4.6 Solution Times One of the primary goals of our research is to automate the treatment plan generation in order to save clinicians valuable time. A related, equally important goal is to do so in a reasonably short period of time, so that more plans can be generated in a short amount of time and thus, hopefully, more patients can be treated. Therefore, our next set of experiments are aimed at assessing the run time requirements of our solution scheme. As mentioned above, we chose to develop only linear programming based technology, because linear programs can be solved efficiently. Several methodologies exist for solving linear programs, e.g., primal simplex, dual simplex, and interior point methods, and our first experiment examines the solution times for the different solution methods for our class of linear programs. We have used the linear programming solver of XPRESS (Xpress-Optimizer 2007). Table 11 presents the instance characteristics for the head and neck case and the brain case when generating a treatment plan for 8 equi-spaced beams (using a virtual critical structure) and the run times in seconds for the three linear programming algorithms (with default parameter settings). All our experiments were run on a 2.66GHz Pentium Core 2 Duo processor with 3GB of RAM under Windows XP Operating System. The differences are staggering; for this class of linear programs, interior point methods are by far superior. All remaining computational experiments therefore use XPRESS s barrier algorithm to solve linear programs. Our next set of results illustrates the impact on computation times of including a virtual critical 25

A Fully-Automated Intensity-Modulated Radiation Therapy Planning System

A Fully-Automated Intensity-Modulated Radiation Therapy Planning System A Fully-Automated Intensity-Modulated Radiation Therapy Planning System Shabbir Ahmed, Ozan Gozbasi, Martin Savelsbergh Georgia Institute of Technology Tim Fox, Ian Crocker, Eduard Schreibmann Emory University

More information

An Automated Intensity-Modulated Radiation Therapy Planning System

An Automated Intensity-Modulated Radiation Therapy Planning System An Automated Intensity-Modulated Radiation Therapy Planning System Shabbir Ahmed, Ozan Gozbasi, Martin Savelsbergh H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology,

More information

Radiation therapy treatment plan optimization

Radiation therapy treatment plan optimization H. Department of Industrial and Operations Engineering The University of Michigan, Ann Arbor, Michigan MOPTA Lehigh University August 18 20, 2010 Outline 1 Introduction Radiation therapy delivery 2 Treatment

More information

Interactive Treatment Planning in Cancer Radiotherapy

Interactive Treatment Planning in Cancer Radiotherapy Interactive Treatment Planning in Cancer Radiotherapy Mohammad Shakourifar Giulio Trigila Pooyan Shirvani Ghomi Abraham Abebe Sarah Couzens Laura Noreña Wenling Shang June 29, 212 1 Introduction Intensity

More information

7/29/2017. Making Better IMRT Plans Using a New Direct Aperture Optimization Approach. Aim of Radiotherapy Research. Aim of Radiotherapy Research

7/29/2017. Making Better IMRT Plans Using a New Direct Aperture Optimization Approach. Aim of Radiotherapy Research. Aim of Radiotherapy Research Making Better IMRT Plans Using a New Direct Aperture Optimization Approach Dan Nguyen, Ph.D. Division of Medical Physics and Engineering Department of Radiation Oncology UT Southwestern AAPM Annual Meeting

More information

A hybrid framework for optimizing beam angles in radiation therapy planning

A hybrid framework for optimizing beam angles in radiation therapy planning A hybrid framework for optimizing beam angles in radiation therapy planning Gino J. Lim and Laleh Kardar and Wenhua Cao December 29, 2013 Abstract The purpose of this paper is twofold: (1) to examine strengths

More information

Treatment Planning Optimization for VMAT, Tomotherapy and Cyberknife

Treatment Planning Optimization for VMAT, Tomotherapy and Cyberknife Treatment Planning Optimization for VMAT, Tomotherapy and Cyberknife Kerem Akartunalı Department of Management Science Strathclyde Business School Joint work with: Vicky Mak-Hau and Thu Tran 14 July 2015

More information

Current state of multi-criteria treatment planning

Current state of multi-criteria treatment planning Current state of multi-criteria treatment planning June 11, 2010 Fall River NE AAPM meeting David Craft Massachusetts General Hospital Talk outline - Overview of optimization - Multi-criteria optimization

More information

IMRT site-specific procedure: Prostate (CHHiP)

IMRT site-specific procedure: Prostate (CHHiP) IMRT site-specific procedure: Prostate (CHHiP) Scope: To provide site specific instructions for the planning of CHHIP IMRT patients Responsibilities: Radiotherapy Physicists, HPC Registered Therapy Radiographers

More information

An experimental investigation on the effect of beam angle optimization on the reduction of beam numbers in IMRT of head and neck tumors

An experimental investigation on the effect of beam angle optimization on the reduction of beam numbers in IMRT of head and neck tumors JOURNAL OF APPLIED CLINICAL MEDICAL PHYSICS, VOLUME 13, NUMBER 4, 2012 An experimental investigation on the effect of beam angle optimization on the reduction of beam numbers in IMRT of head and neck tumors

More information

An optimization framework for conformal radiation treatment planning

An optimization framework for conformal radiation treatment planning An optimization framework for conformal radiation treatment planning Jinho Lim Michael C. Ferris Stephen J. Wright David M. Shepard Matthew A. Earl December 2002 Abstract An optimization framework for

More information

Iterative regularization in intensity-modulated radiation therapy optimization. Carlsson, F. and Forsgren, A. Med. Phys. 33 (1), January 2006.

Iterative regularization in intensity-modulated radiation therapy optimization. Carlsson, F. and Forsgren, A. Med. Phys. 33 (1), January 2006. Iterative regularization in intensity-modulated radiation therapy optimization Carlsson, F. and Forsgren, A. Med. Phys. 33 (1), January 2006. 2 / 15 Plan 1 2 3 4 3 / 15 to paper The purpose of the paper

More information

OPTIMIZATION METHODS IN INTENSITY MODULATED RADIATION THERAPY TREATMENT PLANNING

OPTIMIZATION METHODS IN INTENSITY MODULATED RADIATION THERAPY TREATMENT PLANNING OPTIMIZATION METHODS IN INTENSITY MODULATED RADIATION THERAPY TREATMENT PLANNING By DIONNE M. ALEMAN A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT

More information

Creating a Knowledge Based Model using RapidPlan TM : The Henry Ford Experience

Creating a Knowledge Based Model using RapidPlan TM : The Henry Ford Experience DVH Estimates Creating a Knowledge Based Model using RapidPlan TM : The Henry Ford Experience Karen Chin Snyder, MS, DABR AAMD Region V Meeting October 4, 2014 Disclosures The Department of Radiation Oncology

More information

Two Effective Heuristics for Beam Angle Optimization in Radiation Therapy

Two Effective Heuristics for Beam Angle Optimization in Radiation Therapy Two Effective Heuristics for Beam Angle Optimization in Radiation Therapy Hamed Yarmand, David Craft Department of Radiation Oncology Massachusetts General Hospital and Harvard Medical School, Boston,

More information

An Optimisation Model for Intensity Modulated Radiation Therapy

An Optimisation Model for Intensity Modulated Radiation Therapy An Optimisation Model for Intensity Modulated Radiation Therapy Matthias Ehrgott Department of Engineering Science University of Auckland New Zealand m.ehrgott@auckland.ac.nz Abstract Intensity modulated

More information

An Automatic Approach for Satisfying Dose-Volume Constraints in Linear Fluence Map Optimization for IMPT

An Automatic Approach for Satisfying Dose-Volume Constraints in Linear Fluence Map Optimization for IMPT Journal of Cancer Therapy, 2014, 5, 198-207 Published Online February 2014 (http://www.scirp.org/journal/jct) http://dx.doi.org/10.4236/jct.2014.52025 An Automatic Approach for Satisfying Dose-Volume Constraints

More information

High Throughput Computing and Sampling Issues for Optimization in Radiotherapy

High Throughput Computing and Sampling Issues for Optimization in Radiotherapy High Throughput Computing and Sampling Issues for Optimization in Radiotherapy Michael C. Ferris, University of Wisconsin Alexander Meeraus, GAMS Development Corporation Optimization Days, Montreal, May

More information

GPU applications in Cancer Radiation Therapy at UCSD. Steve Jiang, UCSD Radiation Oncology Amit Majumdar, SDSC Dongju (DJ) Choi, SDSC

GPU applications in Cancer Radiation Therapy at UCSD. Steve Jiang, UCSD Radiation Oncology Amit Majumdar, SDSC Dongju (DJ) Choi, SDSC GPU applications in Cancer Radiation Therapy at UCSD Steve Jiang, UCSD Radiation Oncology Amit Majumdar, SDSC Dongju (DJ) Choi, SDSC Conventional Radiotherapy SIMULATION: Construciton, Dij Days PLANNING:

More information

Monaco VMAT. The Next Generation in IMRT/VMAT Planning. Paulo Mathias Customer Support TPS Application

Monaco VMAT. The Next Generation in IMRT/VMAT Planning. Paulo Mathias Customer Support TPS Application Monaco VMAT The Next Generation in IMRT/VMAT Planning Paulo Mathias Customer Support TPS Application 11.05.2011 Background What is Monaco? Advanced IMRT/VMAT treatment planning system from Elekta Software

More information

OPTIMIZATION MODELS FOR RADIATION THERAPY: TREATMENT PLANNING AND PATIENT SCHEDULING

OPTIMIZATION MODELS FOR RADIATION THERAPY: TREATMENT PLANNING AND PATIENT SCHEDULING OPTIMIZATION MODELS FOR RADIATION THERAPY: TREATMENT PLANNING AND PATIENT SCHEDULING By CHUNHUA MEN A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF

More information

How would, or how does, the patient position (chin extended) affect your beam arrangement?

How would, or how does, the patient position (chin extended) affect your beam arrangement? 1 Megan Sullivan Clinical Practicum II Parotid Lab July 29, 2016 PLAN 1: IPSILATERAL WEDGE PAIR TECHNIQUE The ipsilateral wedge pair technique consisted of an anterior oblique field at 45 degrees and a

More information

Photon beam dose distributions in 2D

Photon beam dose distributions in 2D Photon beam dose distributions in 2D Sastry Vedam PhD DABR Introduction to Medical Physics III: Therapy Spring 2014 Acknowledgments! Narayan Sahoo PhD! Richard G Lane (Late) PhD 1 Overview! Evaluation

More information

LINEAR PROGRAMMING FORMULATIONS AND ALGORITHMS FOR RADIOTHERAPY TREATMENT PLANNING

LINEAR PROGRAMMING FORMULATIONS AND ALGORITHMS FOR RADIOTHERAPY TREATMENT PLANNING LINEAR PROGRAMMING FORMULATIONS AND ALGORITHMS FOR RADIOTHERAPY TREATMENT PLANNING ARINBJÖRN ÓLAFSSON AND STEPHEN J. WRIGHT Abstract. Optimization has become an important tool in treatment planning for

More information

A derivative-free multistart framework for an automated noncoplanar beam angle optimization in IMRT

A derivative-free multistart framework for an automated noncoplanar beam angle optimization in IMRT A derivative-free multistart framework for an automated noncoplanar beam angle optimization in IMRT Humberto Rocha and Joana Dias FEUC and Inesc-Coimbra, University of Coimbra, Portugal 5 1 Tiago Ventura

More information

Monaco Concepts and IMRT / VMAT Planning LTAMON0003 / 3.0

Monaco Concepts and IMRT / VMAT Planning LTAMON0003 / 3.0 and IMRT / VMAT Planning LTAMON0003 / 3.0 and Planning Objectives By the end of this presentation you can: Describe the cost functions in Monaco and recognize their application in building a successful

More information

Dose Distributions. Purpose. Isodose distributions. To familiarize the resident with dose distributions and the factors that affect them

Dose Distributions. Purpose. Isodose distributions. To familiarize the resident with dose distributions and the factors that affect them Dose Distributions George Starkschall, Ph.D. Department of Radiation Physics U.T. M.D. Anderson Cancer Center Purpose To familiarize the resident with dose distributions and the factors that affect them

More information

A new quadratic optimization approach to beam angle optimization for fixed-field

A new quadratic optimization approach to beam angle optimization for fixed-field A new quadratic optimization approach to beam angle optimization for fixed-field intensity modulated radiation therapy using compressed sensing Junbo Peng 1, Ailin Wu 2 and Lei Zhu 1,* 1 Department of

More information

Basic Radiation Oncology Physics

Basic Radiation Oncology Physics Basic Radiation Oncology Physics T. Ganesh, Ph.D., DABR Chief Medical Physicist Fortis Memorial Research Institute Gurgaon Acknowledgment: I gratefully acknowledge the IAEA resources of teaching slides

More information

16.410/413 Principles of Autonomy and Decision Making

16.410/413 Principles of Autonomy and Decision Making 16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)

More information

The MSKCC Approach to IMRT. Outline

The MSKCC Approach to IMRT. Outline The MSKCC Approach to IMRT Spiridon V. Spirou, PhD Department of Medical Physics Memorial Sloan-Kettering Cancer Center New York, NY Outline Optimization Field splitting Delivery Independent verification

More information

Hugues Mailleux Medical Physics Department Institut Paoli-Calmettes Marseille France. Sunday 17 July 2016

Hugues Mailleux Medical Physics Department Institut Paoli-Calmettes Marseille France. Sunday 17 July 2016 Hugues Mailleux Medical Physics Department Institut Paoli-Calmettes Marseille France Sunday 17 July 2016 AGENDA 1. Introduction 2. Material 3. Optimization process 4. Results 5. Comments 6. Conclusion

More information

Introduction. Linear because it requires linear functions. Programming as synonymous of planning.

Introduction. Linear because it requires linear functions. Programming as synonymous of planning. LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing

More information

ICARO Vienna April Implementing 3D conformal radiotherapy and IMRT in clinical practice: Recommendations of IAEA- TECDOC-1588

ICARO Vienna April Implementing 3D conformal radiotherapy and IMRT in clinical practice: Recommendations of IAEA- TECDOC-1588 ICARO Vienna April 27-29 2009 Implementing 3D conformal radiotherapy and IMRT in clinical practice: Recommendations of IAEA- TECDOC-1588 M. Saiful Huq, Ph.D., Professor and Director, Dept. of Radiation

More information

Optimization in Brachytherapy. Gary A. Ezzell, Ph.D. Mayo Clinic Scottsdale

Optimization in Brachytherapy. Gary A. Ezzell, Ph.D. Mayo Clinic Scottsdale Optimization in Brachytherapy Gary A. Ezzell, Ph.D. Mayo Clinic Scottsdale Outline General concepts of optimization Classes of optimization techniques Concepts underlying some commonly available methods

More information

Applied Optimization Application to Intensity-Modulated Radiation Therapy (IMRT)

Applied Optimization Application to Intensity-Modulated Radiation Therapy (IMRT) Applied Optimization Application to Intensity-Modulated Radiation Therapy (IMRT) 2009-05-08 Caroline Olsson, M.Sc. Topics History of radiotherapy Developments that has led to IMRT The IMRT process How

More information

Volumetric Modulated Arc Therapy - Clinical Implementation. Outline. Acknowledgement. History of VMAT. IMAT Basics of IMAT

Volumetric Modulated Arc Therapy - Clinical Implementation. Outline. Acknowledgement. History of VMAT. IMAT Basics of IMAT Volumetric Modulated Arc Therapy - Clinical Implementation Daliang Cao, PhD, DABR Swedish Cancer Institute, Seattle, WA Acknowledgement David M. Shepard, Ph.D. Muhammad K. N. Afghan, Ph.D. Fan Chen, Ph.D.

More information

Applied Optimization: Application to Intensity-Modulated Radiation Therapy (IMRT)

Applied Optimization: Application to Intensity-Modulated Radiation Therapy (IMRT) Applied Optimization: Application to Intensity-Modulated Radiation Therapy (IMRT) 2010-05-04 Caroline Olsson, M.Sc. caroline.olsson@vgregion.se Topics History of radiotherapy Developments that has led

More information

Coverage based treatment planning to accommodate organ deformable motions and contouring uncertainties for prostate treatment. Huijun Xu, Ph.D.

Coverage based treatment planning to accommodate organ deformable motions and contouring uncertainties for prostate treatment. Huijun Xu, Ph.D. Coverage based treatment planning to accommodate organ deformable motions and contouring uncertainties for prostate treatment Huijun Xu, Ph.D. Acknowledgement and Disclosure Dr. Jeffrey Siebers Dr. DJ

More information

Some Advanced Topics in Linear Programming

Some Advanced Topics in Linear Programming Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,

More information

REAL-TIME ADAPTIVITY IN HEAD-AND-NECK AND LUNG CANCER RADIOTHERAPY IN A GPU ENVIRONMENT

REAL-TIME ADAPTIVITY IN HEAD-AND-NECK AND LUNG CANCER RADIOTHERAPY IN A GPU ENVIRONMENT REAL-TIME ADAPTIVITY IN HEAD-AND-NECK AND LUNG CANCER RADIOTHERAPY IN A GPU ENVIRONMENT Anand P Santhanam Assistant Professor, Department of Radiation Oncology OUTLINE Adaptive radiotherapy for head and

More information

Optimization with Multiple Objectives

Optimization with Multiple Objectives Optimization with Multiple Objectives Eva K. Lee, Ph.D. eva.lee@isye.gatech.edu Industrial & Systems Engineering, Georgia Institute of Technology Computational Research & Informatics, Radiation Oncology,

More information

Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC - Coimbra

Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC - Coimbra Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC - Coimbra Humberto Rocha Brígida da Costa Ferreira Joana Matos Dias Maria do Carmo Lopes

More information

An Application of the Extended Cutting Angle Method in Radiation Therapy

An Application of the Extended Cutting Angle Method in Radiation Therapy An Application of the Extended Cutting Angle Method in Radiation Therapy by Valentin Koch A THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF Bachelor of Science Honours in The

More information

8/3/2017. Contour Assessment for Quality Assurance and Data Mining. Objective. Outline. Tom Purdie, PhD, MCCPM

8/3/2017. Contour Assessment for Quality Assurance and Data Mining. Objective. Outline. Tom Purdie, PhD, MCCPM Contour Assessment for Quality Assurance and Data Mining Tom Purdie, PhD, MCCPM Objective Understand the state-of-the-art in contour assessment for quality assurance including data mining-based techniques

More information

Title: Toward Truly Optimal IMRT Dose Distribution: Inverse Planning with Voxel- Specific Penalty

Title: Toward Truly Optimal IMRT Dose Distribution: Inverse Planning with Voxel- Specific Penalty Type of the article: Original article Title: Toward Truly Optimal IMRT Dose Distribution: Inverse Planning with Voxel- Specific Penalty Authors: Pavel Lougovski (1), Jordan LeNoach (1), Lei Zhu (1), Yunzhi

More information

Radiotherapy Plan Competition TomoTherapy Planning System. Dmytro Synchuk. Ukrainian Center of TomoTherapy, Kirovograd, Ukraine

Radiotherapy Plan Competition TomoTherapy Planning System. Dmytro Synchuk. Ukrainian Center of TomoTherapy, Kirovograd, Ukraine Radiotherapy Plan Competition 2016 TomoTherapy Planning System Dmytro Synchuk Ukrainian Center of TomoTherapy, Kirovograd, Ukraine Beam Geometry 6MV fan beam 3 jaw options 1.0, 2.5 and 5 cm 64 leaves binary

More information

CHAPTER 9 INFLUENCE OF SMOOTHING ALGORITHMS IN MONTE CARLO DOSE CALCULATIONS OF CYBERKNIFE TREATMENT PLANS: A LUNG PHANTOM STUDY

CHAPTER 9 INFLUENCE OF SMOOTHING ALGORITHMS IN MONTE CARLO DOSE CALCULATIONS OF CYBERKNIFE TREATMENT PLANS: A LUNG PHANTOM STUDY 148 CHAPTER 9 INFLUENCE OF SMOOTHING ALGORITHMS IN MONTE CARLO DOSE CALCULATIONS OF CYBERKNIFE TREATMENT PLANS: A LUNG PHANTOM STUDY 9.1 INTRODUCTION 9.1.1 Dose Calculation Algorithms Dose calculation

More information

Applied Optimization Application to Intensity-Modulated Radiation Therapy (IMRT)

Applied Optimization Application to Intensity-Modulated Radiation Therapy (IMRT) Applied Optimization Application to Intensity-Modulated Radiation Therapy (IMRT) 2008-05-08 Caroline Olsson, M.Sc. Topics Short history of radiotherapy Developments that has led to IMRT The IMRT process

More information

Operations Research and Optimization: A Primer

Operations Research and Optimization: A Primer Operations Research and Optimization: A Primer Ron Rardin, PhD NSF Program Director, Operations Research and Service Enterprise Engineering also Professor of Industrial Engineering, Purdue University Introduction

More information

Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

More information

Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC - Coimbra

Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC - Coimbra Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC - Coimbra Humberto Rocha Joana Matos Dias On the Optimization of Radiation Therapy Planning

More information

VALIDATION OF DIR. Raj Varadhan, PhD, DABMP Minneapolis Radiation Oncology

VALIDATION OF DIR. Raj Varadhan, PhD, DABMP Minneapolis Radiation Oncology VALIDATION OF DIR Raj Varadhan, PhD, DABMP Minneapolis Radiation Oncology Overview Basics: Registration Framework, Theory Discuss Validation techniques Using Synthetic CT data & Phantoms What metrics to

More information

Algorithms for Integer Programming

Algorithms for Integer Programming Algorithms for Integer Programming Laura Galli November 9, 2016 Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is

More information

Dose Calculation and Optimization Algorithms: A Clinical Perspective

Dose Calculation and Optimization Algorithms: A Clinical Perspective Dose Calculation and Optimization Algorithms: A Clinical Perspective Daryl P. Nazareth, PhD Roswell Park Cancer Institute, Buffalo, NY T. Rock Mackie, PhD University of Wisconsin-Madison David Shepard,

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

Robustness Recipes for Proton Therapy

Robustness Recipes for Proton Therapy Robustness Recipes for Proton Therapy Polynomial Chaos Expansion as a tool to construct robustness recipes for proton therapy C.E. ter Haar Delft University of Technology Robustness Recipes for Proton

More information

Integer Programming Theory

Integer Programming Theory Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x

More information

IMRT and VMAT Patient Specific QA Using 2D and 3D Detector Arrays

IMRT and VMAT Patient Specific QA Using 2D and 3D Detector Arrays IMRT and VMAT Patient Specific QA Using 2D and 3D Detector Arrays Sotiri Stathakis Outline Why IMRT/VMAT QA AAPM TG218 UPDATE Tolerance Limits and Methodologies for IMRT Verification QA Common sources

More information

Tomotherapy Physics. Machine Twinning and Quality Assurance. Emilie Soisson, MS

Tomotherapy Physics. Machine Twinning and Quality Assurance. Emilie Soisson, MS Tomotherapy Physics Machine Twinning and Quality Assurance Emilie Soisson, MS Tomotherapy at UW- Madison Treating for nearly 5 years Up to ~45 patients a day on 2 tomo units Units twinned to facilitate

More information

Linear programming II João Carlos Lourenço

Linear programming II João Carlos Lourenço Decision Support Models Linear programming II João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research,

More information

The Simplex Algorithm

The Simplex Algorithm The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly

More information

Integer Programming Chapter 9

Integer Programming Chapter 9 1 Integer Programming Chapter 9 University of Chicago Booth School of Business Kipp Martin October 30, 2017 2 Outline Branch and Bound Theory Branch and Bound Linear Programming Node Selection Strategies

More information

arxiv: v1 [physics.med-ph] 22 Dec 2011

arxiv: v1 [physics.med-ph] 22 Dec 2011 Including Robustness in Multi-criteria Optimization for Intensity Modulated Proton Therapy arxiv:2.5362v [physics.med-ph] 22 Dec 20 Wei Chen, Jan Unkelbach, Alexei Trofimov, Thomas Madden, Hanne Kooy,

More information

An accelerated multistart derivative-free framework for the beam angle optimization problem in IMRT

An accelerated multistart derivative-free framework for the beam angle optimization problem in IMRT An accelerated multistart derivative-free framework for the beam angle optimization problem in IMRT Humberto Rocha 1,2, Joana M. Dias 1,2, Tiago Ventura 3, Brígida C. Ferreira 4, and Maria do Carmo Lopes

More information

arxiv: v3 [physics.med-ph] 6 Dec 2011

arxiv: v3 [physics.med-ph] 6 Dec 2011 Multicriteria VMAT optimization David Craft, Dualta McQuaid, Jeremiah Wala, Wei Chen, Ehsan Salari, Thomas Bortfeld December 5, 2011 arxiv:1105.4109v3 [physics.med-ph] 6 Dec 2011 Abstract Purpose: To make

More information

Lecture on Modeling Tools for Clustering & Regression

Lecture on Modeling Tools for Clustering & Regression Lecture on Modeling Tools for Clustering & Regression CS 590.21 Analysis and Modeling of Brain Networks Department of Computer Science University of Crete Data Clustering Overview Organizing data into

More information

Chapter II. Linear Programming

Chapter II. Linear Programming 1 Chapter II Linear Programming 1. Introduction 2. Simplex Method 3. Duality Theory 4. Optimality Conditions 5. Applications (QP & SLP) 6. Sensitivity Analysis 7. Interior Point Methods 1 INTRODUCTION

More information

Application of polynomial chaos in proton therapy

Application of polynomial chaos in proton therapy Application of polynomial chaos in proton therapy Dose distributions, treatment parameters, robustness recipes & treatment planning Master Thesis S.R. van der Voort June, 215 Supervisors: Dr. Ir. D. Lathouwers

More information

Linear Programming in Small Dimensions

Linear Programming in Small Dimensions Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional

More information

Operations Research Methods for Optimization in Radiation Oncology

Operations Research Methods for Optimization in Radiation Oncology Journal of Radiation Oncology Informatics Operations Research Methods for Optimization in Radiation Oncology Review Article Matthias Ehrgott 1, Allen Holder 2 1 Department of Management Science, Lancaster

More information

6 Randomized rounding of semidefinite programs

6 Randomized rounding of semidefinite programs 6 Randomized rounding of semidefinite programs We now turn to a new tool which gives substantially improved performance guarantees for some problems We now show how nonlinear programming relaxations can

More information

Radiation Therapy Planning by Multicriteria Optimisation

Radiation Therapy Planning by Multicriteria Optimisation Radiation Therapy Planning by Multicriteria Optimisation Matthias Ehrgott, Mena Burjony Deptartment of Engineering Science University of Auckland New Zealand m.ehrgott@auckland.ac.nz Abstract Radiation

More information

Prostate Detection Using Principal Component Analysis

Prostate Detection Using Principal Component Analysis Prostate Detection Using Principal Component Analysis Aamir Virani (avirani@stanford.edu) CS 229 Machine Learning Stanford University 16 December 2005 Introduction During the past two decades, computed

More information

Chapter 7. Linear Programming Models: Graphical and Computer Methods

Chapter 7. Linear Programming Models: Graphical and Computer Methods Chapter 7 Linear Programming Models: Graphical and Computer Methods To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian

More information

Position accuracy analysis of the stereotactic reference defined by the CBCT on Leksell Gamma Knife Icon

Position accuracy analysis of the stereotactic reference defined by the CBCT on Leksell Gamma Knife Icon Position accuracy analysis of the stereotactic reference defined by the CBCT on Leksell Gamma Knife Icon WHITE PAPER Introduction An image guidance system based on Cone Beam CT (CBCT) is included in Leksell

More information

Beam Orientation Optimization for Intensity Modulated Radiation Therapy using Adaptive l 1 Minimization

Beam Orientation Optimization for Intensity Modulated Radiation Therapy using Adaptive l 1 Minimization Beam Orientation Optimization for Intensity Modulated Radiation Therapy using Adaptive l 1 Minimization Xun Jia 1, Chunhua Men 1, Yifei Lou 2, and Steve B. Jiang 1 1 Center for Advanced Radiotherapy Technologies

More information

3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times 3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

More information

Applied Lagrange Duality for Constrained Optimization

Applied Lagrange Duality for Constrained Optimization Applied Lagrange Duality for Constrained Optimization Robert M. Freund February 10, 2004 c 2004 Massachusetts Institute of Technology. 1 1 Overview The Practical Importance of Duality Review of Convexity

More information

Hashing. Hashing Procedures

Hashing. Hashing Procedures Hashing Hashing Procedures Let us denote the set of all possible key values (i.e., the universe of keys) used in a dictionary application by U. Suppose an application requires a dictionary in which elements

More information

An examination of Benders decomposition approaches in large-scale healthcare optimization problems. Curtiss Luong

An examination of Benders decomposition approaches in large-scale healthcare optimization problems. Curtiss Luong An examination of Benders decomposition approaches in large-scale healthcare optimization problems by Curtiss Luong A thesis submitted in conformity with the requirements for the degree of Master of Applied

More information

Mathematical Optimization in Radiotherapy Treatment Planning

Mathematical Optimization in Radiotherapy Treatment Planning 1 / 35 Mathematical Optimization in Radiotherapy Treatment Planning Ehsan Salari Department of Radiation Oncology Massachusetts General Hospital and Harvard Medical School HST S14 May 13, 2013 2 / 35 Outline

More information

SHAPE, SPACE & MEASURE

SHAPE, SPACE & MEASURE STAGE 1 Know the place value headings up to millions Recall primes to 19 Know the first 12 square numbers Know the Roman numerals I, V, X, L, C, D, M Know the % symbol Know percentage and decimal equivalents

More information

An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy

An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy Chenyang Xu 1, Siemens Corporate Research, Inc., Princeton, NJ, USA Xiaolei Huang,

More information

Incorporating deliverable monitor unit constraints into spot intensity. optimization in IMPT treatment planning

Incorporating deliverable monitor unit constraints into spot intensity. optimization in IMPT treatment planning Incorporating deliverable monitor unit constraints into spot intensity optimization in IMPT treatment planning Wenhua Cao, Gino Lim Department of Industrial Engineering, University of Houston, Houston,

More information

Math 340 Fall 2014, Victor Matveev. Binary system, round-off errors, loss of significance, and double precision accuracy.

Math 340 Fall 2014, Victor Matveev. Binary system, round-off errors, loss of significance, and double precision accuracy. Math 340 Fall 2014, Victor Matveev Binary system, round-off errors, loss of significance, and double precision accuracy. 1. Bits and the binary number system A bit is one digit in a binary representation

More information

CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension

CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture

More information

Robust PDF Table Locator

Robust PDF Table Locator Robust PDF Table Locator December 17, 2016 1 Introduction Data scientists rely on an abundance of tabular data stored in easy-to-machine-read formats like.csv files. Unfortunately, most government records

More information

Design and performance characteristics of a Cone Beam CT system for Leksell Gamma Knife Icon

Design and performance characteristics of a Cone Beam CT system for Leksell Gamma Knife Icon Design and performance characteristics of a Cone Beam CT system for Leksell Gamma Knife Icon WHITE PAPER Introduction Introducing an image guidance system based on Cone Beam CT (CBCT) and a mask immobilization

More information

Part 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm

Part 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm In the name of God Part 4. 4.1. Dantzig-Wolf Decomposition Algorithm Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction Real world linear programs having thousands of rows and columns.

More information

Cutting Planes by Projecting Interior Points onto Polytope Facets

Cutting Planes by Projecting Interior Points onto Polytope Facets Cutting Planes by Projecting Interior Points onto Polytope Facets Daniel Porumbel CEDRIC CS Lab, CNAM, 292 rue Saint-Martin, F-75141 Paris, France daniel.porumbel@cnam.fr Abstract Given a point x inside

More information

Basics of treatment planning II

Basics of treatment planning II Basics of treatment planning II Sastry Vedam PhD DABR Introduction to Medical Physics III: Therapy Spring 2015 Dose calculation algorithms! Correction based! Model based 1 Dose calculation algorithms!

More information

Prentice Hall Mathematics: Course Correlated to: Colorado Model Content Standards and Grade Level Expectations (Grade 6)

Prentice Hall Mathematics: Course Correlated to: Colorado Model Content Standards and Grade Level Expectations (Grade 6) Colorado Model Content Standards and Grade Level Expectations (Grade 6) Standard 1: Students develop number sense and use numbers and number relationships in problemsolving situations and communicate the

More information

Electron Dose Kernels (EDK) for Secondary Particle Transport in Deterministic Simulations

Electron Dose Kernels (EDK) for Secondary Particle Transport in Deterministic Simulations Electron Dose Kernels (EDK) for Secondary Particle Transport in Deterministic Simulations A. Al-Basheer, G. Sjoden, M. Ghita Computational Medical Physics Team Nuclear & Radiological Engineering University

More information

Learning-based Neuroimage Registration

Learning-based Neuroimage Registration Learning-based Neuroimage Registration Leonid Teverovskiy and Yanxi Liu 1 October 2004 CMU-CALD-04-108, CMU-RI-TR-04-59 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Abstract

More information

BCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.

BCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D. Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method

More information

Downloaded from

Downloaded from UNIT 2 WHAT IS STATISTICS? Researchers deal with a large amount of data and have to draw dependable conclusions on the basis of data collected for the purpose. Statistics help the researchers in making

More information

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization

More information

SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING

SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING Bulletin of Mathematics Vol. 06, No. 0 (20), pp.. SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING Eddy Roflin, Sisca Octarina, Putra B. J Bangun,

More information

A SYSTEM OF DOSIMETRIC CALCULATIONS

A SYSTEM OF DOSIMETRIC CALCULATIONS A SYSTEM OF DOSIMETRIC CALCULATIONS INTRODUCTION Dose calculation based on PDD and TAR have Limitations The dependence of PDD on SSD Not suitable for isocentric techniques TAR and SAR does not depend on

More information