Search NASA⌕ Search

SEARCH · Search NASA

Results for “Error estimation”

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 595 records · Page 33

Techniques for correcting transmission errors in video adaptive delta modulation channels

We investigated the effects of channel errors on an adaptive delta modulator used to encode video signals. The investigation revealed that channel errors caused a permanent shift in the dc level of the delta modulator's estimate. Errors in the step size, on the other hand, were transitory and had no noticeable effect on the received pictures. We then presented three error correction schemes to minimize the visibility of the channel errors in the received picture. The first scheme required the transmitter to periodically send the correct dc level of the estimate to the receiver. The second method employed a leaky integrator, and the third method used line-to-line interpolation

Scheinberg, N.↗

Limited‐memory adaptive snapshot selection for proper orthogonal decomposition

Summary Reduced order models are useful for accelerating simulations in many‐query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models (ROMs) can have prohibitively expensive memory and floating‐point operation costs in high‐performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time‐stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition‐based ROMs, and memory usage is minimized by computing the singular value decomposition using a single‐pass incremental algorithm. Results for a viscous Burgers' test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full‐order model is recovered to within discretization error. A parallel version of the resulting method can be used on supercomputers to generate proper orthogonal decomposition‐based ROMs, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space. Copyright © 2016 John Wiley & Sons, Ltd.

Oxberry, Geoffrey M.↗

Limited-memory adaptive snapshot selection for proper orthogonal decomposition

Reduced order models are useful for accelerating simulations in many-query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models can have prohibitively expensive memory and floating-point operation costs in high-performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time-stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition-based reduced order models, and memory usage is minimized by computing the singular value decomposition using a single-pass incremental algorithm. Results for a viscous Burgers’ test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full order model is recovered to within discretization error. The resulting method can be used on supercomputers to generate proper orthogonal decomposition-based reduced order models, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space.

97 MATHEMATICS AND COMPUTING↗

An Algebra of Machine Learners with Applications

Machine learning (ML) methods are increasingly being applied to solve complex, data-driven problems in diverse areas, by exploiting the physical laws derived from first principles such as thermal hydraulics and the abstract laws developed recently for data and computing infrastructures. These physical and abstract laws encapsulate, typically in compact algebraic forms, the critical knowledge that complements data-driven ML models. We present a unified perspective of these laws and ML methods using an abstract algebra (A;⊕,Ⓧ), wherein the performance estimation and classification tasks are characterized by the additive ⊕ operations, and the diagnosis, reconstruction, and optimization tasks are characterized by the difference Ⓧ operations. This abstraction provides ML codes and their performance characterizations that are transferable across different areas. We describe practical applications of these abstract operations using examples of throughput profile estimation tasks in data transport infrastructures, and power-level and sensor error estimation tasks in nuclear reactor systems.

Rao, Nageswara↗

Maximum likelihood method for estimating airplane stability and control parameters from flight data in frequency domain

A frequency domain maximum likelihood method is developed for the estimation of airplane stability and control parameters from measured data. The model of an airplane is represented by a discrete-type steady state Kalman filter with time variables replaced by their Fourier series expansions. The likelihood function of innovations is formulated, and by its maximization with respect to unknown parameters the estimation algorithm is obtained. This algorithm is then simplified to the output error estimation method with the data in the form of transformed time histories, frequency response curves, or spectral and cross-spectral densities. The development is followed by a discussion on the equivalence of the cost function in the time and frequency domains, and on advantages and disadvantages of the frequency domain approach. The algorithm developed is applied in four examples to the estimation of longitudinal parameters of a general aviation airplane using computer generated and measured data in turbulent and still air. The cost functions in the time and frequency domains are shown to be equivalent; therefore, both approaches are complementary and not contradictory. Despite some computational advantages of parameter estimation in the frequency domain, this approach is limited to linear equations of motion with constant coefficients.

Klein, V.↗

Deep Interacting Multiple Model Filtering

In this paper, a deep learning-based multiple model estimation framework is presented for the state estimation of hybrid dynamical systems from high dimensional observations such as camera images. A low dimensional vector which represents the measurement of the latent dynamical system and its corresponding variance are learned using a deep encoder neural network. An Interacting Multiple Model (IMM) filter is used to generate the latent state estimates and covariances using multiple dynamical models, which can be learned using backpropagation through time. The state estimates of the dynamical system and the corresponding covariance matrix are generated from the latent state estimates and covariance using a deep decoder neural network. The whole network is trained in an end-to-end manner using a loss function which minimizes the negative log-likelihood of the neural network parameters. Simulation results are presented using a 2D bouncing ball example and estimation error statistics are computed which demonstrates the accuracy and consistency of the estimation.

