Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “projected gradient method”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Pattern Search Algorithms for Bound Constrained Minimization

We present a convergence theory for pattern search methods for solving bound constrained nonlinear programs. The analysis relies on the abstract structure of pattern search methods and an understanding of how the pattern interacts with the bound constraints. This analysis makes it possible to develop pattern search methods for bound constrained problems while only slightly restricting the flexibility present in pattern search methods for unconstrained problems. We prove global convergence despite the fact that pattern search methods do not have explicit information concerning the gradient and its projection onto the feasible region and consequently are unable to enforce explicitly a notion of sufficient feasible decrease.

Lewis, Robert Michael↗
DOE OSTI2014

MO-G-17A-07: Improved Image Quality in Brain F-18 FDG PET Using Penalized-Likelihood Image Reconstruction Via a Generalized Preconditioned Alternating Projection Algorithm: The First Patient Results

Purpose: To investigate the performance of a new penalized-likelihood PET image reconstruction algorithm using the 1{sub 1}-norm total-variation (TV) sum of the 1st through 4th-order gradients as the penalty. Simulated and brain patient data sets were analyzed. Methods: This work represents an extension of the preconditioned alternating projection algorithm (PAPA) for emission-computed tomography. In this new generalized algorithm (GPAPA), the penalty term is expanded to allow multiple components, in this case the sum of the 1st to 4th order gradients, to reduce artificial piece-wise constant regions (“staircase” artifacts typical for TV) seen in PAPA images penalized with only the 1st order gradient. Simulated data were used to test for “staircase” artifacts and to optimize the penalty hyper-parameter in the root-mean-squared error (RMSE) sense. Patient FDG brain scans were acquired on a GE D690 PET/CT (370 MBq at 1-hour post-injection for 10 minutes) in time-of-flight mode and in all cases were reconstructed using resolution recovery projectors. GPAPA images were compared PAPA and RMSE-optimally filtered OSEM (fully converged) in simulations and to clinical OSEM reconstructions (3 iterations, 32 subsets) with 2.6 mm XYGaussian and standard 3-point axial smoothing post-filters. Results: The results from the simulated data show a significant reduction in the 'staircase' artifact for GPAPA compared to PAPA and lower RMSE (up to 35%) compared to optimally filtered OSEM. A simple power-law relationship between the RMSE-optimal hyper-parameters and the noise equivalent counts (NEC) per voxel is revealed. Qualitatively, the patient images appear much sharper and with less noise than standard clinical images. The convergence rate is similar to OSEM. Conclusions: GPAPA reconstructions using the 1{sub 1}-norm total-variation sum of the 1st through 4th-order gradients as the penalty show great promise for the improvement of image quality over that currently achieved with clinical OSEM reconstructions.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Accelerated fast iterative shrinkage thresholding algorithms for sparsity-regularized cone-beam CT image reconstruction

Purpose: The development of iterative image reconstruction algorithms for cone-beam computed tomography (CBCT) remains an active and important research area. Even with hardware acceleration, the overwhelming majority of the available 3D iterative algorithms that implement nonsmooth regularizers remain computationally burdensome and have not been translated for routine use in time-sensitive applications such as image-guided radiation therapy (IGRT). In this work, two variants of the fast iterative shrinkage thresholding algorithm (FISTA) are proposed and investigated for accelerated iterative image reconstruction in CBCT. Methods: Algorithm acceleration was achieved by replacing the original gradient-descent step in the FISTAs by a subproblem that is solved by use of the ordered subset simultaneous algebraic reconstruction technique (OS-SART). Due to the preconditioning matrix adopted in the OS-SART method, two new weighted proximal problems were introduced and corresponding fast gradient projection-type algorithms were developed for solving them. We also provided efficient numerical implementations of the proposed algorithms that exploit the massive data parallelism of multiple graphics processing units. Results: The improved rates of convergence of the proposed algorithms were quantified in computer-simulation studies and by use of clinical projection data corresponding to an IGRT study. The accelerated FISTAs were shown to possess dramatically improved convergence properties as compared to the standard FISTAs. For example, the number of iterations to achieve a specified reconstruction error could be reduced by an order of magnitude. Volumetric images reconstructed from clinical data were produced in under 4 min. Conclusions: The FISTA achieves a quadratic convergence rate and can therefore potentially reduce the number of iterations required to produce an image of a specified image quality as compared to first-order methods. We have proposed and investigated accelerated FISTAs for use with two nonsmooth penalty functions that will lead to further reductions in image reconstruction times while preserving image quality. Moreover, with the help of a mixed sparsity-regularization, better preservation of soft-tissue structures can be potentially obtained. The algorithms were systematically evaluated by use of computer-simulated and clinical data sets.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Thermodynamical study of boron doped CeX{sub 3} (X=Pd, Rh)

