Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Reconstruction 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 217 records · Page 12

Generating Exploration Mission-3 Trajectories to a 9:2 NRHO using Machine Learning

The purpose of this thesis is to design a machine learning algorithm platform that provides expanded knowledge of mission availability through a launch season by improving trajectory resolution and introducing launch mission forecasting. The specific scenario addressed in this paper is one in which data is provided for four deterministic translational maneuvers through a mission to a Near Rectilinear Halo Orbit (NRHO) with a 9:2 synodic frequency. Current launch availability knowledge under NASA's Orion Orbit Performance Team is established by altering optimization variables associated to given reference launch epochs. This current method can bean abstract task and relies on an orbit analyst to structure a mission based on an established mission design methodology associated to the performance of Orion and NASA's Space Launch System. Introducing a machine learning algorithm trained to construct mission scenarios within the feasible range of known trajectories reduces the required interaction of the orbit analyst by removing the needed step of optimizing the orbit to fit an expected translational response required of the spacecraft. In this study, k-Nearest Neighbor and Bayesian Linear Regression successfully predicted classical orbital elements for the launch windows observed. However both algorithms had limitations due to their approaches to model fitting. Training machine learning algorithms off of classical orbital elements introduced a repetitive approach to reconstructing mission segments for different arrival opportunities through the launch window and can prove to be a viable method of launch window scan generation for future missions.

Guzman, Esteban↗

Shock capturing schemes for multidimensional flow

Progress made in the development of a genuinely multidimensional finite volume algorithm for problems in inviscid gas dynamics is presented. The approach entails: (1) the reconstruction of flowfield data using a planar wave pattern in which the strengths and orientations of the component waves are derived independently of the mesh geometry; and (2) the development of a flux formula which provides a numerical approximation to the flux at a finite volume cell face during the passage of waves which are in general oblique to the face. Several algorithms are outlined, and the most recent developments are included. The results of several numerical cases are also included.

Parpia, Ijaz H.↗

Hubble Space Telescope characterized by using phase-retrieval algorithms

We describe several results characterizing the Hubble Space Telescope from measured point spread functions by using phase-retrieval algorithms. The Cramer-Rao lower bounds show that point spread functions taken well out of focus result in smaller errors when aberrations are estimated and that, for those images, photon noise is not a limiting factor. Reconstruction experiments with both simulated and real data show that the calculation of wave-front propagation by the retrieval algorithms must be performed with a multiple-plane propagation rather than a simple fast Fourier transform to ensure the high accuracy required. Pupil reconstruction was performed and indicates a misalignment of the optical axis of a camera relay telescope relative to the main telescope. After we accounted for measured spherical aberration in the relay telescope, our estimate of the conic constant of the primary mirror of the HST was - 1.0144.

Fienup, J. R.↗

Variational Algorithms for Nonlinear Smoothing Applications

A variational approach is presented for solving a nonlinear, fixed-interval smoothing problem with application to offline processing of noisy data for trajectory reconstruction and parameter estimation. The nonlinear problem is solved as a sequence of linear two-point boundary value problems. Second-order convergence properties are demonstrated. Algorithms for both continuous and discrete versions of the problem are given, and example solutions are provided.

Bach, Ralph E. Jr.↗

An image compression algorithm for a high-resolution digital still camera

The Electronic Still Camera (ESC) project will provide for the capture and transmission of high-quality images without the use of film. The image quality will be superior to video and will approach the quality of 35mm film. The camera, which will have the same general shape and handling as a 35mm camera, will be able to send images to earth in near real-time. Images will be stored in computer memory (RAM) in removable cartridges readable by a computer. To save storage space, the image will be compressed and reconstructed at the time of viewing. Both lossless and loss-y image compression algorithms are studied, described, and compared.

Nerheim, Rosalee↗

Adding GPU Support to the Markov Chain Monte Carlo Code Catmip

