Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative methods”

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 1,477 records · Page 82
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Quantitative phase retrieval with arbitrary pupil and illumination

We present a general algorithm for combining measurements taken under various illumination and imaging conditions to quantitatively extract the amplitude and phase of an object wave. The algorithm uses the weak object transfer function, which incorporates arbitrary pupil functions and partially coherent illumination. The approach is extended beyond the weak object regime using an iterative algorithm. Finally, we demonstrate the method on measurements of Extreme Ultraviolet Lithography (EUV) multilayer mask defects taken in an EUV zone plate microscope with both a standard zone plate lens and a zone plate implementing Zernike phase contrast.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Eigenfunction Decomposition of Reactor Perturbations and Transitions Using MCNP Monte Carlo

Monte Carlo criticality calculations for nuclear reactors have typically only been able to find the primary eigenvalue and eigenmode. With the new fission matrix capability in MCNP6, it becomes possible to solve for higher modes, which are useful in wide variety of analyses. As a test case of this new capability, two reactor models in both a base configuration and a perturbed configuration were simulated in MCNP to generate fission matrices. Tools were written to find a relatively small number of eigenpairs of the resulting matrices, whereupon it was found that the implicitly restarted Arnoldi method outperformed the previously used power iteration as an eigenvalue algorithm by a factor of 1500 for a 3600 × 3600 sparse matrix.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
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 OSTI2011

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed, and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modelled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi [12], and by Pazy and Rabinowitz [14].

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Impact of Increased Latent Generations on Sensitivity Calculations with SCALE [Slides]

Depending on the system, energy, and/or nuclide, altering the number of latent generations can significantly impact generated sensitivity coefficients. In general, as the number of latent generations increases, the accuracy of the generated sensitivity value compared with the DP value increases and there is a significant increase in the uncertainty with generated sensitivity values. IFP generated sensitivities appear to be more stable than those with CLUTCH. Complex systems, even with IFP and increased latent generations can still produce poor results (i.e., MPC- 32). This reiterates the importance of performing DPs to confirm sensitivities. IFP-Shift and CLUTCH can take advantage of parallel computing abilities. Work continues in this area as additional parameters and calculational methods are examined to provide analysts insights to successfully generating sensitivity coefficients for confirmatory analyses and validation efforts.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗
DOE OSTI2021

Models and Processes to Extract Drug-like Molecules From Natural Language Text

Researchers worldwide are seeking to repurpose existing drugs or discover new drugs to counter the disease caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). A promising source of candidates for such studies is molecules that have been reported in the scientific literature to be drug-like in the context of viral research. However, this literature is too large for human review and features unusual vocabularies for which existing named entity recognition (NER) models are ineffective. We report here on a project that leverages both human and artificial intelligence to detect references to such molecules in free text. We present 1) a iterative model-in-the-loop method that makes judicious use of scarce human expertise in generating training data for a NER model, and 2) the application and evaluation of this method to the problem of identifying drug-like molecules in the COVID-19 Open Research Dataset Challenge (CORD-19) corpus of 198,875 papers. We show that by repeatedly presenting human labelers only with samples for which an evolving NER model is uncertain, our human-machine hybrid pipeline requires only modest amounts of non-expert human labeling time (tens of hours to label 1778 samples) to generate an NER model with an F-1 score of 80.5%—on par with that of non-expert humans—and when applied to CORD’19, identifies 10,912 putative drug-like molecules. This enriched the computational screening team’s targets by 3,591 molecules, of which 18 ranked in the top 0.1% of all 6.6 million molecules screened for docking against the 3CLPro protein.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Improving an Acoustic Vehicle Detector Using an Iterative Self-Supervision Procedure

