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 1,135 records · Page 63

Preliminary Assessment of Elemental Analysis of X-Ray Fluorescence with Genetic Algorithm

X-ray fluorescence (XRF) spectroscopy is a promising approach to elemental analysis of forensic samples. Elements in the mixture can be identified from the XRF data because chemical elements are associated with unique spectra. This report consists of preliminary assessment of automated identification of unknown mixtures of elements from XRF spectra using a genetic algorithm (GA). The XRF spectra are measured at the Advanced Photon Source (APS) at the liquid-liquid interface during solvent extraction process. Possible advantages of using GA for identifying elements at the interface from XRF data are discussed, and a path for implementation of GA is outlined.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Temperature measurements using multicolor pyrometry in thermal radiation heating environments

Temperature measurements are important for thermal-structural experiments in the thermal radiation heating environments such as used for thermal-structural stress analyses. This paper describes the use of multicolor pyrometry for the measurements of diffuse surfaces in thermal radiation environments that eliminates the effects of background radiation reflections and unknown emissivities based on a least-squares algorithm. The near-infrared multicolor pyrometer had a spectral range of 1100–2400 nm, spectrum resolution of 6 nm, maximum sampling frequency of 2 kHz, working distance of 0.6 m to infinity, temperature range of 700–1700 K. The pyrometer wavelength response, nonlinear intensity response, and spectral response were all calibrated. The temperature of a graphite sample irradiated by quartz lamps was then measured during heating and cooling using the least-squares algorithm based on the calibrated irradiation data. The experiments show that higher temperatures and longer wavelengths are more suitable for the thermal measurements in the quartz lamp radiation heating system. This analysis provides a valuable method for temperature measurements of diffuse surfaces in thermal radiation environments.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Self-tuning control of attitude and momentum management for the Space Station

This paper presents a hybrid state-space self-tuning design methodology using dual-rate sampling for suboptimal digital adaptive control of attitude and momentum management for the Space Station. This new hybrid adaptive control scheme combines an on-line recursive estimation algorithm for indirectly identifying the parameters of a continuous-time system from the available fast-rate sampled data of the inputs and states and a controller synthesis algorithm for indirectly finding the slow-rate suboptimal digital controller from the designed optimal analog controller. The proposed method enables the development of digitally implementable control algorithms for the robust control of Space Station Freedom with unknown environmental disturbances and slowly time-varying dynamics.

Shieh, L. S.↗

Influence of Data Acquisition Algorithms on X-ray Phase Contrast Imaging Computed Tomography

X-ray phase contrast imaging (XPCI) is a non-destructive evaluation technique that enables high-contrast detection of low-attenuation materials that are largely transparent in traditional radiography. Extending a grating based Talbot-Lau XPCI system to three- dimensional imaging with computed tomography (CT) imposes two motion requirements: the analyzer grating must translate transverse to the optical axis to capture image sets for XPCI reconstruction, and the sample must rotate to capture angular data for CT reconstruction. The acquisition algorithm choice determines the order of movement and positioning of the two stages. The choice of image acquisition algorithm for XPCI CT is instrumental to collecting high fidelity data for reconstruction. We investigate how data acquisition influences XPCI CT by comparing two simple data acquisition algorithms and determine that capturing a full phase-stepping image set for a CT projection before rotating the sample results in higher quality data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SU-F-J-23: Field-Of-View Expansion in Cone-Beam CT Reconstruction by Use of Prior Information

Purpose: Cone-beam CT (CBCT) has become an integral part of online patient setup in an image-guided radiation therapy (IGRT). In addition, the utility of CBCT for dose calculation has actively been investigated. However, the limited size of field-of-view (FOV) and resulted CBCT image with a lack of peripheral area of patient body prevents the reliability of dose calculation. In this study, we aim to develop an FOV expanded CBCT in IGRT system to allow the dose calculation. Methods: Three lung cancer patients were selected in this study. We collected the cone-beam projection images in the CBCT-based IGRT system (X-ray volume imaging unit, ELEKTA), where FOV size of the provided CBCT with these projections was 410 × 410 mm{sup 2} (normal FOV). Using these projections, CBCT with a size of 728 × 728 mm{sup 2} was reconstructed by a posteriori estimation algorithm including a prior image constrained compressed sensing (PICCS). The treatment planning CT was used as a prior image. To assess the effectiveness of FOV expansion, a dose calculation was performed on the expanded CBCT image with region-of-interest (ROI) density mapping method, and it was compared with that of treatment planning CT as well as that of CBCT reconstructed by filtered back projection (FBP) algorithm. Results: A posteriori estimation algorithm with PICCS clearly visualized an area outside normal FOV, whereas the FBP algorithm yielded severe streak artifacts outside normal FOV due to under-sampling. The dose calculation result using the expanded CBCT agreed with that using treatment planning CT very well; a maximum dose difference was 1.3% for gross tumor volumes. Conclusion: With a posteriori estimation algorithm, FOV in CBCT can be expanded. Dose comparison results suggested that the use of expanded CBCTs is acceptable for dose calculation in adaptive radiation therapy. This study has been supported by KAKENHI (15K08691).