The structural, electronic, thermal, and optical properties of cubic non magnetic CeX{sub 3}(X=Pd, Rh) compounds which crystallize in the Au{sub 3}Cu structure have been studied using the projected augmented wave (PAW) method within the density functional theory (DFT) with generalized gradient approximation (GGA) for exchange correlation potential. In this paper we have calculated the band structure which are interpreted using the density of states. The optical properties such as extinction coefficients clearly illustrate the changes in CeX{sub 3} due to intercalation of boron. Lattice instability is observed in CePd{sub 3}B from the calculated dynamical properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

TH-E-17A-04: Geometric Validation of K-Space Self-Gated 4D-MRI Vs. 4D-CT Using A Respiratory Motion Phantom

Purpose: 4D-CT is often limited by motion artifacts, low temporal resolution, and poor phase-based target definition. We recently developed a novel k-space self-gated 4D-MRI technique with high spatial and temporal resolution. The goal here is to geometrically validate 4D-MRI using a MRI-CT compatible respiratory motion phantom and comparison to 4D-CT. Methods: 4D-MRI was acquired using 3T spoiled gradient echo-based 3D projection sequences. Respiratory phases were resolved using self-gated k-space lines as the motion surrogate. Images were reconstructed into 10 temporal bins with 1.56×1.56×1.56mm3. A MRI-CT compatible phantom was designed with a 23mm diameter ball target filled with highconcentration gadolinium(Gd) gel embedded in a 35×40×63mm3 plastic box stabilized with low-concentration Gd gel. The whole phantom was driven by an air pump. Human respiratory motion was mimicked using the controller from a commercial dynamic phantom (RSD). Four breathing settings (rates/depths: 10s/20mm, 6s/15mm, 4s/10mm, 3s/7mm) were scanned with 4D-MRI and 4D-CT (slice thickness 1.25mm). Motion ground-truth was obtained from input signals and real-time video recordings. Reconstructed images were imported into Eclipse(Varian) for target contouring. Volumes and target positions were compared with ground-truth. Initial human study was investigated on a liver patient. Results: 4D-MRI and 4D-CT scans for the different breathing cycles were reconstructed with 10 phases. Target volume in each phase was measured for both 4D-CT and 4D-MRI. Volume percentage difference for the 6.37ml target ranged from 6.67±5.33 to 11.63±5.57 for 4D-CT and from 1.47±0.52 to 2.12±1.60 for 4D-MRI. The Mann-Whitney U-test shows the 4D-MRI is significantly superior to 4D-CT (p=0.021) for phase-based target definition. Centroid motion error ranges were 1.35–1.25mm (4D-CT), and 0.31–0.12mm (4D-MRI). Conclusion: The k-space self-gated 4D-MRI we recently developed can accurately determine phase-based target volume while avoiding typical motion artifacts found in 4D-CT, and is being further studied for use in GI targeting and motion management. This work supported in part by grant 1R03CA173273-01.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2012

Fast compressed sensing-based CBCT reconstruction using Barzilai-Borwein formulation for application to on-line IGRT

