Clinical Application of Computational Methods in Precision Oncology: A Review.

Importance: There is an enormous and growing amount of data available from individual cancer cases, which makes the work of clinical oncologists more demanding. This data challenge has attracted engineers to create software that aims to improve cancer diagnosis or treatment. However, the move to use computers in the oncology clinic for diagnosis or treatment has led to instances of premature or inappropriate use of computational predictive systems. Objective: To evaluate best practices for developing and assessing the clinical utility of predictive computational methods in oncology. Evidence Review: The National Cancer Policy Forum and the Board on Mathematical Sciences and Analytics at the National Academies of Sciences, Engineering, and Medicine hosted a workshop to examine the use of multidimensional data derived from patients with cancer and the computational methods used to analyze these data. The workshop convened diverse stakeholders and experts, including computer scientists, oncology clinicians, statisticians, patient advocates, industry leaders, ethicists, leaders of health systems (academic and community based), private and public health insurance carriers, federal agencies, and regulatory authorities. Key characteristics for successful computational oncology were considered in 3 thematic areas: (1) data quality, completeness, sharing, and privacy; (2) computational methods for analysis, interpretation, and use of oncology data; and (3) clinical infrastructure and expertise for best use of computational precision oncology. Findings: Quality control was found to be essential across all stages, from data collection to data processing, management, and use. Collecting a standardized parsimonious data set at every cancer diagnosis and restaging could enhance reliability and completeness of clinical data for precision oncology. Data completeness refers to key data elements such as information about cancer diagnosis, treatment, and outcomes, while data quality depends on whether appropriate variables have been measured in valid and reliable ways. Collecting data from diverse populations can reduce the risk of creating invalid and biased algorithms. Computational systems that aid clinicians should be classified as software as a medical device and thus regulated according to the potential risk posed. To facilitate appropriate use of computational methods that interpret high-dimensional data in oncology, treating physicians need access to multidisciplinary teams with broad expertise and deep training among a subset of clinical oncology fellows in clinical informatics. Conclusions and Relevance: Workshop discussions suggested best practices in demonstrating the clinical utility of predictive computational methods for diagnosing or treating cancer.

Myocarditis Associated with Immune Checkpoint Inhibitors: An Expert Consensus on Data Gaps and a Call to Action.

Immune checkpoint inhibitors (ICIs) have transformed the treatment landscape for cancer. Due to the mechanism of action of ICIs, inflammatory reactions against normal tissue were an anticipated side effect of these agents; these immune-related adverse events have been documented and are typically low grade and manageable. Myocarditis has emerged as an uncommon but potentially life-threatening adverse reaction in patients treated with ICIs. Assessment and characterization of ICI-associated myocarditis is challenging because of its low incidence and protean manifestations. Nevertheless, the seriousness of ICI-associated myocarditis justifies a coordinated effort to increase awareness of this syndrome, identify patients who may be at risk, and enable early diagnosis and appropriate treatment. The "Checkpoint Inhibitor Safety Working Group," a multidisciplinary committee of academic, industry, and regulatory partners, convened at a workshop hosted by Project Data Sphere, LLC, on December 15, 2017. This meeting aimed to evaluate the current information on ICI-associated myocarditis, determine methods to collect and share data on this adverse reaction, and establish task forces to close the identified knowledge gaps. In this report, we summarize the workshop findings and proposed steps to address the impact of ICI-associated myocarditis in patients with cancer.

Tribute to Donald Metcalf.

A collection of tributes and remembrances from esteemed colleagues, mentees, and friends on the life and work of "the father of hematopoietic cytokines".

Evaluation of 4-dimensional computed tomography to 4-dimensional cone-beam computed tomography deformable image registration for lung cancer adaptive radiation therapy.