In many non-canonical data science scenarios, obtaining, detecting, attributing, and annotating enough high-quality training data is the primary barrier to developing highly effective models. Moreover, in many problems that are not sufficiently defined or constrained, manually developing a training dataset can often overlook interesting phenomena that should be included. To this end, we have developed and demonstrated an iterative self-supervised learning procedure, whereby models are successfully trained and applied to new data to extract new training examples that are added to the corpus of training data. Successive generations of classifiers are then trained on this augmented corpus. Using low-frequency acoustic data collected by a network of infrasound sensors deployed around the High Flux Isotope Reactor and Radiochemical Engineering Development Center at Oak Ridge National Laboratory, we test the viability of our proposed approach to develop a powerful classifier with the goal of identifying vehicles from continuously streamed data and differentiating these from other sources of noise such as tools, people, airplanes, and wind. Using a small collection of exhaustively manually labeled data, we test several implementation details of the procedure and demonstrate its success regardless of the fidelity of the initial model used to seed the iterative procedure. Finally, we demonstrate the method’s ability to update a model to accommodate changes in the data-generating distribution encountered during long-term persistent data collection.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Stacked networks improve physics-informed training: Applications to neural networks and deep operator networks

Physics-informed neural networks and operator networks have shown promise for effectively solving equations modeling physical systems. However, these networks can happen to be difficult or impossible to train accurately. Here, we present a novel multifidelity framework for stacking physics-informed neural networks and operator networks that facilitates training. We successively build a chain of networks, where the output at one step can act as a low-fidelity input for training a longer chain, gradually increasing the expressivity of the learnt model. The equations imposed at each step of the iterative process can be the same or different (akin to simulated annealing). The iterative (stacking) nature of the proposed method allows us to learn progressively features of a solution which could have been hard to learn directly. Through benchmark problems including a nonlinear pendulum, the wave equation, and the viscous Burgers equation, we show how stacking can be used to improve the accuracy and reduce the required size of physics-informed neural networks and operator networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Use of SCALE Continuous-Energy Monte Carlo Tools for Eigenvalue Sensitivity Coefficient Calculations

The TSUNAMI code within the SCALE code system makes use of eigenvalue sensitivity coefficients for an extensive number of criticality safety applications, such as quantifying the data-induced uncertainty in the eigenvalue of critical systems, assessing the neutronic similarity between different critical systems, and guiding nuclear data adjustment studies. The need to model geometrically complex systems with improved fidelity and the desire to extend TSUNAMI analysis to advanced applications has motivated the development of a methodology for calculating sensitivity coefficients in continuous-energy (CE) Monte Carlo applications. The CLUTCH and Iterated Fission Probability (IFP) eigenvalue sensitivity methods were recently implemented in the CE KENO framework to generate the capability for TSUNAMI-3D to perform eigenvalue sensitivity calculations in continuous-energy applications. This work explores the improvements in accuracy that can be gained in eigenvalue and eigenvalue sensitivity calculations through the use of the SCALE CE KENO and CE TSUNAMI continuous-energy Monte Carlo tools as compared to multigroup tools. The CE KENO and CE TSUNAMI tools were used to analyze two difficult models of critical benchmarks, and produced eigenvalue and eigenvalue sensitivity coefficient results that showed a marked improvement in accuracy. The CLUTCH sensitivity method in particular excelled in terms of efficiency and computational memory requirements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

TH-E-BRF-06: Kinetic Modeling of Tumor Response to Fractionated Radiotherapy

Purpose: Accurate calibration of radiobiological parameters is crucial to predicting radiation treatment response. Modeling differences may have a significant impact on calibrated parameters. In this study, we have integrated two existing models with kinetic differential equations to formulate a new tumor regression model for calibrating radiobiological parameters for individual patients. Methods: A system of differential equations that characterizes the birth-and-death process of tumor cells in radiation treatment was analytically solved. The solution of this system was used to construct an iterative model (Z-model). The model consists of three parameters: tumor doubling time Td, half-life of dying cells Tr and cell survival fraction SFD under dose D. The Jacobian determinant of this model was proposed as a constraint to optimize the three parameters for six head and neck cancer patients. The derived parameters were compared with those generated from the two existing models, Chvetsov model (C-model) and Lim model (L-model). The C-model and L-model were optimized with the parameter Td fixed. Results: With the Jacobian-constrained Z-model, the mean of the optimized cell survival fractions is 0.43±0.08, and the half-life of dying cells averaged over the six patients is 17.5±3.2 days. The parameters Tr and SFD optimized with the Z-model differ by 1.2% and 20.3% from those optimized with the Td-fixed C-model, and by 32.1% and 112.3% from those optimized with the Td-fixed L-model, respectively. Conclusion: The Z-model was analytically constructed from the cellpopulation differential equations to describe changes in the number of different tumor cells during the course of fractionated radiation treatment. The Jacobian constraints were proposed to optimize the three radiobiological parameters. The developed modeling and optimization methods may help develop high-quality treatment regimens for individual patients.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

