Search NASA⌕ Search

SEARCH · Search NASA

Results for “likelihood”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 415 records · Page 23

Identification of M2/F3 stability and control derivatives from flight data containing gust effects

The application of the maximum likelihood identification technique to M2/F3 lifting body flight data containing wind gust effects is discussed. With the objective of this effort being the identification of the stability and control derivatives, it is shown first that the output error technique (or modified Newton-Raphson) fails to fit the recorded data accurately. The means of applying the maximum likelihood technique to this problem are then discussed and the results given which indicate an accurate fit to the data. The question of derivative signs opposite to the wind tunnel values is then addressed and the results of three techniques for dealing with this problem are presented. These techniques are a priori weighting, fixing parameter values, and rank deficient inverses.

Stepner, D. E.↗

A square root formulation for the combined state-parameter estimator with application to the identification of sailplane performance

A square root formulation is presented for the discrete combined state parameter estimation problem with linear plant dynamics, Gaussian random disturbances, and constant but uncertain parameters. The estimator is a combination of the classical Kalman filter and a maximum likelihood algorithm which maximizes the parameter log-likelihood function using a first order search routine.

Froidevaux, M. R.↗

On the error probability of general tree and trellis codes with applications to sequential decoding

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree codes is derived and shown to be independent of the length of the tree. An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n is derived which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence. This implication is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication and further suggest an empirical formula for the true undetected decoding error probability with sequential decoding.

Johannesson, R.↗

Automated thematic mapping and change detection of ERTS-A images

The author has identified the following significant results. A diffraction pattern analysis of MSS images led to the development of spatial signatures for farm land, urban areas and mountains. Four spatial features are employed to describe the spatial characteristics of image cells in the digital data. Three spectral features are combined with the spatial features to form a seven dimensional vector describing each cell. Then, the classification of the feature vectors is accomplished by using the maximum likelihood criterion. It was determined that the recognition accuracy with the maximum likelihood criterion depends on the statistics of the feature vectors. It was also determined that for a given geographic area the statistics of the classes remain invariable for a period of a month, but vary substantially between seasons. Three ERTS-1 images from the Phoenix, Arizona area were processed, and recognition rates between 85% and 100% were obtained for the terrain classes of desert, farms, mountains, and urban areas. To eliminate the need for training data, a new clustering algorithm has been developed. Seven ERTS-1 images from four test sites have been processed through the clustering algorithm, and high recognition rates have been achieved for all terrain classes.

Gramenopoulos, N.↗

Sequential decision analysis for nonstationary stochastic processes

A formulation of the problem of making decisions concerning the state of nonstationary stochastic processes is given. An optimal decision rule, for the case in which the stochastic process is independent of the decisions made, is derived. It is shown that this rule is a generalization of the Bayesian likelihood ratio test; and an analog to Wald's sequential likelihood ratio test is given, in which the optimal thresholds may vary with time.

Schaefer, B.↗

Classification by means of B-spline potential functions with applications to remote sensing

A method is presented for using B-splines as potential functions in the estimation of likelihood functions (probability density functions conditioned on pattern classes), or the resulting discriminant functions. The consistency of this technique is discussed. Experimental results of using the likelihood functions in the classification of remotely sensed data are given.

Bennett, J. O.↗

Upper bounds on sequential decoding performance parameters

This paper presents the best obtainable random coding and expurgated upper bounds on the probabilities of undetectable error, of t-order failure (advance to depth t into an incorrect subset), and of likelihood rise in the incorrect subset, applicable to sequential decoding when the metric bias G is arbitrary. Upper bounds on the Pareto exponent are also presented. The G-values optimizing each of the parameters of interest are determined, and are shown to lie in intervals that in general have nonzero widths. The G-optimal expurgated bound on undetectable error is shown to agree with that for maximum likelihood decoding of convolutional codes, and that on failure agrees with the block code expurgated bound. Included are curves evaluating the bounds for interesting choices of G and SNR for a binary-input quantized-output Gaussian additive noise channel.

Jelinek, F.↗

Recursive estimation of prior probabilities using the mixture approach