PURPOSE: To evaluate 2 deformable image registration (DIR) algorithms for the purpose of contour mapping to support image-guided adaptive radiation therapy with 4-dimensional cone-beam CT (4DCBCT). METHODS AND MATERIALS: One planning 4D fan-beam CT (4DFBCT) and 7 weekly 4DCBCT scans were acquired for 10 locally advanced non-small cell lung cancer patients. The gross tumor volume was delineated by a physician in all 4D images. End-of-inspiration phase planning 4DFBCT was registered to the corresponding phase in weekly 4DCBCT images for day-to-day registrations. For phase-to-phase registration, the end-of-inspiration phase from each 4D image was registered to the end-of-expiration phase. Two DIR algorithms-small deformation inverse consistent linear elastic (SICLE) and Insight Toolkit diffeomorphic demons (DEMONS)-were evaluated. Physician-delineated contours were compared with the warped contours by using the Dice similarity coefficient (DSC), average symmetric distance, and false-positive and false-negative indices. The DIR results are compared with rigid registration of tumor. RESULTS: For day-to-day registrations, the mean DSC was 0.75 ± 0.09 with SICLE, 0.70 ± 0.12 with DEMONS, 0.66 ± 0.12 with rigid-tumor registration, and 0.60 ± 0.14 with rigid-bone registration. Results were comparable to intraobserver variability calculated from phase-to-phase registrations as well as measured interobserver variation for 1 patient. SICLE and DEMONS, when compared with rigid-bone (4.1 mm) and rigid-tumor (3.6 mm) registration, respectively reduced the average symmetric distance to 2.6 and 3.3 mm. On average, SICLE and DEMONS increased the DSC to 0.80 and 0.79, respectively, compared with rigid-tumor (0.78) registrations for 4DCBCT phase-to-phase registrations. CONCLUSIONS: Deformable image registration achieved comparable accuracy to reported interobserver delineation variability and higher accuracy than rigid-tumor registration. Deformable image registration performance varied with the algorithm and the patient.

A digitally reconstructed radiograph algorithm calculated from first principles.

PURPOSE: To develop an algorithm for computing realistic digitally reconstructed radiographs (DRRs) that match real cone-beam CT (CBCT) projections with no artificial adjustments. METHODS: The authors used measured attenuation data from cone-beam CT projection radiographs of different materials to obtain a function to convert CT number to linear attenuation coefficient (LAC). The effects of scatter, beam hardening, and veiling glare were first removed from the attenuation data. Using this conversion function the authors calculated the line integral of LAC through a CT along rays connecting the radiation source and detector pixels with a ray-tracing algorithm, producing raw DRRs. The effects of scatter, beam hardening, and veiling glare were then included in the DRRs through postprocessing. RESULTS: The authors compared actual CBCT projections to DRRs produced with all corrections (scatter, beam hardening, and veiling glare) and to uncorrected DRRs. Algorithm accuracy was assessed through visual comparison of projections and DRRs, pixel intensity comparisons, intensity histogram comparisons, and correlation plots of DRR-to-projection pixel intensities. In general, the fully corrected algorithm provided a small but nontrivial improvement in accuracy over the uncorrected algorithm. The authors also investigated both measurement- and computation-based methods for determining the beam hardening correction, and found the computation-based method to be superior, as it accounted for nonuniform bowtie filter thickness. The authors benchmarked the algorithm for speed and found that it produced DRRs in about 0.35 s for full detector and CT resolution at a ray step-size of 0.5 mm. CONCLUSIONS: The authors have demonstrated a DRR algorithm calculated from first principles that accounts for scatter, beam hardening, and veiling glare in order to produce accurate DRRs. The algorithm is computationally efficient, making it a good candidate for iterative CT reconstruction techniques that require a data fidelity term based on the matching of DRRs and projections.

A method to estimate the effect of deformable image registration uncertainties on daily dose mapping.