TU-CD-BRA-12: Coupling PET Image Restoration and Segmentation Using Variational Method with Multiple Regularizations

Purpose: To propose a new variational method which couples image restoration with tumor segmentation for PET images using multiple regularizations. Methods: Partial volume effect (PVE) is a major degrading factor impacting tumor segmentation accuracy in PET imaging. The existing segmentation methods usually need to take prior calibrations to compensate PVE and they are highly system-dependent. Taking into account that image restoration and segmentation can promote each other and they are tightly coupled, we proposed a variational method to solve the two problems together. Our method integrated total variation (TV) semi-blind deconvolution and Mumford-Shah (MS) segmentation. The TV norm was used on edges to protect the edge information, and the L{sub 2} norm was used to avoid staircase effect in the no-edge area. The blur kernel was constrained to the Gaussian model parameterized by its variance and we assumed that the variances in the X-Y and Z directions are different. The energy functional was iteratively optimized by an alternate minimization algorithm. Segmentation performance was tested on eleven patients with non-Hodgkin’s lymphoma, and evaluated by Dice similarity index (DSI) and classification error (CE). For comparison, seven other widely used methods were also tested and evaluated. Results: The combination of TV and L{sub 2} regularizations effectively improved the segmentation accuracy. The average DSI increased by around 0.1 than using either the TV or the L{sub 2} norm. The proposed method was obviously superior to other tested methods. It has an average DSI and CE of 0.80 and 0.41, while the FCM method — the second best one — has only an average DSI and CE of 0.66 and 0.64. Conclusion: Coupling image restoration and segmentation can handle PVE and thus improves tumor segmentation accuracy in PET. Alternate use of TV and L2 regularizations can further improve the performance of the algorithm. This work was supported in part by National Natural Science Foundation of China (NNSFC), under Grant No.61375018, and Fundamental Research Funds for the Central Universities, under Grant No. 2012QN086. Wei Lu was supported in part by the National Institutes of Health (NIH) Grant No. R01 CA172638.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

Full waveform inversion for time-distance helioseismology

Inferring interior properties of the Sun from photospheric measurements of the seismic wavefield constitutes the helioseismic inverse problem. Deviations in seismic measurements (such as wave travel times) from their fiducial values estimated for a given model of the solar interior imply that the model is inaccurate. Contemporary inversions in local helioseismology assume that properties of the solar interior are linearly related to measured travel-time deviations. It is widely known, however, that this assumption is invalid for sunspots and active regions and is likely for supergranular flows. Here, we introduce nonlinear optimization, executed iteratively, as a means of inverting for the subsurface structure of large-amplitude perturbations. Defining the penalty functional as the L {sub 2} norm of wave travel-time deviations, we compute the total misfit gradient of this functional with respect to the relevant model parameters at each iteration around the corresponding model. The model is successively improved using either steepest descent, conjugate gradient, or the quasi-Newton limited-memory Broyden-Fletcher-Goldfarb-Shanno algorithm. Performing nonlinear iterations requires privileging pixels (such as those in the near field of the scatterer), a practice that is not compliant with the standard assumption of translational invariance. Measurements for these inversions, although similar in principle to those used in time-distance helioseismology, require some retooling. For the sake of simplicity in illustrating the method, we consider a two-dimensional inverse problem with only a sound-speed perturbation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

Resolution recovery for Compton camera using origin ensemble algorithm