Purpose: Compressed sensing theory has enabled an accurate, low-dose cone-beam computed tomography (CBCT) reconstruction using a minimal number of noisy projections. However, the reconstruction time remains a significant challenge for practical implementation in the clinic. In this work, we propose a novel gradient projection algorithm, based on the Gradient-Projection-Barzilai-Borwein formulation (GP-BB), that handles the total variation (TV)-norm regularization-based least squares problem for the CBCT reconstruction in a highly efficient manner, with speed acceptable for routine use in the clinic. Methods: CBCT is reconstructed by minimizing an energy function consisting of a data fidelity term and a TV-norm regularization term. Both terms are simultaneously minimized by calculating the gradient projection of the energy function with the step size determined using an approximate Hessian calculation at each iteration, based on the Barzilai-Borwein formulation. To speed up the process, a multiresolution optimization is used. In addition, the entire algorithm was designed to run with a single graphics processing unit (GPU) card. To evaluate the performance, the Shepp-Logan numerical phantom, the CatPhan 600 physical phantom, and a clinically-treated head-and-neck patient were acquired from the TrueBeam system (Varian Medical Systems, Palo Alto, CA). For each scan, in total, 364 projections were acquired in a 200 deg. rotation. The imager has 1024 x 768 pixels with 0.388 x 0.388-mm resolution. This was down-sampled to 512 x 384 pixels with 0.776 x 0.776-mm resolution for reconstruction. Evenly spaced angles were subsampled and used for varying the number of projections for the image reconstruction. To assess the performance of our GP-BB algorithm, we have implemented and compared with three compressed sensing-type algorithms, the two of which are popular and published (forward-backward splitting techniques), and the other one with a basic line-search technique. In addition, the conventional Feldkamp-Davis-Kress (FDK) reconstruction of the clinical patient data is compared as well. Results: In comparison with the other compressed sensing-type algorithms, our algorithm showed convergence in {<=}30 iterations whereas other published algorithms need at least 50 iterations in order to reconstruct the Shepp-Logan phantom image. With the CatPhan phantom, the GP-BB algorithm achieved a clinically-reasonable image with 40 projections in 12 iterations, in less than 12.6 s. This is at least an order of magnitude faster in reconstruction time compared with the most recent reports utilizing GPU technology given the same input projections. For the head-and-neck clinical scan, clinically-reasonable images were obtained from 120 projections in 34-78 s converging in 12-30 iterations. In this reconstruction range (i.e., 120 projections) the image quality is visually similar to or better than the conventional FDK reconstructed images using 364 projections. This represents a dose reduction of nearly 67% (120/364 projections) while maintaining a reasonable speed in clinical implementation. Conclusions: In this paper, we proposed a novel, fast, low-dose CBCT reconstruction algorithm using the Barzilai-Borwein step-size calculation. A clinically viable head-and-neck image can be obtained within {approx}34-78 s while simultaneously cutting the dose by approximately 67%. This makes our GP-BB algorithm potentially useful in an on-line image-guided radiation therapy (IGRT).

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

WE-EF-207-09: Single-Scan Dual-Energy CT Using Primary Modulation

Purpose: Compared with conventional CT, dual energy CT (DECT) provides better material differentiation but requires projection data with two different effective x-ray spectra. Current DECT scanners use either a two-scan setting or costly imaging components, which are not feasible or available on open-gantry cone-beam CT systems. We propose a hardware-based method which utilizes primary modulation to enable single-scan DECT on a conventional CT scanner. The CT imaging geometry of primary modulation is identical to that used in our previous method for scatter removal, making it possible for future combination with effective scatter correction on the same CT scanner. Methods: We insert an attenuation sheet with a spatially-varying pattern - primary modulator-between the x-ray source and the imaged object. During the CT scan, the modulator selectively hardens the x-ray beam at specific detector locations. Thus, the proposed method simultaneously acquires high and low energy data. High and low energy CT images are then reconstructed from projections with missing data via an iterative CT reconstruction algorithm with gradient weighting. Proof-of-concept studies are performed using a copper modulator on a cone-beam CT system. Results: Our preliminary results on the Catphan(c) 600 phantom indicate that the proposed method for single-scan DECT is able to successfully generate high-quality high and low energy CT images and distinguish different materials through basis material decomposition. By applying correction algorithms and using all of the acquired projection data, we can reconstruct a single CT image of comparable image quality to conventional CT images, i.e., without primary modulation. Conclusion: This work shows great promise in using a primary modulator to perform high-quality single-scan DECT imaging. Future studies will test method performance on anthropomorphic phantoms and perform quantitative analyses on image qualities and DECT decomposition accuracy. We will use simulations to optimize the modulator material and geometry parameters.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

