Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and data structure”

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,675 records · Page 93

Deep Learning Prediction of Interspecies Interactions from Self-organized Spatiotemporal Patterns of Co-evolving Organisms

Microorganisms colonizing natural habits such as soils co-evolve to form specific spatial patterns through interspecies interactions. These self-organized patterns are a key ecological phenotype, which provides critical information on their interaction mechanisms. However, conventional network inference techniques that analyze species population data in bulk have yet to be extended to account for such spatial heterogeneity. Here we proposed supervised deep learning as a new network inference tool for predicting interspecies interactions from spatiotemporal patterns of microbial evolution. Due to lack of biological imaging data that can be used for training deep learning networks, we used in silico data generated from high-fidelity agent-based models to determine model structure and parameters. Even though networks were trained under simple configurations where interaction coefficients are assumed to be spatially invariant, we demonstrated that the resulting model can be utilized to successfully predict spatial variation of interactions in more complex domains (i.e., configured with a context-dependent mixture of interaction coefficients) as well as in simple domains without further training. In the further test against real biological data obtained through imaging experiments of a binary consortium (Pseudomonas fluorescens and a mutant of Escherichia coli), our model also predicted the dramatic shifts in interactions of the two organisms across different environmental contexts. Through various successful demonstrations in this work, the combined use of the agent-based model and machine learning algorithm provides a means to use new type of data - microscopic images - for extracting microbial interactions, therefore presenting itself as a useful tool for the analysis of more complex microbial community interactions.

Lee, Joon-Yong↗

Integration of Total-Sky Imager Data with a Physics-Based Smart Persistence Model for Intra-Hour Forecasting of Solar Radiation

Short-term solar forecasting models based solely on global horizontal irradiance (GHI) measurements are often unable to discriminate the forecasting of the factors affecting GHI from those that can be precisely computed by atmospheric models. Our previous study introduced a Physics-based Smart Persistence model for Intra-hour forecasting of solar radiation (PSPI) that decomposed the forecasting of GHI into the computation of extraterrestrial solar radiation and solar zenith angle and the forecasting of cloud albedo and cloud fraction. The extraterrestrial solar radiation and solar zenith angle were accurately computed by the Solar Position Algorithm (SPA) developed at the National Renewable Energy Laboratory (NREL). A cloud retrieval technique was used to estimate cloud albedo and cloud fraction from surface-based observations of GHI. With the assumption of persistent cloud structures, the cloud albedo and cloud fraction were predicted for future time steps using a two-stream approximation and a 5-minute exponential weighted moving average, respectively. The model evaluation indicated the estimation and forecast of cloud fraction mostly contributed to the uncertainty of the PSPI though it overcame the persistence and smart persistence models in all forecast time horizons between 5 and 60 minutes. This study aims to enhance the PSPI by ingesting surface-based observations of cloud fraction from a total sky imager (TSI). The estimation and forecast of cloud albedo is correspondingly improved by utilizing the cloud fraction observations and thus leads to more accurate GHI forecast. Various time-series analysis methods are also investigated on the forecasting of cloud fraction and cloud albedo for further improving the GHI forecast. These improvements are valuable for many applications, such as forecasting energy use for buildings, grid operations, and ultimately bringing down the cost of solar energy.

14 SOLAR ENERGY↗

A spatially based area–time inundation index model developed to assess habitat opportunity in tidal–fluvial wetlands and restoration sites

