Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithms”

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 469 records · Page 26

Random Walks With Tweedie: A Unified View of Score-Based Diffusion Models [In the Spotlight]

We present a concise derivation for several influential score-based diffusion models that relies on only a few textbook results. Diffusion models have recently emerged as powerful tools for generating realistic, synthetic signals—particularly natural images—and often play a role in state-of-the-art algorithms for inverse problems in image processing. While these algorithms are often surprisingly simple, the theory behind them is not, and multiple complex theoretical justifications exist in the literature. Here, in this study, we provide a simple and largely self-contained theoretical justification for score-based diffusion models that is targeted towards the signal processing community. This approach leads to generic algorithmic templates for training and generating samples with diffusion models. We show that several influential diffusion models correspond to particular choices within these templates and demonstrate that alternative, more straightforward algorithmic choices can provide comparable results. This approach has the added benefit of enabling conditional sampling without any likelihood approximation.

97 MATHEMATICS AND COMPUTING↗

Automated selection of the optimal cardiac phase for single-beat coronary CT angiography reconstruction

Purpose: Reconstructing a low-motion cardiac phase is expected to improve coronary artery visualization in coronary computed tomography angiography (CCTA) exams. This study developed an automated algorithm for selecting the optimal cardiac phase for CCTA reconstruction. The algorithm uses prospectively gated, single-beat, multiphase data made possible by wide cone-beam imaging. The proposed algorithm differs from previous approaches because the optimal phase is identified based on vessel image quality (IQ) directly, compared to previous approaches that included motion estimation and interphase processing. Because there is no processing of interphase information, the algorithm can be applied to any sampling of image phases, making it suited for prospectively gated studies where only a subset of phases are available. Methods: An automated algorithm was developed to select the optimal phase based on quantitative IQ metrics. For each reconstructed slice at each reconstructed phase, an image quality metric was calculated based on measures of circularity and edge strength of through-plane vessels. The image quality metric was aggregated across slices, while a metric of vessel-location consistency was used to ignore slices that did not contain through-plane vessels. The algorithm performance was evaluated using two observer studies. Fourteen single-beat cardiac CT exams (Revolution CT, GE Healthcare, Chalfont St. Giles, UK) reconstructed at 2% intervals were evaluated for best systolic (1), diastolic (6), or systolic and diastolic phases (7) by three readers and the algorithm. Pairwise inter-reader and reader-algorithm agreement was evaluated using the mean absolute difference (MAD) and concordance correlation coefficient (CCC) between the reader and algorithm-selected phases. A reader-consensus best phase was determined and compared to the algorithm selected phase. In cases where the algorithm and consensus best phases differed by more than 2%, IQ was scored by three readers using a five point Likert scale. Results: There was no statistically significant difference between inter-reader and reader-algorithm agreement for either MAD or CCC metrics (p > 0.1). The algorithm phase was within 2% of the consensus phase in 15/21 of cases. The average absolute difference between consensus and algorithm best phases was 2.29% ± 2.47%, with a maximum difference of 8%. Average image quality scores for the algorithm chosen best phase were 4.01 ± 0.65 overall, 3.33 ± 1.27 for right coronary artery (RCA), 4.50 ± 0.35 for left anterior descending (LAD) artery, and 4.50 ± 0.35 for left circumflex artery (LCX). Average image quality scores for the consensus best phase were 4.11 ± 0.54 overall, 3.44 ± 1.03 for RCA, 4.39 ± 0.39 for LAD, and 4.50 ± 0.18 for LCX. There was no statistically significant difference (p > 0.1) between the image quality scores of the algorithm phase and the consensus phase. Conclusions: The proposed algorithm was statistically equivalent to a reader in selecting an optimal cardiac phase for CCTA exams. When reader and algorithm phases differed by >2%, image quality as rated by blinded readers was statistically equivalent. By detecting the optimal phase for CCTA reconstruction, the proposed algorithm is expected to improve coronary artery visualization in CCTA exams.

61 RADIATION PROTECTION AND DOSIMETRY↗

Derivative-free robust optimization by outer approximations

