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 451 records · Page 25

A novel off-axis scanning method for an enlarged ellipse cone-beam computed tomography field of view

Purpose: Current on-board imaging systems commonly used by modern linear accelerators (LINACs) have a limited field of view (FOV) for a cone-beam CT (CBCT) scan, which is typically less than 50 cm. Consequently, truncation artifacts often occur for large patients. The goal of this work is to investigate a novel method to increase the FOV for current on-board CBCT systems. Methods: When a large patient is scanned with CBCT, any region outside the FOV is only partially sampled within a short range of projection angles, and at other angles no x-ray beams may pass through that region. To increase the sampling rate for the region outside the FOV, we have designed a new source trajectory by shifting the center of rotation during a CBCT scan. This resulted in a reduced sampling rate at the central area and increased sampling rate at the edges. The tradeoff led to a more balanced sampling for an enlarged FOV. An iterative algorithm was also developed to reconstruct the CT image under the new sampling scheme using a compressed sensing technique. Results: The method was validated by numerical simulations mimicking a Varian Trilogy CBCT system, and it was found that artifact-free images could be obtained with the FOV as large as 80 cm. Conclusions: The new CT scanning trajectory can be easily realized under current clinical setup with little modification of the control system, and this can be useful for treating obese patients.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Fast adaptive flat-histogram ensemble for calculating density of states and enhanced sampling in large systems

We presented an efficient algorithm, fast adaptive flat-histogram ensemble (FAFE), to estimate the density of states (DOS) and to enhance sampling in large systems. FAFE calculates the means of an arbitrary extensive variable U in generalized ensembles to form points on the curve {beta}{sub s}(U) {equivalent_to}{partial_derivative}S(U)/frac/{partial_derivative}U, the derivative of the logarithmic DOS. Unlike the popular Wang-Landau-like (WLL) methods, FAFE satisfies the detailed-balance condition through out the simulation and automatically generates non-uniform ({beta}{sub i}, U{sub i}) data points to follow the real change rate of {beta}{sub s}(U) in different U regions and in different systems. Combined with a U-compression transformation, FAFE reduces the required simulation steps from O(N{sup 3/2}) in WLL to O(N{sup 1/2}), where N is the system size. We demonstrate the efficiency of FAFE in Lennard-Jones liquids with several N values. More importantly, we show its abilities in finding and identifying different macroscopic states including meta-stable states in phase co-existing regions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Performance Comparison of Low-Cost Near-Infrared (NIR) Spectrometers to a Conventional Laboratory Spectrometer for Rapid Biomass Compositional Analysis

The performance of a conventional laboratory near-infrared (NIR) spectrometer and two NIR spectrometer prototypes (a Texas Instruments NIRSCAN Nano evaluation model (EVM) and an InnoSpectra NIR-M-R2 spectrometer) are compared by collecting reflectance spectra of 270 well-characterized herbaceous biomass samples, building calibration models using the partial least squares (PLS-2) algorithm to predict five constituents of the samples from the reflectance spectra, and comparing the resulting model statistics. The prediction models developed using spectra from the Foss XDS spectrometer were slightly better than the prediction models developed using spectra from either the TI NIRSCAN Nano EVM and the InnoSpectra NIR-M-R2 as measured by the root mean square error (RMSECV) and the correlation coefficient (R 2 _cv) for “leave-one-out” cross-validation (CV). The models built from the two prototype units were not statistically significantly different from each other (p = 0.05). The Foss spectrometer has a larger wavelength range (400–2500 nm) compared with the two prototypes (900–1700 nm). When the spectra from the Foss XDS spectrometer were truncated so their wavelength range matched the wavelength range of the two prototype units, the resulting model was not statistically significantly different from the models from either prototype.

47 OTHER INSTRUMENTATION↗

POF-Darts: Geometric adaptive sampling for probability of failure