The hydrodynamics of tidal wetland areas in the lower Columbia River floodplain and estuary directly affect habitat opportunity for endangered salmonid fishes. Physical and biological structures and functions in the system are directly affected by inundation patterns influenced by tidal cycles, hydropower operations, river discharge, upriver water withdrawals, climate, and physical barriers such as dikes, culverts, and tide gates. Ongoing ecosystem restoration efforts are intended to increase the opportunity for salmon to access beneficial habitats by hydrologically reconnecting main-stem river channels and diked areas within the historical floodplain. To address the need to evaluate habitat opportunity, a geographic information system-based Area-Time Inundation Index Model (ATIIM) was developed. Additionally, the ATIIM integrates in situ or modeled hourly water-surface elevation (WSE) data and advanced terrain processing of high-resolution elevation data. The ATIIM uses a spatially based wetted-area algorithm to determine site average bankfull elevation, two- and three-dimensional inundation extent, and other site metrics. Hydrological process metrics such as inundation frequency, duration, maximum area, and maximum frequency area can inform evaluation of proposed restoration sites; e.g., determine trade-offs between WSE and habitat opportunity, contrast alternative restoration designs, predict impacts of altered flow regimes, and estimate nutrient and biomass fluxes. In an adaptive management framework, this model can be used to provide standardized site comparisons and effectiveness monitoring of changes in the developmental trajectories of restoration sites. Overall, results are presented for 11 wetlands representative of tidal marshes, tidal forested wetlands, and restoration sites.

42 ENGINEERING↗

An HDF5-Based Framework for the Distribution and Analysis of Ultrasonic Concrete Data

There are many commercial ultrasonic tomography devices (UTDs) available for use in nondestructive evaluation (NDE) of reinforced concrete structures. These devices emit, measure, and store ultrasonic signals typically in the 25 kHz to 5 MHz frequency range. UTDs are characterized by a composition of multiple transducers, also known as a transducer array or phased array. Often, UTDs data are in a proprietary format. Consequently, NDE research data is limited to those who have prior non-disclosure agreements or the appropriate licenses. Thus, there is a need for a proper universal data framework to exist such that proprietary file datasets for different concrete specimens can be converted, organized, and stored with relative metadata for individual or collaborative NDE research. Building upon the Hierarchical Data Format (HDF5) model, we have developed a UTD data management framework and Graphic User Interface (GUI) to promote the algorithmic reconstruction of ultrasonic data in a controlled environment for easily reproducible and publishable results.

concrete NDE↗

Improved predictions of transcription factor binding sites using physicochemical features of DNA

Typical approaches for predicting transcription factor binding sites (TFBSs) involve use of a position-specific weight matrix (PWM) to statistically characterize the sequences of the known sites. Recently, an alternative physicochemical approach, called SiteSleuth, was proposed. In this approach, a linear support vector machine (SVM) classifier is trained to distinguish TFBSs from background sequences based on local chemical and structural features of DNA. SiteSleuth appears to generally perform better than PWM-based methods. Here, we improve the SiteSleuth approach by considering both new physicochemical features and algorithmic modifications. New features are derived from Gibbs energies of amino acid–DNA interactions and hydroxyl radical cleavage profiles of DNA. Algorithmic modifications consist of inclusion of a feature selection step, use of a nonlinear kernel in the SVM classifier, and use of a consensus-based post-processing step for predictions. We also considered SVM classification based on letter features alone to distinguish performance gains from use of SVM-based models versus use of physicochemical features. The accuracy of each of the variant methods considered was assessed by cross validation using data available in the RegulonDB database for 54 Escherichia coli TFs, as well as by experimental validation using published ChIP-chip data available for Fis and Lrp.

59 BASIC BIOLOGICAL SCIENCES↗

Neural network accelerator for quantum control

Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.

43 PARTICLE ACCELERATORS↗

SU-F-T-122: 4Dand 5D Proton Dose Evaluation with Monte Carlo

Purpose: We evaluated uncertainties in therapeutic proton doses of a lung treatment, taking into account intra-fractional geometry changes, such as breathing, and inter-fractional changes, such as tumor shrinkage and weight loss. Methods: A Monte Carlo study was performed using four dimensional CT image sets (4DCTs) and weekly repeat imaging (5DCTs) to compute fixed RBE (1.1) and variable RBE weighted dose in an actual lung treatment geometry. The MC2 Monte Carlo system was employed to simulate proton energy deposition and LET distributions according to a thoracic cancer treatment plan developed with a 3D-CT in a commercial treatment planning system, as well as in each of the phases of 4DCT sets which were recorded weekly throughout the course of the treatment. A cumulative dose distribution in relevant structures was computed and compared to the predictions of the treatment planning system. Results: Using the Monte Carlo method, dose deposition estimates with the lowest possible uncertainties were produced. Comparison with treatment planning predictions indicates that significant uncertainties may be associated with therapeutic lung dose prediction from treatment planning systems, depending on the magnitude of inter- and intra-fractional geometry changes. Conclusion: As this is just a case study, a more systematic investigation accounting for a cohort of patients is warranted; however, this is less practical because Monte Carlo simulations of such cases require enormous computational resources. Hence our study and any future case studies may serve as validation/benchmarking data for faster dose prediction engines, such as the track repeating algorithm, FDC.

