Search NASA⌕ Search

SEARCH · Search NASA

Results for “Statistical 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 415 records · Page 23

Design of partially supervised classifiers for multispectral image data

A partially supervised classification problem is addressed, especially when the class definition and corresponding training samples are provided a priori only for just one particular class. In practical applications of pattern classification techniques, a frequently observed characteristic is the heavy, often nearly impossible requirements on representative prior statistical class characteristics of all classes in a given data set. Considering the effort in both time and man-power required to have a well-defined, exhaustive list of classes with a corresponding representative set of training samples, this 'partially' supervised capability would be very desirable, assuming adequate classifier performance can be obtained. Two different classification algorithms are developed to achieve simplicity in classifier design by reducing the requirement of prior statistical information without sacrificing significant classifying capability. The first one is based on optimal significance testing, where the optimal acceptance probability is estimated directly from the data set. In the second approach, the partially supervised classification is considered as a problem of unsupervised clustering with initially one known cluster or class. A weighted unsupervised clustering procedure is developed to automatically define other classes and estimate their class statistics. The operational simplicity thus realized should make these partially supervised classification schemes very viable tools in pattern classification.

Jeon, Byeungwoo↗

Updated MISR Dark Water Research Aerosol Retrieval Algorithm - Part 1: Coupled 1.1 km Ocean Surface Chlorophyll a Retrievals with Empirical Calibration Corrections

As aerosol amount and type are key factors in the 'atmospheric correction' required for remote-sensing chlorophyll alpha concentration (Chl) retrievals, the Multi-angle Imaging SpectroRadiometer (MISR) can contribute to ocean color analysis despite a lack of spectral channels optimized for this application. Conversely, an improved ocean surface constraint should also improve MISR aerosol-type products, especially spectral single-scattering albedo (SSA) retrievals. We introduce a coupled, self-consistent retrieval of Chl together with aerosol over dark water. There are time-varying MISR radiometric calibration errors that significantly affect key spectral reflectance ratios used in the retrievals. Therefore, we also develop and apply new calibration corrections to the MISR top-of-atmosphere (TOA) reflectance data, based on comparisons with coincident MODIS (Moderate Resolution Imaging Spectroradiometer) observations and trend analysis of the MISR TOA bidirectional reflectance factors (BRFs) over three pseudo-invariant desert sites. We run the MISR research retrieval algorithm (RA) with the corrected MISR reflectances to generate MISR-retrieved Chl and compare the MISR Chl values to a set of 49 coincident SeaBASS (SeaWiFS Bio-optical Archive and Storage System) in situ observations. Where Chl(sub in situ) less than 1.5 mg m(exp -3), the results from our Chl model are expected to be of highest quality, due to algorithmic assumption validity. Comparing MISR RA Chl to the 49 coincident SeaBASS observations, we report a correlation coefficient (r) of 0.86, a root-mean-square error (RMSE) of 0.25, and a median absolute error (MAE) of 0.10. Statistically, a two-sample Kolmogorov- Smirnov test indicates that it is not possible to distinguish between MISR Chl and available SeaBASS in situ Chl values (p greater than 0.1). We also compare MODIS-Terra and MISR RA Chl statistically, over much broader regions. With about 1.5 million MISR-MODIS collocations having MODIS Chl less than 1.5 mg m(exp -3), MISR and MODIS show very good agreement: r = 0.96, MAE = 0.09, and RMSE = 0.15. The new dark water aerosol/Chl RA can retrieve Chl in low-Chl, case I waters, independent of other imagers such as MODIS, via a largely physical algorithm, compared to the commonly applied statistical ones. At a minimum, MISR's multi-angle data should help reduce uncertainties in the MODIS-Terra ocean color retrieval where coincident measurements are made, while also allowing for a more robust retrieval of particle properties such as spectral single-scattering albedo.

Limbacher, James A.↗

Predicting Flow in Fracture Networks With Quantum Algorithms

