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 613 records · Page 34

Improved Performance of Asymptotically Optimal Rapidly Exploring Random Trees

Three algorithms that improve the performance of the asymptotically optimal Rapidly exploring Random Tree (RRT*) are presented here. First, we introduce the Goal Tree (GT) algorithm for motion planning in dynamic environments where unexpected obstacles appear sporadically. The GT reuses the previous RRT* by pruning the affected area and then extending the tree by drawing samples from a shadow set. The shadow is the subset of the free configuration space containing all configurations that have geodesics ending at the goal and are in conflict with the new obstacle. Smaller, well defined, sampling regions are considered for Euclidean metric spaces and Dubins' vehicles. Next, the Focused-Refinement (FR) algorithm, which samples with some probability around the first path found by an RRT*, is defined. The third improvement is the Grandparent-Connection (GP) algorithm, which attempts to connect an added vertex directly to its grandparent vertex instead of parent. The GT and GP algorithms are both proven to be asymptotically optimal. Finally, the three algorithms are simulated and compared for a Euclidean metric robot, a Dubins' vehicle, and a seven degrees-of-freedom manipulator.

42 ENGINEERING↗

3D Reconstruction of a High-Energy Diffraction Microscopy Sample Using Multi-modal Serial Sectioning with High-Precision EBSD and Surface Profilometry

High-energy diffraction microscopy (HEDM) combined with in situ mechanical testing is a powerful nondestructive technique for tracking the evolving microstructure within polycrystalline materials during deformation. This technique relies on a sophisticated analysis of X-ray diffraction patterns to produce a three-dimensional reconstruction of grains and other microstructural features within the interrogated volume. However, it is known that HEDM can fail to identify certain microstructural features, particularly smaller grains or twinned regions. Characterization of the identical sample volume using high-resolution surface-specific techniques, particularly electron backscatter diffraction (EBSD), can not only provide additional microstructure information about the interrogated volume but also highlight opportunities for improvement of the HEDM reconstruction algorithms. In this study, a sample fabricated from undeformed “low solvus, high refractory” nickel-based superalloy was scanned using HEDM. The volume interrogated by HEDM was then carefully characterized using a combination of surface-specific techniques, including epi-illumination optical microscopy, zero-tilt secondary and backscattered electron imaging, scanning white light interferometry, and high-precision EBSD. Custom data fusion protocols were developed to integrate and align the microstructure maps captured by these surface-specific techniques and HEDM. The raw and processed data from HEDM and serial sectioning have been made available via the Materials Data Facility (MDF) at https://doi.org/10.18126/4y0p-v604 for further investigation.

36 MATERIALS SCIENCE↗

Machine Learning for Big Data: A Study to Understand Limits at Scale

This report aims to empirically understand the limits of machine learning when applied to Big Data. We observe that recent innovations in being able to collect, access, organize, integrate, and query massive amounts of data from a wide variety of data sources have brought statistical data mining and machine learning under more scrutiny, evaluation and application for gleaning insights from the data than ever before. Much is expected from algorithms without understanding their limitations at scale while dealing with massive datasets. In that context, we pose and address the following questions How does a machine learning algorithm perform on measures such as accuracy and execution time with increasing sample size and feature dimensionality? Does training with more samples guarantee better accuracy? How many features to compute for a given problem? Do more features guarantee better accuracy? Do efforts to derive and calculate more features and train on larger samples worth the effort? As problems become more complex and traditional binary classification algorithms are replaced with multi-task, multi-class categorization algorithms do parallel learners perform better? What happens to the accuracy of the learning algorithm when trained to categorize multiple classes within the same feature space? Towards finding answers to these questions, we describe the design of an empirical study and present the results. We conclude with the following observations (i) accuracy of the learning algorithm increases with increasing sample size but saturates at a point, beyond which more samples do not contribute to better accuracy/learning, (ii) the richness of the feature space dictates performance - both accuracy and training time, (iii) increased dimensionality often reflected in better performance (higher accuracy in spite of longer training times) but the improvements are not commensurate the efforts for feature computation and training and (iv) accuracy of the learning algorithms drop significantly with multi-class learners training on the same feature matrix and (v) learning algorithms perform well when categories in labeled data are independent (i.e., no relationship or hierarchy exists among categories).

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

High-accuracy computation of Delta V magnitude probability densities - Preliminary remarks

This paper describes an algorithm for the high accuracy computation of some statistical quantities of the magnitude of a random trajectory correction maneuver (TCM). The trajectory correction velocity increment Delta V is assumed to be a three-component random vector with each component being a normally distributed random scalar having a possibly nonzero mean. Knowledge of the statitiscal properties of the magnitude of a random TCM is important in the planning and execution of maneuver strategies for deep-space missions such as Galileo. The current algorithm involves the numerical integration of a set of differential equations. This approach allows the computation of density functions for specific Delta V magnitude distributions to high accuracy without first having to generate large numbers of random samples. Possible applications of the algorithm to maneuver planning, planetary quarantine evaluation, and guidance success probability calculations are described.

Chadwick, C.↗

Dual computations of non-Abelian Yang-Mills theories on the lattice