In geophysics, we are confronted with many under-determined inverse problems. For example, all of our observations of earthquakes are made at the Earth’s surface. So, when we try to infer how slip during an earthquake evolves in space and time, we find that there are many potential slip histories that are consistent with our limited observations and our understanding of earthquake physics. One way to approach these problems is with Bayesian analysis which allows us to infer the ensemble of all potential slip models that satisfy the observations and our prior knowledge of earthquake physics. In Bayesian analysis, our prior knowledge is known as the prior probability density function or prior PDF, the fit to the data is known as the data likelihood, and the target PDF that satisfies both the prior PDF and data likelihood is known as the posterior PDF. However, simulating the posterior PDF typically requires using Markov Chain Monte Carlo (MCMC) to draw tens of billions of random realizations of earthquake slip models, which may not be computationally feasible. To make this and similar geophysical inversions computationally tractable, we developed the Cascading Adaptive Transitional Metropolis In Parallel (CATMIP) algorithm. CATMIP is an efficient parallel Markov Chain Monte Carlo (MCMC) sampler that is used for model fitting and uncertainty quantification in geophysics. Example use cases are earthquake rupture modeling, determining mineral composition on Mars, reconstructing the history of ocean salinity, and historical earthquake relocation. CATMIP employs many parallel instances of the Metropolis algorithm for sampling in a transitioning framework. Transitioning is a process in which a set of random samples at equilibrium with a known probability density function (PDF) are used as seeds for the Markov chains to sample successive target PDFs that incrementally move the distribution from the starting seeds to the final desired PDF that describes the relative plausibility of potential values for the model parameters. The algorithm is implemented as a Master-Worker model employing MPI for communication. The worker processes are loosely coupled with global parameters periodically optimized by the master process. This provides a very high amount of parallelism with little communication between updates. During the presentation we will discuss the history of the algorithm and elaborate the earthquake rupture modeling use case for the CATMIP package. Our first step toward GPU optimization was to optimize the code for the CPU. CPU profiling revealed that most of the compute time is spent in calls to level 2 BLAS routines and calls to GSL random number generators. We revised the algorithm to employ level 3 BLAS routines instead. In our presentation we will describe how this was accomplished. Adding GPU support to CATMIP consisted mostly of replacing the calls to GSL with calls to GPU vendor-provided library routines. A small number of loops were directly implemented in CUDA. In the presentation will provide implementation details. Finally, we will discuss methods for profiling and opportunities for further optimizing GPU execution. By creating a code with the flexibility to run on either a CPU or GPU architecture, CATMIP can be used on systems ranging from large CPU-based HPC environments to single servers with GPU acceleration and everything in between.

HECC↗

A spectroscopic search for colliding stellar winds in O-type close binary systems. IV - Iota Orionis

We present H-alpha and He I 6678 A line profiles for the eccentric orbit binary Iota Ori. We have applied a tomography algorithm which uses the established orbital velocity curves and intensity ratio to reconstruct the spectral line profiles for each star. The He I profiles appear as pure photospheric lines, and H-alpha shows variable emission in the line core throughout the orbit (which is typical of O giants) and in the blue wing near periastron passage. We show that the blue wing emission is consistent with an origin between the stars which probably results from a dramatic focusing of the primary's stellar wind at periastron. We also present IUE archival spectra of the UV wind lines N V 1240 A and C IV 1550 A.

Gies, Douglas R.↗

Synthetic-Aperture Coherent Imaging From A Circular Path

Imaging algorithms based on exact point-target responses. Developed for use in reconstructing image of target from data gathered by radar, sonar, or other transmitting/receiving coherent-signal sensory apparatus following circular observation path around target. Potential applications include: Wide-beam synthetic-aperture radar (SAR) from aboard spacecraft in circular orbit around target planet; SAR from aboard airplane flying circular course at constant elevation around central ground point, toward which spotlight radar beam pointed; Ultrasonic reflection tomography in medical setting, using one transducer moving in circle around patient or else multiple transducers at fixed positions on circle around patient; and Sonar imaging of sea floor to high resolution, without need for large sensory apparatus.