We develop an algorithm for minimax problems that arise in robust optimization in the absence of objective function derivatives. The algorithm utilizes an extension of methods for inexact outer approximation in sampling a potentially infinite-cardinality uncertainty set. Clarke stationarity of the algorithm output is established alongside desirable features of the model-based trust-region subproblems encountered. We demonstrate the practical benefits of the algorithm on a new class of test problems.

59 BASIC BIOLOGICAL SCIENCES↗

Sampling and resolution characteristics in reduced order models of shallow water equations: Intrusive vs nonintrusive

We investigate the sensitivity of reduced order models (ROMs) to training data spatial resolution as well as sampling rate. In particular, we consider proper orthogonal decomposition (POD), coupled with Galerkin projection (POD-GP), as an intrusive reduced order modeling technique. For non-intrusive ROMs, we consider two frameworks. The first is using dynamic mode decomposition (DMD), and the second is based on artificial neural networks (ANNs). For ANN, we utilized a residual deep neural network, and for DMD we have studied two versions of DMD approaches; one with hard thresholding and the other with sorted bases selection. Also, we highlight the differences between mean-subtracting the data (centering) and using the data without mean-subtraction. We tested these ROMs using a system of 2D shallow water equations for four different numerical experiments, adopting combinations of sampling rates and spatial resolutions. For these cases, we found that the DMD basis obtained with hard threshodling is sensitive to sampling rate. The sorted DMD algorithm helps to mitigate this problem and yields more stabilized and converging solution. Furthermore, we demonstrate that both DMD approaches without mean subtraction provide significantly more accurate results than DMD with mean-subtracting the data. On the other hand, POD is relatively insensitive to sampling rate and yields better representation of the flow field. Meanwhile, spatial resolution has little effect on both POD and DMD performances. Here, the numerical results reveal that an ANN on POD subspace (POD-ANN) performs remarkably better than POD-GP and DMD in capturing system dynamics, even with a small number of modes.

42 ENGINEERING↗

The Velociprobe: An ultrafast hard X-ray nanoprobe for high-resolution ptychographic imaging

Motivated by the advanced photon source upgrade, a new hard X-ray microscope called "Velociprobe" has been recently designed and built for fast ptychographic imaging with high spatial resolution. We are addressing the challenges of high-resolution and fast scanning with novel hardware designs, advanced motion controls, and new data acquisition strategies, including the use of high-bandwidth interferometric measurements. The use of granite, air-bearing-supported stages provides the necessary long travel ranges for coarse motion to accommodate real samples and variable energy operation while remaining highly stable during fine scanning. Scanning the low-mass zone plate enables high-speed and high-precision motion of the probe over the sample. With an advanced control algorithm implemented in a closed-loop feedback system, the setup achieves a position resolution (3σ) of 2 nm. The instrument performance is evaluated by 2D fly-scan ptychography with our developed data acquisition strategies. A spatial resolution of 8.8 nm has been demonstrated on a Au test sample with a detector continuous frame rate of 200 Hz. Using a higher flux X-ray source provided by double-multilayer monochromator, we achieve 10 nm resolution for an integrated circuit sample in an ultrafast scan with a detector's full continuous frame rate of 3000 Hz (0.33 ms per exposure), resulting in an outstanding imaging rate of 9 x 10 4 resolution elements per second

36 MATERIALS SCIENCE↗

Using GANs with adaptive training data to search for new molecules

The process of drug discovery involves a search over the space of all possible chemical compounds. Generative Adversarial Networks (GANs) provide a valuable tool towards exploring chemical space and optimizing known compounds for a desired functionality. Standard approaches to training GANs, however, can result in mode collapse, in which the generator primarily produces samples closely related to a small subset of the training data. In contrast, the search for novel compounds necessitates exploration beyond the original data. In this work, we present an approach to training GANs that promotes incremental exploration and limits the impacts of mode collapse using concepts from Genetic Algorithms. In our approach, valid samples from the generator are used to replace samples from the training data. We consider both random and guided selection along with recombination during replacement. By tracking the number of novel compounds produced during training, we show that updates to the training data drastically outperform the traditional approach, increasing potential applications for GANs in drug discovery.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mapping nanocrystal orientations via scanning Laue diffraction microscopy for multi-peak Bragg coherent diffraction imaging

