mlsanityData to 14 Oct 2026

Efficient Radiation Treatment Planning based on Voxel Importance

arXiv 2405.03880 ↗First posted 6 May 2024physics.med-ph cs.LG eess.IVcited by 0

Not on the map. Why?

Abstract (arXiv)

Radiation treatment planning involves optimization over a large number of voxels, many of which carry limited information about the clinical problem. We propose an approach to reduce the large optimization problem by only using a representative subset of informative voxels. This way, we drastically improve planning efficiency while maintaining the plan quality. Within an initial probing step, we pre-solve an easier optimization problem involving a simplified objective from which we derive an importance score per voxel. This importance score is then turned into a sampling distribution, which allows us to subsample a small set of informative voxels using importance sampling. By solving a - now reduced - version of the original optimization problem using this subset, we effectively reduce the problem's size and computational demands while accounting for regions where satisfactory dose deliveries are challenging. In contrast to other stochastic (sub-)sampling methods, our technique only requires a single probing and sampling step to define a reduced optimization problem. This problem can be efficiently solved using established solvers without the need of modifying or adapting them. Empirical experiments on open benchmark data highlight substantially reduced optimization times, up to 50 times faster than the original ones, for intensity-modulated radiation therapy (IMRT), all while upholding plan quality comparable to traditional methods. Our novel approach has the potential to significantly accelerate radiation treatment planning by addressing its inherent computational challenges. We reduce the treatment planning time by reducing the size of the optimization problem rather than modifying and improving the optimization method. Our efforts are thus complementary to many previous developments.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 25 references that are in the map. First posted on arXiv 6 May 2024.

Builds on

6 of 25 references.

References · 6

  1. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 641
  2. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
  3. 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 328
  4. 2017OSQP: An Operator Splitting Solver for Quadratic Programscited by 161
  5. 2015Variance Reduction in SGD by Distributed Importance Samplingcited by 79
  6. 2018A linear programming approach to inverse planning in Gamma Knife radiosurgerycited by 1

Built on by

Not cited yet.