Intercomparison of methods of coupling between convection and large-scale circulation. 1. Comparison over uniform surface conditions

Here, as part of an international intercomparison project, a set of single-column models (SCMs) and cloud-resolving models (CRMs) are run under the weak-temperature gradient (WTG) method and the damped gravity wave (DGW) method. For each model, the implementation of the WTG or DGW method involves a simulated column which is coupled to a reference state defined with profiles obtained from the same model in radiative-convective equilibrium. The simulated column has the same surface conditions as the reference state and is initialized with profiles from the reference state. We performed systematic comparison of the behavior of different models under a consistent implementation of the WTG method and the DGW method and systematic comparison of the WTG and DGW methods in models with different physics and numerics. CRMs and SCMs produce a variety of behaviors under both WTG and DGW methods. Some of the models reproduce the reference state while others sustain a large-scale circulation which results in either substantially lower or higher precipitation compared to the value of the reference state. CRMs show a fairly linear relationship between precipitation and circulation strength. SCMs display a wider range of behaviors than CRMs. Some SCMs under the WTG method produce zero precipitation. Within an individual SCM, a DGW simulation and a corresponding WTG simulation can produce different signed circulation. When initialized with a dry troposphere, DGW simulations always result in a precipitating equilibrium state. The greatest sensitivities to the initial moisture conditions occur for multiple stable equilibria in some WTG simulations, corresponding to either a dry equilibrium state when initialized as dry or a precipitating equilibrium state when initialized as moist. Multiple equilibria are seen in more WTG simulations for higher SST. In some models, the existence of multiple equilibria is sensitive to some parameters in the WTG calculations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

CRCNS22 Learning Rules in the Hippocampus and their Mapping to Neuromorphic Systems (Final Technical Report)

Large scale biologically-realistic computational models are key to investigating the interplay between structure and function in nervous systems, thus paving the way to new clinical methods and neuro-inspired computing solutions. This project focuses on the hippocampus, in particular the CA3-CA1 regions, due to their role in associative learning and memory, pattern separation and completion, and spatial navigation. Investigations into the neuronal organization and learning rule(s) of this circuit can shed light into how declarative memories are formed, stored, recalled and forgotten and inform computational, experimental and clinical neuroscience work. Our project aims at developing a novel data-driven methodology supported by a broad heterogeneous base of neuroscience experimental knowledge and inspired from advances in computer science and engineering. Specifically, this work will benchmark existing and new learning rules within a full-scale spiking neural network simulation of the CA3-CA1 region. The model will be based on an open-source repository, called the Hippocampome, which contains neuronal morphologies, firing patterns, synapse probabilities, and most other required parameters for all known neuron types in the rodent hippocampal formation. The model will be first trained in a supervised fashion for associative memory tasks using backpropagation through time traditionally used in computer science, enhanced with a new technique called the surrogate gradient method. This optimization method will be used to obtain a global loss minimization, but it is not biologically inspired as it assumes the use of data not locally available to the synapses. However, we propose its use as a benchmarking tool, to compare the training performance of local biologically plausible and hardware-mappable learning rules at scale. New rules or combinations will be proposed and tested as needed, based on the obtained results. Progress in this area will also drive the development of novel hardware-mappable algorithms for continual lifelong learning and categorization of new events from few presented examples. This project goes beyond the existing state-of-the-art by looking at large scale realistic neuronal circuits as networks trainable via global optimization methods such as surrogate gradient descent. The objective function of the brain that supports learning is largely unknown, but it is likely that it operates through local learning rules. Studying network trajectories around local minima as proposed in this work represents a useful strategy for understanding whether a network is training by using a specific (set of) learning rule(s). Starting from a completely untrained network is a challenging test since it is difficult to determine how the learning rule affects the trajectory of the network. This interdisciplinary project will help understand what rule governs learning in these regions or if multiple learning rules are involved. The work will develop a robust methodology to measure if the network is converging to the target solution, oscillating around it, or diverging away.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2015

Geometric validation of self-gating k-space-sorted 4D-MRI vs 4D-CT using a respiratory motion phantom

