Misha Kazhdan

Patient geometry-driven information retrieval for IMRT treatment plan quality control.

PURPOSE Intensity modulated radiation therapy (IMRT) treatment plan quality depends on the planners level of experience and the amount of time the planner invests in developing the plan. Planners often unwittingly accept plans when further sparing of the organs at risk (OARs) is possible. The authors propose a method of IMRT treatment plan quality control that helps planners to evaluate the doses of the OARs upon completion of a new plan. METHODS It is achieved by comparing the geometric configurations of the OARs and targets of a new patient with those of prior patients, whose plans are maintained in a database. They introduce the concept of a shape relationship descriptor and, specifically, the overlap volume histogram (OVH) to describe the spatial configuration of an OAR with respect to a target. The OVH provides a way to infer the likely DVHs of the OARs by comparing the relative spatial configurations between patients. A database of prior patients is built to serve as an external reference. At the conclusion of a new plan, planners search through the database and identify related patients by comparing the OAR-target geometric relationships of the new patient with those of prior patients. The treatment plans of these related patients are retrieved from the database and guide planners in determining whether lower doses delivered to the OARs in the new plan are feasible. RESULTS Preliminary evaluation is promising. In this evaluation, they applied the analysis to the parotid DVHs of 32 prior head-and-neck patients, whose plans are maintained in a database. Each parotid was queried against the other 63 parotids to determine whether a lower dose was possible. The 17 parotids that promised the greatest reduction in D50 (DVH dose at 50% volume) were flagged. These 17 parotids came from 13 patients. The method also indicated that the doses of the other nine parotids of the 13 patients could not be reduced, so they were included in the replanning process as controls. Replanning with an effort to reduce D50 was conducted on these 26 parotids. After replanning, the average reductions for D50 of the 17 flagged parotids and nine unflagged parotids were 6.6 and 1.9 Gy, respectively. These results demonstrate that the quality control method has accurately identified not only the parotids that require dose reductions but also those for which dose reductions are marginal. Originally, 11 of out the 17 flagged parotids did not meet the Radiation Therapy Oncology Group sparing goal of V(30 Gy) < 50%. Replanning reduced them to three. Additionally, PTV coverage and OAR sparing of the original plans were compared to those of the replans by using pairwise Wilcoxon p test. The statistical comparisons show that replanning compromised neither PTV coverage nor OAR sparing. CONCLUSIONS This method provides an effective quality control mechanism for evaluating the DVHs of the OARs. Adoption of such a method will advance the quality of current IMRT planning, providing better treatment plan consistency.

Motion graphs for unstructured textured meshes

Scanned performances are commonly represented in virtual environments as sequences of textured triangle meshes. Detailed shapes deforming over time benefit from meshes with dynamically evolving connectivity. We analyze these unstructured mesh sequences to automatically synthesize motion graphs with new smooth transitions between compatible poses and actions. Such motion graphs enable natural periodic motions, stochastic playback, and user-directed animations. The main challenge of unstructured sequences is that the meshes differ not only in connectivity but also in alignment, shape, and texture. We introduce new geometry processing techniques to address these problems and demonstrate visually seamless transitions on high-quality captures.

Spatiotemporal atlas parameterization for evolving meshes

We convert a sequence of unstructured textured meshes into a mesh with incrementally changing connectivity and atlas parameterization. Like prior work on surface tracking, we seek temporally coherent mesh connectivity to enable efficient representation of surface geometry and texture. Like recent work on evolving meshes, we pursue local remeshing to permit tracking over long sequences containing significant deformations or topological changes. Our main contribution is to show that both goals are realizable within a common framework that simultaneously evolves both the set of mesh triangles and the parametric map. Sparsifying the remeshing operations allows the formation of large spatiotemporal texture charts. These charts are packed as prisms into a 3D atlas for a texture video. Reducing tracking drift using mesh-based optical flow helps improve compression of the resulting video stream.

Unconditionally stable shock filters for image and geometry processing

This work revisits the Shock Filters of Osher and Rudin [ OR90 ] and shows how the proposed filtering process can be interpreted as the advection of image values along flow‐lines. Using this interpretation, we obtain an efficient implementation that only requires tracing flow‐lines and re‐sampling the image. We show that the approach is stable, allowing the use of arbitrarily large time steps without requiring a linear solve. Furthermore, we demonstrate the robustness of the approach by extending it to the processing of signals on meshes in 3D.

Field-aligned online surface reconstruction