Purpose: Compton cameras (CCs) use electronic collimation to reconstruct the images of activity distribution. Although this approach can greatly improve imaging efficiency, due to complex geometry of the CC principle, image reconstruction with the standard iterative algorithms, such as ordered subset expectation maximization (OSEM), can be very time-consuming, even more so if resolution recovery (RR) is implemented. We have previously shown that the origin ensemble (OE) algorithm can be used for the reconstruction of the CC data. Here we propose a method of extending our OE algorithm to include RR. Methods: To validate the proposed algorithm we used Monte Carlo simulations of a CC composed of multiple layers of pixelated CZT detectors and designed for imaging small animals. A series of CC acquisitions of small hot spheres and the Derenzo phantom placed in air were simulated. Images obtained from (a) the exact data, (b) blurred data but reconstructed without resolution recovery, and (c) blurred and reconstructed with resolution recovery were compared. Furthermore, the reconstructed contrast-to-background ratios were investigated using the phantom with nine spheres placed in a hot background. Results: Our simulations demonstrate that the proposed method allows for the recovery of the resolution loss that is due to imperfect accuracy of event detection. Additionally, tests of camera sensitivity corresponding to different detector configurations demonstrate that the proposed CC design has sensitivity comparable to PET. When the same number of events were considered, the computation time per iteration increased only by a factor of 2 when OE reconstruction with the resolution recovery correction was performed relative to the original OE algorithm. We estimate that the addition of resolution recovery to the OSEM would increase reconstruction times by 2–3 orders of magnitude per iteration. Conclusions: The results of our tests demonstrate the improvement of image resolution provided by the OE reconstructions with resolution recovery. The quality of images and their contrast are similar to those obtained from the OE reconstructions from scans simulated with perfect energy and spatial resolutions.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

WE-G-18A-04: 3D Dictionary Learning Based Statistical Iterative Reconstruction for Low-Dose Cone Beam CT Imaging