Ghananeel Rotithor↗

Ionospheric refraction effects on orbit determination using the orbit determination error analysis system

The influence of ionospheric refraction on orbit determination was studied through the use of the Orbit Determination Error Analysis System (ODEAS). The results of a study of the orbital state estimate errors due to the ionospheric refraction corrections, particularly for measurements involving spacecraft-to-spacecraft tracking links, are presented. In current operational practice at the Goddard Space Flight Center (GSFC) Flight Dynamics Facility (FDF), the ionospheric refraction effects on the tracking measurements are modeled in the Goddard Trajectory Determination System (GTDS) using the Bent ionospheric model. While GTDS has the capability of incorporating the ionospheric refraction effects for measurements involving ground-to-spacecraft tracking links, such as those generated by the Ground Spaceflight Tracking and Data Network (GSTDN), it does not have the capability to incorporate the refraction effects for spacecraft-to-spacecraft tracking links for measurements generated by the Tracking and Data Relay Satellite System (TDRSS). The lack of this particular capability in GTDS raised some concern about the achievable accuracy of the estimated orbit for certain classes of spacecraft missions that require high-precision orbits. Using an enhanced research version of GTDS, some efforts have already been made to assess the importance of the spacecraft-to-spacecraft ionospheric refraction corrections in an orbit determination process. While these studies were performed using simulated data or real tracking data in definitive orbit determination modes, the study results presented here were obtained by means of covariance analysis simulating the weighted least-squares method used in orbit determination.

Yee, C. P.↗

Deconvolution Approach to Carrier and Code Multipath Error Elimination in High Precision GPS

This paper proposes a novel technique based on the deconvolution approach of the simultaneous estimation and compensation of the multipath estimation errors in both the carrier phase lock and the code delay lock loops in GPS receivers. Simulation results are presented showing that the proposed GPS receiver algorithm achieves high precision in the range and differential range estimation in various GPS precision applications such as spacecraft attitude control, even in a relatively severe multipath environment.

GPS↗

LAMOST DR1: Stellar Parameters and Chemical Abundances with SP-Ace

We present a new analysis of the LAMOST DR1 survey spectral database performed with the code SP-Ace, which provides the derived stellar parameters T{sub eff}, logg, [Fe/H], and [α/H] for 1,097,231 stellar objects. We tested the reliability of our results by comparing them to reference results from high spectral resolution surveys. The expected errors can be summarized as ∼120 K in T{sub eff}, ∼0.2 in logg, ∼0.15 dex in [Fe/H], and ∼0.1 dex in [α/Fe] for spectra with S/N > 40, with some differences between dwarf and giant stars. SP-Ace provides error estimations consistent with the discrepancies observed between derived and reference parameters. Some systematic errors are identified and discussed. The resulting catalog is publicly available at the LAMOST and CDS websites.

79 ASTRONOMY AND ASTROPHYSICS↗

Filtering flight data prior to aerodynamic system identification

An algorithm for processing flight-test data to provide state estimates and instrument calibrations for aerodynamic or hydrodynamic system identification by the equation error estimation method is developed and demonstrated on synthesized data. The extended-Kalman-filter algorithm employs a locally level, north-pointing frame of reference, accounts for rotating ellipsoidal earth effects, and estimates sensor bias, scale factors, wind components, and process noise levels by maximum-likelihood parameters. The method is found to be most effective with navigation quality inertial input data. The algorithm is applied to data from a six-degree-of-freedom F-4 aircraft simulation and shown to produce state estimates in good agreement with the simulation values.

Trankle, T. L.↗

Automated mesoscale winds derived from GOES multispectral imagery

An automated technique for extracting mesoscale winds from sequences of GOES VISSR image pairs was developed, tested and configured for quasi-real time/research applications on a computing system which gives mesoscale wind estimates at the highest spatial/temporal resolution possible from the VISSR imagery down to a wind vector separation of 10 km. Preprocessing of imagery using IR resampling, VIS edge preserving filtering, and reduced VIS resolution averaging improved height assignments and vector extraction for 10, 15, and 30 min imagery. An objective quality control system provides much greater than 99% accuracy in eliminating questionable wind estimates. Automated winds generally have better spatial coverage and density, and have random error estimates half as large as the manual winds. Dynamical analysis of cloud wind divergence revealed temporally consistent convergence centers on the meso beta scale that are highly correlated with on going and future developing convective storms. The entire system of computer codes was successfully vectorized for execution on an array processor resulting in job turnaround in less than one hour.