The problem of estimating the prior probabilities q sub k of a mixture of known density functions f sub k(X), based on a sequence of N statistically independent observations is considered. It is shown that for very mild restrictions on f sub k(X), the maximum likelihood estimate of Q is asymptotically efficient. A recursive algorithm for estimating Q is proposed, analyzed, and optimized. For the M = 2 case, it is possible for the recursive algorithm to achieve the same performance with the maximum likelihood one. For M 2, slightly inferior performance is the price for having a recursive algorithm. However, the loss is computable and tolerable.

Kazakos, D.↗

Effects of time-shifted data on flight determined stability and control derivatives

Flight data were shifted in time by various increments to assess the effects of time shifts on estimates of stability and control derivatives produced by a maximum likelihood estimation method. Derivatives could be extracted from flight data with the maximum likelihood estimation method even if there was a considerable time shift in the data. Time shifts degraded the estimates of the derivatives, but the degradation was in a consistent rather than a random pattern. Time shifts in the control variables caused the most degradation, and the lateral-directional rotary derivatives were affected the most by time shifts in any variable.

Steers, S. T.↗

A statistical technique for processing radio interferometer data

The output of a radio interferometer is the Fourier transform of the object under investigation. Due to the limited coverage of the Fourier plane, the reconstruction of the image of the source is blurred by the beam of the synthesized array. A maximum-likelihood processing technique is described which uses the statistical properties of the received noise-like signals. This technique has been used extensively in the processing of large-aperture seismic arrays. This inversion method results in a synthesized beam that is more uniform, has lower sidelobes, and higher resolution than the normal Fourier transform methods. The maximum-likelihood method algorithm was applied successfully to very long baseline and short baseline interferometric data.

Papadopoulos, G. D.↗

Nonparametric probability density estimation by optimization theoretic techniques

Two nonparametric probability density estimators are considered. The first is the kernel estimator. The problem of choosing the kernel scaling factor based solely on a random sample is addressed. An interactive mode is discussed and an algorithm proposed to choose the scaling factor automatically. The second nonparametric probability estimate uses penalty function techniques with the maximum likelihood criterion. A discrete maximum penalized likelihood estimator is proposed and is shown to be consistent in the mean square error. A numerical implementation technique for the discrete solution is discussed and examples displayed. An extensive simulation study compares the integrated mean square error of the discrete and kernel estimators. The robustness of the discrete estimator is demonstrated graphically.

Scott, D. W.↗

Digital adaptive control laws for the F-8

NASA is conducting a flight control research program in digital fly-by-wire technology using a modified F-8C aircraft. The first phase of this program used Apollo hardware to demonstrate the practicality of digital fly-by-wire in an actual test vehicle. For the second phase, conventional aircraft sensors and a large floating point digital computer are being utilized to test advanced control laws and redundancy concepts. As part of NASA's research in digital fly-by-wire technology, Honeywell developed digital adaptive flight control laws for flight test in the F-8C. Adaptation of the control laws was to be based on information sensed from conventional aircraft sensors excluding air data. The control laws were constrained to use only existing elevator, rudder, and ailerons as control effectors, each powered by existing actuators. Three adaptive control laws were successfully designed using maximum likelihood estimation, a Liapunov stable model tracker and a self-excited limit cycle concept. The maximum likelihood estimation design was selected as the most promising because of its capability to identify more than surface effectiveness parameters. The adaptive concepts, the control laws and comparisons of predicted performance are described.

Hartmann, G. L.↗

A LANDSAT study of ephemeral and perennial rangeland vegetation and soils

The author has identified the following significant results. Several methods of computer processing were applied to LANDSAT data for mapping vegetation characteristics of perennial rangeland in Montana and ephemeral rangeland in Arizona. The choice of optimal processing technique was dependent on prescribed mapping and site condition. Single channel level slicing and ratioing of channels were used for simple enhancement. Predictive models for mapping percent vegetation cover based on data from field spectra and LANDSAT data were generated by multiple linear regression of six unique LANDSAT spectral ratios. Ratio gating logic and maximum likelihood classification were applied successfully to recognize plant communities in Montana. Maximum likelihood classification did little to improve recognition of terrain features when compared to a single channel density slice in sparsely vegetated Arizona. LANDSAT was found to be more sensitive to differences between plant communities based on percentages of vigorous vegetation than to actual physical or spectral differences among plant species.

