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 703 records · Page 39

Jitter Correction

Jitter_Correct.m is a MATLAB function that automatically measures and corrects inter-frame jitter in an image sequence to a user-specified precision. In addition, the algorithm dynamically adjusts the image sample size to increase the accuracy of the measurement. The Jitter_Correct.m function takes an image sequence with unknown frame-to-frame jitter and computes the translations of each frame (column and row, in pixels) relative to a chosen reference frame with sub-pixel accuracy. The translations are measured using a Cross Correlation Fourier transformation method in which the relative phase of the two transformed images is fit to a plane. The measured translations are then used to correct the inter-frame jitter of the image sequence. The function also dynamically expands the image sample size over which the cross-correlation is measured to increase the accuracy of the measurement. This increases the robustness of the measurement to variable magnitudes of inter-frame jitter

Waegell, Mordecai J.↗

NASA Tech Briefs, June 2012

Topics covered include: iGlobe Interactive Visualization and Analysis of Spatial Data; Broad-Bandwidth FPGA-Based Digital Polyphase Spectrometer; Small Aircraft Data Distribution System; Earth Science Datacasting v2.0; Algorithm for Compressing Time-Series Data; Onboard Science and Applications Algorithm for Hyperspectral Data Reduction; Sampling Technique for Robust Odorant Detection Based on MIT RealNose Data; Security Data Warehouse Application; Integrated Laser Characterization, Data Acquisition, and Command and Control Test System; Radiation-Hard SpaceWire/Gigabit Ethernet-Compatible Transponder; Hardware Implementation of Lossless Adaptive Compression of Data From a Hyperspectral Imager; High-Voltage, Low-Power BNC Feedthrough Terminator; SpaceCube Mini; Dichroic Filter for Separating W-Band and Ka-Band; Active Mirror Predictive and Requirement Verification Software (AMP-ReVS); Navigation/Prop Software Suite; Personal Computer Transport Analysis Program; Pressure Ratio to Thermal Environments; Probabilistic Fatigue Damage Program (FATIG); ASCENT Program; JPL Genesis and Rapid Intensification Processes (GRIP) Portal; Data::Downloader; Fault Tolerance Middleware for a Multi-Core System; DspaceOgreTerrain 3D Terrain Visualization Tool; Trick Simulation Environment 07; Geometric Reasoning for Automated Planning; Water Detection Based on Color Variation; Single-Layer, All-Metal Patch Antenna Element with Wide Bandwidth; Scanning Laser Infrared Molecular Spectrometer (SLIMS); Next-Generation Microshutter Arrays for Large-Format Imaging and Spectroscopy; Detection of Carbon Monoxide Using Polymer-Composite Films with a Porphyrin-Functionalized Polypyrrole; Enhanced-Adhesion Multiwalled Carbon Nanotubes on Titanium Substrates for Stray Light Control; Three-Dimensional Porous Particles Composed of Curved, Two-Dimensional, Nano-Sized Layers for Li-Ion Batteries 23 Ultra-Lightweight; and Ultra-Lightweight Nanocomposite Foams and Sandwich Structures for Space Structure Applications.

Source record↗

Recent Advances in SMAP RFI Processing

The measurements made by the Soil Moisture Active/Passive (SMAP) mission are affected by the presence of Radio Frequency Interference (RFI) in the protected 1400-1427 MHz band. In SMAP data processing, the main protection against RFI is a sophisticated RFI detection algorithm which flags sub-samples in time and frequency that are contaminated by RFI and removes them before estimating the brightness temperature. This contribution presents two additional approaches that have been developed to address the RFI concern in SMAP. The first consists in locating sources of RFI; once located, it becomes possible to report RFI sources to spectrum management authorities, which can lead to less RFI being experienced by SMAP in the future. The second is a new RFI detection method that is based on detecting outliers in the spatial distribution of measured antenna temperatures.

Radio Frequency Interference↗

Single-Turnover Variable Chlorophyll Fluorescence as a Tool for Assessing Phytoplankton Photosynthesis and Primary Productivity: Opportunities, Caveats and Recommendations