PURPOSE: To develop a statistical sampling procedure for spatially-correlated uncertainties in deformable image registration and then use it to demonstrate their effect on daily dose mapping. METHODS: Sequential daily CT studies are acquired to map anatomical variations prior to fractionated external beam radiotherapy. The CTs are deformably registered to the planning CT to obtain displacement vector fields (DVFs). The DVFs are used to accumulate the dose delivered each day onto the planning CT. Each DVF has spatially-correlated uncertainties associated with it. Principal components analysis (PCA) is applied to measured DVF error maps to produce decorrelated principal component modes of the errors. The modes are sampled independently and reconstructed to produce synthetic registration error maps. The synthetic error maps are convolved with dose mapped via deformable registration to model the resulting uncertainty in the dose mapping. The results are compared to the dose mapping uncertainty that would result from uncorrelated DVF errors that vary randomly from voxel to voxel. RESULTS: The error sampling method is shown to produce synthetic DVF error maps that are statistically indistinguishable from the observed error maps. Spatially-correlated DVF uncertainties modeled by our procedure produce patterns of dose mapping error that are different from that due to randomly distributed uncertainties. CONCLUSIONS: Deformable image registration uncertainties have complex spatial distributions. The authors have developed and tested a method to decorrelate the spatial uncertainties and make statistical samples of highly correlated error maps. The sample error maps can be used to investigate the effect of DVF uncertainties on daily dose mapping via deformable image registration. An initial demonstration of this methodology shows that dose mapping uncertainties can be sensitive to spatial patterns in the DVF uncertainties.

Editorial: Our top 10 developments in stem cell biology over the last 30 years.

To celebrate 30 years of peer-reviewed publication of cutting edge stem cell research in Stem Cells, the first journal devoted to this promising field, we pause to review how far we have come in the three-decade lifetime of the Journal. To do this, we will present our views of the 10 most significant developments that have advanced stem cell biology where it is today. With the increasing rate of new data, it is natural that the bulk of these developments would have occurred in recent years, but we must not think that stem cell biology is a young science. The idea of a stem cell has actually been around for quite a long time having appeared in the scientific literature as early as 1868 with Haeckels' concept of a stamzelle as an uncommitted or undifferentiated cell responsible for producing many types of new cells to repair the body [Naturliche Schopfungsgeschichte, 1868; Berlin: Georg Reimer] but it took many years to obtain hard evidence in support of this theory. Not until the work of James Till and Ernest McCulloch in the 1960s did we have proof of the existence of stem cells and until the derivation of embryonal carcinoma cells in the 1960s-1970s and the first embryonic stem cell in 1981, such adult or tissue-specific stem cells were the only known class. The first issue of Stem Cells was published in 1981; no small wonder that most of its papers were devoted to hematopoietic progenitors. More recently, induced pluripotent stem cells (iPSCs) have been developed, and this is proving to be a fertile area of investigation as shown by the volume of publications appearing not only in Stem Cells but also in other journals over the last 5 years. The reader will note that many of the articles in this special issue are concerned with iPSC; however, this reflects the current surge of interest in the topic rather than any deliberate attempt to ignore other areas of stem cell investigation.

4D Cone-beam CT reconstruction using a motion model based on principal component analysis.

PURPOSE: To provide a proof of concept validation of a novel 4D cone-beam CT (4DCBCT) reconstruction algorithm and to determine the best methods to train and optimize the algorithm. METHODS: The algorithm animates a patient fan-beam CT (FBCT) with a patient specific parametric motion model in order to generate a time series of deformed CTs (the reconstructed 4DCBCT) that track the motion of the patient anatomy on a voxel by voxel scale. The motion model is constrained by requiring that projections cast through the deformed CT time series match the projections of the raw patient 4DCBCT. The motion model uses a basis of eigenvectors that are generated via principal component analysis (PCA) of a training set of displacement vector fields (DVFs) that approximate patient motion. The eigenvectors are weighted by a parameterized function of the patient breathing trace recorded during 4DCBCT. The algorithm is demonstrated and tested via numerical simulation. RESULTS: The algorithm is shown to produce accurate reconstruction results for the most complicated simulated motion, in which voxels move with a pseudo-periodic pattern and relative phase shifts exist between voxels. The tests show that principal component eigenvectors trained on DVFs from a novel 2D/3D registration method give substantially better results than eigenvectors trained on DVFs obtained by conventionally registering 4DCBCT phases reconstructed via filtered backprojection. CONCLUSIONS: Proof of concept testing has validated the 4DCBCT reconstruction approach for the types of simulated data considered. In addition, the authors found the 2D/3D registration approach to be our best choice for generating the DVF training set, and the Nelder-Mead simplex algorithm the most robust optimization routine.

