Robert R. Meyer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Robert R. Meyer has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Leyuan Shi
University of Wisconsin-Madison
3 shared publications - Athula Gunawardena
University of Wisconsin-Whitewater, Whitewater, USA
2 shared publications - Hao H Zhang
Department of Radiation Oncology, University of Maryland School of Medicine, Baltimore, MD, USA
2 shared publications - Warren D. D'Souza
Department of Radiation Oncology, University of Maryland School of Medicine, Baltimore, MD
2 shared publications - Andrew J. Miller
University of Wisconsin
1 shared publication Armand Zakarian
University of Wisconsin-Madison
1 shared publication
Latest Publications
- 12 April 2022
- Published by Springer Nature in SN Computer Science
- Vol. 3 (3) , 1-16
Interest-Aligned System for College Degree Planning and Career Path Selection
- 12 April 2022
- Published by Springer Nature in SN Computer Science
- Vol. 3 (3) , 1-16
Interest-Aligned System for College Degree Planning and Career Path Selection
- 12 March 2010
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 55 (7) , 1935-1947
The minimum knowledge base for predicting organ-at-risk dose–volume levels and plan-related complications in IMRT planning
IMRT treatment planning requires consideration of two competing objectives: achieving the required amount of radiation for the planning target volume and minimizing the amount of radiation delivered to all other tissues. It is important for planners to understand the tradeoff between competing factors so that the time-consuming human interaction loop (plan-evaluate-modify) can be eliminated. Treatment-plan-surface models have been proposed as a decision support tool to aid treatment planners and clinicians in choosing between rival treatment plans in a multi-plan environment. In this paper, an empirical approach is introduced to determine the minimum number of treatment plans (minimum knowledge base) required to build accurate representations of the IMRT plan surface in order to predict organ-at-risk (OAR) dose-volume (DV) levels and complications as a function of input DV constraint settings corresponding to all involved OARs in the plan. We have tested our approach on five head and neck patients and five whole pelvis/prostate patients. Our results suggest that approximately 30 plans were sufficient to predict DV levels with less than 3% relative error in both head and neck and whole pelvis/prostate cases. In addition, approximately 30-60 plans were sufficient to predict saliva flow rate with less than 2% relative error and to classify rectal bleeding with an accuracy of 90%.
- 12 March 2010
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 55 (7) , 1935-1947
The minimum knowledge base for predicting organ-at-risk dose–volume levels and plan-related complications in IMRT planning
IMRT treatment planning requires consideration of two competing objectives: achieving the required amount of radiation for the planning target volume and minimizing the amount of radiation delivered to all other tissues. It is important for planners to understand the tradeoff between competing factors so that the time-consuming human interaction loop (plan-evaluate-modify) can be eliminated. Treatment-plan-surface models have been proposed as a decision support tool to aid treatment planners and clinicians in choosing between rival treatment plans in a multi-plan environment. In this paper, an empirical approach is introduced to determine the minimum number of treatment plans (minimum knowledge base) required to build accurate representations of the IMRT plan surface in order to predict organ-at-risk (OAR) dose-volume (DV) levels and complications as a function of input DV constraint settings corresponding to all involved OARs in the plan. We have tested our approach on five head and neck patients and five whole pelvis/prostate patients. Our results suggest that approximately 30 plans were sufficient to predict DV levels with less than 3% relative error in both head and neck and whole pelvis/prostate cases. In addition, approximately 30-60 plans were sufficient to predict saliva flow rate with less than 2% relative error and to classify rectal bleeding with an accuracy of 90%.
- 14 January 2010
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 55 (3) , 883-902
A two-stage sequential linear programming approach to IMRT dose optimization
The conventional IMRT planning process involves two stages in which the first stage consists of fast but approximate idealized pencil beam dose calculations and dose optimization and the second stage consists of discretization of the intensity maps followed by intensity map segmentation and a more accurate final dose calculation corresponding to physical beam apertures. Consequently, there can be differences between the presumed dose distribution corresponding to pencil beam calculations and optimization and a more accurately computed dose distribution corresponding to beam segments that takes into account collimator-specific effects. IMRT optimization is computationally expensive and has therefore led to the use of heuristic (e.g., simulated annealing and genetic algorithms) approaches that do not encompass a global view of the solution space. We modify the traditional two-stage IMRT optimization process by augmenting the second stage via an accurate Monte Carlo-based kernel-superposition dose calculations corresponding to beam apertures combined with an exact mathematical programming-based sequential optimization approach that uses linear programming (SLP). Our approach was tested on three challenging clinical test cases with multileaf collimator constraints corresponding to two vendors. We compared our approach to the conventional IMRT planning approach, a direct-aperture approach and a segment weight optimization approach. Our results in all three cases indicate that the SLP approach outperformed the other approaches, achieving superior critical structure sparing. Convergence of our approach is also demonstrated. Finally, our approach has also been integrated with a commercial treatment planning system and may be utilized clinically.
- 14 January 2010
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 55 (3) , 883-902
A two-stage sequential linear programming approach to IMRT dose optimization
The conventional IMRT planning process involves two stages in which the first stage consists of fast but approximate idealized pencil beam dose calculations and dose optimization and the second stage consists of discretization of the intensity maps followed by intensity map segmentation and a more accurate final dose calculation corresponding to physical beam apertures. Consequently, there can be differences between the presumed dose distribution corresponding to pencil beam calculations and optimization and a more accurately computed dose distribution corresponding to beam segments that takes into account collimator-specific effects. IMRT optimization is computationally expensive and has therefore led to the use of heuristic (e.g., simulated annealing and genetic algorithms) approaches that do not encompass a global view of the solution space. We modify the traditional two-stage IMRT optimization process by augmenting the second stage via an accurate Monte Carlo-based kernel-superposition dose calculations corresponding to beam apertures combined with an exact mathematical programming-based sequential optimization approach that uses linear programming (SLP). Our approach was tested on three challenging clinical test cases with multileaf collimator constraints corresponding to two vendors. We compared our approach to the conventional IMRT planning approach, a direct-aperture approach and a segment weight optimization approach. Our results in all three cases indicate that the SLP approach outperformed the other approaches, achieving superior critical structure sparing. Convergence of our approach is also demonstrated. Finally, our approach has also been integrated with a commercial treatment planning system and may be utilized clinically.
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647011,p. 318-323
Approximation and Segment Count Reduction in Intensity Modulated Radiation Therapy
For a given mtimesn nonnegative real matrix A, a binary segmentation with 1-norm relative error e is a set of pairs (alpha,S)={(alpha1, S1), (alpha2, S2), ..., (alphak, Sk)}, where each alphai is a positive number and Si is an mtimesn binary matrix, and e=|A-Sigmai k=alphaiSi |1/|A|1 where |A|1 is the 1-norm of a vector which consists of exactly all the entries of the matrix A. Given A and positive scalars gamma, delta, we consider the optimization problem of finding a binary segmentation alphaS that minimizes z=Sigmai k=alphai+gammak+deltae subject to certain constraints on Si. This problem provides a major challenge in preparing a clinically acceptable treatment plan for intensity modulated radiation therapy (IMRT) and is known to be NP-hard. In this paper, we present an effective heuristic algorithm for the above problem with an additional constraint klesK, where K is a given positive integer. Reducing k subject to achieving an acceptable value of e is very desirable in both IMRT and intensity modulated arc therapy (IMAT). Our algorithm can be used as a valuable tool to find a clinically deliverable solution with a tradeoff between these two competing metrics
- 1 August 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647011,p. 318-323
Approximation and Segment Count Reduction in Intensity Modulated Radiation Therapy
For a given mtimesn nonnegative real matrix A, a binary segmentation with 1-norm relative error e is a set of pairs (alpha,S)={(alpha1, S1), (alpha2, S2), ..., (alphak, Sk)}, where each alphai is a positive number and Si is an mtimesn binary matrix, and e=|A-Sigmai k=alphaiSi |1/|A|1 where |A|1 is the 1-norm of a vector which consists of exactly all the entries of the matrix A. Given A and positive scalars gamma, delta, we consider the optimization problem of finding a binary segmentation alphaS that minimizes z=Sigmai k=alphai+gammak+deltae subject to certain constraints on Si. This problem provides a major challenge in preparing a clinically acceptable treatment plan for intensity modulated radiation therapy (IMRT) and is known to be NP-hard. In this paper, we present an effective heuristic algorithm for the above problem with an additional constraint klesK, where K is a given positive integer. Reducing k subject to achieving an acceptable value of e is very desirable in both IMRT and intensity modulated arc therapy (IMAT). Our algorithm can be used as a valuable tool to find a clinically deliverable solution with a tradeoff between these two competing metrics
- 1 April 2004
- Published by Springer Nature in Journal of Systems Science and Systems Engineering
- Vol. 13 (2) , 158-179
A nested partitions framework for solving large-scale multicommodity facility location problems
- 1 April 2004
- Published by Springer Nature in Journal of Systems Science and Systems Engineering
- Vol. 13 (2) , 158-179
A nested partitions framework for solving large-scale multicommodity facility location problems
- 1 January 2004
- Published by Springer Nature in Machine Learning
- Vol. 54 (1) , 33-44
Projection Support Vector Machine Generators
- 1 January 2004
- Published by Springer Nature in Machine Learning
- Vol. 54 (1) , 33-44
Projection Support Vector Machine Generators
- 1 January 2000
- Published by Springer Nature
- p. 245-302
Decomposition Algorithms for Communication Minimization in Parallel Computing
- 1 January 2000
- Published by Springer Nature
- p. 245-302
Decomposition Algorithms for Communication Minimization in Parallel Computing
- 1 January 1999
- Published by Springer Nature
- p. 107-126
A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems
- 1 January 1999
- Published by Springer Nature
- p. 107-126
A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems
- 1 January 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 83 (1-3) , 29-53
A variable-penalty alternating directions method for convex optimization
- 1 January 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 83 (1-3) , 29-53
A variable-penalty alternating directions method for convex optimization
- 1 January 1994
- Published by Springer Nature
- p. 294-311
Large-Scale Diversity Minimization via Parallel Genetic Algorithms
- 1 January 1994
- Published by Springer Nature
- p. 294-311
Large-Scale Diversity Minimization via Parallel Genetic Algorithms