Sensitivity analysis for lexicographic ordering in radiation therapy treatment planning
نویسندگان
چکیده
منابع مشابه
An Approach in Radiation Therapy Treatment Planning: A Fast, GPU-Based Monte Carlo Method
Introduction: An accurate and fast radiation dose calculation is essential for successful radiation radiotherapy. The aim of this study was to implement a new graphic processing unit (GPU) based radiation therapy treatment planning for accurate and fast dose calculation in radiotherapy centers. Materials and Methods: A program was written for parallel runnin...
متن کاملOptimizing the Scenario Positions for Robust Radiation Therapy Treatment Planning
Complex external beam radiation therapy treatment plans are susceptible to errors. Robust optimization methods that take uncertainties into account during the optimization can alleviate the effects of the errors. For many robust methods, the possible error realizations are discretized into scenarios. The methods then aim at achieving high quality plans in all scenarios simultaneously. The choic...
متن کاملAnalytical probabilistic modeling for radiation therapy treatment planning.
This paper introduces the concept of analytical probabilistic modeling (APM) to quantify uncertainties in quality indicators of radiation therapy treatment plans. Assuming Gaussian probability densities over the input parameters of the treatment plan quality indicators, APM enables the calculation of the moments of the induced probability density over the treatment plan quality indicators by an...
متن کاملLexicographic ordering: intuitive multicriteria optimization for IMRT.
Optimization problems in IMRT inverse planning are inherently multicriterial since they involve multiple planning goals for targets and their neighbouring critical tissue structures. Clinical decisions are generally required, based on tradeoffs among these goals. Since the tradeoffs cannot be quantitatively determined prior to optimization, the decision-making process is usually indirect and it...
متن کاملPropagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constraint programming to a problem, it is modelled by a set of constraints on a set of decision variables. A common modelling pattern is the use of matrices of decision variables. The rows and/or columns of these matrices are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Medical Physics
سال: 2012
ISSN: 0094-2405
DOI: 10.1118/1.4720218