Search NASASearch

SEARCH · Search NASA

Results for “Inference”

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 19 records

Application of AI techniques to infer vegetation characteristics from directional reflectance(s)

Traditionally, the remote sensing community has relied totally on spectral knowledge to extract vegetation characteristics. However, there are other knowledge bases (KB's) that can be used to significantly improve the accuracy and robustness of inference techniques. Using AI (artificial intelligence) techniques a KB system (VEG) was developed that integrates input spectral measurements with diverse KB's. These KB's consist of data sets of directional reflectance measurements, knowledge from literature, and knowledge from experts which are combined into an intelligent and efficient system for making vegetation inferences. VEG accepts spectral data of an unknown target as input, determines the best techniques for inferring the desired vegetation characteristic(s), applies the techniques to the target data, and provides a rigorous estimate of the accuracy of the inference. VEG was developed to: infer spectral hemispherical reflectance from any combination of nadir and/or off-nadir view angles; infer percent ground cover from any combination of nadir and/or off-nadir view angles; infer unknown view angle(s) from known view angle(s) (known as view angle extension); and discriminate between user defined vegetation classes using spectral and directional reflectance relationships developed from an automated learning algorithm. The errors for these techniques were generally very good ranging between 2 to 15% (proportional root mean square). The system is designed to aid scientists in developing, testing, and applying new inference techniques using directional reflectance data.

Kimes, D. S.

Intelligent machines in the twenty-first century: foundations of inference and inquiry

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

Review

Intelligent Machines in the 21st Century: Automating the Processes of Inference and Inquiry

The last century saw the application of Boolean algebra toward the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines. in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. However, modern intelligent machines work by inferring knowledge using only their pre-programmed prior knowledge and the data provided. They lack the ability to ask questions, or request data that would aid their inferences. Recent advances in understanding the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we identified the algebra of questions as the free distributive algebra, which now allows us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper we describe this logic of inference and inquiry using the mathematics of partially ordered sets and the scaffolding of lattice theory, discuss the far-reaching implications of the methodology, and demonstrate its application with current examples in machine learning. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them to not only make inferences from data, but also decide which question to ask, experiment to perform, or measurement to take given what they have learned and what they are designed to understand.

Knuth, Kevin H.

On Bayesian Inductive Inference & Predictive Estimation

We investigate Bayesian inference and the Principle of Maximum Entropy (PME) as methods for doing inference under uncertainty. This investigation is primarily through concrete examples that have been previously investigated in the literature. We find that it is possible to do Bayesian inference and PME inference using the same information, despite claims to the contrary, but that the results are not directly comparable. This is because Bayesian inference yields a probability density function (pdf) over the unknown model parameters, whereas PME yields point estimates. If mean estimates are extracted from the Bayesian pdfs, the resulting parameter estimates can differ radically from the PME values and also from the Maximum Likelihood values. We conclude that these differences are due to the Bayesian inference not assuming anything beyond the given prior probabilities and the data, whereas PME implicitly assumes that the given constraints are the only constraints that are operating. Since this assumption can be wrong, PME values may have to be revised when subsequent data shows evidence for more constraints. The entropy concentration previously "proved" by E. T. Jaynes is shown to be in error. Further, we show that PME is a generalized form of independence assumption, and so can be a very powerful method of inference when the variables being investigated are largely independent of each other.

Cheeseman, Peter

Algorithm Optimally Orders Forward-Chaining Inference Rules

People typically develop knowledge bases in a somewhat ad hoc manner by incrementally adding rules with no specific organization. This often results in a very inefficient execution of those rules since they are so often order sensitive. This is relevant to tasks like Deep Space Network in that it allows the knowledge base to be incrementally developed and have it automatically ordered for efficiency. Although data flow analysis was first developed for use in compilers for producing optimal code sequences, its usefulness is now recognized in many software systems including knowledge-based systems. However, this approach for exhaustively computing data-flow information cannot directly be applied to inference systems because of the ubiquitous execution of the rules. An algorithm is presented that efficiently performs a complete producer/consumer analysis for each antecedent and consequence clause in a knowledge base to optimally order the rules to minimize inference cycles. An algorithm was developed that optimally orders a knowledge base composed of forwarding chaining inference rules such that independent inference cycle executions are minimized, thus, resulting in significantly faster execution. This algorithm was integrated into the JPL tool Spacecraft Health Inference Engine (SHINE) for verification and it resulted in a significant reduction in inference cycles for what was previously considered an ordered knowledge base. For a knowledge base that is completely unordered, then the improvement is much greater.

James, Mark

New developments of a knowledge based system (VEG) for inferring vegetation characteristics

An extraction technique for inferring physical and biological surface properties of vegetation using nadir and/or directional reflectance data as input has been developed. A knowledge-based system (VEG) accepts spectral data of an unknown target as input, determines the best strategy for inferring the desired vegetation characteristic, applies the strategy to the target data, and provides a rigorous estimate of the accuracy of the inference. Progress in developing the system is presented. VEG combines methods from remote sensing and artificial intelligence, and integrates input spectral measurements with diverse knowledge bases. VEG has been developed to (1) infer spectral hemispherical reflectance from any combination of nadir and/or off-nadir view angles; (2) test and develop new extraction techniques on an internal spectral database; (3) browse, plot, or analyze directional reflectance data in the system's spectral database; (4) discriminate between user-defined vegetation classes using spectral and directional reflectance relationships; and (5) infer unknown view angles from known view angles (known as view angle extension).

Kimes, D. S.

An inference engine for embedded diagnostic systems

The implementation of an inference engine for embedded diagnostic systems is described. The system consists of two distinct parts. The first is an off-line compiler which accepts a propositional logical statement of the relationship between facts and conclusions and produces data structures required by the on-line inference engine. The second part consists of the inference engine and interface routines which accept assertions of fact and return the conclusions which necessarily follow. Given a set of assertions, it will generate exactly the conclusions which logically follow. At the same time, it will detect any inconsistencies which may propagate from an inconsistent set of assertions or a poorly formulated set of rules. The memory requirements are fixed and the worst case execution times are bounded at compile time. The data structures and inference algorithms are very simple and well understood. The data structures and algorithms are described in detail. The system has been implemented on Lisp, Pascal, and Modula-2.

Fox, Barry R.

Inference of geologic surface parameters from polarimetric radar observations and model inversion

The results of inferring geologic parameters such as rms surface height, correlation length, and dielectric constant of rough surfaces by fitting observed polarization signatures with those predicted by the second order Rice model are discussed. The inferred results are compared to measured values of rms height and correlation length. The rms height values inferred are in good agreement with in situ measurements. The inferred correlation lengths generally do not agree with measured values. The results allow the separation of the effects of surface roughness and dielectric constant on the overall backscatter from rough surfaces.

Vanzyl, Jakob J.

The mechanisms of temporal inference

The properties of a temporal language are determined by its constituent elements: the temporal objects which it can represent, the attributes of those objects, the relationships between them, the axioms which define the default relationships, and the rules which define the statements that can be formulated. The methods of inference which can be applied to a temporal language are derived in part from a small number of axioms which define the meaning of equality and order and how those relationships can be propagated. More complex inferences involve detailed analysis of the stated relationships. Perhaps the most challenging area of temporal inference is reasoning over disjunctive temporal constraints. Simple forms of disjunction do not sufficiently increase the expressive power of a language while unrestricted use of disjunction makes the analysis NP-hard. In many cases a set of disjunctive constraints can be converted to disjunctive normal form and familiar methods of inference can be applied to the conjunctive sub-expressions. This process itself is NP-hard but it is made more tractable by careful expansion of a tree-structured search space.

Fox, B. R.

Safe Upper-Bounds Inference of Energy Consumption for Java Bytecode Applications

Many space applications such as sensor networks, on-board satellite-based platforms, on-board vehicle monitoring systems, etc. handle large amounts of data and analysis of such data is often critical for the scientific mission. Transmitting such large amounts of data to the remote control station for analysis is usually too expensive for time-critical applications. Instead, modern space applications are increasingly relying on autonomous on-board data analysis. All these applications face many resource constraints. A key requirement is to minimize energy consumption. Several approaches have been developed for estimating the energy consumption of such applications (e.g. [3, 1]) based on measuring actual consumption at run-time for large sets of random inputs. However, this approach has the limitation that it is in general not possible to cover all possible inputs. Using formal techniques offers the potential for inferring safe energy consumption bounds, thus being specially interesting for space exploration and safety-critical systems. We have proposed and implemented a general frame- work for resource usage analysis of Java bytecode [2]. The user defines a set of resource(s) of interest to be tracked and some annotations that describe the cost of some elementary elements of the program for those resources. These values can be constants or, more generally, functions of the input data sizes. The analysis then statically derives an upper bound on the amount of those resources that the program as a whole will consume or provide, also as functions of the input data sizes. This article develops a novel application of the analysis of [2] to inferring safe upper bounds on the energy consumption of Java bytecode applications. We first use a resource model that describes the cost of each bytecode instruction in terms of the joules it consumes. With this resource model, we then generate energy consumption cost relations, which are then used to infer safe upper bounds. How energy consumption for each bytecode instruction is measured is beyond the scope of this paper. Instead, this paper is about how to infer safe energy consumption estimations assuming that those energy consumption costs are provided. For concreteness, we use a simplified version of an existing resource model [1] in which an energy consumption cost for individual Java opcodes is defined.

Navas, Jorge

Electron Precipitation Parameters and Ionospheric Conductances Inferred from Auroral Images Acquired by the Visible Imaging Systems (VIS) on the Polar Spacecraft

The Visible Imaging System (VIS) on the polar spacecraft provided time sequences of auroral images at multiple wavelengths that yield information of auroral dynamics on a global scale with a spatial resolution of - 20 km and temporal resolution of approx. 1 minute. Time sequences of VIS images in which the aurora was highly dynamic are used to infer global maps for the electron precipitation parameters, energy flux and characteristic energies, and ionospheric conductances. The maps are inferred from the corresponding VIS images using an auroral model (Lumerzheim et al., 1987). The temporal and spatial resolution of the VIS inferred patterns are unprecedented. The inferred patterns are highly structured and vary significantly on a time scale of less than 5 minutes. These patterns can be very beneficial for global physics-based numerical models for the high-latitude ionosphere which previously had to rely on statistical models for the electron precipitation and ionospheric conductance.

Sigwarth, John B.

Degree of Ice Particle Surface Roughness Inferred from Polarimetric Observations

The degree of surface roughness of ice particles within thick, cold ice clouds is inferred from multidirectional, multi-spectral satellite polarimetric observations over oceans, assuming a column-aggregate particle habit. An improved roughness inference scheme is employed that provides a more noise-resilient roughness estimate than the conventional best-fit approach. The improvements include the introduction of a quantitative roughness parameter based on empirical orthogonal function analysis and proper treatment of polarization due to atmospheric scattering above clouds. A global 1-month data sample supports the use of a severely roughened ice habit to simulate the polarized reflectivity associated with ice clouds over ocean. The density distribution of the roughness parameter inferred from the global 1- month data sample and further analyses of a few case studies demonstrate the significant variability of ice cloud single-scattering properties. However, the present theoretical results do not agree with observations in the tropics. In the extra-tropics, the roughness parameter is inferred but 74% of the sample is out of the expected parameter range. Potential improvements are discussed to enhance the depiction of the natural variability on a global scale.

surface

Use of Design of Experiments and Rule-Based Inference in Determining Neural Network Architectures for Loss of Control Detection

In this work, we describe methods for selecting the neural network architectures and input spaces to implement belief state inference on generic commercial transport aircraft. First, we highlight a case study on the planning, execution, and analysis of a set of experiments to determine the configurations of a conditional variational autoencoder (CVAE). We present a structured method that can be used in a number of aerospace applications, to optimize the structure and training parameters of the CVAE for belief state inference, using Design of Experiments (DOE) statistical methodologies. The motivation for this specific DOE was to identify the appropriate hyperparameters for measuring the CVAE reconstruction probability and latent space, such that the measurements can be used to infer qualitative state changes for the aircraft. We demonstrate that this process yields information about a trained neural network’s utility for this specific application, along with a quantifiable range of certainty. We execute 84 experiments using loss-of-control flight maneuver data from a NASA T-2 aircraft, demonstrating that this empirical process allows us to construct cheap and simple models with specific attributes amenable to belief state inference in aerospace applications. While theoretically, we could create a single CVAE with an input space the size of all measurable flight variables and environmental dynamics, it becomes intractable to use such a neural network in an in-situ intelligent multi-agent system. Using the recommendations from our case study, we introduce a technical approach for feasibly describing the belief space by (1) identifying significant statistical relationships among flight variables using rule induction, (2) using a set of rules that cover all features to define the input space of multiple CVAEs, and (3) forming a belief space based on the joint probability density of their collective latent spaces. This results in a series of relatively small matrix multiplications that can be performed in real time, as opposed to large matrix computations in a single CVAE. We demonstrate the application of this approach on the T-2 flight loss-of control experiments, using the architecture and hyperparameter recommendations from the case study. We compare the utilities of an individual CVAE trained on all flight variables and multiple CVAEs defined on subsets of flight variables for detecting qualitative changes in flight. We demonstrate that the use of multiple CVAEs with smaller input spaces permits the CVAE to capture more granular relationships in the latent space, permitting better state space characterization and loss-of-control detection.

Design of experiments

Consequences of Asteroid Characterization on the State of Knowledge about Inferred Physical Properties and Impact Risk

Physical characteristics of Near-Earth Objects (NEOs) are essential inputs to planetary defense assessments. The size, density, and strength of an NEO are critical inputs to modeling behavior during atmospheric entry as well as assessing the risk of impact. Similarly, knowledge of the physical characteristics of an object are necessary to evaluate the probable result of a mitigation mission. Usually, these attributes cannot be directly measured, but increasingly sophisticated methods have been developed to infer physical properties from related measurements of asteroids, meteors, and/or meteorites. Fortuitously, some of these measurements have been obtained for enough NEOs to elucidate the distribution of values across the sampled population. However, the situation becomes more challenging when considering a specific asteroid, since it is unlikely that all the relevant measurements have been made for any given object. We have developed a Bayesian network that can combine available information about a particular NEO with knowledge of the larger population to infer probabilistic values and uncertainties for physical characteristics of interest. Distributions of asteroid population albedos, taxonomic classes, and macroporosities, along with meteorite density distributions and associations between taxonomic classes and meteorite classes, provide the default distributions for the network’s parameter nodes. The inference network links parameters for each virtual asteroid either deterministically or probabilistically as appropriate, and eliminates any unphysical combinations of parameters. Within the context of planetary defense, our Bayesian network can be used to constrain the ranges of likely impactor properties, which can subsequently reduce the uncertainty in modelling of atmospheric entry, mitigation efficacy, and impact risk assessment. When additional measurements become available for a specific object, the network incorporates those measurements to generate virtual asteroids with property distributions that are consistent with the measurements. We will use the 2023 PDC scenario to demonstrate how the inference network can be combined with plausible characterization measurements to refine the state of knowledge about likely combinations of physical parameters and the resulting impact risk.

risk assessment

Consequences of Asteroid Characterization on the State of Knowledge about Inferred Physical Properties and Impact Risk

Physical characteristics of Near-Earth Objects (NEOs) are essential inputs to planetary defense assessments. The size, density, and strength of an NEO are critical inputs to modeling behavior during atmospheric entry as well as assessing the risk of impact. Similarly, knowledge of the physical characteristics of an object are necessary to evaluate the probable result of a mitigation mission. Usually, these attributes cannot be directly measured, but increasingly sophisticated methods have been developed to infer physical properties from related measurements of asteroids, meteors, and/or meteorites. Fortuitously, some of these measurements have been obtained for enough NEOs to elucidate the distribution of values across the sampled population. However, the situation becomes more challenging when considering a specific asteroid, since it is unlikely that all the relevant measurements have been made for any given object. We have developed a Bayesian network that can combine available information about a particular NEO with knowledge of the larger population to infer probabilistic values and uncertainties for physical characteristics of interest. Distributions of asteroid population albedos, taxonomic classes, and macroporosities, along with meteorite density distributions and associations between taxonomic classes and meteorite classes, provide the default distributions for the network’s parameter nodes. The inference network links parameters for each virtual asteroid either deterministically or probabilistically as appropriate, and eliminates any unphysical combinations of parameters. Within the context of planetary defense, our Bayesian network can be used to constrain the ranges of likely impactor properties, which can subsequently reduce the uncertainty in modelling of atmospheric entry, mitigation efficacy, and impact risk assessment. When additional measurements become available for a specific object, the network incorporates those measurements to generate virtual asteroids with property distributions that are consistent with the measurements. We will use the 2023 PDC scenario to demonstrate how the inference network can be combined with plausible characterization measurements to refine the state of knowledge about likely combinations of physical parameters and the resulting impact risk.

risk assessment

Bayesian Inference and the Effects of Varying Uncertainty Models in Charring Ablator Calibration and Uncertainty Quantification Problems

The Mars Science Laboratory (MSL) vehicle utilized a heat shield constructed from NASA’s Phenolic-Impregnated Carbon Ablator (PICA) material to protect the main structure from the high enthalpy environment encountered during hypersonic atmospheric entry. During the vehicle’s descent through Martian atmosphere, multiple thermocouples embedded within the heat shield captured in-depth material temperature data that allow for studies to be conducted on current material response reconstruction tools. In the present work, material temperature data obtained from thermocouples within the MISP-4 plug (MEDLI (Mars Science Laboratory Entry, Descent, and Landing Instrument) Integrated Sensor Plug) are utilized in the calibration of Theoretical Ablative Composite for Open Testing (TACOT) model parameters in conjunction with NASA’s Porous material Analysis Toolbox (PATO) through Bayesian inference where uncertainty due to parametric, modeling, and experimental sources is simultaneously quantified. Prior to the study, a sensitivity analysis is performed through computation of the robust Sobol indices in an effort to study the relationship between input space and model response and to reduce the dimensionality of the statistical inverse problem. The Bayesian inference methodology necessitates an a-priori choice to be made for the uncertainty model for which numerous possibilities are available. Across most works, however, only basic additive or multiplicative models are utilized with pre-defined magnitudes of uncertainty based on a-priori knowledge or to-be-calibrated multipliers of static covariance matrix structures. The present effort explores the effects of informed uncertainty models, ones with temporal dependence that are simultaneously calibrated through Bayesian inference, on calibrated results for parameters that make up the uncertain input space.

Sensitivity Analysis

Interplanetary magnetic sector polarity inferred from polar geomagnetic field observations

In order to infer the interplanetary sector polarity from polar geomagnetic field diurnal variations, measurements were carried out at Godhavn and Thule (Denmark) Geomagnetic Observatories. The inferred interplanetary sector polarity was compared with the polarity observed at the same time by Explorer 33 and 35 magnetometers. It is shown that the polarity (toward or away from the sun) of the interplanetary magnetic field can be reliably inferred from observations of the polar cap geomagnetic fields.

Friis-Christensen, E.

Comparison of inferred and observed interplanetary magnetic field polarities, 1970-1972

The inferred polarity (toward or away from the sun) of the interplanetary magnetic field at earth using polar observations of the geomagnetic field has been compared with spacecraft observations. A list published by Svalgaard (1974) of the inferred field polarities in the period from 1970 to 1972 is found to be correct on 82% of the days. A near real-time (same day) method of inferring the polarity of the interplanetary magnetic field using geomagnetic observations at Vostok and Thule is in use at the NOAA Space Environment Laboratory, Boulder, Colorado. During 1972, this method is found to be correct on 87% of the days. A list of 'well-defined' sector boundaries at earth from 1970 to 1972 is given.

Wilcox, J. M.