Purpose: MRI is increasingly being used for radiotherapy planning, simulation, and in-treatment-room motion monitoring. To provide more detailed temporal and spatial MR data for these tasks, we have recently developed a novel self-gated (SG) MRI technique with advantage of k-space phase sorting, high isotropic spatial resolution, and high temporal resolution. The current work describes the validation of this 4D-MRI technique using a MRI- and CT-compatible respiratory motion phantom and comparison to 4D-CT. Methods: The 4D-MRI sequence is based on a spoiled gradient echo-based 3D projection reconstruction sequence with self-gating for 4D-MRI at 3 T. Respiratory phase is resolved by using SG k-space lines as the motion surrogate. 4D-MRI images are reconstructed into ten temporal bins with spatial resolution 1.56 × 1.56 × 1.56 mm{sup 3}. A MRI-CT compatible phantom was designed to validate the performance of the 4D-MRI sequence and 4D-CT imaging. A spherical target (diameter 23 mm, volume 6.37 ml) filled with high-concentration gadolinium (Gd) gel is embedded into a plastic box (35 × 40 × 63 mm{sup 3}) and stabilized with low-concentration Gd gel. The phantom, driven by an air pump, is able to produce human-type breathing patterns between 4 and 30 respiratory cycles/min. 4D-CT of the phantom has been acquired in cine mode, and reconstructed into ten phases with slice thickness 1.25 mm. The 4D images sets were imported into a treatment planning software for target contouring. The geometrical accuracy of the 4D MRI and CT images has been quantified using target volume, flattening, and eccentricity. The target motion was measured by tracking the centroids of the spheres in each individual phase. Motion ground-truth was obtained from input signals and real-time video recordings. Results: The dynamic phantom has been operated in four respiratory rate (RR) settings, 6, 10, 15, and 20/min, and was scanned with 4D-MRI and 4D-CT. 4D-CT images have target-stretching, partial-missing, and other motion artifacts in various phases, whereas the 4D-MRI images are visually free of those artifacts. Volume percentage difference for the 6.37 ml target ranged from 5.3% ± 4.3% to 10.3% ± 5.9% for 4D-CT, and 1.47 ± 0.52 to 2.12 ± 1.60 for 4D-MRI. With an increase of respiratory rate, the target volumetric and geometric deviations increase for 4D-CT images while remaining stable for the 4D-MRI images. Target motion amplitude errors at different RRs were measured with a range of 0.66–1.25 mm for 4D-CT and 0.2–0.42 mm for 4D-MRI. The results of Mann–Whitney tests indicated that 4D-MRI significantly outperforms 4D-CT in phase-based target volumetric (p = 0.027) and geometric (p < 0.001) measures. Both modalities achieve equivalent accuracy in measuring motion amplitude (p = 0.828). Conclusions: The k-space self-gated 4D-MRI technique provides a robust method for accurately imaging phase-based target motion and geometry. Compared to 4D-CT, the current 4D-MRI technique demonstrates superior spatiotemporal resolution, and robust resistance to motion artifacts caused by fast target motion and irregular breathing patterns. The technique can be used extensively in abdominal targeting, motion gating, and toward implementing MRI-based adaptive radiotherapy.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Scalable and Energy-Efficient Methods for Interactive Exploration of Scientific Data

The main scientific contributions of this project are the following novel concepts for multidimensional arrays: shape-based similarity join (SIGMOD 2016), incremental view maintenance (SIGMOD 2017), user-defined stencil functions (HPDC 2017), and distributed caching for in-situ processing (SSDBM 2018). Building on our collaboration with the astrophysics group at LBNL, we applied these techniques to the data generated in the Palomar Transient Factory (PTF) astronomical survey. They played a pivotal role in the first-ever observation of a neutron star merger, which produces gravitational waves and turns out to be the origin of heavy elements, including gold. This has lead to a Science magazine article that has received extensive media coverage on ACM TechNews, Slashdot, FiveThirtyEight, and Quanta Magazine, among others. Additionally, two other articles detailing related aspects of the same discovery have been published in the Astrophysical Journal Letters journal. These publications have more than 3,000 citations according to Google Scholar (as of February 2022). This cross-disciplinary collaboration provided very good opportunities to apply database techniques to real-life scientific problems. The fact that they facilitated major discoveries in astrophysics proves the importance of our research. In addition to the work on multidimensional array databases, this project has also developed stochastic gradient descent (SGD) optimization algorithms for training large scale machine learning models, methods for querying in-situ data, and a database query optimizer based on sketch synopses.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2007

