Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Expectation Maximization”

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 37 records · Page 2

Gaussian Mixture Model Solvers for the Boltzmann Equation

This report documents our experience constructing a numerical method for the collisional Boltzmann equation that is capable of accurately capturing the collisionless through strongly collisional limits. We explore three different functional representations and present a detailed account of a numerical method based on a spatially dependent Gaussian mixture model (GMM). The Kullback-Leibler divergence is used as a closeness measure and various expectation maximization (EM) solution algorithms are implemented to find a compact representation in velocity space for distribution functions that exhibit significant non-Maxwellian character. We discuss issues that appear with this representation over a range of Knudsen numbers for a prototypical test problem and demonstrate that the strongly collisional limit recovers a solution to Euler's equations. Looking forward, this approach is broadly applicable to the non-relativistic and relativistic collisional Vlasov equations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Monte Carlo Simulation and Reconstruction: Assessment of Myocardial Perfusion Imaging of Tracer Dynamics With Cardiac Motion Due to Deformation and Respiration Using Gamma Camera With Continuous Acquisition

Purpose: Myocardial perfusion imaging (MPI) with single photon emission computed tomography (SPECT) is routinely used for stress testing in nuclear medicine. Recently, our group extended its potential going from 3D visual qualitative image analysis to 4D spatiotemporal reconstruction of dynamically acquired data to capture the time variation of the radiotracer concentration and the estimated myocardial blood flow (MBF) and coronary flow reserve (CFR). However, the quality of reconstructed image is compromised due to cardiac deformation and respiration. The work presented here develops an algorithm that reconstructs the dynamic sequence of separate respiratory and cardiac phases and evaluates the algorithm with data simulated with a Monte Carlo simulation for the continuous image acquisition and processing with a slowly rotating SPECT camera. Methods: A clinically realistic Monte Carlo (MC) simulation is developed using the 4D Extended Cardiac Torso (XCAT) digital phantom with respiratory and cardiac motion to model continuous data acquisition of dynamic cardiac SPECT with slowly rotating gamma cameras by incorporating deformation and displacement of the myocardium due to cardiac and respiratory motion. We extended our previously developed 4D maximum-likelihood expectation-maximization (MLEM) reconstruction algorithm for a data set binned from a continuous list mode (LM) simulation with cardiac and respiratory information. Our spatiotemporal image reconstruction uses splines to explicitly model the temporal change of the tracer for each cardiac and respiratory gate that delineates the myocardial spatial position as the tracer washes in and out. Unlike in a fully list-mode data acquisition and reconstruction the accumulated photons are binned over a specific but very short time interval corresponding to each cardiac and respiratory gate. Reconstruction results are presented showing the dynamics of the tracer in the myocardium as it continuously deforms. These results are then compared with the conventional 4D spatiotemporal reconstruction method that models only the temporal changes of the tracer activity. Mean Stabilized Activity (MSA), signal to noise ratio (SNR) and Bias for the myocardium activities for three different target-to-background ratios (TBRs) are evaluated. Dynamic quantitative indices such as wash-in (K1) and wash-out (k2) rates at each gate were also estimated. Results: The MSA and SNR are higher with higher TBRs while biases were improved with higher TBRs to less than 10%. The correlation between exhalation-inhalation sequence with the ground truth during respiratory cycle was excellent. Our reconstruction method showed better resolved myocardial walls during diastole to systole as compared to the ungated 4D image. Estimated values of K1 and k2 were also consistent with the ground truth. Conclusion: The continuous image acquisition for dynamic scan using conventional two-head gamma cameras can provide valuable information for MPI. Our study demonstrated the viability of using a continuous image acquisition method on a widely used clinical two-head SPECT system. Our reconstruction method showed better resolved myocardial walls during diastole to systole as compared to the ungated 4D image. Precise implementation of reconstruction algorithms, better segmentation techniques by generating images of different tissue types and background activity would improve the feasibility of the method in real clinical environment.