60 APPLIED LIFE SCIENCES↗

HIERARCHICAL PROBABILISTIC INFERENCE OF COSMIC SHEAR

Point estimators for the shearing of galaxy images induced by gravitational lensing involve a complex inverse problem in the presence of noise, pixelization, and model uncertainties. We present a probabilistic forward modeling approach to gravitational lensing inference that has the potential to mitigate the biased inferences in most common point estimators and is practical for upcoming lensing surveys. The first part of our statistical framework requires specification of a likelihood function for the pixel data in an imaging survey given parameterized models for the galaxies in the images. We derive the lensing shear posterior by marginalizing over all intrinsic galaxy properties that contribute to the pixel data (i.e., not limited to galaxy ellipticities) and learn the distributions for the intrinsic galaxy properties via hierarchical inference with a suitably flexible conditional probabilitiy distribution specification. We use importance sampling to separate the modeling of small imaging areas from the global shear inference, thereby rendering our algorithm computationally tractable for large surveys. With simple numerical examples we demonstrate the improvements in accuracy from our importance sampling approach, as well as the significance of the conditional distribution specification for the intrinsic galaxy properties when the data are generated from an unknown number of distinct galaxy populations with different morphological characteristics.

79 ASTRONOMY AND ASTROPHYSICS↗

Online Learning and Pricing for Service Systems with Reusable Resources

We consider a price-based revenue management problem with finite reusable resources over a finite time horizon T. Customers arrive following a price-dependent Poisson process, and each customer requests one unit of c homogeneous reusable resources. If there is an available unit, the customer gets served within a price-dependent exponentially distributed service time; otherwise, the customer waits in a queue until the next available unit. In this paper, we assume that the firm does not know how the arrival and service rates depend on posted prices, and thus it makes adaptive pricing decisions in each period based only on past observations to maximize the cumulative revenue. Given a discrete price set with cardinality P, we propose two online learning algorithms, termed batch upper confidence bound (BUCB) and batch Thompson sampling (BTS), and prove that the cumulative regret upper bound is O˜(√PT) , which matches the regret lower bound. In establishing the regret, we bound the transient system performance upon price changes via a novel coupling argument, and also generalize bandits to accommodate subexponential rewards. Here, we also extend our approach to models with balking and reneging customers and discuss a continuous price setting. Our numerical experiments demonstrate the efficacy of the proposed BUCB and BTS algorithms.

97 MATHEMATICS AND COMPUTING↗

Computer-aided analysis of Landsat data for surveying Texas coastal zone environments

The feasibility of using machine-aided processing of Landsat data to inventory environmental units was studied by analyzing geometrically corrected and spatially registered Landsat data collected over the Matagorda Bay area of the Texas coastal estuarine system. A clustering algorithm (nonsupervised processor) was used to divide the data into groups of sample points of similar spectral characteristics, and correlation of spectral classes with reference data on a point-to-point basis showed the coastal features exhibit unique spectral variations. Use of a maximum likelihood algorithm permitted discrimination of 13 terrestrial and aquatic environments.

Kristof, S. J.↗

Carrier-to-noise power estimation for the Block 5 Receiver

Two possible algorithms for the carrier to noise power (P sub c/N sub 0) estimation in the Block V Receiver are analyzed and their performances compared. The expected value and the variance of each estimator algorithm are derived. The two algorithms examined are known as the I arm estimator, which relies on samples from only the in-phase arm of the digital phase lock loop, and the IQ arm estimator, which uses both in-phase and quadrature-phase arm signals. The IQ arm algorithm is currently implemented in the Advanced Receiver II (ARX II). Both estimators are biased. The performance degradation due to phase jitter in the carrier tracking loop is taken into account. Curves of the expected value and the signal to noise ratio of the P sub c/N sub 0 estimators vs. actual P sub c/N sub 0 are shown. From this, it is clear that the I arm estimator performs better than the IQ arm estimator when the data to noise power ratio (P sub d/N sub 0) is high, i.e., at high P sub c/N sub 0 values and a significant modulation index. When P sub d/N sub 0 is low, the two estimators have essentially the same performance.

Monk, A. M.↗

Galaxy bias from galaxy–galaxy lensing in the DES science verification data