We introduce a novel technique, POF-Darts, to estimate the Probability Of Failure based on random disk-packing in the uncertain parameter space. POF-Darts uses hyperplane sampling to explore the unexplored part of the uncertain space. We use the function evaluation at a sample point to determine whether it belongs to failure or non-failure regions, and surround it with a protection sphere region to avoid clustering. We decompose the domain into Voronoi cells around the function evaluations as seeds and choose the radius of the protection sphere depending on the local Lipschitz continuity. As sampling proceeds, regions uncovered with spheres will shrink, improving the estimation accuracy. After exhausting the function evaluation budget, we build a surrogate model using the function evaluations associated with the sample points and estimate the probability of failure by exhaustive sampling of that surrogate. In comparison to other similar methods, our algorithm has the advantages of decoupling the sampling step from the surrogate construction one, the ability to reach target POF values with fewer samples, and the capability of estimating the number and locations of disconnected failure regions, not just the POF value. Furthermore, we present various examples to demonstrate the efficiency of our novel approach.

97 MATHEMATICS AND COMPUTING↗

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗

Automated Identification of Characteristic Droplet Size Distributions in Stratocumulus Clouds Utilizing a Data Clustering Algorithm

Abstract Droplet-level interactions in clouds are often parameterized by a modified gamma fitted to a “global” droplet size distribution. Do “local” droplet size distributions of relevance to microphysical processes look like these average distributions? This paper describes an algorithm to search and classify characteristic size distributions within a cloud. The approach combines hypothesis testing, specifically, the Kolmogorov–Smirnov (KS) test, and a widely used class of machine learning algorithms for identifying clusters of samples with similar properties: density-based spatial clustering of applications with noise (DBSCAN) is used as the specific example for illustration. The two-sample KS test does not presume any specific distribution, is parameter free, and avoids biases from binning. Importantly, the number of clusters is not an input parameter of the DBSCAN-type algorithms but is independently determined in an unsupervised fashion. As implemented, it works on an abstract space from the KS test results, and hence spatial correlation is not required for a cluster. The method is explored using data obtained from the Holographic Detector for Clouds (HOLODEC) deployed during the Aerosol and Cloud Experiments in the Eastern North Atlantic (ACE-ENA) field campaign. The algorithm identifies evidence of the existence of clusters of nearly identical local size distributions. It is found that cloud segments have as few as one and as many as seven characteristic size distributions. To validate the algorithm’s robustness, it is tested on a synthetic dataset and successfully identifies the predefined distributions at plausible noise levels. The algorithm is general and is expected to be useful in other applications, such as remote sensing of cloud and rain properties. Significance Statement A typical cloud can have billions of drops spread over tens or hundreds of kilometers in space. Keeping track of the sizes, positions, and interactions of all of these droplets is impractical, and, as such, information about the relative abundance of large and small drops is typically quantified with a “size distribution.” Droplets in a cloud interact locally, however, so this work is motivated by the question of whether the cloud droplet size distribution is different in different parts of a cloud. A new method, based on hypothesis testing and machine learning, determines how many different size distributions are contained in a given cloud. This is important because the size distribution describes processes such as cloud droplet growth and light transmission through clouds.

54 ENVIRONMENTAL SCIENCES↗

Model-Based Iterative Reconstruction of Magnetization Using Vector Field Electron Tomography

Vector field electron tomography (VFET) is extensively used for three-dimensional (3-D) imaging of magnetic materials at nanometer resolutions. The conventional approach is to reconstruct and visualize the magnetic vector potential or the magnetic field associated with the sample. There is a lack of algorithms capable of reconstructing the 3-D distribution of magnetization from VFET data. Unlike magnetic vector potential and magnetic field, magnetization is a fundamental physical property of the sample that does not extend beyond the dimensions of the sample. We present a model-based iterative reconstruction algorithm (MBIR) that reconstructs the magnetization by minimizing a cost function consisting of a forward model term and a prior model term. The forward model uses the physics of imaging to model the VFET data as a function of the magnetization, and the prior model enforces sparsity in the magnetization reconstruction. We then formulate an optimization algorithm based on the theory of alternate direction method of multipliers to minimize the resulting MBIR cost function. In conclusion, using simulated and real data, we show that our algorithm accurately reconstructs both the magnetization and the magnetic vector potential.

97 MATHEMATICS AND COMPUTING↗

MO-F-CAMPUS-I-04: Characterization of Fan Beam Coded Aperture Coherent Scatter Spectral Imaging Methods for Differentiation of Normal and Neoplastic Breast Structures