Wilson, G. S.↗

A Proposed Clock Synchronization Method for the Solar System Internet

Networked communications in space are necessary to achieve scalability in terms of the number of communicating nodes but also in terms of the overall system complexity. A key component to such a system is the ability to synchronize clocks, which is the focus of this paper. The so-called Solar System Internet (SSI) will be built upon Delay Tolerant Networking (DTN), which, in analogy to the Internet Protocol (IP), can be considered a suite of protocols necessary for networking in the space domain. Therefore, our goal is to extend this suite to include a DTN clock synchronization capability, analogous to the Network Time Protocol (NTP) used in the Internet. A motivating example of a network in space is NASA’s LunaNet, a vision for a multi-hop multi-path network extending to the moon wherein not all nodes will have direct connections to an authoritative reference clock. In this paper, we propose a general clock synchronization methodology and algorithm that could be used for LunaNet as well as more elaborate time-varying networks. In recent years, DTN has benefited from modeling efforts founded on the mathematical tool of sheaves. Here we continue this work to provide an approach to clock synchronization. Due to the time-varying nature of space networks, absolute consensus is not possible. However, the sheaf Laplacian provides a practical, distributed approach to approximating consensus by allowing data to diffuse through the network. In particular, the sheaf Laplacian is readily computable, lending our approach to implementation. Our approach is well suited to handle the difficulties of space networks. For instance, differences in clock accuracy mean certain nodes are more authoritative than others; we can account for these differences through hierarchies in the network, generalizing the strata in NTP. Furthermore, just as error estimation is an integral part of NTP, we are able to give concrete error bounds for our approach. Indeed, different applications (e.g., communications schedules, pointing, navigation, distributed science) will have different requirements, hence it is necessary to maintain clocks within a given tolerance. We outline some of the necessary steps to turn our approach into a practical network protocol that could be used in DTN, and we conclude the paper with suggestions for future research.

Michael Moy↗

Multiview marker-free registration of forest terrestrial laser scanner data with embedded confidence metrics

Terrestrial laser scanning has demonstrated increasing potential for rapid comprehensive measurement of forest structure, especially when multiple scans are spatially registered in order to reduce the limitations of occlusion. Although marker-based registration techniques (based on retro-reflective spherical targets) are commonly used in practice, a blind marker-free approach is preferable, insofar as it supports rapid operational data acquisition. To support these efforts, we extend the pairwise registration approach of our earlier work, and develop a graph-theoretical framework to perform blind marker-free global registration of multiple point cloud data sets. Pairwise pose estimates are weighted based on their estimated error, in order to overcome pose conflict while exploiting redundant information and improving precision. The proposed approach was tested for eight diverse New England forest sites, with 25 scans collected at each site. Quantitative assessment was provided via a novel embedded confidence metric, with a mean estimated root-mean-square error of 7.2 cm and 89% of scans connected to the reference node. Lastly, this paper assesses the validity of the embedded multiview registration confidence metric and evaluates the performance of the proposed registration algorithm.

47 OTHER INSTRUMENTATION↗

Dynamically accumulated dose and 4D accumulated dose for moving tumors

Purpose: The purpose of this work was to investigate the relationship between dynamically accumulated dose (dynamic dose) and 4D accumulated dose (4D dose) for irradiation of moving tumors, and to quantify the dose uncertainty induced by tumor motion. Methods: The authors established that regardless of treatment modality and delivery properties, the dynamic dose will converge to the 4D dose, instead of the 3D static dose, after multiple deliveries. The bounds of dynamic dose, or the maximum estimation error using 4D or static dose, were established for the 4D and static doses, respectively. Numerical simulations were performed (1) to prove the principle that for each phase, after multiple deliveries, the average number of deliveries for any given time converges to the total number of fractions (K) over the number of phases (N); (2) to investigate the dose difference between the 4D and dynamic doses as a function of the number of deliveries for deliveries of a 'pulsed beam'; and (3) to investigate the dose difference between 4D dose and dynamic doses as a function of delivery time for deliveries of a 'continuous beam.' A Poisson model was developed to estimate the mean dose error as a function of number of deliveries or delivered time for both pulsed beam and continuous beam. Results: The numerical simulations confirmed that the number of deliveries for each phase converges to K/N, assuming a random starting phase. Simulations for the pulsed beam and continuous beam also suggested that the dose error is a strong function of the number of deliveries and/or total deliver time and could be a function of the breathing cycle, depending on the mode of delivery. The Poisson model agrees well with the simulation. Conclusions: Dynamically accumulated dose will converge to the 4D accumulated dose after multiple deliveries, regardless of treatment modality. Bounds of the dynamic dose could be determined using quantities derived from 4D doses, and the mean dose difference between the dynamic dose and 4D dose as a function of number of deliveries and/or total deliver time was also established.