Optimized knot placement for B-splines in deformable image registration.

PURPOSE: To develop an automatic knot placement algorithm to enable the use of NonUniform Rational B-Splines (NURBS) in deformable image registration. METHODS: The authors developed a two-step approach to fit a known displacement vector field (DVF). An initial fit was made with uniform knot spacing. The error generated by this fit was then assigned as an attractive force pulling on the knots, acting against a resistive spring force in an iterative equilibration scheme. To demonstrate the accuracy gain of knot optimization over uniform knot placement, we compared the sum of the squared errors and the frequency of large errors. RESULTS: Fits were made to a one-dimensional DVF using 1-20 free knots. Given the same number of free knots, the optimized, nonuniform B-spline fit produced a smaller error than the uniform B-spline fit. The accuracy was improved by a mean factor of 4.02. The optimized B-spline was found to greatly reduce the number of errors more than 1 standard deviation from the mean error of the uniform fit. The uniform B-spline had 15 such errors, while the optimized B-spline had only two. The algorithm was extended to fit a two-dimensional DVF using control point grid sizes ranging from 8 x 8 to 15 x 15. Compared with uniform fits, the optimized B-spline fits were again found to reduce the sum of squared errors (mean ratio = 2.61) and number of large errors (mean ratio = 4.50). CONCLUSIONS: Nonuniform B-splines offer an attractive alternative to uniform B-splines in modeling the DVF. They carry forward the mathematical compactness of B-splines while simultaneously introducing new degrees of freedom. The increased adaptability of knot placement gained from the generalization to NURBS offers increased local control as well as the ability to explicitly represent topological discontinuities.

Localizing intracavitary brachytherapy applicators from cone-beam CT x-ray projections via a novel iterative forward projection matching algorithm.

PURPOSE: To present a novel method for reconstructing the 3D pose (position and orientation) of radio-opaque applicators of known but arbitrary shape from a small set of 2D x-ray projections in support of intraoperative brachytherapy planning. METHODS: The generalized iterative forward projection matching (gIFPM) algorithm finds the six degree-of-freedom pose of an arbitrary rigid object by minimizing the sum-of-squared-intensity differences (SSQD) between the computed and experimentally acquired autosegmented projection of the objects. Starting with an initial estimate of the object's pose, gIFPM iteratively refines the pose parameters (3D position and three Euler angles) until the SSQD converges. The object, here specialized to a Fletcher-Weeks intracavitary brachytherapy (ICB) applicator, is represented by a fine mesh of discrete points derived from complex combinatorial geometric models of the actual applicators. Three pairs of computed and measured projection images with known imaging geometry are used. Projection images of an intrauterine tandem and colpostats were acquired from an ACUITY cone-beam CT digital simulator. An image postprocessing step was performed to create blurred binary applicators only images. To quantify gIFPM accuracy, the reconstructed 3D pose of the applicator model was forward projected and overlaid with the measured images and empirically calculated the nearest-neighbor applicator positional difference for each image pair. RESULTS: In the numerical simulations, the tandem and colpostats positions (x,y,z) and orientations (alpha, beta, gamma) were estimated with accuracies of 0.6 mm and 2 degrees, respectively. For experimentally acquired images of actual applicators, the residual 2D registration error was less than 1.8 mm for each image pair, corresponding to about 1 mm positioning accuracy at isocenter, with a total computation time of less than 1.5 min on a 1 GHz processor. CONCLUSIONS: This work describes a novel, accurate, fast, and completely automatic method to localize radio-opaque applicators of arbitrary shape from measured 2D x-ray projections. The results demonstrate approximately 1 mm accuracy while compared against the measured applicator projections. No lateral film is needed. By localizing the applicator internal structure as well as radioactive sources, the effect of intra-applicator and interapplicator attenuation can be included in the resultant dose calculations. Further validation tests using clinically acquired tandem and colpostats images will be performed for the accurate and robust applicator/sources localization in ICB patients.