Purpose: This study intends to characterize the spectral and spatial resolution limits of various fan beam geometries for differentiation of normal and neoplastic breast structures via coded aperture coherent scatter spectral imaging techniques. In previous studies, pencil beam raster scanning methods using coherent scatter computed tomography and selected volume tomography have yielded excellent results for tumor discrimination. However, these methods don’t readily conform to clinical constraints; primarily prolonged scan times and excessive dose to the patient. Here, we refine a fan beam coded aperture coherent scatter imaging system to characterize the tradeoffs between dose, scan time and image quality for breast tumor discrimination. Methods: An X-ray tube (125kVp, 400mAs) illuminated the sample with collimated fan beams of varying widths (3mm to 25mm). Scatter data was collected via two linear-array energy-sensitive detectors oriented parallel and perpendicular to the beam plane. An iterative reconstruction algorithm yields images of the sample’s spatial distribution and respective spectral data for each location. To model in-vivo tumor analysis, surgically resected breast tumor samples were used in conjunction with lard, which has a form factor comparable to adipose (fat). Results: Quantitative analysis with current setup geometry indicated optimal performance for beams up to 10mm wide, with wider beams producing poorer spatial resolution. Scan time for a fixed volume was reduced by a factor of 6 when scanned with a 10mm fan beam compared to a 1.5mm pencil beam. Conclusion: The study demonstrates the utility of fan beam coherent scatter spectral imaging for differentiation of normal and neoplastic breast tissues has successfully reduced dose and scan times whilst sufficiently preserving spectral and spatial resolution. Future work to alter the coded aperture and detector geometries could potentially allow the use of even wider fans, thereby making coded aperture coherent scatter imaging a clinically viable method for breast cancer detection. United States Department of Homeland Security; Duke University Medical Center - Department of Radiology; Carl E Ravin Advanced Imaging Laboratories; Duke University Medical Physics Graduate Program.

60 APPLIED LIFE SCIENCES↗

Automatic microseismic event picking via unsupervised machine learning

SUMMARY Effective and efficient arrival picking plays an important role in microseismic and earthquake data processing and imaging. Widely used short-term-average long-term-average ratio (STA/LTA) based arrival picking algorithms suffer from the sensitivity to moderate-to-strong random ambient noise. To make the state-of-the-art arrival picking approaches effective, microseismic data need to be first pre-processed, for example, removing sufficient amount of noise, and second analysed by arrival pickers. To conquer the noise issue in arrival picking for weak microseismic or earthquake event, I leverage the machine learning techniques to help recognizing seismic waveforms in microseismic or earthquake data. Because of the dependency of supervised machine learning algorithm on large volume of well-designed training data, I utilize an unsupervised machine learning algorithm to help cluster the time samples into two groups, that is, waveform points and non-waveform points. The fuzzy clustering algorithm has been demonstrated to be effective for such purpose. A group of synthetic, real microseismic and earthquake data sets with different levels of complexity show that the proposed method is much more robust than the state-of-the-art STA/LTA method in picking microseismic events, even in the case of moderately strong background noise.

Chen, Yangkang↗

The completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey: growth rate of structure measurement from cosmic voids

ABSTRACT We present a void clustering analysis in configuration-space using the completed Sloan Digital Sky Survey IV (SDSS-IV) extended Baryon Oscillation Spectroscopic Survey (eBOSS) DR16 samples. These samples consist of Luminous Red Galaxies (LRGs) combined with the high-redshift tail of the SDSS-III Baryon Oscillation Spectroscopic Survey (BOSS) DR12 CMASS galaxies (called as LRG+CMASS sample), Emission Line Galaxies (ELGs), and quasars (QSOs). We build void catalogues from the three eBOSS DR16 samples using a ZOBOV-based algorithm, providing 2814 voids, 1801 voids, and 4347 voids in the LRG+CMASS, ELG, and QSO samples, respectively, spanning the redshift range 0.6 < z < 2.2. We measure the redshift space distortions around voids using the anisotropic void-galaxy cross-correlation function and we extract the distortion parameter β. We test the methodology on realistic simulations before applying it to the data, and we investigate all our systematic errors on these mocks. We find βLRG(z = 0.74) = 0.415 ± 0.087, βELG(z = 0.85) = 0.665 ± 0.125 and βQSO(z = 1.48) = 0.313 ± 0.134, for the LRG+CMASS, ELG, and QSO sample, respectively. The quoted errors include systematic and statistical contributions. In order to convert our measurements in terms of the growth rate fσ8, we use consensus values of linear bias from the eBOSS DR16 companion papers, resulting in the following constraints: fσ8(z = 0.74) = 0.50 ± 0.11, fσ8(z = 0.85) = 0.52 ± 0.10, and fσ8(z = 1.48) = 0.30 ± 0.13. Our measurements are consistent with other measurements from eBOSS DR16 using conventional clustering techniques.