60 APPLIED LIFE SCIENCES↗

The NASA Lewis Research Center electric propulsion program

The Lewis Research Center conducts an electric propulsion program aimed at a broad class of space missions. The program is structured in an evolutionary fashion in order to both maximize expectations for the acceptance of developed concepts and accommodate anticipated developments of critical system technologies. Recent efforts have assisted in the acceptance of low power electric rockets. Primary electric propulsion concepts are also being developed for both Solar Electric Propulsion Systems and Nuclear Electric Propulsion Systems class space missions, and the paper briefly describes the concepts under evaluation for potential Space Exploration Initiative missions.

Byers, David C.↗

Mixed data/goal driven intelligent real-time assessment and control

We describe work in progress to develop model-based systems for real-time assessment and control of complex systems. Intelligent real-time processing must balance accuracy and response-time requirements to maximize expected performance. We use brief (probability) and goal (utility) information to guide construction of an approximate system model on which we then apply approximate inference procedures to yield timely, effective assessments and control decisions.

Dambrosio, Bruce↗

Power console development for NASA's electric propulsion outreach program

NASA LeRC is developing a 30 cm diameter xenon ion thruster for auxiliary and primary propulsion applications. To maximize expectations for user-acceptance of ion propulsion technology, NASA LeRC, through their Electric Propulsion Outreach Program, is providing sectors of industry with portable power consoles for operation of 5 KW-class xenon ion thrusters. This power console provides all necessary functions to permit thruster operations over a 0.5-5 KW envelope under both manual and automated control. These functions include the following: discharge, cathode heater, neutralizer keeper, and neutralizer heater currents, screen and accelerator voltages, and a gas feed system to regulate and control propellant flow to the thruster. An electronic circuit monitors screen and accelerator currents and controls arcing events. The power console was successfully integrated with the NASA 30 cm thruster.

Pinero, Luis R.↗

Software For Multivariate Bayesian Classification

PHD general-purpose classifier computer program. Uses Bayesian methods to classify vectors of real numbers, based on combination of statistical techniques that include multivariate density estimation, Parzen density kernels, and EM (Expectation Maximization) algorithm. By means of simple graphical interface, user trains classifier to recognize two or more classes of data and then use it to identify new data. Written in ANSI C for Unix systems and optimized for online classification applications. Embedded in another program, or runs by itself using simple graphical-user-interface. Online help files makes program easy to use.

Saul, Ronald↗

The NASA Electric Propulsion Program

Nearly all space missions require on-board propulsion systems and these systems typically have a major impact on spacecraft mass and cost. Electric propulsion systems offer major performance advantages over conventional chemical systems for many mission functions and the NASA Office of Space Access and Technology (OSAT) supports an extensive effort to develop the technology for high-performance, on-board electric propulsion system options to enhance and enable near- and far-term US space missions. This program includes research and development efforts on electrothermal, electrostatic, and electromagnetic propulsion system technologies to cover a wide range of potential applications. To maximize expectations of technology transfer, the program emphasizes strong interaction with the user community through a variety of cooperative and contracted approaches. This paper provides an overview of the OSAT electric propulsion program with an emphasis on recent progress and future directions.

Callahan, Lisa Wood↗

Operations for Learning with Graphical Models

This paper is a multidisciplinary review of empirical, statistical learning from a graphical model perspective. Well-known examples of graphical models include Bayesian net- works, directed graphs representing a Markov chain, and undirected networks representing a Markov field. These graphical models are extended to model data analysis and empirical learning using the notation of plates. Graphical operations for simplifying and manipulating a problem are provided including decomposition, differentiation, and the manipulation of probability models from the exponential family. These operations adapt existing techniques from statistics and automatic differentiation to graphs. Two standard algorithm schemes for learning are reviewed in a graphical framework: Gibbs sampling and the expectation maximization algorithm. Some algorithms are developed in this graphical framework including a generalized version of linear regression, techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data. The paper concludes by sketching some implications for data analysis and summarizing some popular algorithms that fall within the framework presented. The main original contributions here are the decomposition techniques and the demonstration that graphical models provide a framework for understanding and developing complex learning algorithms.