Jin, Michael Y.↗

3D Geolocation of Simulated Lightning Sources from Low-Earth Orbit

The recent removal of the Lightning Imaging Sensor from the International Space Station has left an observational gap in lightning detection from low-Earth orbit (LEO). However, new studies have demonstrated the potential for 3D geolocation of lightning sources using orbiting sensors. The Cubespark mission concept aims to take advantage of these developments by deploying a constellation of satellites with radio frequency (RF) sensors and optical imagers to not only map lightning locations, but also to collect bi-spectral flash images. These new capabilities include mapping storm charge structure, flash channel structure, and distinguishing microphysical processes throughout flash development, helping link microphysics and convective processes with overall flash and storm structure around the globe from LEO. In this study, we simulate lightning RF sources in the very high frequency (VHF) band, extrapolate their signals to space-based detection using an improved ionospheric model, and reconstruct their 3D locations using a time-of-arrival (TOA) minimization algorithm. Various constellation configurations, locations, and atmospheric conditions are considered in order to identify and quantify the three main sources of geolocation error: geometric, ionospheric, and instrumental effects. The promising results of this study emphasize the potential of space-based 3D lightning mapping under diverse conditions. 3D resolution is shown to be better than 1-2 km in many cases, enabling new global applications in meteorology and climate sciences. Here we present a selection of these geolocation results as seen from space alongside recent advancements, paving the way for a future generation of LEO lightning mappers.

CubeSpark↗

SIRENA Software for Athena X-IFU Event Reconstruction

The X-ray Observatory Athena was proposed in April 2014 as the mission to implement the science theme "The Hot and Energetic Universe" selected by ESA for L2 (the second Large-class mission in ESAs Cosmic Vision science programme). One of the two X-ray detectors designed to be onboard Athena is X-IFU, a cryogenic microcalorimeter based on Transition Edge Sensor (TES) technology that will provide spatially resolved high-resolution spectroscopy. X-IFU will be developed by an international consortium led by IRAP (PI), SRON (co-PI) and IAPS/INAF (co-PI) and involving ESA Member States, Japan and the United States. In Spain, IFCA (CSIC-UC) has an anticipated contribution to X-IFU through the Digital Readout Electronics (DRE) unit, in particular in the Event Processor Subsytem. For this purpose and in collaboration with the Athena end-to-end simulations team, we are currently developing the SIRENA package as part of the publicly available SIXTE end-to-end simulator. SIRENA comprises a set of processing algorithms aimed at recognizing, from a noisy signal, the intensity pulses generated by the absorption of the X-ray photons, to lately reconstruct their energy, position and arrival time. This poster describes the structure of the package and the different algorithms currently implemented as well as their comparative performance in the energy resolution achieved in the reconstruction of the instrument events.

M T Ceballos↗

Phase-retrieval algorithms for a complicated optical system

Phase-retrieval algorithms have been developed that handle a complicated optical system that requires multiple Fresnellike transforms to propagate from one end of the system to the other including the absorption by apertures in more than one plane and allowance for bad detector pixels. Gradient-search algorithms and generalizations of the iterative-transform phase-retrieval algorithms are derived. Analytic expressions for the gradient of an error metric, with respect to polynomial coefficients and with respect to point-by-point phase descriptions, are given. The entire gradient can be computed with the number of transforms required to propagate a wave front from one end of the optical system to the other and back again, independent of the number of coefficients or phase points. This greatly speeds the computation. The reconstruction of pupil amplitude is also given. A convergence proof of the generalized iterative transform algorithm is given. These improved algorithms permit a more accurate characterization of complicated optical systems from their point spread functions.

Fienup, J. R.↗

Least Squares Reverse Time Migration (LSRTM) for Damage Imaging in Composite Laminates