In the past several decades there have been a number of proposals for computing with dual forms of non-Abelian Yang-Mills theories on the lattice. Motivated by the gauge-invariant, geometric picture offered by dual models and successful applications of duality in the U(1) case, we revisit the question of whether it is practical to perform numerical computation using non-Abelian dual models. Specifically, we consider three-dimensional SU(2) pure Yang-Mills as an accessible yet nontrivial case in which the gauge group is non-Abelian. Using methods developed recently in the context of spin foam quantum gravity, we derive an algorithm for efficiently computing the dual amplitude and describe Metropolis moves for sampling the dual ensemble. We relate our algorithms to prior work in non-Abelian dual computations of Hari Dass and his collaborators, addressing several problems that have been left open. We report results of spin expectation value computations over a range of lattice sizes and couplings that are in agreement with our conventional lattice computations. We conclude with an outlook on further development of dual methods and their application to problems of current interest.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Exponentially-Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians

We study the performance of the D-Wave 2X quantum annealing machine on systems with well-controlled ground-state degeneracy. While obtaining the ground state of a spin-glass benchmark instance represents a difficult task, the gold standard for any optimization algorithm or machine is to sample all solutions that minimize the Hamiltonian with more or less equal probability. Our results show that while naive transverse-field quantum annealing on the D-Wave 2X device can find the ground-state energy of the problems, it is not well suited in identifying all degenerate ground-state configurations associated to a particular instance. Even worse, some states are exponentially suppressed, in agreement with previous studies on toy model problems [New J. Phys. 11, 073021 (2009)]. These results suggest that more complex driving Hamiltonians are needed in future quantum annealing machines to ensure a fair sampling of the ground-state manifold.

Quantum Annealing↗

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

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↗

Improvement in the Characterization of MODIS Subframe Difference

MODIS is a key instrument of NASA's Earth Observing System. It has successfully operated for 16+ years on the Terra satellite and 14+ years on the Aqua satellite, respectively. MODIS has 36 spectral bands at three different nadir spatial resolutions, 250m (bands 1-2), 500m (bands 3-7), and 1km (bands 8-36). MODIS subframe measurement is designed for bands 1-7 to match their spatial resolution in the scan direction to that of the track direction. Within each 1 km frame, the MODIS 250 m resolution bands sample four subframes and the 500 m resolution bands sample two subframes. The detector gains are calibrated at a subframe level. Due to calibration differences between subframes, noticeable subframe striping is observed in the Level 1B (L1B) products, which exhibit a predominant radiance-level dependence. This paper presents results of subframe differences from various onboard and earth-view data sources (e.g. solar diffuser, electronic calibration, spectro-radiometric calibration assembly, Earth view, etc.). A subframe bias correction algorithm is proposed to minimize the subframe striping in MODIS L1B image. The algorithm has been tested using sample L1B images and the vertical striping at lower radiance value is mitigated after applying the corrections. The subframe bias correction approach will be considered for implementation in future versions of the calibration algorithm.

Li, Yonghong↗

Multivariate Methods for Prediction of Geologic Sample Composition with Laser-Induced Breakdown Spectroscopy

Laser-induced breakdown spectroscopy (LIBS) uses pulses of laser light to ablate a material from the surface of a sample and produce an expanding plasma. The optical emission from the plasma produces a spectrum which can be used to classify target materials and estimate their composition. The ChemCam instrument on the Mars Science Laboratory (MSL) mission will use LIBS to rapidly analyze targets remotely, allowing more resource- and time-intensive in-situ analyses to be reserved for targets of particular interest. ChemCam will also be used to analyze samples that are not reachable by the rover's in-situ instruments. Due to these tactical and scientific roles, it is important that ChemCam-derived sample compositions are as accurate as possible. We have compared the results of partial least squares (PLS), multilayer perceptron (MLP) artificial neural networks (ANNs), and cascade correlation (CC) ANNs to determine which technique yields better estimates of quantitative element abundances in rock and mineral samples. The number of hidden nodes in the MLP ANNs was optimized using a genetic algorithm. The influence of two data preprocessing techniques were also investigated: genetic algorithm feature selection and averaging the spectra for each training sample prior to training the PLS and ANN algorithms. We used a ChemCam-like laboratory stand-off LIBS system to collect spectra of 30 pressed powder geostandards and a diverse suite of 196 geologic slab samples of known bulk composition. We tested the performance of PLS and ANNs on a subset of these samples, choosing to focus on silicate rocks and minerals with a loss on ignition of less than 2 percent. This resulted in a set of 22 pressed powder geostandards and 80 geologic samples. Four of the geostandards were used as a validation set and 18 were used as the training set for the algorithms. We found that PLS typically resulted in the lowest average absolute error in its predictions, but that the optimized MLP ANN and the CC ANN often gave results comparable to PLS. Averaging the spectra for each training sample and/or using feature selection to choose a small subset of wavelengths to use for predictions gave mixed results, with degraded performance in some cases and similar or slightly improved performance in other cases. However, training time was significantly reduced for both PLS and ANN methods by implementing feature selection, making this a potentially appealing method for initial, rapid-turn-around analyses necessary for Chemcam's tactical role on MSL. Choice of training samples has a strong influence on the accuracy of predictions. We are currently investigating the use of clustering algorithms (e.g. k-means, neural gas, etc.) to identify training sets that are spectrally similar to the unknown samples that are being predicted, and therefore result in improved predictions

Morris, Richard↗

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↗

State-Variable Representations For Moving-Average Sampling

Two state-variable representations derived for continuous-time plant driven by control algorithm including zero-order hold and measurements sampled at mutliple rates by multiple-input/multiple-output moving-average processes. New representations enhance observability and controllability of plant. Applications include mathematical modeling of navigation systems including star trackers, gyroscopes, and accelerometers.

Polites, Michael E.↗