Buntine, Wray L.↗

On the Spatial Distribution of High Velocity Al-26 Near the Galactic Center

We present results of simulations of the distribution of 1809 keV radiation from the decay of Al-26 in the Galaxy. Recent observations of this emission line using the Gamma Ray Imaging Spectrometer (GRIS) have indicated that the bulk of the AL-26 must have a velocity of approx. 500 km/ s. We have previously shown that a velocity this large could be maintained over the 10(exp 6) year lifetime of the Al-26 if it is trapped in dust grains that are reaccelerated periodically in the ISM. Here we investigate whether a dust grain velocity of approx. 500 km/ s will produce a distribution of 1809 keV emission in latitude that is consistent with the narrow distribution seen by COMPTEL. We find that dust grain velocities in the range 275 - 1000 km/ s are able to reproduce the COMPTEL 1809 keV emission maps reconstructed using the Richardson-Lucy and Maximum Entropy image reconstruction methods while the emission map reconstructed using the Multiresolution Regularized Expectation Maximization algorithm is not well fit by any of our models. The Al-26 production rate that is needed to reproduce the observed 1809 keV intensity yields in a Galactic mass of Al-26 of approx. 1.5 - 2 solar mass which is in good agreement with both other observations and theoretical production rates.

Sturner, Steven J.↗

Brain segmentation and the generation of cortical surfaces

This paper describes methods for white matter segmentation in brain images and the generation of cortical surfaces from the segmentations. We have developed a system that allows a user to start with a brain volume, obtained by modalities such as MRI or cryosection, and constructs a complete digital representation of the cortical surface. The methodology consists of three basic components: local parametric modeling and Bayesian segmentation; surface generation and local quadratic coordinate fitting; and surface editing. Segmentations are computed by parametrically fitting known density functions to the histogram of the image using the expectation maximization algorithm [DLR77]. The parametric fits are obtained locally rather than globally over the whole volume to overcome local variations in gray levels. To represent the boundary of the gray and white matter we use triangulated meshes generated using isosurface generation algorithms [GH95]. A complete system of local parametric quadratic charts [JWM+95] is superimposed on the triangulated graph to facilitate smoothing and geodesic curve tracking. Algorithms for surface editing include extraction of the largest closed surface. Results for several macaque brains are presented comparing automated and hand surface generation. Copyright 1999 Academic Press.

NASA Discipline Neuroscience↗

Statistical analysis of geodetic networks for detecting regional events

We present an application of hidden Markov models (HMMs) to analysis of geodetic time series in Southern California. Our model fitting method uses a regularized version of the deterministic annealing expectation-maximization algorithm to ensure that model solutions are both robust and of high quality.

geodetic networks↗

Symmetric normal mixtures

We consider mixture density estimation under the symmetry constraint x = Az for an orthogonal matrix A. This distributional constraint implies a corresponding constraint on the mixture parameters. Focusing on the gaussian case, we derive an expectation-maximization (EM) algorithm to enforce the constraint and show results for modeling of image feature vectors.

symmetry constraint↗

Particle Filtering for Model-Based Anomaly Detection in Sensor Networks