We present a measurement of galaxy-galaxy lensing around a magnitude-limited ($i_{AB} < 22.5$) sample of galaxies from the Dark Energy Survey Science Verification (DES-SV) data. We split these lenses into three photometric-redshift bins from 0.2 to 0.8, and determine the product of the galaxy bias $b$ and cross-correlation coefficient between the galaxy and dark matter overdensity fields $r$ in each bin, using scales above 4 Mpc/$h$ comoving, where we find the linear bias model to be valid given our current uncertainties. We compare our galaxy bias results from galaxy-galaxy lensing with those obtained from galaxy clustering (Crocce et al. 2016) and CMB lensing (Giannantonio et al. 2016) for the same sample of galaxies, and find our measurements to be in good agreement with those in Crocce et al. (2016), while, in the lowest redshift bin ($z\sim0.3$), they show some tension with the findings in Giannantonio et al. (2016). We measure $b\cdot r$ to be $0.87\pm 0.11$, $1.12 \pm 0.16$ and $1.24\pm 0.23$, respectively for the three redshift bins of width $\Delta z = 0.2$ in the range $0.2<z <0.8$, defined with the photometric-redshift algorithm BPZ. Using a different code to split the lens sample, TPZ, leads to changes in the measured biases at the 10-20\% level, but it does not alter the main conclusion of this work: when comparing with Crocce et al. (2016) we do not find strong evidence for a cross-correlation parameter significantly below one in this galaxy sample, except possibly at the lowest redshift bin ($z\sim 0.3$), where we find $r = 0.71 \pm 0.11$ when using TPZ, and $0.83 \pm 0.12$ with BPZ.

79 ASTRONOMY AND ASTROPHYSICS↗

Initializing BSQ with Open-Source ICCING

While it is well known that there is a significant amount of conserved charges in the initial state of nuclear collisions, the production of these due to gluon splitting has yet to be thoroughly investigated. The ICCING (Initial Conserved Charges in Nuclear Geometry) algorithm reconstructs these quark distributions, providing conserved strange, baryon, and electric charges, by sampling a given model for the g → qq¯ splitting function over the initial energy density, which is valid at top collider energies, even when µB = 0. The ICCING algorithm includes fluctuations in the gluon longitudinal momenta, a structure that supports the implementation of dynamical processes, and the c++ version is now open-source. A full analysis of parameter choices on the model has been done to quantify the effect these have on the underlying physics. We find there is a sustained difference across the different charges that indicates sensitivity to hot spot geometry.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Genetic algorithms as global random search methods

Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that that schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solution and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

Peck, Charles C.↗

Genetic algorithms as global random search methods

Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solutions and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

Peck, Charles C.↗

Preliminary Analysis of Double Shell Tomography Data

In this project we have collaborated with LLNL scientists Dr. Peer-Timo Bremer while performing our research work on algorithmic solutions for geometric processing, image segmentation and data streaming. The main deliverable has been a 3D viewer for high-resolution imaging data with particular focus on the presentation of orthogonal slices of the double shell tomography dataset. Basic probing capabilities allow querying single voxels in the data to study in detail the information presented to the user and compensate for the intrinsic filtering and imprecision due to visualization based on colormaps. On the algorithmic front we have studied the possibility of using of non-local means filtering algorithm to achieve noise removal from tomography data. In particular we have developed a prototype that implements an accelerated version of the algorithm that may be able to take advantage of the multi-resolution sub-sampling of the ViSUS format. We have achieved promising results. Future plans include the full integration of the non-local means algorithm in the ViSUS frameworks and testing if the accelerated method will scale properly from 2D images to 3D tomography data.

99 GENERAL AND MISCELLANEOUS↗

Recent Advancements in Lightning Jump Algorithm Work

In the past year, the primary objectives were to show the usefulness of total lightning as compared to traditional cloud-to-ground (CG) networks, test the lightning jump algorithm configurations in other regions of the country, increase the number of thunderstorms within our thunderstorm database, and to pinpoint environments that could prove difficult for any lightning jump configuration. A total of 561 thunderstorms have been examined in the past year (409 non-severe, 152 severe) from four regions of the country (North Alabama, Washington D.C., High Plains of CO/KS, and Oklahoma). Results continue to indicate that the 2 lightning jump algorithm configuration holds the most promise in terms of prospective operational lightning jump algorithms, with a probability of detection (POD) at 81%, a false alarm rate (FAR) of 45%, a critical success index (CSI) of 49% and a Heidke Skill Score (HSS) of 0.66. The second best performing algorithm configuration was the Threshold 4 algorithm, which had a POD of 72%, FAR of 51%, a CSI of 41% and an HSS of 0.58. Because a more complex algorithm configuration shows the most promise in terms of prospective operational lightning jump algorithms, accurate thunderstorm cell tracking work must be undertaken to track lightning trends on an individual thunderstorm basis over time. While these numbers for the 2 configuration are impressive, the algorithm does have its weaknesses. Specifically, low-topped and tropical cyclone thunderstorm environments are present issues for the 2 lightning jump algorithm, because of the suppressed vertical depth impact on overall flash counts (i.e., a relative dearth in lightning). For example, in a sample of 120 thunderstorms from northern Alabama that contained 72 missed events by the 2 algorithm 36% of the misses were associated with these two environments (17 storms).