60 APPLIED LIFE SCIENCES↗

Relocation of the Seismicity of the Caucasus Region

Our objective is to improve the view of the seismicity in the Caucasus region using instrumental data between 1951 and 2019. To create a comprehensive catalog, we combine the bulletins of local agencies and the International Seismological Centre, and use an advanced single-event location algorithm, iLoc, to obtain better locations. We show that relocations with iLoc, using travel-time predictions from the 3D upper mantle velocity model, Regional Seismic Travel Time, improve the locations. Then, using the iLoc results as initial locations and the ground-truth events identified in the iLoc results as fix points, we apply Bayesloc, a multiple-event location algorithm, to simultaneously relocate the entire seismicity of the Caucasus region. Here we demonstrate that the simultaneous relocation of the seismicity with Bayesloc clarifies the location and geometry of major active structures accommodating ongoing convergence between the Arabian and Eurasian continents between the Black and Caspian Seas. Among our major findings is the confirmation of widespread seismicity in the mantle beneath the northern flank of the Greater Caucasus and central Caspian, resulting from north-dipping subduction of the Kura and South Caspian basins and the identification of a discrete band of crustal seismicity beneath the southern flank of the Greater Caucasus.

58 GEOSCIENCES↗

A Study of Physics-Informed Deep Learning for System Fluid Dynamics Closures

The sub-grid-scale (SGS) physics models, or so-called closure relations (CR), are essential in thermal-fluid modeling and simulation codes, ranging from large-eddy simulation to system-level thermo-fluid dynamic problems. While details vary, all thermo-fluid codes solve coupled mass-momentum-energy conservation partial differential equations (PDE). Traditionally, the analytical form of closure models has to be known, and then we calibrate the model using data from a set of applicable experiments. Characteristically, it takes long effort to gain insights and mechanistic understanding needed for developing closure models. Such a model is a compact form of data. The long time required for new model development limits the pace of model application while dealing with new geometries, new coolants or system conditions, particularly in newly designed systems. Alternative to mechanistic and semi-analytical models, it is possible to discover the pattern of closure relations by applying the modern machine learning methods to the body of relevant experimental data. Deep learning (DL) is a relatively new branch in the machine learning family, and a major breakthrough has been achieved since Hinton introduces a fast algorithm to efficiently train a feed-forward neural network (NN) with multilayer perceptrons. Generally, any NN with more than two layers is considered as deep learning, and it contains a large number of hyper-parameters to achieve pattern recognition or regression for complex datasets. Hornik shows that multilayer NN is compatible with universal approximation theorem. There is no constraint for a multilayer NN to capture the properties of any measurable information. This capability makes DL attractive for closure models in a system thermal-hydraulic code. As system geometry and/or operating conditions change, new physical experiments (increasingly sophisticated) are conducted to support evaluation and revision of closure models. Such a so-called data-driven modeling relaxes the structural form of system codes to directly assimilate data instead of hard-wiring the model to pre-calibrated correlations. The objective of this research is to enable cost-effective development of a DL-based closure that reflects the data. The previous work on applying machine learning techniques to fluid dynamics focused on statistical learning with basic NN from direct numerical simulations (DNS) dataset. In the present work, we show that DL-based closure models can cause the fluid calculation to diverge if multilayer NN is used. To address the issue, we investigate conditions by which the DL-based closure models work compatibly, stably, and effectively with PDE-constrained forward prediction problems. Optimally meeting the compatibility conditions constitutes a physics-informed deep learning (PIDL) strategy. We refer to this process as PDE-constrained machine learning or PDE-ML. To develop the technical basis for PDE-ML using DL-based fluid dynamics closure, numerical experiments are performed for manufactured problems of increasing complexity. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Characterizing system dynamics with a weighted and directed network constructed from time series data