The recent commissioning of a movable monochromator at the 34-ID-C endstation of the Advanced Photon Source has vastly simplified the collection of Bragg coherent diffraction imaging (BCDI) data from multiple Bragg peaks of sub-micrometre scale samples. Laue patterns arising from the scattering of a polychromatic beam by arbitrarily oriented nanocrystals permit their crystal orientations to be computed, which are then used for locating and collecting several non-co-linear Bragg reflections. The volumetric six-component strain tensor is then constructed by combining the projected displacement fields that are imaged using each of the measured reflections via iterative phase retrieval algorithms. Complications arise when the sample is heterogeneous in composition and/or when multiple grains of a given lattice structure are simultaneously illuminated by the polychromatic beam. Here, a workflow is established for orienting and mapping nanocrystals on a substrate of a different material using scanning Laue diffraction microscopy. The capabilities of the developed algorithms and procedures with both synthetic and experimental data are demonstrated. The robustness is verified by comparing experimental texture maps obtained with Laue diffraction microscopy at the beamline with maps obtained from electron back-scattering diffraction measurements on the same patch of gold nanocrystals. Such tools provide reliable indexing for both isolated and densely distributed nanocrystals, which are challenging to image in three dimensions with other techniques.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

BEYONDPLANCK XIII. Intensity foreground sampling, degeneracies, and priors

We present the intensity foreground algorithms and model employed within the BEYONDPLANCK analysis framework. The BEYONDPLANCK analysis is aimed at integrating component separation and instrumental parameter sampling within a global framework, leading to complete end-to-end error propagation in the Planck Low Frequency Instrument (LFI) data analysis. Given the scope of the BEYONDPLANCK analysis, a limited set of data is included in the component separation process, leading to foreground parameter degeneracies. In order to properly constrain the Galactic foreground parameters, we improve upon the previous Commander component separation implementation by adding a suite of algorithmic techniques. These algorithms are designed to improve the stability and computational efficiency for weakly constrained posterior distributions. These are: (1) joint foreground spectral parameter and amplitude sampling, building on ideas from MIRAMARE; (2) component-based monopole determination; (3) joint spectral parameter and monopole sampling; and (4) application of informative spatial priors for component amplitude maps. We find that the only spectral parameter with a significant signal-to-noise ratio using the current BEYONDPLANCK data set is the peak frequency of the anomalous microwave emission component, for which we find $ν$ p = 25.3 ± 0.5 GHz; all others must be constrained through external priors. Future works will be aimed at integrating many more data sets into this analysis, both map and time-ordered based, thereby gradually eliminating the currently observed degeneracies in a controlled manner with respect to both instrumental systematic effects and astrophysical degeneracies. When this happens, the simple LFI-oriented data model employed in the current work will need to be generalized to account for both a richer astrophysical model and additional instrumental effects. This work will be organized within the Open Science-based COSMOGLOBE community effort.

79 ASTRONOMY AND ASTROPHYSICS↗

Application of High Performance Computing for Studying Cyclic Variability in Dilute Internal Combustion Engines