Todays 3D scanning pipelines can be classified into two overarching categories: offline, high accuracy methods that rely on global optimization to reconstruct complex scenes with hundreds of millions of samples, and online methods that produce real-time but low-quality output, usually from structure-from-motion or depth sensors. The method proposed in this paper is the first to combine the benefits of both approaches, supporting online reconstruction of scenes with hundreds of millions of samples from high-resolution sensing modalities such as structured light or laser scanners. The key property of our algorithm is that it sidesteps the signed-distance computation of classical reconstruction techniques in favor of direct filtering, parametrization, and mesh and texture extraction. All of these steps can be realized using only weak notions of spatial neighborhoods, which allows for an implementation that scales approximately linearly with the size of each dataset that is integrated into a partial reconstruction. Combined, these algorithmic differences enable a drastically more efficient output-driven interactive scanning and reconstruction workflow, where the user is able to see the final quality field-aligned textured mesh during the entirety of the scanning procedure. Holes or parts with registration problems are displayed in real-time to the user and can be easily resolved by adding further localized scans, or by adjusting the input point cloud using our interactive editing tools with immediate visual feedback on the output mesh. We demonstrate the effectiveness of our algorithm in conjunction with a state-of-the-art structured light scanner and optical tracking system and test it on a large variety of challenging models.

Fast and exact (Poisson) solvers on symmetric geometries

In computer graphics, numerous geometry processing applications reduce to the solution of a Poisson equation. When considering geometries with symmetry, a natural question to consider is whether and how the symmetry can be leveraged to derive an efficient solver for the underlying system of linear equations. In this work we provide a simple representation‐theoretic analysis that demonstrates how symmetries of the geometry translate into block diagonalization of the linear operators and we show how this results in efficient linear solvers for surfaces of revolution with and without angular boundaries.

An Adaptive Multi-Grid Solver for Applications in Computer Graphics: An Adaptive Multi-Grid Solver

A key processing step in numerous computer graphics applications is the solution of a linear system discretized over a spatial domain. Often, the linear system can be represented using an adaptive domain tessellation, either because the solution will only be sampled sparsely, or because the solution is known to be ‘interesting’ (e.g. high frequency) only in localized regions. In this work, we propose an adaptive, finite elements, multi‐grid solver capable of efficiently solving such linear systems. Our solver is designed to be general‐purpose, supporting finite elements of different degrees, across different dimensions and supporting both integrated and pointwise constraints. We demonstrate the efficacy of our solver in applications including surface reconstruction, image stitching and Euclidean Distance Transform calculation.

The potential of shape-based treatment plan optimization for pancreatic IMRT treatments to spare organs at risk and allow for dose escalation to the tumor PTV.

316 Background: Due to the low dose tolerance of the organs at risk (OARs) in the abdomen the tumor dose for pancreatic cancer patient is restricted to 50-60 Gy in 1.8-2.0 Gy fractions when combined with chemotherapy. The goal of this study was to develop a system that can determine the minimal radiation dose to the OARs of each individual patient that is achievable while maintaining adequate tumor coverage. This could guide treatment planners to spare the OARs to the fullest extent. When the minimal doses to the OAR are achieved, the total plan can be upscaled until the normal tissue dose constraints are met, allowing for an increase in tumor dose without increased normal tissue toxicity. METHODS The minimal achievable dose to the OARs depends on its proximity to the planning target volume (PTV). The overlap volume histogram (OVH) was used to describe the spatial relation of each OAR to the PTV. A database of 33 patients, treated with IMRT, was queried to find the lowest achieved dose to an organ for any of the prior patients with less favorable PTV-OAR configurations than the current patient. This minimal dose must also be achievable for the OAR of the new patient. For 25 randomly chosen patients the lowest achievable dose to the liver and kidneys was predicted this way. Then the patients were replanned to verify if this dose could be achieved. The new plans were compared to the original clinical plans. RESULTS After replanning the predicted achievable dose to the liver was realized within 1 and 2 Gy for more than 86% and 96% of the patients respectively. For the kidneys these numbers were 83% and 96%. The average improvement in terms of mean dose was 1.4 Gy (range 0 - 4.6 Gy) for the liver and 1.7 Gy (range 0 - 6.3 Gy) for the kidneys. This would have allowed an increase in PTV dose of on average 5 Gy (range 0-13 Gy) based on the liver and 8.5 Gy (range 0-38 Gy) based on the kidneys compared to the original plan, without an increase in dose to the bowel, cord, and stomach. CONCLUSIONS The lowest achievable dose to the OARs could accurately be predicted for pancreatic cancer patients within seconds. This can guide dosimetrists to spare the OARs or increase the PTV dose by 5 Gy without increased toxicity. [Table: see text].