In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the time series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constraining Genome-Scale Models to Represent the Bow Tie Structure of Metabolism for 13 C Metabolic Flux Analysis

Determination of internal metabolic fluxes is crucial for fundamental and applied biology because they map how carbon and electrons flow through metabolism to enable cell function. 13 C Metabolic Flux Analysis ( 13 C MFA) and Two-Scale 13 C Metabolic Flux Analysis (2S- 13 C MFA) are two techniques used to determine such fluxes. Both operate on the simplifying approximation that metabolic flux from peripheral metabolism into central “core” carbon metabolism is minimal, and can be omitted when modeling isotopic labeling in core metabolism. The validity of this “two-scale” or “bow tie” approximation is supported both by the ability to accurately model experimental isotopic labeling data, and by experimentally verified metabolic engineering predictions using these methods. However, the boundaries of core metabolism that satisfy this approximation can vary across species, and across cell culture conditions. Here, we present a set of algorithms that (1) systematically calculate flux bounds for any specified “core” of a genome-scale model so as to satisfy the bow tie approximation and (2) automatically identify an updated set of core reactions that can satisfy this approximation more efficiently. First, we leverage linear programming to simultaneously identify the lowest fluxes from peripheral metabolism into core metabolism compatible with the observed growth rate and extracellular metabolite exchange fluxes. Second, we use Simulated Annealing to identify an updated set of core reactions that allow for a minimum of fluxes into core metabolism to satisfy these experimental constraints. Together, these methods accelerate and automate the identification of a biologically reasonable set of core reactions for use with 13 C MFA or 2S- 13 C MFA, as well as provide for a substantially lower set of flux bounds for fluxes into the core as compared with previous methods. We provide an open source Python implementation of these algorithms at https://github.com/JBEI/limitfluxtocore.

13C metabolic flux analysis↗

Diffraction pattern simulation of cellulose fibrils using distributed and quantized pair distances

Intensity simulation of X-ray scattering from large twisted cellulose molecular fibrils is important in understanding the impact of chemical or physical treatments on structural properties such as twisting or coiling. This paper describes a highly efficient method for the simulation of X-ray diffraction patterns from complex fibrils using atom-type-specific pair-distance quantization. Pair distances are sorted into arrays which are labelled by atom type. Histograms of pair distances in each array are computed and binned and the resulting population distributions are used to represent the whole pair-distance data set. These quantized pair-distance arrays are used with a modified and vectorized Debye formula to simulate diffraction patterns. This approach utilizes fewer pair distances in each iteration, and atomic scattering factors are moved outside the iteration since the arrays are labelled by atom type. As a result, this algorithm significantly reduces the computation time while maintaining the accuracy of diffraction pattern simulation, making possible the simulation of diffraction patterns from large twisted fibrils in a relatively short period of time, as is required for model testing and refinement.

09 BIOMASS FUELS↗

Data-Enabled Predictive Control for Building HVAC Systems

Model predictive control is widely used as a control technology for the computation of optimal control inputs of building heating, ventilating, and air conditioning (HVAC) systems. However, both the benefits and widespread adoption of model predictive control (MPC) are hindered by the effort of model creation, calibration, and accuracy of the predictions. In this paper, we apply the data-enabled predictive control (DeePC) algorithm for designing controls for building HVAC systems. The algorithm solely depends on input/output data from the system to predict future state trajectories without the need for system identification. The algorithm relies on the idea that a vector space of all input–output trajectories of a discrete-time linear time-invariant (LTI) system is spanned by time-shifts of a single measured trajectory, given the input signal is persistently exciting. Closed-loop simulations using EnergyPlus are performed to demonstrate the approach. The simulated building modeled in EnergyPlus is a modified commercial large office prototype building served by an air handling unit-variable air volume HVAC system. Temperature setpoints of zones are used as control variables to minimize the HVAC energy cost of the building considering a time-of-use electricity rate structure. Furthermore, sensitivity analysis is conducted to gain insights into the effect of parameter tuning on DeePC performance. Simulation results are used to illustrate the performance of the algorithm and compare the algorithm with model-based MPC and occupancy-based setpoint controller. Overall, DeePC achieves similar performance compared to MPC for lower engineering effort.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Fast and effective reordering of columns within supernodes using partition refinement