Combustion instabilities in dilute internal combustion engines are manifest in cyclic variability (CV) in engine performance measures such as integrated heat release or shaft work. Understanding the factors leading to CV is important in model-based control, especially with high dilution where experimental studies have demonstrated that deterministic effects can become more prominent. Observation of enough consecutive engine cycles for significant statistical analysis is standard in experimental studies but is largely wanting in numerical simulations because of the computational time required to compute hundreds or thousands of consecutive cycles. We have proposed and begun implementation of an alternative approach to allow rapid simulation of long series of engine dynamics based on a low-dimensional mapping of ensembles of single-cycle simulations which map input parameters to output engine performance. This paper details the use Titan at the Oak Ridge Leadership Computing Facility to investigate CV in a gasoline direct-injected spark-ignited engine with a moderately high rate of dilution achieved through external exhaust gas recirculation. The CONVERGE™ CFD software was used to perform single-cycle simulations with imposed variations of operating parameters and boundary conditions selected according to a sparse grid sampling of the parameter space. Using an uncertainty quantification technique, the sampling scheme is chosen similar to a design of experiments grid but uses algorithms designed to minimize the number of samples required to achieve a desired degree of accuracy. The simulations map input parameters to output metrics of engine performance for a single cycle, and by mapping over a large parameter space, results can be interpolated from within that space. This interpolation scheme forms the basis for a low-dimensional ‘metamodel’ (or model of a model) which can be used to mimic the dynamical behavior of corresponding high-dimensional simulations. Simulations of high-EGR spark-ignition combustion cycles within a parametric sampling grid were performed and analyzed statistically, and sensitivities of the physical factors leading to high CV are presented. With these results, the prospect of producing low-dimensional metamodels to describe engine dynamics at any point in the parameter space will be discussed. Additionally, modifications to the methodology to account for nondeterministic effects in the numerical solution environment are proposed.

Finney, Charles E. A.↗

Finding Fast Transients in Real Time Using a Novel Light-curve Analysis Algorithm

The current data acquisition rate of astronomical transient surveys and the promise for significantly higher rates in the next decade necessitate the development of novel approaches to analyze astronomical data sets and promptly detect objects of interest. The Deeper, Wider, Faster (DWF) program is a survey focused on the identification of fast-evolving transients, such as fast radio bursts, gamma-ray bursts, and supernova shock breakouts. It employs multifrequency simultaneous coverage of the same part of the sky over several orders of magnitude. Using the Dark Energy Camera mounted on the 4 m Blanco telescope, DWF captures a 20 s g -band exposure every minute, at a typical seeing of ~1'' and an air mass of ~1.5. These optical data are collected simultaneously with observations conducted over the entire electromagnetic spectrum—from radio to γ -rays—as well as cosmic-ray observations. In this paper, we present a novel real-time light-curve analysis algorithm, designed to detect transients in the DWF optical data; this algorithm functions independently from, or in conjunction with, image subtraction. We present a sample of fast transients detected by our algorithm, as well as a false-positive analysis. Our algorithm is customizable and can be tuned to be sensitive to transients evolving over different timescales and flux ranges.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimizing a magnitude-limited spectroscopic training sample for photometric classification of supernovae

ABSTRACT In preparation for photometric classification of transients from the Legacy Survey of Space and Time (LSST) we run tests with different training data sets. Using estimates of the depth to which the 4-m Multi-Object Spectroscopic Telescope (4MOST) Time Domain Extragalactic Survey (TiDES) can classify transients, we simulate a magnitude-limited sample reaching rAB ≈ 22.5 mag. We run our simulations with the software snmachine, a photometric classification pipeline using machine learning. The machine-learning algorithms struggle to classify supernovae when the training sample is magnitude limited, in contrast to representative training samples. Classification performance noticeably improves when we combine the magnitude-limited training sample with a simulated realistic sample of faint high-redshift supernovae observed from larger spectroscopic facilities; the algorithms’ range of average area under receiver operator characteristic curve (AUC) scores over 10 runs increases from 0.547–0.628 to 0.946–0.969 and purity of the classified sample reaches 95 per cent in all runs for two of the four algorithms. By creating new, artificial light curves using the augmentation software avocado, we achieve a purity in our classified sample of 95 per cent in all 10 runs performed for all machine-learning algorithms considered. We also reach a highest average AUC score of 0.986 with the artificial neural network algorithm. Having ‘true’ faint supernovae to complement our magnitude-limited sample is a crucial requirement in optimization of a 4MOST spectroscopic sample. However, our results are a proof of concept that augmentation is also necessary to achieve the best classification results.

79 ASTRONOMY AND ASTROPHYSICS↗

Automated detection of double nuclei galaxies using GOTHIC and the discovery of a large sample of dual AGN