79 ASTRONOMY AND ASTROPHYSICS↗

Mapping Vegetation at Species Level with High-Resolution Multispectral and Lidar Data Over a Large Spatial Area: A Case Study with Kudzu

Mapping vegetation species is critical to facilitate related quantitative assessment, and mapping invasive plants is important to enhance monitoring and management activities. Integrating high-resolution multispectral remote-sensing (RS) images and lidar (light detection and ranging) point clouds can provide robust features for vegetation mapping. However, using multiple sources of high-resolution RS data for vegetation mapping on a large spatial scale can be both computationally and sampling intensive. Here, we designed a two-step classification workflow to potentially decrease computational cost and sampling effort and to increase classification accuracy by integrating multispectral and lidar data in order to derive spectral, textural, and structural features for mapping target vegetation species. We used this workflow to classify kudzu, an aggressive invasive vine, in the entire Knox County (1362 km2) of Tennessee (U.S.). Object-based image analysis was conducted in the workflow. The first-step classification used 320 kudzu samples and extensive, coarsely labeled samples (based on national land cover) to generate an overprediction map of kudzu using random forest (RF). For the second step, 350 samples were randomly extracted from the overpredicted kudzu and labeled manually for the final prediction using RF and support vector machine (SVM). Computationally intensive features were only used for the second-step classification. SVM had constantly better accuracy than RF, and the producer’s accuracy, user’s accuracy, and Kappa for the SVM model on kudzu were 0.94, 0.96, and 0.90, respectively. SVM predicted 1010 kudzu patches covering 1.29 km2 in Knox County. We found the sample size of kudzu used for algorithm training impacted the accuracy and number of kudzu predicted. The proposed workflow could also improve sampling efficiency and specificity. Our workflow had much higher accuracy than the traditional method conducted in this research, and could be easily implemented to map kudzu in other regions as well as map other vegetation species.

59 BASIC BIOLOGICAL SCIENCES↗

Building Ultra-Low False Alarm Rate Support Vector Classifier Ensembles Using Random Subspaces

This paper presents the Cost-Sensitive Random Subspace Support Vector Classifier (CS-RS-SVC), a new learning algorithm that combines random subspace sampling and bagging with Cost-Sensitive Support Vector Classifiers to more effectively address detection applications burdened by unequal misclassification requirements. When compared to its conventional, non-cost-sensitive counterpart on a two-class signal detection application, random subspace sampling is shown to very effectively leverage the additional flexibility offered by the Cost-Sensitive Support Vector Classifier, yielding a more than four-fold increase in the detection rate at a false alarm rate (FAR) of zero. Moreover, the CS-RS-SVC is shown to be fairly robust to constraints on the feature subspace dimensionality, enabling reductions in computation time of up to 82% with minimal performance degradation.

42 ENGINEERING↗

Interaction networks for the identification of boosted H → $b\overline b$ decays

We develop an algorithm based on an interaction network to identify high-transverse-momentum Higgs bosons decaying to bottom quark-antiquark pairs and distinguish them from ordinary jets that reflect the configurations of quarks and gluons at short distances. The algorithm's inputs are features of the reconstructed charged particles in a jet and the secondary vertices associated with them. Describing the jet shower as a combination of particle-to-particle and particle-to-vertex interactions, the model is trained to learn a jet representation on which the classification problem is optimized. The algorithm is trained on simulated samples of realistic LHC collisions, released by the CMS Collaboration on the CERN Open Data Portal. The interaction network achieves a drastic improvement in the identification performance with respect to state-of-the-art algorithms.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

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↗

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↗