Single-arc dose painting for precision radiation therapy

a radiation therapy and single-arc technology, applied in the field of radiation oncology for malignant tumors, can solve the problems of labor-intensiveness, compromising the efficiency of treatment, and inefficient treatment delivery,

Active Publication Date: 2018-07-17
UNIV OF MARYLAND BALTIMORE +2
View PDF341 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, because the ionizing radiation that is administered is damaging to both healthy and malignant tissue, it is important to confine the effect of the irradiation to the target tissue, to the extent possible, while sparing the adjacent tissue by minimizing irradiation thereto.
Although the quality of IMRT treatment plans has steadily improved, the plans tend to be relatively complicated, which makes for a somewhat inefficient delivery of treatment.
Consequently, labor-intensiveness has been one of the drawbacks of IMRT.
Furthermore, in general, a large number of different complex field shapes is often needed, which also compromises the efficiency of the treatment and can result in an increased number of collimator artifacts (7).
Nevertheless, while long-term clinical results of IMRT treatments are still limited, initial results appear very promising, and with increased use of IMRT, more encouraging results are emerging.
However, IMAT has not been widely adopted for clinical use.
This limitation can significantly affect the quality of the treatment plans because the most preferred angle might be completely missed.
As a result, the final IMAT plan is almost always degraded from the unconstrained optimized plan.
Using such methods, it is prohibitive with today's technology to optimize the rotational delivery with more beam angles, because pencil beams must be calculated for all the beam angles (8-9).
For simple cases it was demonstrated that a single optimized arc can yield results as good as those of fixed-field IMRT, while, for more complicated cases, such as head and neck cases with multiple targets, such an approach would not work well, and intensity modulation is required (8).
Although allowing the planned dose rate to vary with gantry angle provides a new degree of freedom, such relaxation of a restraint is not sufficient in itself to establish that a single arc using the described optimization method can replace multiple-arc IMAT.
However, although the optimization starts with a limited number of fields and the connectedness of the field shapes can be ignored, as the optimization progresses, constraint to force the shape-connectedness will compromise the quality of he treatment plans.
More specifically, the prior art is deficient in methods and systems for single-arc dose radiation therapy.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Single-arc dose painting for precision radiation therapy
  • Single-arc dose painting for precision radiation therapy
  • Single-arc dose painting for precision radiation therapy

Examples

Experimental program
Comparison scheme
Effect test

example 1

Constrained Coupled Path Planning (CCPP)

[0054]In constrained coupled path planning, the starting and ending points of the sought paths are prespecified. Precisely, the constrained coupled path planning (CCPP) problem is: Given an n×H uniform grid Rg, a non-negative function ƒ defined on the integers in {1, 2, . . . , n}, and positive integers lstart, rstart, lend, rend, c, and Δ (Δ≤H), find two noncrossing paths pl and pr of height H along the edges of Rg to minimize the total error ϵ(pl, pr) Δ=Σni+1|li,pl,pr−f(i)|, subject to the following constraints: (1) pl (resp., pr) starts at (lstart, 0) (resp., (rstart, 0)) and ends at (lend, H) (resp., (rend,H)), (2) (the steepness constraint) both pl and pr are c-steep paths, and (3) (the closeness constraint) |li,pl,pr−f(i)|≤Δ for all i=1, 2, . . . , n.

[0055]Without loss of generality, it is assumed that lstart≤lend and rstart≤rend, so that the two sought paths pl and pr are both xy-monotone increasing paths. Otherwise, the CCPP problem ca...

example 2

Computing the Complete Set of all CCPP Problem Instances

[0060]Overview of the Algorithm

[0061]Given f, n, H, Δ, and c, CCPP problem instances are solved on f, n, H, Δ, c, lstart, rstart, lend, and rend for all possible combinations of lstart, rstart, lend, and rend. Without loss of generality, only those combinations which satisfy lstart≤lend and rstart≤rend are considered. All problem instances are classified into two subsets S1 and S2, with S1 (resp., S2) containing those with lend≥rstart (resp., lendstart).

[0062]Solving all CCPP Instances in S1

[0063]It is to be noted that this approach can be adapted easily to solve all instances in S2. Since 0≤lstart≤rstart≤lend≤rend≤n, there are totally N=Θ(n4) problem instances, denoted by l1, l2, . . . , lN. Let l(k)start, r(k)start, l(k)end, and r(k)end be the corresponding specification for the problem instance lk. An instance lk (1≤k≤N) corresponds to a shortest path problem on a vertex-weighted DAG, denoted by G′k, of O(nHΔ) vertices and ...

example 3

Unconstrained Intensity Optimization in Single-arc Dose Painting

[0083]The first planning step for single arc dose painting is unconstrained intensity optimization. Different algorithms can be used for achieving this step (11-13). Suitable algorithms are available in the relevant literature (8,10). As with IMAT, an arc is approximated with multiple fixed radiation beams evenly spaced every 5-10 degrees (5).

EXAMPLE 4

Leaf-sequencing in Single-arc Dose Painting

[0084]Step two in single-arc dose painting is the conversion of the optimized beam intensities into connected field apertures. The goal is to find a set of connected field shapes that when delivered dynamically based on linear interpolation between the apertures, will result in minimum discrepancy to the optimized intensity profile. For leaf sequencing, a hybrid approach has been developed. For simple cases the method called line segment approximation on component intensity profiles is appropriate. For more complicated cases, leaf...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

Provided herein are methods and systems for designing a radiation treatment for a subject using single arc dose painting. The methods and systems comprise an algorithm or a computer-readable product having the same, to plan the radiation treatment. The algorithm converts pairs of multiple leaf collimation (MLC) leaves to sets of leaf aperture sequences that form a shortest path single arc thereof where the pairs of MLC leaves each aligned to an intensity profile of densely-spaced radiation beams, and connects each single arc of leaf apertures to form a final treatment single arc. Also provided is a method for irradiating a tumor in a subject using single arc dose painting.

Description

FEDERAL FUNDING LEGEND[0001]This work was supported by National Science Foundation Grant No. CCF-0515203 and by National Institutes of Health Grant No. CA117997. The U.S. Government has certain rights in this invention.CROSS-REFERENCE TO RELATED APPLICATIONS[0002]This U.S. national application claims benefit of priority under 35 U.S.C. §120 of international application PCT / US2008 / 005028, filed Apr. 18, 2008 which claims benefit of priority under 35 U.S.C. § 119(e) of provisional application U.S. Ser. No. 61 / 913,175, filed Apr. 20, 2007, now abandoned.CROSS-REFERENCE TO RELATED APPLICATIONS[0003]This U.S. national application claims benefit of priority under 35 U.S.C. § 120 of international application PCT / US2008 / 005028, filed Apr. 18, 2008 which claims benefit of priority under 35 U.S.C. § 119(e) of provisional application U.S. Ser. No. 60 / 913,175, filed Apr. 20, 2007, now abandoned.BACKGROUND OF THE INVENTION[0004]1. Field of the Invention[0005]The present invention relates to the ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(United States)
IPC IPC(8): A61N5/10G21K1/02H05G1/42
CPCA61N5/103A61N5/1047A61N5/1036G21K1/046
Inventor YU, CEDRIC X.LUAN, SHUANGCHEN, DANNY Z.EARL, MATTHEW A.WANG, CHAO
Owner UNIV OF MARYLAND BALTIMORE
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products