60 APPLIED LIFE SCIENCES↗

The discrete correlation function: A new method for analyzing unevenly sampled variability data

A method of measuring correlation functions without interpolating in the temporal domain, the discrete correlation function, is introduced. It provides an assumption-free representation of the correlation measured in the data, and allows meaningful error estimates. This method does not produce spurious correlations at zero lag due to correlated errors. It is shown that physical interpretation of active galactic nuclei cross-correlation functions requires knowledge of the input function's fluctuation power spectrum, involves model-dependence in the form of symmetry assumptions, and must take into account intrinsic scale bias. This technique was used to find a correlation in published IUE data for NGC 4151, which indicates that the broad C IV feature emanates from a shell 15 to 75 light-days in radius, assuming spherical symmetry.

Edelson, R. A.↗

Statistical plant set estimation using Schroeder-phased multisinusoidal input design

A frequency domain method is developed for plant set estimation. The estimation of a plant 'set' rather than a point estimate is required to support many methods of modern robust control design. The approach here is based on using a Schroeder-phased multisinusoid input design which has the special property of placing input energy only at the discrete frequency points used in the computation. A detailed analysis of the statistical properties of the frequency domain estimator is given, leading to exact expressions for the probability distribution of the estimation error, and many important properties. It is shown that, for any nominal parametric plant estimate, one can use these results to construct an overbound on the additive uncertainty to any prescribed statistical confidence. The 'soft' bound thus obtained can be used to replace 'hard' bounds presently used in many robust control analysis and synthesis methods.

Bayard, D. S.↗

THE SLOAN LENS ACS SURVEY. IX. COLORS, LENSING, AND STELLAR MASSES OF EARLY-TYPE GALAXIES

We present the current photometric data set for the Sloan Lens ACS (SLACS) Survey, including Hubble Space Telescope (HST) photometry from Advanced Camera for Surveys, WFPC2, and NICMOS. These data have enabled the confirmation of an additional 15 grade 'A' (certain) lens systems, bringing the number of SLACS grade 'A' lenses to 85; including 13 grade 'B' (likely) systems, SLACS has identified nearly 100 lenses and lens candidates. Approximately 80% of the grade 'A' systems have elliptical morphologies while approx10% show spiral structure; the remaining lenses have lenticular morphologies. Spectroscopic redshifts for the lens and source are available for every system, making SLACS the largest homogeneous data set of galaxy-scale lenses to date. We have created lens models using singular isothermal ellipsoid mass distributions for the 11 new systems that are dominated by a single mass component and where the multiple images are detected with sufficient signal to noise; these models give a high precision measurement of the mass within the Einstein radius of each lens. We have developed a novel Bayesian stellar population analysis code to determine robust stellar masses with accurate error estimates. We apply this code to deep, high-resolution HST imaging and determine stellar masses with typical statistical errors of 0.1 dex; we find that these stellar masses are unbiased compared to estimates obtained using SDSS photometry, provided that informative priors are used. The stellar masses range from 10{sup 10.5} to 10{sup 11.8} M{sub sun} and the typical stellar mass fraction within the Einstein radius is 0.4, assuming a Chabrier initial mass function. The ensemble properties of the SLACS lens galaxies, e.g., stellar masses and projected ellipticities, appear to be indistinguishable from other SDSS galaxies with similar stellar velocity dispersions. This further supports that SLACS lenses are representative of the overall population of massive early-type galaxies with M{sub *} approx> 10{sup 11} M{sub sun}, and are therefore an ideal data set to investigate the kpc-scale distribution of luminous and dark matter in galaxies out to z approx 0.5.

79 ASTRONOMY AND ASTROPHYSICS↗