A novel technique has been developed for anomaly detection of rocket engine test stand (RETS) data. The objective was to develop a system that postprocesses a csv file containing the sensor readings and activities (time-series) from a rocket engine test, and detects any anomalies that might have occurred during the test. The output consists of the names of the sensors that show anomalous behavior, and the start and end time of each anomaly. In order to reduce the involvement of domain experts significantly, several data-driven approaches have been proposed where models are automatically acquired from the data, thus bypassing the cost and effort of building system models. Many supervised learning methods can efficiently learn operational and fault models, given large amounts of both nominal and fault data. However, for domains such as RETS data, the amount of anomalous data that is actually available is relatively small, making most supervised learning methods rather ineffective, and in general met with limited success in anomaly detection. The fundamental problem with existing approaches is that they assume that the data are iid, i.e., independent and identically distributed, which is violated in typical RETS data. None of these techniques naturally exploit the temporal information inherent in time series data from the sensor networks. There are correlations among the sensor readings, not only at the same time, but also across time. However, these approaches have not explicitly identified and exploited such correlations. Given these limitations of model-free methods, there has been renewed interest in model-based methods, specifically graphical methods that explicitly reason temporally. The Gaussian Mixture Model (GMM) in a Linear Dynamic System approach assumes that the multi-dimensional test data is a mixture of multi-variate Gaussians, and fits a given number of Gaussian clusters with the help of the wellknown Expectation Maximization (EM) algorithm. The parameters thus learned are used for calculating the joint distribution of the observations. However, this GMM assumption is essentially an approximation and signals the potential viability of non-parametric density estimators. This is the key idea underlying the new approach.

Solano, Wanda↗

Orbit Clustering Based on Transfer Cost

We propose using cluster analysis to perform quick screening for combinatorial global optimization problems. The key missing component currently preventing cluster analysis from use in this context is the lack of a useable metric function that defines the cost to transfer between two orbits. We study several proposed metrics and clustering algorithms, including k-means and the expectation maximization algorithm. We also show that proven heuristic methods such as the Q-law can be modified to work with cluster analysis.

combinatorial optimization↗

Clustering Days with Similar Airport Weather Conditions

On any given day, traffic flow managers must often rely on past experience and intuition when developing traffic flow management initiatives that mitigate imbalances between the aircraft demand and the weather impacted airport capacity. The goal of this study was to build on recent efforts to apply data mining classification and clustering algorithms to vast archives of historical weather and air traffic data to identify patterns and past decisions that can ultimately inform day-of-operations decision-making. More specifically, this study identified similar weather impacted days at select U.S. airports, and analyzed the traffic management initiatives implemented on these representative days. The identification of the similar days was accomplished by applying a decision tree algorithm to the hourly Localized Aviation Model Output Statistics Program observations and the arrival delays for Newark Liberty International Airport. The branches from the trained decision tree were subsequently pruned to identify four weather conditions that resulted in medium to high delays for the arrivals scheduled to Newark in 2012. Using these weather conditions, four, daily airport-level Weather Impacted Traffic Index values were calculated using the Localized Aviation Model Output Statistics Program observations and the 2012 scheduled arrival counts from the FAAs Aviation System Performance Metric system. The four, daily Weather Impacted Traffic Index values for 2012 were subsequently clustered using an Expectation Maximization clustering algorithm, and nine unique types of weather days at Newark were identified. By far the most prominent type of day at Newark was a day associated with relatively good weather conditions, where there was little convective activity, winds were low, ceilings and visibility were high and there was little precipitation. Moderate levels of convective activity characterized the next most prominent type of day. Days with persistently high winds or low ceiling and visibility levels were relatively rare in 2012. Lastly, the frequency at which Ground Delay Programs, Ground Stops and Miles-in-Trail restrictions were implemented on each of the typical types of days at Newark were analyzed. Based on the results, it does appear as if the usage of Miles-in-Trail, Ground Delay Program and Ground Stop restrictions correlates well with the severity of the weather associated with each unique type of weather impacted day at Newark. Furthermore, the results demonstrate that it is feasible to use historical weather and air traffic archives to provide guidance on the types of traffic management restrictions to implement in response to the weather conditions impacting an airport.

traffic flow management↗

Clustering Days with Similar Airport Weather Conditions