In this paper, we consider the problem of computing a triangular factorization of a sparse symmetric matrix using Gaussian elimination. We assume that the sparse matrix has been permuted using a fill-reducing ordering algorithm. When the matrix is symmetric positive definite, the sparsity structure of the triangular factor can be determined once the fill-reducing ordering has been computed. Thus, an efficient numerical factorization scheme can be designed so that only the nonzero entries are stored and operated on. On modern architectures, the positions of the nonzero entries in the triangular factor play a big role in determining the efficiency. It is desirable to have dense blocks in the factor so that the computation can be cast in terms of level-3 BLAS as much as possible. On architectures with GPUs, for example, it is also desirable for these dense blocks to be as large as possible in order to reduce the times to transfer data between the main CPU and the GPUs. We address the problem of locally refining the ordering so that the number of dense blocks is reduced and the sizes of these dense blocks are increased in the triangular factor.

Jacquelin, Mathias↗

Towards a Scalable and Adaptive Application Support Platform for Large-Scale Distributed E-Sciences in High-Performance Network Environments

The advent of large-scale collaborative scientific applications has demonstrated the potential for broad scientific communities to pool globally distributed resources to produce unprecedented data acquisition, movement, and analysis. System resources including supercomputers, data repositories, computing facilities, network infrastructures, storage systems, and display devices have been increasingly deployed at national laboratories and academic institutes. These resources are typically shared by large communities of users over Internet or dedicated networks and hence exhibit an inherent dynamic nature in their availability, accessibility, capacity, and stability. Scientific applications using either experimental facilities or computation-based simulations with various physical, chemical, climatic, and biological models feature diverse scientific workflows as simple as linear pipelines or as complex as a directed acyclic graphs, which must be executed and supported over wide-area networks with massively distributed resources. Application users oftentimes need to manually configure their computing tasks over networks in an ad hoc manner, hence significantly limiting the productivity of scientists and constraining the utilization of resources. The success of these large-scale distributed applications requires a highly adaptive and massively scalable workflow platform that provides automated and optimized computing and networking services. This project is to design and develop a generic Scientific Workflow Automation and Management Platform (SWAMP), which contains a web-based user interface specially tailored for a target application, a set of user libraries, and several easy-to-use computing and networking toolkits for application scientists to conveniently assemble, execute, monitor, and control complex computing workflows in heterogeneous high-performance network environments. SWAMP will enable the automation and management of the entire process of scientific workflows with the convenience of a few mouse clicks while hiding the implementation and technical details from end users. Particularly, we will consider two types of applications with distinct performance requirements: data-centric and service-centric applications. For data-centric applications, the main workflow task involves large-volume data generation, catalog, storage, and movement typically from supercomputers or experimental facilities to a team of geographically distributed users; while for service-centric applications, the main focus of workflow is on data archiving, preprocessing, filtering, synthesis, visualization, and other application-specific analysis. We will conduct a comprehensive comparison of existing workflow systems and choose the best suited one with open-source code, a flexible system structure, and a large user base as the starting point for our development. Based on the chosen system, we will develop and integrate new components including a black box design of computing modules, performance monitoring and prediction, and workflow optimization and reconfiguration, which are missing from existing workflow systems. A modular design for separating specification, execution, and monitoring aspects will be adopted to establish a common generic infrastructure suited for a wide spectrum of science applications. We will further design and develop efficient workflow mapping and scheduling algorithms to optimize the workflow performance in terms of minimum end-to-end delay, maximum frame rate, and highest reliability. We will develop and demonstrate the SWAMP system in a local environment, the grid network, and the 100Gpbs Advanced Network Initiative (ANI) testbed. The demonstration will target scientific applications in climate modeling and high energy physics and the functions to be demonstrated include workflow deployment, execution, steering, and reconfiguration. Throughout the project period, we will work closely with the science communities in the fields of climate modeling and high energy physics including Spallation Neutron Source (SNS) and Large Hadron Collider (LHC) projects to mature the system for production use.