A method for adapting least squares reverse time migration (LSRTM) for ultrasonic guided wave imaging of composite laminates is proposed in this paper. As composites become more widely used in fields such as the aerospace industry, the need for high-resolution imaging in structural health monitoring (SHM) and nondestructive evaluation (NDE) is also growing. For instance, delamination is a common problem in composite laminates, which has led to a certain degree of apprehension in the use of composite materials for load-bearing structures. Although the solver-based imaging techniques using conventional reverse time migration (RTM) methods illuminate damage with a wide range of damage-scattering effects, the resulting images do not fully define the damage regions due to the limited data acquisition aperture, sensor density, frequencies/wavelengths, and incompleteness of adjoint reconstruction. Previously, the LSRTM theory was derived by incorporating a least squares migration (LSM) algorithm into RTM, and benchmarked its high-resolution damage imaging performance for isotropic plates. To improve damage imaging in composite laminates, a process to create an ultrasonic guided wave-based LSRTM method for anisotropic materials is proposed in this paper. The derivation of the forward modeling operator and the adjoint operator is presented. Numerical case studies were conducted to show the improvement of LSRTM over RTM in mapping damage in composite plates. Multiple damage sites or damage with a complex shape were created in the numerical studies based on 1) Born approximation-based modeling or 2) reduction of the plate stiffness-based modeling. LSRTM begins by using a forward modeling process. The forward modeling accuracy for the flexural wave solver used in this study for LSRTM was also compared with the results from a three-dimensional rotated staggered grid (RSG) elastodynamic finite difference solver, previously open-sourced by NASA Langley Research Center. These benchmarking studies have shown that the LSRTM method is more effective in reducing artifacts, improving resolution, and enhancing damage model reconstruction compared to RTM in composite laminates.

Jiaze He↗

High resolution observations of the L1551 bipolar outflow

The nearby dark cloud Lynds 1551 contains one of the closest examples of a well-collimated bipolar molecular outflow. This source has the largest angular size of any known outflow and was the first bipolar outflow to be detected. The outflow originates from a low-luminosity young stellar object, IRS-5. Optical and radio continuum observations show the presence of a highly collimated, ionized stellar wind orginating from close to IRS-5 and aligned with the molecular outflow. However, we have little information on the actual mechanism that generates the stellar wind and collimates it into opposed jets. The Very Large Array (VLA) observations indicate that the winds originate within 10(15) cm of IRS-5, unfortunately at a size scale difficult to resolve. For these reasons, observations of the structure and dynamics of the hypersonic molecular gas may provide valuable information on the origin and evolution of these outflows. In addition, the study of the impact of the outflowing gas on the surrounding molecular material is essential to understand the consequence these outflows have on the evolution and star formation history of the entire cloud. Moriarty-Schieven et al. (1986) obtained a oversampled map of the CO emission of a portion of both the blueshifted and redshifted outflows in LI551 using Five College Radio Astronomy Observatory 14 m telescope. The oversampled maps have been reconstructed to an effective angular resolution of 20 arcsec using a maximum entropy algorithm. A continuation of the study of Moriarty-Schieven et al. is presented. The entire L1551 outflow has now been mapped at 12 arcsec sampling requiring roughly 4000 spectra. This data has been constructed to 20 arcsec resolution to provide the first high resolution picture of the entire L1551 outflow. This new data has shown that the blueshifted lobe is more extended than previously thought and has expanded downstream sufficiently to break out of the dense molecular cloud, but the redshifted outflow is still confined within the molecular cloud. Details of the structure and kinematics of the high velocity gas are used to test the various models of the origin and evolution of outflows.

Snell, R.↗

New insights in the numerical reliability properties of existing Kalman filter implementations