Reconstruction of brachytherapy seed positions and orientations from cone-beam CT x-ray projections via a novel iterative forward projection matching method.

PURPOSE: To generalize and experimentally validate a novel algorithm for reconstructing the 3D pose (position and orientation) of implanted brachytherapy seeds from a set of a few measured 2D cone-beam CT (CBCT) x-ray projections. METHODS: The iterative forward projection matching (IFPM) algorithm was generalized to reconstruct the 3D pose, as well as the centroid, of brachytherapy seeds from three to ten measured 2D projections. The gIFPM algorithm finds the set of seed poses that minimizes the sum-of-squared-difference of the pixel-by-pixel intensities between computed and measured autosegmented radiographic projections of the implant. Numerical simulations of clinically realistic brachytherapy seed configurations were performed to demonstrate the proof of principle. An in-house machined brachytherapy phantom, which supports precise specification of seed position and orientation at known values for simulated implant geometries, was used to experimentally validate this algorithm. The phantom was scanned on an ACUITY CBCT digital simulator over a full 660 sinogram projections. Three to ten x-ray images were selected from the full set of CBCT sinogram projections and postprocessed to create binary seed-only images. RESULTS: In the numerical simulations, seed reconstruction position and orientation errors were approximately 0.6 mm and 5 degrees, respectively. The physical phantom measurements demonstrated an absolute positional accuracy of (0.78 +/- 0.57) mm or less. The theta and phi angle errors were found to be (5.7 +/- 4.9) degrees and (6.0 +/- 4.1) degrees, respectively, or less when using three projections; with six projections, results were slightly better. The mean registration error was better than 1 mm/6 degrees compared to the measured seed projections. Each test trial converged in 10-20 iterations with computation time of 12-18 min/iteration on a 1 GHz processor. CONCLUSIONS: This work describes a novel, accurate, and completely automatic method for reconstructing seed orientations, as well as centroids, from a small number of radiographic projections, in support of intraoperative planning and adaptive replanning. Unlike standard back-projection methods, gIFPM avoids the need to match corresponding seed images on the projections. This algorithm also successfully reconstructs overlapping clustered and highly migrated seeds in the implant. The accuracy of better than 1 mm and 6 degrees demonstrates that gIFPM has the potential to support 2D Task Group 43 calculations in clinical practice.

A neural network based 3D/3D image registration quality evaluator for the head-and-neck patient setup in the absence of a ground truth.

PURPOSE: To develop a neural network based registration quality evaluator (RQE) that can identify unsuccessful 3D/3D image registrations for the head-and-neck patient setup in radiotherapy. METHODS: A two-layer feed-forward neural network was used as a RQE to classify 3D/3D rigid registration solutions as successful or unsuccessful based on the features of the similarity surface near the point-of-solution. The supervised training and test data sets were generated by rigidly registering daily cone-beam CTs to the treatment planning fan-beam CTs of six patients with head-and-neck tumors. Two different similarity metrics (mutual information and mean-squared intensity difference) and two different types of image content (entire image versus bony landmarks) were used. The best solution for each registration pair was selected from 50 optimizing attempts that differed only by the initial transformation parameters. The distance from each individual solution to the best solution in the normalized parametrical space was compared to a user-defined error threshold to determine whether that solution was successful or not. The supervised training was then used to train the RQE. The performance of the RQE was evaluated using the test data set that consisted of registration results that were not used in training. RESULTS: The RQE constructed using the mutual information had very good performance when tested using the test data sets, yielding the sensitivity, the specificity, the positive predictive value, and the negative predictive value in the ranges of 0.960-1.000, 0.993-1.000, 0.983-1.000, and 0.909-1.000, respectively. Adding a RQE into a conventional 3D/3D image registration system incurs only about 10%-20% increase of the overall processing time. CONCLUSIONS: The authors' patient study has demonstrated very good performance of the proposed RQE when used with the mutual information in identifying unsuccessful 3D/3D registrations for daily patient setup. The classifier had very good generality and required only to be trained once for each implementation. When the RQE is incorporated with an automated 3D/3D image registration system, it can improve the robustness of the system.