Uncertainty quantification plays a crucial role in the modeling of subsurface flow. For instance, uncertainties in the properties of geologic fracture networks significantly impact flow, requiring numerous simulations to accurately estimate quantities of interest. However, each simulation is computationally expensive because it requires solving a large linear system to capture features that involve both small and large fractures. An example is in percolation, where the interaction of many small fractures (which cumulatively can have a large surface area) with the rock matrix must be modeled precisely. Quantum computing is an emerging tool with the potential to address this issue. Quantum algorithms offer a significant speedup in solving linear systems, achieving efficiencies that are challenging to match with classical approaches. These classical approaches include direct solvers, such as LU decomposition, and iterative methods, notably preconditioned conjugate gradient, commonly used in subsurface modeling to solve large sparse systems. However, applying quantum algorithms to geologic fracture flow requires careful attention to algorithmic and problem-specific constraints to fully realize this quantum advantage. In this work we describe a quantum algorithm for generalized Monte Carlo applications with a quadratic speedup over the classical approaches which can be combined with the quantum speedup, currently under investigation, for solving quantum linear systems for subsurface flow. We show that for quantum algorithms the computational cost of estimating a quantity of interest for a statistical ensemble of networks is roughly the same as that of a single realization, essentially implying that one can get uncertainty quantification for free.

58 GEOSCIENCES↗

A Quantum Leap for Dynamic Radiography

Dynamic radiography techniques have been instrumental in advancing the National Nuclear Security Administration's (NNSA) mission since WWII. This paper explores the transformative potential of quantum information science (QIS) to revolutionize dynamic radiography through enhanced image processing, tomographic reconstruction, statistics and uncertainty quantification (UQ), and artificial intelligence integration. By leveraging quantum algorithms to extract previously inaccessible information from existing datasets, this interdisciplinary approach promises unprecedented insights at the intersection of dynamic imaging, artificial intelligence, and quantum information technologies.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Characterization of surficial geologic units on Venus from Pioneer Venus radar data: A progress report

A classification database using the reflectivity (derived from the altimetry data), rms slope, and the first principal component of altimetry and topographic slope is presented. The resultant clustered data is examined qualitatively as well as quantitatively, to establish the statistical integrity of each cluster by use of an interactive, ternary plotting algorithm. This algorithm plots, for a cluster, the position of each of its pixels within a ternary diagram whose apices represent reflectivity, rms slope, and the first principal component. The digital values in these three databases are normalized such that unity is represented by a value of 255 in each database. The frequencies of each plotted point within the ternary diagram are recorded in order to establish the mode of each cluster. The pixels of each cluster are displayed as one separate color; their ternary plot will show not only the interrelations between clusters, but also the presence of any anomalous points within a cluster. Existing lunar and terrestrial analog radar data is used to establish fields within this ternary diagram that are indicative of as many different geologic materials and tectonics settings as possible. The resultant fields are used to determine empirically the geologic significance of the clusters resulting from the cluster analysis.

Davis, P. A.↗

The effect of limiting aerodynamic and structural coupling in models of mistuned bladed disk vibration

A model has been developed for studying the effect of mistuning on bladed disk vibration which has the unique feature that the extent of aerodynamic and structural interaction which it simulates can be readily varied from full coupling of all blades on the disk to coupling of each blade with only its nearest neighbors. Simulations utilizing the resulting algorithm show that limited coupling models may be used to predict the statistical distribution of blade amplitudes that characterizes the mistuning effect, which in turn determines stage durability. This approach is used to study the effect of changing various system parameters on amplitude scatter. Gas density, the number of blades on the disk, disk stiffness, and the engine order of the excitation are considered. The results are used to draw some conclusions about how to improve laboratory tests and component design.

Basu, P.↗

Maximum likelihood classification of synthetic aperture radar imagery

Classification of synthetic aperture radar (SAR) images has important applications in geology, agriculture, and the military. A statistical model for SAR images is reviewed and a maximum likelihood classification algorithm developed for the classification of agricultural fields based on the model. It is first assumed that the target feature information is known a priori. The performance of the algorithm is then evaluated in terms of the probability of incorrect classification. A technique is also presented to extract the needed feature information from a SAR image; then both the feature extraction and the maximum likelihood classification algorithms are tested on a SEASAT-A SAR image.