Schultz, Christopher J.↗

redMaGiC: Selecting luminous red galaxies from the DES Science Verification data

Here, we introduce redMaGiC, an automated algorithm for selecting luminous red galaxies (LRGs). The algorithm was specifically developed to minimize photometric redshift uncertainties in photometric large-scale structure studies. redMaGiC achieves this by self-training the colour cuts necessary to produce a luminosity-thresholded LRG sample of constant comoving density. We demonstrate that redMaGiC photo-zs are very nearly as accurate as the best machine learning-based methods, yet they require minimal spectroscopic training, do not suffer from extrapolation biases, and are very nearly Gaussian. We apply our algorithm to Dark Energy Survey (DES) Science Verification (SV) data to produce a redMaGiC catalogue sampling the redshift range z ϵ [0.2, 0.8]. Our fiducial sample has a comoving space density of 10 –3 (h –1 Mpc) –3 , and a median photo-z bias (zspec – zphoto) and scatter (σz/(1 + z)) of 0.005 and 0.017, respectively. The corresponding 5σ outlier fraction is 1.4 per cent. We also test our algorithm with Sloan Digital Sky Survey Data Release 8 and Stripe 82 data, and discuss how spectroscopic training can be used to control photo-z biases at the 0.1 per cent level.

79 ASTRONOMY AND ASTROPHYSICS↗

A hybrid reconstruction algorithm for fast and accurate 4D cone-beam CT imaging

Purpose: 4D cone beam CT (4D-CBCT) has been utilized in radiation therapy to provide 4D image guidance in lung and upper abdomen area. However, clinical application of 4D-CBCT is currently limited due to the long scan time and low image quality. The purpose of this paper is to develop a new 4D-CBCT reconstruction method that restores volumetric images based on the 1-min scan data acquired with a standard 3D-CBCT protocol. Methods: The model optimizes a deformation vector field that deforms a patient-specific planning CT (p-CT), so that the calculated 4D-CBCT projections match measurements. A forward-backward splitting (FBS) method is invented to solve the optimization problem. It splits the original problem into two well-studied subproblems, i.e., image reconstruction and deformable image registration. By iteratively solving the two subproblems, FBS gradually yields correct deformation information, while maintaining high image quality. The whole workflow is implemented on a graphic-processing-unit to improve efficiency. Comprehensive evaluations have been conducted on a moving phantom and three real patient cases regarding the accuracy and quality of the reconstructed images, as well as the algorithm robustness and efficiency. Results: The proposed algorithm reconstructs 4D-CBCT images from highly under-sampled projection data acquired with 1-min scans. Regarding the anatomical structure location accuracy, 0.204 mm average differences and 0.484 mm maximum difference are found for the phantom case, and the maximum differences of 0.3–0.5 mm for patients 1–3 are observed. As for the image quality, intensity errors below 5 and 20 HU compared to the planning CT are achieved for the phantom and the patient cases, respectively. Signal-noise-ratio values are improved by 12.74 and 5.12 times compared to results from FDK algorithm using the 1-min data and 4-min data, respectively. The computation time of the algorithm on a NVIDIA GTX590 card is 1–1.5 min per phase. Conclusions: High-quality 4D-CBCT imaging based on the clinically standard 1-min 3D CBCT scanning protocol is feasible via the proposed hybrid reconstruction algorithm.

60 APPLIED LIFE SCIENCES↗

Random sampling of the Green’s Functions for reversible reactions with an intermediate state

Exact random variate generators were developed to sample Green’s functions used in Brownian Dynamics (BD) algorithms for the simulations of chemical systems. These algorithms, which use less than a kilobyte of memory, provide a useful alternative to the table look-up method that has been used in similar work. The cases that are studied with this approach are (1) diffusion-influenced reactions; (2) reversible diffusion-influenced reactions and (3) reactions with an intermediate state such as enzymatic catalysis. The results are validated by comparison with those obtained by the Independent Reaction Times (IRT) method. This work is part of our effort in developing models to understand the role of radiation chemistry in the radiation effects on human body and may eventually be included in event-based models of space radiation risk.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