Phytoplankton photosynthetic physiology can be investigated through single-turnover variable chlorophyll fluorescence (ST-ChlF) approaches, which carry unique potential to autonomously collect data at high spatial and temporal resolution. Over the past decades, significant progress has been made in the development and application of ST-ChlF methods in aquatic ecosystems, and in the interpretation of the resulting observations. At the same time, however, an increasing number of sensor types, sampling protocols, and data processing algorithms have created confusion and uncertainty among potential users, with a growing divergence of practice among different research groups. In this review, we assist the existing and upcoming user community by providing an overview of current approaches and consensus recommendations for the use of ST-ChlF measurements to examine in-situ phytoplankton productivity and photo-physiology. We argue that a consistency of practice and adherence to basic operational and quality control standards is critical to ensuring data inter-comparability. Large datasets of inter-comparable and globally coherent ST-ChlF observations hold the potential to reveal large-scale patterns and trends in phytoplankton photo-physiology, photosynthetic rates and bottom-up controls on primary productivity. As such, they hold great potential to provide invaluable physiological observations on the scales relevant for the development and validation of ecosystem models and remote sensing algorithms.

variable chlorophyll fluorescence↗

Estimating Cosmological Constraints from Galaxy Cluster Abundance using Simulation-Based Inference

Inferring the values and uncertainties of cosmological parameters in a cosmology model is of paramount importance for modern cosmic observations. In this paper, we use the simulation-based inference (SBI) approach to estimate cosmological constraints from a simplified galaxy cluster observation analysis. Using data generated from the Quijote simulation suite and analytical models, we train a machine learning algorithm to learn the probability function between cosmological parameters and the possible galaxy cluster observables. The posterior distribution of the cosmological parameters at a given observation is then obtained by sampling the predictions from the trained algorithm. Our results show that the SBI method can successfully recover the truth values of the cosmological parameters within the 2σ limit for this simplified galaxy cluster analysis, and acquires similar posterior constraints obtained with a likelihood-based Markov Chain Monte Carlo method, the current state-of the-art method used in similar cosmological studies.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions

We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equilibrium measure of the parametric domain and subsequently solves a preconditioned $\ell^1$-minimization problem, where the weights of the diagonal preconditioning matrix are given by evaluations of the Christoffel function. Our algorithm can be applied to a wide class of orthogonal polynomial families on bounded and unbounded domains, including all classical families. We present theoretical analysis to motivate the algorithm and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest. In conclusion, numerical examples are also provided to demonstrate that our proposed algorithm leads to comparable or improved accuracy even when compared with Legendre- and Hermite-specific algorithms.

97 MATHEMATICS AND COMPUTING↗

Estimating consistent biased source probabilities over arbitrary bins - 25621

This paper describes computational algorithms for estimating consistent biased source probabilities for the CADIS and FW-CADIS methods that are compatible with most of the general fixed-source capabilities of the MCNP continuous-energy transport code. The basic algorithm is a novel Monte Carlo sampling technique that enables the straightforward estimation of biased source probabilities over arbitrarily complex distribution trees. In recent work, a method has been developed for generating correct biased spatial source probabilities in the presence of rejection from an arbitrary number of geometry cells. Two numerical test problems that demonstrate the correctness of this new algorithm are presented, including a simplified model of a cooling water system with an N-17 neutron source. (authors)

07 ISOTOPE AND RADIATION SOURCES↗

Adaptive Sampling of Large Deviations

We introduce and test an algorithm that adaptively estimates large deviation functions characterizing the fluctuations of additive functionals of Markov processes in the long-time limit. These functions play an important role for predicting the probability and pathways of rare events in stochastic processes, as well as for understanding the physics of nonequilibrium systems driven in steady states by external forces and reservoirs. The algorithm uses methods from risk-sensitive and feedback control to estimate from a single trajectory a new process, called the driven process, known to be efficient for importance sampling. Its advantages compared to other simulation techniques, such as splitting or cloning, are discussed and illustrated with simple equilibrium and nonequilibrium diffusion models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast and stable recursive algorithms for continuous-time and discrete-time model conversions

Based on the Newton-Raphson method, this paper presents recursive algorithms that are rapidly convergent and more stable for modeling the equivalent continuous-time (discrete-time) model from the available discrete-time (continuous-time) model for a fixed sampling period. The newly developed recursive algorithms relax the constraints imposed upon the existing model conversion algorithms, and, thus, enhance the applications of microprocessors and associated microelectronics to digital control systems. A practical example is presented to demonstrate the effectiveness of the proposed procedures.

Shieh, L. S.↗

Simulation and performance of an artificial retina for 40 MHz track reconstruction