On any given day, traffic flow managers must often rely on past experience and intuition when developing traffic flow management initiatives that mitigate imbalances between the aircraft demand and the weather impacted airport capacity. The goal of this study was to build on recent efforts to apply data mining classification and clustering algorithms to vast archives of historical weather and air traffic data to identify patterns and past decisions that can ultimately inform day-of-operations decision-making. More specifically, this study identified similar weather impacted days at select U.S. airports, and analyzed the traffic management initiatives implemented on these representative days. The identification of the similar days was accomplished by applying a decision tree algorithm to the hourly Localized Aviation Model Output Statistics Program observations and the arrival delays for Newark Liberty International Airport. The branches from the trained decision tree were subsequently pruned to identify four weather conditions that resulted in medium to high delays for the arrivals scheduled to Newark in 2012. Using these weather conditions, four, daily airport-level Weather Impacted Traffic Index values were calculated using the Localized Aviation Model Output Statistics Program observations and the 2012 scheduled arrival counts from the FAAs Aviation System Performance Metric system. The four, daily Weather Impacted Traffic Index values for 2012 were subsequently clustered using an Expectation Maximization clustering algorithm, and nine unique types of weather days at Newark were identified. By far the most prominent type of day at Newark was a day associated with relatively good weather conditions, where there was little convective activity, winds were low, ceilings and visibility were high and there was little precipitation. Moderate levels of convective activity characterized the next most prominent type of day. Days with persistently high winds or low ceiling and visibility levels were relatively rare in 2012. Lastly, the frequency at which Ground Delay Programs, Ground Stops and Miles-in-Trail restrictions were implemented on each of the typical types of days at Newark were analyzed. Based on the results, it does appear as if the usage of Miles-in-Trail, Ground Delay Program and Ground Stop restrictions correlates well with the severity of the weather associated with each unique type of weather impacted day at Newark. Furthermore, the results demonstrate that it is feasible to use historical weather and air traffic archives to provide guidance on the types of traffic management restrictions to implement in response to the weather conditions impacting an airport.

weather↗

LHS 1815b: The First Thick-disk Planet Detected by TESS

We report the first discovery of a thick-disk planet, LHS 1815b (TOI-704b, TIC 260004324), detected in the Transiting Exoplanet Survey Satellite (TESS) survey. LHS 1815b transits a bright (V = 12.19 mag, K = 7.99 mag) and quiet M dwarf located 29.87 ± 0.02 pc away with a mass of 0.502 ± 0.015 M⊙ and a radius of 0.501 ± 0.030 R⊙. We validate the planet by combining space- and ground-based photometry, spectroscopy, and imaging. The planet has a radius of 1.088 ± 0.064 R⊕ with a 3σ mass upper limit of 8.7 M⊕. We analyze the galactic kinematics and orbit of the host star LHS 1815 and find that it has a large probability (Pthick/Pthin = 6482) to be in the thick disk with a much higher expected maximal height (Zmax = 1.8 kpc) above the Galactic plane compared with other TESS planet host stars. Future studies of the interior structure and atmospheric properties of planets in such systems using, for example, the upcoming James Webb Space Telescope, can investigate the differences in formation efficiency and evolution for planetary systems between different Galactic components (thick disks, thin disks, and halo).

LHS 1815b↗

Unsupervised Change Detection for Space Habitats Using 3D Point Clouds

This work presents an algorithm for scene change detection from point clouds to enable autonomous robotic caretaking in future space habitats. Autonomous robotic systems will help maintain future deep-space habitats, such as the Gateway space station, which will be uncrewed for extended periods. Existing scene analysis software used on the International Space Station (ISS) relies on manually-labeled images for detecting changes. In contrast, the algorithm presented in this work uses raw, unlabeled point clouds as inputs. The algorithm first applies modified Expectation-Maximization Gaussian Mixture Model (GMM) clustering to two input point clouds. It then performs change detection by comparing the GMMs using the Earth Mover’s Distance. The algorithm is validated quantitatively and qualitatively using a test dataset collected by an Astrobee robot in the NASA Ames Granite Lab comprising single frame depth images taken directly by Astrobee and full-scene reconstructed maps built with RGB-D and pose data from Astrobee. The runtimes of the approach are also analyzed in depth. The source code is publicly released to promote further development.

robotics↗