We present a novel algorithm to detect double nuclei galaxies (DNG) called Gothic (Graph-bOosTed iterated HIll Climbing) – that detects whether a given image of a galaxy has two or more closely separated nuclei. Our aim is to test for the presence of dual/multiple active galactic nuclei (AGN) in galaxies that visually represent a DNG. Although galaxy mergers are common, the detection of dual AGN is rare. Their detection is very important as they help us understand the formation of supermassive black hole (SMBH) binaries, SMBH growth and AGN feedback effects in multiple nuclei systems. There is thus a need for an algorithm to do a systematic survey of existing imaging data for the discovery of DNGs and dual AGNs. We have tested Gothic on an established sample of DNGs with a 100 per cent detection rate and subsequently conducted a blind search of 1 million SDSS DR16 galaxies (with spectroscopic data available) lying in the redshift range of z = 0 to 0.75. From the list of candidate DNGs found, we have detected 159 dual AGNs, of which 2 are triple AGN systems. Our results show that dual AGNs are not common, and triple AGN even rarer. The colour (u–r) magnitude plots of the DNGs indicate that star formation is quenched as the nuclei come closer and as the AGN fraction increases. The quenching is especially prominent for dual/triple AGN galaxies that lie at the extreme end of the red sequence.

79 ASTRONOMY AND ASTROPHYSICS↗

A COMPRESSED SENSING METHOD WITH ANALYTICAL RESULTS FOR LIDAR FEATURE CLASSIFICATION

We present an innovative way to autonomously classify LiDAR points into bare earth, building, vegetation, and other categories. One desirable product of LiDAR data is the automatic classification of the points in the scene. Our algorithm automatically classifies scene points using Compressed Sensing Methods via Orthogonal Matching Pursuit algorithms utilizing a generalized K-Means clustering algorithm to extract buildings and foliage from a Digital Surface Models (DSM). This technology reduces manual editing while being cost effective for large scale automated global scene modeling. Quantitative analyses are provided using Receiver Operating Characteristics (ROC) curves to show Probability of Detection and False Alarm of buildings vs. vegetation classification. Histograms are shown with sample size metrics. Our inpainting algorithms then fill the voids where buildings and vegetation were removed, utilizing Computational Fluid Dynamics (CFD) techniques and Partial Differential Equations (PDE) to create an accurate Digital Terrain Model (DTM) [6]. Inpainting preserves building height contour consistency and edge sharpness of identified inpainted regions. Qualitative results illustrate other benefits such as Terrain Inpainting s unique ability to minimize or eliminate undesirable terrain data artifacts. Keywords: Compressed Sensing, Sparsity, Data Dictionary, LiDAR, ROC, K-Means, Clustering, K-SVD, Orthogonal Matching Pursuit

99 GENERAL AND MISCELLANEOUS↗

Use of Justified Constraints in Coherent Diffractive Imaging

We demonstrate the use of physically justified object constraints in x-ray Fresnel coherent diffractive imaging on a sample of nanoporous gold prepared by dealloying. Use of these constraints in the reconstruction algorithm enabled highly reliable imaging of the sample's shape and quantification of the 23- to 52-nm pore structure within it without use of a tight object support constraint.

36 MATERIALS SCIENCE↗

Optimized, Budget-constrained Monitoring Well Placement Using DREAM

Defining the ideal suite of monitoring technologies to be deployed at a carbon capture and storage (CCS) site presents a challenge to project developers, financers, insurers, regulators and other stakeholders. The monitoring, verification, and accounting (MVA) toolkit offers a suite of technologies to monitor an extensive range of parameters across a wide span of spatial and temporal resolutions, each with their own degree of sensitivity to changes in the parameter being monitored. Understanding how best to optimize MVA budgets to minimize the time to leak detection could help to address issues around project risks, and in turn help support broad CCS deployment. This paper presents a case study demonstrating an application of the Designs for Risk Evaluation and Management (DREAM) tool using an ensemble of CO 2 leakage scenarios taken from a previous study on leakage impacts to groundwater. Impacts were assessed and monitored as a function of pH, total dissolved solids (TDS), and trace metal concentrations of arsenic (As), cadmium (Cd), chromium (Cr), and lead (Pb). Using output from the previous study, DREAM was used to optimize monitoring system designs based on variable sampling locations and parameters. The algorithm requires the user to define a finite budget to limit the number of monitoring wells and technologies deployed, and then iterates well placement and sensor type and location until it converges on the configuration with the lowest time to first detection of the leak averaged across all scenarios. To facilitate an understanding of the optimal number of sampling wells, DREAM was used to assess the marginal utility of additional sampling locations. Based on assumptions about monitoring costs and replacement costs of degraded water, the incremental cost of each additional sampling well can be compared against its marginal value in terms of avoided aquifer degradation. Applying this method, DREAM identified the most cost-effective ensemble with 14 monitoring locations. Here, while this preliminary study applied relatively simplistic cost and technology assumptions, it provides an exciting proof-of-concept for the application of DREAM to questions of cost-optimized MVA system design that are informed not only by site-specific costs and technology options, but also by reservoir simulation results developed during site characterization and operation.