We present the results of a detailed simulation of the artificial retina pattern-recognition algorithm, designed to reconstruct events with hundreds of charged-particle tracks in pixel and silicon detectors at LHCb with LHC crossing frequency of 40 MHz. Performances of the artificial retina algorithm are assessed using the official Monte Carlo samples of the LHCb experiment. We found performances for the retina pattern-recognition algorithm comparable with the full LHCb reconstruction algorithm.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

MicroShield/ISOCS gamma modeling comparison.

Quantitative radiological analysis attempts to determine the quantity of activity or concentration of specific radionuclide(s) in a sample. Based upon the certified standards that are used to calibrate gamma spectral detectors, geometric similarities between sample shape and the calibration standards determine if the analysis results developed are qualitative or quantitative. A sample analyzed that does not mimic a calibrated sample geometry must be reported as a non-standard geometry and thus the results are considered qualitative and not quantitative. MicroShieldR or ISOCSR calibration software can be used to model non-standard geometric sample shapes in an effort to obtain a quantitative analytical result. MicroShieldR and Canberra s ISOCSR software contain several geometry templates that can provide accurate quantitative modeling for a variety of sample configurations. Included in the software are computational algorithms that are used to develop and calculate energy efficiency values for the modeled sample geometry which can then be used with conventional analysis methodology to calculate the result. The response of the analytical method and the sensitivity of the mechanical and electronic equipment to the radionuclide of interest must be calibrated, or standardized, using a calibrated radiological source that contains a known and certified amount of activity.

Sansone, Kenneth R↗

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗

Coupling relativistic viscous hydrodynamics to Boltzmann descriptions

Models of relativistic heavy-ion collisions typically involve both a hydrodynamic module to describe the high-density liquidlike phase and a Boltzmann module to simulate the low-density breakup phase, which is gaslike. Coupling the prescriptions is more complicated for viscous prescriptions if one wants to maintain continuity of the entire stress-energy tensor and currents. Derivations for the viscosity for a gas are reviewed, which then lead to expressions for changes in the phase-space occupation based on simple relaxation-time pictures of viscosity. These expressions are shown to consistently reproduce the nonequilibrium components of the stress-energy tensor. An algorithm for generating a Monte Carlo sampling of particles with which to initiate the Boltzmann calculations is also presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

How Sample Completeness Affects Gamma-Ray Burst Classification

Unsupervised pattern-recognition algorithms support the existence of three gamma-ray burst classes: class 1 (long, large-fluence bursts of intermediate spectral hardness), class 2 (short, small-fluence, hard bursts), and class 3 (soft bursts of intermediate durations and fluences). The algorithms surprisingly assign larger membership to class 3 than to either of the other two classes. A known systematic bias has been previously used to explain the existence of class 3 in terms of class 1 ; this bias allows the fluences and durations of some bursts to be underestimated, as recently shown by Hakkila et al. We show that this bias primarily affects only the longest bursts and cannot explain the bulk of the class 3 properties. We resolve the question of class 3's existence by demonstrating how samples obtained using standard trigger mechanisms fail to preserve the duration characteristics of small-peak flux bursts. Sample incompleteness is thus primarily responsible for the existence of class 3. In order to avoid this incompleteness, we show how a new, dual-timescale peak flux can be defined in terms of peak flux and fluence. The dual-timescale peak flux preserves the duration distribution of faint bursts and correlates better with spectral hardness (and presumably redshift) than either peak flux or fluence. The techniques presented here are generic and have applicability to the studies of other transient events. The results also indicate that pattern recognition algorithms are sensitive to sample completeness; this can influence the study of large astronomical databases, such as those found in a virtual observatory.

Hakkila, Jon↗

Total variation-based neutron computed tomography

We perform the neutron computed tomography reconstruction problem via an inverse problem formulation with a total variation penalty. In the case of highly under-resolved angular measurements, the total variation penalty suppresses high-frequency artifacts which appear in filtered back projections. Here, in order to efficiently compute solutions for this problem, we implement a variation of the split Bregman algorithm; due to the error-forgetting nature of the algorithm, the computational cost of updating can be significantly reduced via very inexact approximate linear solvers. We present the effectiveness of the algorithm in the significantly low-angular sampling case using synthetic test problems as well as data obtained from a high flux neutron source. Finally, the algorithm removes artifacts and can even roughly capture small features when an extremely low number of angles are used.

97 MATHEMATICS AND COMPUTING↗

Simultaneous beam sampling and aperture shape optimization for SPORT