97 MATHEMATICS AND COMPUTING↗

Jet energy drop

We study the jet energy drop, which is the relative difference between the groomed and ungroomed jet energy or transverse momentum. It is one of the fundamental quantities that characterizes the impact of grooming on jets produced in high energy collisions. We consider three different grooming algorithms i) soft drop, ii) iterated soft drop, and iii) trimming. We carry out the resummation of large logarithms of the jet energy drop, the jet radius as well as relevant grooming parameters at next-to-leading logarithmic (NLL') accuracy. In addition, we account for non-global and clustering logarithms, and determine the next-to-leading order corrections. For soft drop we perform a joint resummation of the jet energy drop and the groomed jet radius, which is necessary to achieve the correct all-order structure of the cross section, in particular for the Sudakov-safe case of soft drop with β = 0. We present numerical results for LHC energies and compare to Pythia simulations as well as CMS data. Our factorization framework predicts the onset of nonperturbative effects in the jet energy distribution, in line with what we find in Pythia. The jet energy drop observables stand out because they only probe soft radiation, making them ideal candidates for the tuning of parton shower Monte Carlo event generators and for probing medium effects in heavy-ion collisions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Data-driven Distributed Learning of Multi-agent Systems: A Koopman Operator Approach

Koopman operator theory provides a model-free technique for studying nonlinear dynamical systems purely from data. Since the Koopman operator is infinite-dimensional, researchers have developed several methods that provide a finite-dimensional approximation of the Koopman operator so that it can be applied for practical use cases. One common thing with most of the methods is that their solutions are obtained by solving a centralized minimization problem. In this work, we treat the dynamical system to be a multi-agent system and propose an algorithm to compute the finite-dimensional approximation of the Koopman operator in a distributed manner using the knowledge of the topology of the underlying multi-agent system. The proposed distributed approach is shown to be equivalent to the centralized learning problem and results in a sparse Koopman whose block structure mimics the Laplacian of the multi-agent system. Extensive simulation studies illustrate the proposed framework on the network of oscillators and the IEEE 68 bus system.

Nandanoori, Sai Pushpak↗

MO-FG-204-01: Improved Noise Suppression for Dual-Energy CT Through Entropy Minimization

Purpose: In dual energy CT (DECT), noise amplification during signal decomposition significantly limits the utility of basis material images. Since clinically relevant objects contain a limited number of materials, we propose to suppress noise for DECT based on image entropy minimization. An adaptive weighting scheme is employed during noise suppression to improve decomposition accuracy with limited effect on spatial resolution and image texture preservation. Methods: From decomposed images, we first generate a 2D plot of scattered data points, using basis material densities as coordinates. Data points representing the same material generate a highly asymmetric cluster. We orient an axis by minimizing the entropy in a 1D histogram of these points projected onto the axis. To suppress noise, we replace pixel values of decomposed images with center-of-mass values in the direction perpendicular to the optimal axis. To limit errors due to cluster overlap, we weight each data point’s contribution based on its high and low energy CT values and location within the image. The proposed method’s performance is assessed on physical phantom studies. Electron density is used as the quality metric for decomposition accuracy. Our results are compared to those without noise suppression and with a recently developed iterative method. Results: The proposed method reduces noise standard deviations of the decomposed images by at least one order of magnitude. On the Catphan phantom, this method greatly preserves the spatial resolution and texture of the CT images and limits induced error in measured electron density to below 1.2%. In the head phantom study, the proposed method performs the best in retaining fine, intricate structures. Conclusion: The entropy minimization based algorithm with adaptive weighting substantially reduces DECT noise while preserving image spatial resolution and texture. Future investigations will include extensive investigations on material decomposition accuracy that go beyond the current electron density calculations. This work was supported in part by the National Institutes of Health (NIH) under Grant Number R21 EB012700.

60 APPLIED LIFE SCIENCES↗