Frost, V. S.↗

A Scanning Hartmann Focus Test for the EUVI Telescopes aboard STEREO

The Solar TErrestrial RElations Observatory (STEREO), the third mission in NASA's Solar Terrestrial Probes program, was launched in 2006 on a two year mission to study solar phenomena. STEREO consists of two nearly identical satellites, each carrying an Extreme Ultraviolet Imager (EUVI) telescope as part of the Sun Earth Connection Coronal and Heliospheric Investigation instrument suite. EUVI is a normal incidence, 98mm diameter, Ritchey-Chretien telescope designed to obtain wide field of view images of the Sun at short wavelengths (17.1-30.4nm) using a CCD detector. The telescope entrance aperture is divided into four quadrants by a mask near the secondary mirror spider veins. A mechanism that rotates another mask allows only one of these sub-apertures to accept light over an exposure. The EUVI contains no focus mechanism. Mechanical models predict a difference in telescope focus between ambient integration conditions and on-orbit operation. We describe an independent check of the ambient, ultraviolet, absolute focus setting of the EUVI telescopes after they were integrated with their respective spacecraft. A scanning Hartmann-like test design resulted from constraints implied by the EUVI aperture select mechanism. This inexpensive test was simultaneously coordinated with other NASA integration and test activities in a high-vibration, clean room environment. The total focus test error was required to be better than +/-0.05 mm. We describe the alignment and test procedure, sources of statistical and systematic error, and then the focus determination results using various algorithms. The results are consistent with other tests of focus alignment and indicate that the EUVI telescopes meet the ambient focus offset requirements. STEREO is functioning well on-orbit and the EUVI telescopes meet their on-orbit image quality requirements.

Ohl, Ray↗

Understanding Local Structure Globally in Earth Science Remote Sensing Data Sets

Empirical probability distributions derived from the data are the signatures of physical processes generating the data. Distributions defined on different space-time windows can be compared and differences or changes can be attributed to physical processes. This presentation discusses on ways to reduce remote sensing data in a way that preserves information, focusing on the rate-distortion theory and using the entropy-constrained vector quantization algorithm.

massive data sets↗

Estimating Uncertainties in the Multi-Instrument SBUV Profile Ozone Merged Data Set

The MOD data set is uniquely qualified for use in long-term ozone analysis because of its long record, high spatial coverage, and consistent instrument design and algorithm. The estimated MOD uncertainty term significantly increases the uncertainty over the statistical error alone. Trends in the post-2000 period are generally positive in the upper stratosphere, but only significant at 1-1.6 hPa. Remaining uncertainties not yet included in the Monte Carlo model are Smoothing Error ( 1 from 10 to 1 hPa) Relative calibration uncertainty between N11 and N17Seasonal cycle differences between SBUV records.

Uncertainties↗

On the Use of Complexity Algorithms: a Cautionary Lesson from Climate Research

Complexity algorithms provide information about datasets which is radically different from classical moment statistics. Instead of focusing on the divergences from central values, they quantify other characteristics such as order, pattern repetitions, or the existence of attractors. However, those analyses must be done with the proper statistical treatment, which is, unfortunately, not always the case. In this contribution, I provide an example of the hazards of applying complexity measures without sufficient care by correcting a previously published analysis that aimed to quantify the complexity of climate. I clarify some misconceptions about the use of Sample Entropy and revise the incorrect assessments and conclusions drawn from the previous misapplication of the methods.

Delgado-Bonal, Alfonso↗

The coverage of elliptical orbits using Ergodic theory

One of the key performance metrics for satellite constellations is the statistics of the visibility periods between the satellites and poins on the ground. Associated with this are other desirable communications statistis such as data through-put, link qualities, etc. Typically, the computation of coverage statistics requires the propagation of the trajectories. In this paper a new algorithm using differential geometry enables us to extend the Ergodic theory to eliptical orbits.