Purpose: Station parameter optimized radiation therapy (SPORT) was recently proposed to fully utilize the technical capability of emerging digital linear accelerators, in which the station parameters of a delivery system, such as aperture shape and weight, couch position/angle, gantry/collimator angle, can be optimized simultaneously. SPORT promises to deliver remarkable radiation dose distributions in an efficient manner, yet there exists no optimization algorithm for its implementation. The purpose of this work is to develop an algorithm to simultaneously optimize the beam sampling and aperture shapes. Methods: The authors build a mathematical model with the fundamental station point parameters as the decision variables. To solve the resulting large-scale optimization problem, the authors devise an effective algorithm by integrating three advanced optimization techniques: column generation, subgradient method, and pattern search. Column generation adds the most beneficial stations sequentially until the plan quality improvement saturates and provides a good starting point for the subsequent optimization. It also adds the new stations during the algorithm if beneficial. For each update resulted from column generation, the subgradient method improves the selected stations locally by reshaping the apertures and updating the beam angles toward a descent subgradient direction. The algorithm continues to improve the selected stations locally and globally by a pattern search algorithm to explore the part of search space not reachable by the subgradient method. By combining these three techniques together, all plausible combinations of station parameters are searched efficiently to yield the optimal solution. Results: A SPORT optimization framework with seamlessly integration of three complementary algorithms, column generation, subgradient method, and pattern search, was established. The proposed technique was applied to two previously treated clinical cases: a head and neck and a prostate case. It significantly improved the target conformality and at the same time critical structure sparing compared with conventional intensity modulated radiation therapy (IMRT). In the head and neck case, for example, the average PTV coverage D99% for two PTVs, cord and brainstem max doses, and right parotid gland mean dose were improved, respectively, by about 7%, 37%, 12%, and 16%. Conclusions: The proposed method automatically determines the number of the stations required to generate a satisfactory plan and optimizes simultaneously the involved station parameters, leading to improved quality of the resultant treatment plans as compared with the conventional IMRT plans.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Metropolis-style random sampling of quantum gates for the estimation of low-energy observables

In this work, we propose a quantum algorithm to compute low-energy expectation values of a quantum Hamiltonian by sampling a partition function associated with the average energy of that Hamiltonian. For any given quantum circuit-Hamiltonian pair, there is an associated average energy. The sampling is done through an accept/reject Metropolis-style algorithm on the quantum gates of the circuit itself. Observables calculated under the canonical ensemble from these samples of circuits are extrapolated from higher energies to the ground state.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The development of PIPA: an integrated and automated pipeline for genome-wide protein function annotation

Background: Automated protein function prediction methods are needed to keep pace with high-throughput sequencing. With the existence of many programs and databases for inferring different protein functions, a pipeline that properly integrates these resources will benefit from the advantages of each method. However, integrated systems usually do not provide mechanisms to generate customized databases to predict particular protein functions. Here, we describe a tool termed PIPA (Pipeline for Protein Annotation) that has these capabilities. Results: PIPA annotates protein functions by combining the results of multiple programs and databases, such as InterPro and the Conserved Domains Database, into common Gene Ontology (GO) terms. The major algorithms implemented in PIPA are: (1) a profile database generation algorithm, which generates customized profile databases to predict particular protein functions, (2) an automated ontology mapping generation algorithm, which maps various classification schemes into GO, and (3) a consensus algorithm to reconcile annotations from the integrated programs and databases. PIPA's profile generation algorithm is employed to construct the enzyme profile database CatFam, which predicts catalytic functions described by Enzyme Commission (EC) numbers. Validation tests show that CatFam yields average recall and precision larger than 95.0%. CatFam is integrated with PIPA. We use an association rule mining algorithm to automatically generate mappings between terms of two ontologies from annotated sample proteins. Incorporating the ontologies' hierarchical topology into the algorithm increases the number of generated mappings. In particular, it generates 40.0% additional mappings from the Clusters of Orthologous Groups (COG) to EC numbers and a six-fold increase in mappings from COG to GO terms. The mappings to EC numbers show a very high precision (99.8%) and recall (96.6%), while the mappings to GO terms show moderate precision (80.0%) and low recall (33.0%). Our consensus algorithm for GO annotation is based on the computation and propagation of likelihood scores associated with GO terms. The test results suggest that, for a given recall, the application of the consensus algorithm yields higher precision than when consensus is not used. Conclusion: The algorithms implemented in PIPA provide automated genome-wide protein function annotation based on reconciled predictions from multiple resources.

59 BASIC BIOLOGICAL SCIENCES↗