Projection Method for Flows with Large Density Variations

Numerical models of solidification including a mushy zone are notoriously inefficient; most of them are based on formulations that require the coupled solution of the velocity components in the momentum equation greatly restricting the range of applicability of the models. There are only two models known to the authors that have used a projection or fractional step formulation, but none of these were used to model problems of any significant size. A third model was only applied to a partial mushy zone with no all-fluid region. Our initial attempts at modeling directional solidification in the presence of a developing mushy zone using a projection formulation encountered very serious difficulties once solidification starts. These difficulties were traced to the inability of the method to deal with large local density differences in the vicinity of the fluid-mush interface. As a result, a modified formulation of the projection method has been developed, that maintains the coupling between the body force and the pressure gradient and is presented in this work. The new formulation is shown to be robust and efficient, and can be applied to problems involving very large meshes. This is illustrated in this work through its application to simulations involving Pb-Sb and Pb-Sn alloys.

Heinrich, Juan C.↗
DOE OSTI2012

Automated treatment planning for a dedicated multi-source intracranial radiosurgery treatment unit using projected gradient and grassfire algorithms

Purpose: The purpose of this work is to develop a framework to the inverse problem for radiosurgery treatment planning on the Gamma Knife{sup Registered-Sign} Perfexion Trade-Mark-Sign (PFX) for intracranial targets. Methods: The approach taken in the present study consists of two parts. First, a hybrid grassfire and sphere-packing algorithm is used to obtain shot positions (isocenters) based on the geometry of the target to be treated. For the selected isocenters, a sector duration optimization (SDO) model is used to optimize the duration of radiation delivery from each collimator size from each individual source bank. The SDO model is solved using a projected gradient algorithm. This approach has been retrospectively tested on seven manually planned clinical cases (comprising 11 lesions) including acoustic neuromas and brain metastases. Results: In terms of conformity and organ-at-risk (OAR) sparing, the quality of plans achieved with the inverse planning approach were, on average, improved compared to the manually generated plans. The mean difference in conformity index between inverse and forward plans was -0.12 (range: -0.27 to +0.03) and +0.08 (range: 0.00-0.17) for classic and Paddick definitions, respectively, favoring the inverse plans. The mean difference in volume receiving the prescribed dose (V{sub 100}) between forward and inverse plans was 0.2% (range: -2.4% to +2.0%). After plan renormalization for equivalent coverage (i.e., V{sub 100}), the mean difference in dose to 1 mm{sup 3} of brainstem between forward and inverse plans was -0.24 Gy (range: -2.40 to +2.02 Gy) favoring the inverse plans. Beam-on time varied with the number of isocenters but for the most optimal plans was on average 33 min longer than manual plans (range: -17 to +91 min) when normalized to a calibration dose rate of 3.5 Gy/min. In terms of algorithm performance, the isocenter selection for all the presented plans was performed in less than 3 s, while the SDO was performed in an average of 215 min. Conclusions: PFX inverse planning can be performed using geometric isocenter selection and mathematical modeling and optimization techniques. The obtained treatment plans all meet or exceed clinical guidelines while displaying high conformity.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2012

Scatter correction in cone-beam CT via a half beam blocker technique allowing simultaneous acquisition of scatter and image information