Purpose: To develop a 3D dictionary learning based statistical reconstruction algorithm on graphic processing units (GPU), to improve the quality of low-dose cone beam CT (CBCT) imaging with high efficiency. Methods: A 3D dictionary containing 256 small volumes (atoms) of 3x3x3 voxels was trained from a high quality volume image. During reconstruction, we utilized a Cholesky decomposition based orthogonal matching pursuit algorithm to find a sparse representation on this dictionary basis of each patch in the reconstructed image, in order to regularize the image quality. To accelerate the time-consuming sparse coding in the 3D case, we implemented our algorithm in a parallel fashion by taking advantage of the tremendous computational power of GPU. Evaluations are performed based on a head-neck patient case. FDK reconstruction with full dataset of 364 projections is used as the reference. We compared the proposed 3D dictionary learning based method with a tight frame (TF) based one using a subset data of 121 projections. The image qualities under different resolutions in z-direction, with or without statistical weighting are also studied. Results: Compared to the TF-based CBCT reconstruction, our experiments indicated that 3D dictionary learning based CBCT reconstruction is able to recover finer structures, to remove more streaking artifacts, and is less susceptible to blocky artifacts. It is also observed that statistical reconstruction approach is sensitive to inconsistency between the forward and backward projection operations in parallel computing. Using high a spatial resolution along z direction helps improving the algorithm robustness. Conclusion: 3D dictionary learning based CBCT reconstruction algorithm is able to sense the structural information while suppressing noise, and hence to achieve high quality reconstruction. The GPU realization of the whole algorithm offers a significant efficiency enhancement, making this algorithm more feasible for potential clinical application. A high zresolution is preferred to stabilize statistical iterative reconstruction. This work was supported in part by NIH(1R01CA154747-01), NSFC((No. 61172163), Research Fund for the Doctoral Program of Higher Education of China (No. 20110201110011), China Scholarship Council.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Recent advances in computational mathematics and applications

We are honored to bring you this special issue dedicated to recent advances in computational mathematics and applications in science and engineering. The papers in this special issue were presented in ”Conference on Computational Mathematics and Applications (CCMA)” held at the University of Nevada Las Vegas (UNLV) during October 25–27, 2019. The conference has attracted about 90 attendees from six countries. The 15 papers in the special issue comprise a diverse collection of theoretical numerical analysis as well as applications in various subjects. Topics cover optimal control of PDEs, discontinuous Galerkin methods, fluid flow in porous media, turbulence flow, static and moving interface problems, complex fluids composed by the mixture of Newtonian fluid and nematic (liquid crystal) flows, modeling of ocean–atmosphere system, image segmentation algorithm, uncertainty quantification problems for turbulence model and Maxwell’s equations, iterative solver for systems resulting from mixed methods, and novel methods for solving systems of nonlinear equations. As the Guest Editors we would like to thank Dr. Leland Jameson at NSF (National Science Foundation) for kindly supporting our conference proposal which made this conference possible. We would also like to thank Darren Sugrue from Elsevier who provided partial support for our conference, and Thennarasu Gunasekaran and his production team from Elsevier who produced this nice special issue. We are grateful to many people (Dr. Zhijian Wu, Lori Ornelas, Elsa Juarez, and many Ph.D. students) at the Department of Mathematical Sciences of UNLV who provided tremendous support for the conference. Finally, we very much appreciate all authors who contributed their precious results to this special issue.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Super heat kernel and one-loop divergence of super Yang–Mills theory in conformal supergravity

We consider super Yang–Mills (SYM) theory in N=1 conformal supergravity. Using the background field method and the Faddeev–Popov procedure, the quantized action of the theory is presented. Its one-loop effective action is studied using the heat kernel method. We shall develop a non-iterative scheme, generalizing the non-supersymmetric case, to obtain the super heat kernel coefficients. In particular, the first three coefficients, which govern the one-loop divergence, will be calculated. We shall also demonstrate how to schematically derive the higher-order coefficients. The method presented here can be readily applied to various quantum theories. We shall, as an application, derive the full one-loop divergence of SYM in conformal supergravity.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

WE-AB-204-01: Performance Characterization of Regularized-Reconstruction Algorithm for 90Y PET/CT Images

Purpose: {sup 90}Y PET/CT imaging and quantification have recently been suggested as an approach of treatment verification. However, due to low positron yield (32ppm), the {sup 90}Y-PET/CT images are very noisy. Iterative reconstruction techniques that employ regularization, e.g. block sequential regularized expectation maximization (BSREM) algorithm (recently implemented on GE scanners – QClear™), has the potential to increase quantitative accuracy with lower noise penalty compared to OSEM. Our aim is to investigate the performance of RR algorithms in {sup 90}Y PET/CT studies. Methods: A NEMA IEC phantom filled with 3GBq {sup 90}YCl{sub 2} (to simulate patient treatment) was imaged on GE-D690 for 1800s/bed. The sphere-to-background ratio of 7. The data were reconstructed using OSEM and BSREM with PSF modeling and TOF correction while varying the iterations (IT) from 1–6 with fixed 24subsets. For BSREM, the edge-preservation parameter (γ ) was 2 and the penalty-parameters (β) was varied 350–950. In all cases a post-reconstruction filter of 5.2mm (2pixel) transaxial and standard z-axis were used. Sphere average activity concentration (AC) and background standard deviation (SD) were then calculated from VOIs drawn in the spheres and background. Results: Increasing IT from 1to6, the %SD in OSEM increased from 30% to 80%, whereas %SD in BSREM images increased by <5% for all βs. BSREM with β=350 didn’t offer any improvement over OSEM (convergence of mean achieved at 2 IT, in this study). Increasing β from 350 to 950 reduced the AC accuracy of small spheres (<20mm) by 10% and noise from 40% to 20%, which resulted in CNR increase from 11 to 17. Conclusion: In count-limited studies such as {sup 90}Y PET/CT, BSREM can be used to suppress image noise and increase CNR at the expense of a relatively small decrease of quantitative accuracy. The BSREM parameters need to be optimized for each study depending on the radionuclides and count densities. Research reported in this publication was supported by the National Cancer Institute of the National Institutes of Health under Award Number R01CA13898 and was also partly supported by General Electric.

60 APPLIED LIFE SCIENCES↗