The convergence properties of Kalman filter algorithms are investigated analytically. A theoretical error analysis is performed on four types of algorithms, as defined by Anderson and Moore (1979): (1) a conventional Kalman filter, (2) a square-root (SR) covariance filter, (3) the Chandrasekhar SR filter, and (4) an SR information filter. The derivations are given in detail, and numerical results for the flight-path reconstruction problem studied by Verhaegen (1987) are presented in tables and graphs. It is shown that error propagation in algorithms (1) and (2) is sensitive to the condition number of the innovation-signal covariance matrix and the spectral norm of the filter state-transition matrix, whereas other parameters are dominant in (3) and (4). Filter (2) is found to be the most reliable for the class of problems studied.

Verhaegen, M. H.↗

Machine-Vision Aids for Improved Flight Operations

The development of machine vision based pilot aids to help reduce night approach and landing accidents is explored. The techniques developed are motivated by the desire to use the available information sources for navigation such as the airport lighting layout, attitude sensors and Global Positioning System to derive more precise aircraft position and orientation information. The fact that airport lighting geometry is known and that images of airport lighting can be acquired by the camera, has lead to the synthesis of machine vision based algorithms for runway relative aircraft position and orientation estimation. The main contribution of this research is the synthesis of seven navigation algorithms based on two broad families of solutions. The first family of solution methods consists of techniques that reconstruct the airport lighting layout from the camera image and then estimate the aircraft position components by comparing the reconstructed lighting layout geometry with the known model of the airport lighting layout geometry. The second family of methods comprises techniques that synthesize the image of the airport lighting layout using a camera model and estimate the aircraft position and orientation by comparing this image with the actual image of the airport lighting acquired by the camera. Algorithms 1 through 4 belong to the first family of solutions while Algorithms 5 through 7 belong to the second family of solutions. Algorithms 1 and 2 are parameter optimization methods, Algorithms 3 and 4 are feature correspondence methods and Algorithms 5 through 7 are Kalman filter centered algorithms. Results of computer simulation are presented to demonstrate the performance of all the seven algorithms developed.

Menon, P. K.↗

An Adaptive Flow Solver for Air-Borne Vehicles Undergoing Time-Dependent Motions/Deformations

This report describes a concurrent Euler flow solver for flows around complex 3-D bodies. The solver is based on a cell-centered finite volume methodology on 3-D unstructured tetrahedral grids. In this algorithm, spatial discretization for the inviscid convective term is accomplished using an upwind scheme. A localized reconstruction is done for flow variables which is second order accurate. Evolution in time is accomplished using an explicit three-stage Runge-Kutta method which has second order temporal accuracy. This is adapted for concurrent execution using another proven methodology based on concurrent graph abstraction. This solver operates on heterogeneous network architectures. These architectures may include a broad variety of UNIX workstations and PCs running Windows NT, symmetric multiprocessors and distributed-memory multi-computers. The unstructured grid is generated using commercial grid generation tools. The grid is automatically partitioned using a concurrent algorithm based on heat diffusion. This results in memory requirements that are inversely proportional to the number of processors. The solver uses automatic granularity control and resource management techniques both to balance load and communication requirements, and deal with differing memory constraints. These ideas are again based on heat diffusion. Results are subsequently combined for visualization and analysis using commercial CFD tools. Flow simulation results are demonstrated for a constant section wing at subsonic, transonic, and a supersonic case. These results are compared with experimental data and numerical results of other researchers. Performance results are under way for a variety of network topologies.

Singh, Jatinder↗

ERTS image data compression technique evaluation

The author has identified the following significant results. Tapes of compressed ERTS data were obtained to permit later reconstruction and to prove that in general four ERTS MSS tapes can be put onto a single compressed tape. A compressed tape was reconstructed and imagery made. The data were compressed using the essentially information preserving SSDIAM algorithm, with mappings of from 1 to 3 levels and imagery was made of the result. This imagery shows that no visual degradation results from the one level mapping while compression is significantly increased. Mappings of up to three levels shows negligible deterioration in areas of moderate to high data activity, but contouring is noticeable in areas of uniform data such as the plains region.

Spencer, D. J.↗