47 OTHER INSTRUMENTATION↗

SubTSBR to tackle high noise and outliers for data-driven discovery of differential equations

Data-driven discovery of differential equations has been an emerging research topic. We propose a novel algorithm subsampling-based threshold sparse Bayesian regression (SubTSBR) to tackle high noise and outliers. The subsampling technique is used for improving the accuracy of the Bayesian learning algorithm. It has two parameters: subsampling size and the number of subsamples. When the subsampling size increases with fixed total sample size, the accuracy of our algorithm goes up and then down. When the number of subsamples increases, the accuracy of our algorithm keeps going up. We demonstrate how to use our algorithm step by step and compare our algorithm with threshold sparse Bayesian regression (TSBR) for the discovery of differential equations. We show that our algorithm produces better results. We also discuss the merits of discovering differential equations from data and demonstrate how to discover models with random initial and boundary condition as well as models with bifurcations. The numerical examples are: (1) predator-prey model with noise, (2) shallow water equations with outliers, (3) heat diffusion with random initial and boundary condition, and (4) fish-harvesting problem with bifurcations.

97 MATHEMATICS AND COMPUTING↗

The clustering of galaxies in the SDSS-III Baryon Oscillation Spectroscopic Survey: RSD measurement from the power spectrum and bispectrum of the DR12 BOSS galaxies

In this paper, we measure and analyse the bispectrum of the final data release 12 (DR12), galaxy sample provided by the Baryon Oscillation Spectroscopic Survey, splitting by selection algorithm into LOWZ and CMASS galaxies. The LOWZ sample contains 361 762 galaxies with an effective redshift of z LOWZ = 0.32, and the CMASS sample contains 777 202 galaxies with an effective redshift of z CMASS = 0.57. Combining the power spectrum, measured relative to the line of sight, with the spherically averaged bispectrum, we are able to constrain the product of the growth of structure parameter, ƒ, and the amplitude of dark matter density fluctuations, σ 8 , along with the geometric Alcock–Paczynski parameters, the product of the Hubble constant and the comoving sound horizon at the baryon drag epoch, H(z)r s (z d ), and the angular distance parameter divided by the sound horizon, D A (z)/r s (z d ). After combining pre-reconstruction RSD analyses of the power spectrum monopole, quadrupole and bispectrum monopole with post-reconstruction analysis of the BAO power spectrum monopole and quadrupole, we find ƒ( z LOWZ)σ 8 ( z LOWZ) = 0.427 ± 0.056, D A ( z LOWZ)/r s (z d ) = 6.60 ± 0.13, H ( z LOWZ)r s (z d ) = (11.55 ± 0.38)10 3 km s -1 for the LOWZ sample, and f(zCMASS)σ8(zCMASS) = 0.426 ± 0.029, D A ( z CMASS)/r s (z d ) = 9.39 ± 0.10, H ( z CMASS)r s (z d ) = (14.02 ± 0.22)10 3 km s -1 for the CMASS sample. In conclusion, we find general agreement with previous Baryon Oscillation Spectroscopic Survey DR11 and DR12 measurements. Combining our data set with Planck15 we perform a null test of General Relativity through the γ-parametrization finding γ=0.733$ ^{+0.068}_{-0.069} $, which is ∼2.7σ away from the General Relativity predictions.

79 ASTRONOMY AND ASTROPHYSICS↗