Lo, Martin W.↗

BEAM Technology Flight Demonstration

As technologies advance, their growing complexity makes them harder to maintain. Detection methods for isolating and identifying impending problems are needed to balance this complexity. Through comparison of signal pairs from onboard sensors, the Beacon-based Exception Analysis For Multimissions (BEAM) algorithm can identify and help classify deviations in system operation from a data-trained statistical model. The goal of this task is to mature BEAM and validate its performance on a flying test bed. A series of F-18 flight demonstrations with BEAM monitoring engine parameters in real time was used to demonstrate in-the-field readiness. Captured F-18 and simulated F-18 engine data were used in model creation and training. The algorithm was then ported to the embedded system with a data buffering, file writing, and data-time-stamp monitoring shell to reduce the impact of embedded system faults on BEAM'S ability to correctly identify engine faults. Embedded system testing identified hardware related restrictions and contributed to iterative improvements in the code's runtime performance. The system was flown with forced engine flameouts and other pilot induced faults to simulate operation out of the norm. Successful detection of these faults, confirmed through post-flight data analysis, helped BEAM achieve TRL6.

Wang, David↗

A constrained discrete optimal guidance strategy for low-thrust space flight

A low-thrust guidance algorithm suitable for operational use is formulated. Using linear stochastic control theory, a linear feedback control law is obtained for a minimum terminal miss performance criterion. The control variables are restricted to constant values over specified time intervals and are explicitly limited. Both fixed and variable time-of-arrival guidance are considered. Guidance equations are presented in deterministic (operational) and in statistical form; and computational procedures necessary for implementation are outlined. The performance of the guidance algorithm is evaluated by applying it to the approach phase of the 1980 rendezvous mission with the comet Encke.

Jacobson, R. A.↗

Investigation of energy management strategies for photovoltaic systems - A predictive control algorithm

The present investigation is concerned with the formulation of energy management strategies for stand-alone photovoltaic (PV) systems, taking into account a basic control algorithm for a possible predictive, (and adaptive) controller. The control system controls the flow of energy in the system according to the amount of energy available, and predicts the appropriate control set-points based on the energy (insolation) available by using an appropriate system model. Aspects of adaptation to the conditions of the system are also considered. Attention is given to a statistical analysis technique, the analysis inputs, the analysis procedure, and details regarding the basic control algorithm.

Cull, R. C.↗

New Neural Network Cloud Mask Algorithm Based on Radiative Transfer Simulations

Cloud detection and screening constitute critically important first steps required to derive many satellite data products. Traditional threshold-based cloud mask algorithms require a complicated design process and fine tuning for each sensor, and they have difficulties over areas partially covered with snow/ice. Exploiting advances in machine learning techniques and radiative transfer modeling of coupled environmental systems, we have developed a new, threshold-free cloud mask algorithm based on a neural network classifier driven by extensive radiative transfer simulations. Statistical validation results obtained by using collocated CALIOP and MODIS data show that its performance is consistent over different ecosystems and significantly better than the MODIS Cloud Mask (MOD35 C6) during the winter seasons over snow-covered areas in the mid-latitudes. Simulations using a reduced number of satellite channels also show satisfactory results, indicating its flexibility to be configured for different sensors. Comparedto threshold-based methods and previous machine-learning approaches, this new cloud mask (i) does not rely on thresholds, (ii) needs fewer satellite channels, (iii) has superior performance during winter seasons in mid-latitude areas, and (iv) can easily be applied to different sensors.

cloud mask algorithms↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗

Putting Priors in Mixture Density Mercer Kernels

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. We describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using predefined kernels. These data adaptive kernels can en- code prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS). The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains template for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic- algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code. The results show that the Mixture Density Mercer-Kernel described here outperforms tree-based classification in distinguishing high-redshift galaxies from low- redshift galaxies by approximately 16% on test data, bagged trees by approximately 7%, and bagged trees built on a much larger sample of data by approximately 2%.

Srivastava, Ashok N.↗