Bentley, R. G., Jr.↗

Evaluation of change detection techniques for monitoring coastal zone environments

Procedures for detecting changes in Landsat multispectral scanning imagery of coastal zone environments are discussed. Four detection procedures are examined: a comparison of independently produced spectral classifications; a classification of a multispectral difference data set; a single analysis of a multidate data set; and a maximum likelihood classification using multistage decision logic. The relatively complex maximum likelihood classification technique was found to yield results closest to those obtained with the comparison of independently produced spectral classifications, the chosen standard.

Weismiller, R. A.↗

Aircraft parameter estimation in frequency domain

The algorithms for the equation error and output error methods, the two basic procedures for the extraction of aircraft parameters from flight data, are formulated in the frequency domain. The output error method includes the maximum likelihood estimation technique. This is further extended to those cases where the measured data is in the form of frequency response curves and the model of an aircraft includes elastic degrees of freedom and unsteady aerodynamics. Then the generalized maximum likelihood method, which can be applied to the identification of an aircraft subjected to external disturbances, is introduced. Next, all estimation methods mentioned are discussed with emphasis on advantages of the frequency domain analysis. The paper concludes with an example using real flight data.

Klein, V.↗

On-line parameter estimation using a high sensitivity estimator

An on-line parameter identification method is presented. The method is based on a recursive formulation of the maximum likelihood method, with a significant modification on the gains of the state estimator. In the conventional maximum likelihood method, the Kalman gains are used in the state estimator. This produces unbiased, minimum variance parameter estimates in the presence of process noise and measurement noise, but it also slows the convergence rate when the identification is done on-line. Here we suggest choosing the gains to maximize a measure of the sensitivities of the state estimates to parameter variations. One such criterion is to minimize the trace of the inverse information matrix. This increases the convergence rate significantly. After one or two time constants, the gains are switched to the Kalman values to assure unbiased, minimum-variance estimates. The state estimate will initially be nonoptimal, and may not be adequate for control purposes. In this case, a parallel Kalman filter which uses the identifier's parameter estimates can be used. This method is applied here for the identification of a simple first-order system, and for the identification of short-period stability derivatives of an F-8 aircraft from simulated data.

Mishne, D.↗

Effect of sampling rate and record length on the determination of stability and control derivatives

Flight data from five aircraft were used to assess the effects of sampling rate and record length reductions on estimates of stability and control derivatives produced by a maximum likelihood estimation method. Derivatives could be extracted from flight data with the maximum likelihood estimation method even if there were considerable reductions in sampling rate and/or record length. Small amplitude pulse maneuvers showed greater degradation of the derivative maneuvers than large amplitude pulse maneuvers when these reductions were made. Reducing the sampling rate was found to be more desirable than reducing the record length as a method of lessening the total computation time required without greatly degrading the quantity of the estimates.

Brenner, M. J.↗

Evaluation of several schemes for classification of remotely sensed data: Their parameters and performance

The author has identified the following significant results. Data sets for corn, soybeans, winter wheat, and spring wheat were used to evaluate the following schemes for crop identification: (1) per point Gaussian maximum classifier; (2) per point sum of normal densities classifiers; (3) per point linear classifier; (4) per point Gaussian maximum likelihood decision tree classifiers; and (5) texture sensitive per field Gaussian maximum likelihood classifier. Test site location and classifier both had significant effects on classification accuracy of small grains; classifiers did not differ significantly in overall accuracy, with the majority of the difference among classifiers being attributed to training method rather than to the classification algorithm applied. The complexity of use and computer costs for the classifiers varied significantly. A linear classification rule which assigns each pixel to the class whose mean is closest in Euclidean distance was the easiest for the analyst and cost the least per classification.

Scholz, D.↗