Shuang Luan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shuang Luan has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Chao Wang
University of Notre Dame
3 shared publications - Danny Z. Chen
University of Notre Dame
2 shared publications - Xiaobo Sharon Hu
University of Notre Dame, Notre Dame, IN, USA
2 shared publications - Baruch Schieber
IBM T.J. Watson Research Center
1 shared publication Cedric X. Yu
Department of Radiation Oncology, University of Maryland School of Medicine, Baltimore, Maryland 21201
1 shared publication- Cedric X. Yu
Department of Radiation Oncology, University of Maryland School of Medicine, Baltimore, Maryland 21201
1 shared publication
Latest Publications
- 12 September 2009
- Published by Springer Nature in Algorithmica
- Vol. 60 (1) , 152-174
Coupled Path Planning, Region Optimization, and Applications in Intensity-modulated Radiation Therapy
- 12 September 2009
- Published by Springer Nature in Algorithmica
- Vol. 60 (1) , 152-174
Coupled Path Planning, Region Optimization, and Applications in Intensity-modulated Radiation Therapy
- Open Access
Improved Approximation Algorithms for Segment Minimization in Intensity Modulated Radiation Therapy
he segment minimization problem consists of finding the smallest set of integer matrices that sum to a given intensity matrix, such that each summand has only one non-zero value, and the non-zeroes in each row are consecutive. This has direct applications in intensity-modulated radiation therapy, an effective form of cancer treatment. We develop three approximation algorithms for matrices with arbitrarily many rows. Our first two algorithms improve the approximation factor from the previous best of $1+\log_2 h $ to (roughly) $3/2 \cdot (1+\log_3 h)$ and $11/6\cdot(1+\log_4{h})$, respectively, where $h$ is the largest entry in the intensity matrix. We illustrate the limitations of the specific approach used to obtain these two algorithms by proving a lower bound of $\frac{(2b-2)}{b}\cdot\log_b{h} + \frac{1}{b}$ on the approximation guarantee. Our third algorithm improves the approximation factor from $2 \cdot (\log D+1)$ to $24/13 \cdot (\log D+1)$, where $D$ is (roughly) the largest difference between consecutive elements of a row of the intensity matrix. Finally, experimentation with these algorithms shows that they perform well with respect to the optimum and outperform other approximation algorithms on 77% of the 122 test cases we consider, which include both real world and synthetic data.Open AccessImproved Approximation Algorithms for Segment Minimization in Intensity Modulated Radiation Therapy
he segment minimization problem consists of finding the smallest set of integer matrices that sum to a given intensity matrix, such that each summand has only one non-zero value, and the non-zeroes in each row are consecutive. This has direct applications in intensity-modulated radiation therapy, an effective form of cancer treatment. We develop three approximation algorithms for matrices with arbitrarily many rows. Our first two algorithms improve the approximation factor from the previous best of $1+\log_2 h $ to (roughly) $3/2 \cdot (1+\log_3 h)$ and $11/6\cdot(1+\log_4{h})$, respectively, where $h$ is the largest entry in the intensity matrix. We illustrate the limitations of the specific approach used to obtain these two algorithms by proving a lower bound of $\frac{(2b-2)}{b}\cdot\log_b{h} + \frac{1}{b}$ on the approximation guarantee. Our third algorithm improves the approximation factor from $2 \cdot (\log D+1)$ to $24/13 \cdot (\log D+1)$, where $D$ is (roughly) the largest difference between consecutive elements of a row of the intensity matrix. Finally, experimentation with these algorithms shows that they perform well with respect to the optimum and outperform other approximation algorithms on 77% of the 122 test cases we consider, which include both real world and synthetic data. - 29 August 2009
- Published by Springer Nature in Algorithmica
- Vol. 60 (2) , 421-450
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy
- 29 August 2009
- Published by Springer Nature in Algorithmica
- Vol. 60 (2) , 421-450
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy
- 19 February 2009
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 54 (6) , 1579-1591
Dynamic gamma knife radiosurgery
Gamma knife has been the treatment of choice for various brain tumors and functional disorders. Current gamma knife radiosurgery is planned in a ‘ball-packing’ approach and delivered in a ‘step-and-shoot’ manner, i.e. it aims to ‘pack’ the different sized spherical high-dose volumes (called ‘shots’) into a tumor volume. We have developed a dynamic scheme for gamma knife radiosurgery based on the concept of ‘dose-painting’ to take advantage of the new robotic patient positioning system on the latest Gamma Knife C™ and Perfexion™ units. In our scheme, the spherical high dose volume created by the gamma knife unit will be viewed as a 3D spherical ‘paintbrush’, and treatment planning reduces to finding the best route of this ‘paintbrush’ to ‘paint’ a 3D tumor volume. Under our dose-painting concept, gamma knife radiosurgery becomes dynamic, where the patient moves continuously under the robotic positioning system. We have implemented a fully automatic dynamic gamma knife radiosurgery treatment planning system, where the inverse planning problem is solved as a traveling salesman problem combined with constrained least-square optimizations. We have also carried out experimental studies of dynamic gamma knife radiosurgery and showed the following. (1) Dynamic gamma knife radiosurgery is ideally suited for fully automatic inverse planning, where high quality radiosurgery plans can be obtained in minutes of computation. (2) Dynamic radiosurgery plans are more conformal than step-and-shoot plans and can maintain a steep dose gradient (around 13% per mm) between the target tumor volume and the surrounding critical structures. (3) It is possible to prescribe multiple isodose lines with dynamic gamma knife radiosurgery, so that the treatment can cover the periphery of the target volume while escalating the dose for high tumor burden regions. (4) With dynamic gamma knife radiosurgery, one can obtain a family of plans representing a tradeoff between the delivery time and the dose distributions, thus giving the clinician one more dimension of flexibility of choosing a plan based on the clinical situations.
- 19 February 2009
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 54 (6) , 1579-1591
Dynamic gamma knife radiosurgery
Gamma knife has been the treatment of choice for various brain tumors and functional disorders. Current gamma knife radiosurgery is planned in a ‘ball-packing’ approach and delivered in a ‘step-and-shoot’ manner, i.e. it aims to ‘pack’ the different sized spherical high-dose volumes (called ‘shots’) into a tumor volume. We have developed a dynamic scheme for gamma knife radiosurgery based on the concept of ‘dose-painting’ to take advantage of the new robotic patient positioning system on the latest Gamma Knife C™ and Perfexion™ units. In our scheme, the spherical high dose volume created by the gamma knife unit will be viewed as a 3D spherical ‘paintbrush’, and treatment planning reduces to finding the best route of this ‘paintbrush’ to ‘paint’ a 3D tumor volume. Under our dose-painting concept, gamma knife radiosurgery becomes dynamic, where the patient moves continuously under the robotic positioning system. We have implemented a fully automatic dynamic gamma knife radiosurgery treatment planning system, where the inverse planning problem is solved as a traveling salesman problem combined with constrained least-square optimizations. We have also carried out experimental studies of dynamic gamma knife radiosurgery and showed the following. (1) Dynamic gamma knife radiosurgery is ideally suited for fully automatic inverse planning, where high quality radiosurgery plans can be obtained in minutes of computation. (2) Dynamic radiosurgery plans are more conformal than step-and-shoot plans and can maintain a steep dose gradient (around 13% per mm) between the target tumor volume and the surrounding critical structures. (3) It is possible to prescribe multiple isodose lines with dynamic gamma knife radiosurgery, so that the treatment can cover the periphery of the target volume while escalating the dose for high tumor burden regions. (4) With dynamic gamma knife radiosurgery, one can obtain a family of plans representing a tradeoff between the delivery time and the dose distributions, thus giving the clinician one more dimension of flexibility of choosing a plan based on the clinical situations.
- 13 December 2007
- Published by Wiley in Medical Physics
- Vol. 35 (1) , 61-69
Leaf‐sequencing for intensity‐modulated arc therapy using graph algorithms
Intensity‐modulated arc therapy (IMAT) is a rotational IMRT technique. It uses a set of overlapping or nonoverlapping arcs to create a prescribed dose distribution. Despite its numerous advantages, IMAT has not gained widespread clinical applications. This is mainly due to the lack of an effective IMAT leaf‐sequencing algorithm that can convert the optimized intensity patterns for all beam directions into IMAT treatment arcs. To address this problem, we have developed an IMAT leaf‐sequencing algorithm and software using graph algorithms in computer science. The input to our leaf‐sequencing software includes (1) a set of (continuous) intensity patterns optimized by a treatment planning system at a sequence of equally spaced beam angles (typically 10° apart), (2) a maximum leaf motion constraint, and (3) the number of desired arcs, . The output is a set of treatment arcs that best approximates the set of optimized intensity patterns at all beam angles with guaranteed smooth delivery without violating the maximum leaf motion constraint. The new algorithm consists of the following key steps. First, the optimized intensity patterns are segmented into intensity profiles that are aligned with individual MLC leaf pairs. Then each intensity profile is segmented into MLC leaf openings using a ‐link shortest path algorithm. The leaf openings for all beam angles are subsequently connected together to form 1D IMAT arcs under the maximum leaf motion constraint using a shortest path algorithm. Finally, the 1D IMAT arcs are combined to form IMAT treatment arcs of MLC apertures. The performance of the implemented leaf‐sequencing software has been tested for four treatment sites (prostate, breast, head and neck, and lung). In all cases, our leaf‐sequencing algorithm produces efficient and highly conformal IMAT plans that rival their counterpart, the tomotherapy plans, and significantly improve the IMRT plans. Algorithm execution times ranging from a few seconds to are observed on a laptop computer equipped with a Pentium M processor.
- 13 December 2007
- Published by Wiley in Medical Physics
- Vol. 35 (1) , 61-69
Leaf‐sequencing for intensity‐modulated arc therapy using graph algorithms
Intensity‐modulated arc therapy (IMAT) is a rotational IMRT technique. It uses a set of overlapping or nonoverlapping arcs to create a prescribed dose distribution. Despite its numerous advantages, IMAT has not gained widespread clinical applications. This is mainly due to the lack of an effective IMAT leaf‐sequencing algorithm that can convert the optimized intensity patterns for all beam directions into IMAT treatment arcs. To address this problem, we have developed an IMAT leaf‐sequencing algorithm and software using graph algorithms in computer science. The input to our leaf‐sequencing software includes (1) a set of (continuous) intensity patterns optimized by a treatment planning system at a sequence of equally spaced beam angles (typically 10° apart), (2) a maximum leaf motion constraint, and (3) the number of desired arcs, . The output is a set of treatment arcs that best approximates the set of optimized intensity patterns at all beam angles with guaranteed smooth delivery without violating the maximum leaf motion constraint. The new algorithm consists of the following key steps. First, the optimized intensity patterns are segmented into intensity profiles that are aligned with individual MLC leaf pairs. Then each intensity profile is segmented into MLC leaf openings using a ‐link shortest path algorithm. The leaf openings for all beam angles are subsequently connected together to form 1D IMAT arcs under the maximum leaf motion constraint using a shortest path algorithm. Finally, the 1D IMAT arcs are combined to form IMAT treatment arcs of MLC apertures. The performance of the implemented leaf‐sequencing software has been tested for four treatment sites (prostate, breast, head and neck, and lung). In all cases, our leaf‐sequencing algorithm produces efficient and highly conformal IMAT plans that rival their counterpart, the tomotherapy plans, and significantly improve the IMRT plans. Algorithm execution times ranging from a few seconds to are observed on a laptop computer equipped with a Pentium M processor.
- 12 April 2006
- Published by Wiley in Medical Physics
- Vol. 33 (5) , 1199-1212
An improved MLC segmentation algorithm and software for step‐and‐shoot IMRT delivery without tongue‐and‐groove error
We present an improved multileaf collimator (MLC) segmentation algorithm, denoted by (static leaf sequencing with no tongue‐and‐groove error), for step‐and‐shoot intensity‐modulated radiation therapy (IMRT) delivery. is an improvement over the MLC segmentation algorithm called SLS that was developed by Luan et al. [Med. Phys. 31(4), 695–707 (2004)], which did not consider tongue‐and‐groove error corrections. The aims of are (1) shortening the treatment times of IMRT plans by minimizing their numbers of segments and (2) minimizing the tongue‐and‐groove errors of the computed IMRT plans. The input to is intensity maps (IMs) produced by current planning systems, and its output is (modified) optimized leaf sequences without tongue‐and‐groove error. Like the previous SLS algorithm [Luan et al., Med. Phys. 31(4), 695–707 (2004)], is also based on graph algorithmic techniques in computer science. It models the MLC segmentation problem as a weighted minimum‐cost path problem, where the weight of the path is the number of segments and the cost of the path is the amount of tongue‐and‐groove error. Our comparisons of with CORVUS indicated that for the same intensity maps, the numbers of segments computed by are up to 50% less than those by CORVUS 5.0 on the Elekta LINAC system. Our clinical verifications have shown that the dose distributions of the plans do not have tongue‐and‐groove error and match those of the corresponding CORVUS plans, thus confirming the correctness of . Comparing with existing segmentation methods, also has two additional advantages: (1) can compute leaf sequences whose tongue‐and‐groove error is minimized subject to a constraint on the maximum allowed number of segments, which may be desirable in clinical situations where a treatment with the complete correction of tongue‐and‐groove error takes too much time, and (2) can be used to minimize a more general type of error called the tongue‐or‐groove error.
- 12 April 2006
- Published by Wiley in Medical Physics
- Vol. 33 (5) , 1199-1212
An improved MLC segmentation algorithm and software for step‐and‐shoot IMRT delivery without tongue‐and‐groove error
We present an improved multileaf collimator (MLC) segmentation algorithm, denoted by (static leaf sequencing with no tongue‐and‐groove error), for step‐and‐shoot intensity‐modulated radiation therapy (IMRT) delivery. is an improvement over the MLC segmentation algorithm called SLS that was developed by Luan et al. [Med. Phys. 31(4), 695–707 (2004)], which did not consider tongue‐and‐groove error corrections. The aims of are (1) shortening the treatment times of IMRT plans by minimizing their numbers of segments and (2) minimizing the tongue‐and‐groove errors of the computed IMRT plans. The input to is intensity maps (IMs) produced by current planning systems, and its output is (modified) optimized leaf sequences without tongue‐and‐groove error. Like the previous SLS algorithm [Luan et al., Med. Phys. 31(4), 695–707 (2004)], is also based on graph algorithmic techniques in computer science. It models the MLC segmentation problem as a weighted minimum‐cost path problem, where the weight of the path is the number of segments and the cost of the path is the amount of tongue‐and‐groove error. Our comparisons of with CORVUS indicated that for the same intensity maps, the numbers of segments computed by are up to 50% less than those by CORVUS 5.0 on the Elekta LINAC system. Our clinical verifications have shown that the dose distributions of the plans do not have tongue‐and‐groove error and match those of the corresponding CORVUS plans, thus confirming the correctness of . Comparing with existing segmentation methods, also has two additional advantages: (1) can compute leaf sequences whose tongue‐and‐groove error is minimized subject to a constraint on the maximum allowed number of segments, which may be desirable in clinical situations where a treatment with the complete correction of tongue‐and‐groove error takes too much time, and (2) can be used to minimize a more general type of error called the tongue‐or‐groove error.
- 13 March 2006
- Published by Wiley in Medical Physics
- Vol. 33 (4) , 859-867
Continuous intensity map optimization (CIMO): A novel approach to leaf sequencing in step and shoot IMRT
A new leaf-sequencing approach has been developed that is designed to reduce the number of required beam segments for step-and-shoot intensity modulated radiation therapy (IMRT). This approach to leaf sequencing is called continuous-intensity-map-optimization (CIMO). Using a simulated annealing algorithm, CIMO seeks to minimize differences between the optimized and sequenced intensity maps. Two distinguishing features of the CIMO algorithm are (1) CIMO does not require that each optimized intensity map be clustered into discrete levels and (2) CIMO is not rule-based but rather simultaneously optimizes both the aperture shapes and weights. To test the CIMO algorithm, ten IMRT patient cases were selected (four head-and-neck, two pancreas, two prostate, one brain, and one pelvis). For each case, the optimized intensity maps were extracted from the Pinnacle3 treatment planning system. The CIMO algorithm was applied, and the optimized aperture shapes and weights were loaded back into Pinnacle. A final dose calculation was performed using Pinnacle's convolution/superposition based dose calculation. On average, the CIMO algorithm provided a 54% reduction in the number of beam segments as compared with Pinnacle's leaf sequencer. The plans sequenced using the CIMO algorithm also provided improved target dose uniformity and a reduced discrepancy between the optimized and sequenced intensity maps. For ten clinical intensity maps, comparisons were performed between the CIMO algorithm and the power-of-two reduction algorithm of Xia and Verhey [Med. Phys. 25(8), 1424-1434 (1998)]. When the constraints of a Varian Millennium multileaf collimator were applied, the CIMO algorithm resulted in a 26% reduction in the number of segments. For an Elekta multileaf collimator, the CIMO algorithm resulted in a 67% reduction in the number of segments. An average leaf sequencing time of less than one minute per beam was observed.
- 13 March 2006
- Published by Wiley in Medical Physics
- Vol. 33 (4) , 859-867
Continuous intensity map optimization (CIMO): A novel approach to leaf sequencing in step and shoot IMRT
A new leaf-sequencing approach has been developed that is designed to reduce the number of required beam segments for step-and-shoot intensity modulated radiation therapy (IMRT). This approach to leaf sequencing is called continuous-intensity-map-optimization (CIMO). Using a simulated annealing algorithm, CIMO seeks to minimize differences between the optimized and sequenced intensity maps. Two distinguishing features of the CIMO algorithm are (1) CIMO does not require that each optimized intensity map be clustered into discrete levels and (2) CIMO is not rule-based but rather simultaneously optimizes both the aperture shapes and weights. To test the CIMO algorithm, ten IMRT patient cases were selected (four head-and-neck, two pancreas, two prostate, one brain, and one pelvis). For each case, the optimized intensity maps were extracted from the Pinnacle3 treatment planning system. The CIMO algorithm was applied, and the optimized aperture shapes and weights were loaded back into Pinnacle. A final dose calculation was performed using Pinnacle's convolution/superposition based dose calculation. On average, the CIMO algorithm provided a 54% reduction in the number of beam segments as compared with Pinnacle's leaf sequencer. The plans sequenced using the CIMO algorithm also provided improved target dose uniformity and a reduced discrepancy between the optimized and sequenced intensity maps. For ten clinical intensity maps, comparisons were performed between the CIMO algorithm and the power-of-two reduction algorithm of Xia and Verhey [Med. Phys. 25(8), 1424-1434 (1998)]. When the constraints of a Varian Millennium multileaf collimator were applied, the CIMO algorithm resulted in a 26% reduction in the number of segments. For an Elekta multileaf collimator, the CIMO algorithm resulted in a 67% reduction in the number of segments. An average leaf sequencing time of less than one minute per beam was observed.