Purpose: X-ray scatter incurred to detectors degrades the quality of cone-beam computed tomography (CBCT) and represents a problem in volumetric image guided and adaptive radiation therapy. Several methods using a beam blocker for the estimation and subtraction of scatter have been proposed. However, due to missing information resulting from the obstruction of the blocker, such methods require dual scanning or dynamically moving blocker to obtain a complete volumetric image. Here, we propose a half beam blocker-based approach, in conjunction with a total variation (TV) regularized Feldkamp-Davis-Kress (FDK) algorithm, to correct scatter-induced artifacts by simultaneously acquiring image and scatter information from a single-rotation CBCT scan. Methods: A half beam blocker, comprising lead strips, is used to simultaneously acquire image data on one side of the projection data and scatter data on the other half side. One-dimensional cubic B-Spline interpolation/extrapolation is applied to derive patient specific scatter information by using the scatter distributions on strips. The estimated scatter is subtracted from the projection image acquired at the opposite view. With scatter-corrected projections where this subtraction is completed, the FDK algorithm based on a cosine weighting function is performed to reconstruct CBCT volume. To suppress the noise in the reconstructed CBCT images produced by geometric errors between two opposed projections and interpolated scatter information, total variation regularization is applied by a minimization using a steepest gradient descent optimization method. The experimental studies using Catphan504 and anthropomorphic phantoms were carried out to evaluate the performance of the proposed scheme. Results: The scatter-induced shading artifacts were markedly suppressed in CBCT using the proposed scheme. Compared with CBCT without a blocker, the nonuniformity value was reduced from 39.3% to 3.1%. The root mean square error relative to values inside the regions of interest selected from a benchmark scatter free image was reduced from 50 to 11.3. The TV regularization also led to a better contrast-to-noise ratio. Conclusions: An asymmetric half beam blocker-based FDK acquisition and reconstruction technique has been established. The proposed scheme enables simultaneous detection of patient specific scatter and complete volumetric CBCT reconstruction without additional requirements such as prior images, dual scans, or moving strips.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Implementation and Exploration of Parameterizations of Large-Scale Dynamics in NCAR's Single Column Atmosphere Model SCAM6

A single column model with parameterized large-scale (LS) dynamics is used to better understand the response of steady-state tropical precipitation to relative sea surface temperature under various representations of radiation, convection, and circulation. The large-scale dynamics are parametrized via the weak temperature gradient (WTG), damped gravity wave (DGW), and spectral weak temperature gradient (Spectral WTG) method in NCAR's Single Column Atmosphere Model (SCAM6). Radiative cooling is either specified or interactive, and the convective parameterization is run using two different values of a parameter that controls the degree of convective inhibition. Results are interpreted in the context of the Global Atmospheric System Studies -Weak Temperature Gradient (GASS-WTG) Intercomparison project. Using the same parameter settings and simulation configuration as in the GASS-WTG Intercomparison project, SCAM6 under the WTG and DGW methods produces erratic results, suggestive of numerical instability. However, when key parameters are changed to weaken the large-scale circulation's damping of tropospheric temperature variations, SCAM6 performs comparably to single column models in the GASS-WTG Intercomparison project. The Spectral WTG method is less sensitive to changes in convection and radiation than are the other two methods, performing qualitatively similarly across all configurations considered. Under all three methods, circulation strength, represented in 1D by grid-scale vertical velocity, is decreased when barriers to convection are reduced. This effect is most extreme under specified radiative cooling, and is shown to come from increased static stability in the column's reference radiative-convective equilibrium profile. This argument can be extended to interactive radiation cases as well, though perhaps less conclusively.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

A Kaczmarz-inspired approach to accelerate the optimization of neural network wavefunctions

Neural network wavefunctions optimized using the variational Monte Carlo method have been shown to produce highly accurate results for the electronic structure of atoms and small molecules, but the high cost of optimizing such wavefunctions prevents their application to larger systems. We propose the Subsampled Projected-Increment Natural Gradient Descent (SPRING) optimizer to reduce this bottleneck. SPRING combines ideas from the recently introduced minimum-step stochastic reconfiguration optimizer (MinSR) and the classical randomized Kaczmarz method for solving linear least-squares problems. We demonstrate that SPRING outperforms both MinSR and the popular Kronecker-Factored Approximate Curvature method (KFAC) across a number of small atoms and molecules, given that the learning rates of all methods are optimally tuned. For example, on the oxygen atom, SPRING attains chemical accuracy after forty thousand training iterations, whereas both MinSR and KFAC fail to do so even after one hundred thousand iterations.

97 MATHEMATICS AND COMPUTING↗