Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “maximum 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 397 records · Page 22

UHMLE: Program description user guide

A program which computes maximum likelihood estimates for the general normal mixture is introduced. The program allows the user to fix any subsets of the mixture parameters; this fixed set may be redefined at various times in the iteration process. There is considerable time saved in computing the likelihoods if the diagonal form is specified. Hence, in the early iterations the diagonal assumption might be used, changing over to the full covariance mode later in the iteration process for a more refined solution. This flexibility allows the user to choose the sequence of parameter configurations in the iteration process which he feels will optimize the computation time required as well as possibly avoid convergence to suboptimal local maxima of the likelihood function.

Cobely, W. A.↗

Multidimensional stochastic approximation using locally contractive functions

A Robbins-Monro type multidimensional stochastic approximation algorithm which converges in mean square and with probability one to the fixed point of a locally contractive regression function is developed. The algorithm is applied to obtain maximum likelihood estimates of the parameters for a mixture of multivariate normal distributions.

Lawton, W. M.↗

Dynamics and identification of flexible aircraft

The equations of motion and a maximum likelihood parameter identification formulation are developed for a flexible aircraft. The various levels of approximation associated with the modal substitution representation of the elastic displacement field are discussed and illustrated when appropriate. The necessary extension of the parameter set of stability and control derivatives due to the aeroelastic effects is obtained.

Wells, W. R.↗

Mapping forest vegetation with ERTS-1 MSS data and automatic data processing techniques

This study was undertaken with the intent of elucidating the forest mapping capabilities of ERTS-1 MSS data when analyzed with the aid of LARS' automatic data processing techniques. The site for this investigation was the Great Dismal Swamp, a 210,000 acre wilderness area located on the Middle Atlantic coastal plain. Due to inadequate ground truth information on the distribution of vegetation within the swamp, an unsupervised classification scheme was utilized. Initially pictureprints, resembling low resolution photographs, were generated in each of the four ERTS-1 channels. Data found within rectangular training fields was then clustered into 13 spectral groups and defined statistically. Using a maximum likelihood classification scheme, the unknown data points were subsequently classified into one of the designated training classes. Training field data was classified with a high degree of accuracy (greater than 95 percent), and progress is being made towards identifying the mapped spectral classes.

Messmore, J.↗

Optical pulse timing resolution

This correspondence evaluates the performance of the maximum likelihood (ML) and several suboptimal arrival time estimators for optical pulses. The performance analysis of a 'sliding window' counter followed by a threshold detector is achieved by deriving an expression for the first-crossing density of the output of the counter.

Lee, G.↗

The decision tree classifier - Design and potential

A new classifier has been developed for the computerized analysis of remote sensor data. The decision tree classifier is essentially a maximum likelihood classifier using multistage decision logic. It is characterized by the fact that an unknown sample can be classified into a class using one or several decision functions in a successive manner. The classifier is applied to the analysis of data sensed by Landsat-1 over Kenosha Pass, Colorado. The classifier is illustrated by a tree diagram which for processing purposes is encoded as a string of symbols such that there is a unique one-to-one relationship between string and decision tree.

Hauska, H.↗

Data resolution versus forestry classification and modeling

This paper examines the effects on timber stand computer classification accuracies caused by changes in the resolution of remotely sensed multispectral data. This investigation is valuable, especially for determining optimal sensor and platform designs. Theoretical justification and experimental verification support the finding that classification accuracies for low resolution data could be better than the accuracies for data with higher resolution. The increase in accuracy is constructed as due to the reduction of scene inhomogeneity at lower resolution. The computer classification scheme was a maximum likelihood classifier.

Kan, E. P.↗

A general non-parametric classifier applied to discriminating surface water from terrain shadows

A general non-parametric classifier is described in the context of discriminating surface water from terrain shadows. In addition to using non-parametric statistics, this classifier permits the use of a cost matrix to assign different penalties to various types of misclassifications. The approach also differs from conventional classifiers in that it applies the maximum-likelihood criterion to overall class probabilities as opposed to the standard practice of choosing the most likely individual subclass. The classifier performance is evaluated using two different effectiveness measures for a specific set of ERTS data.

Eppler, W. G.↗

A random search algorithm for laboratory computers

The small laboratory computer is ideal for experimental control and data acquisition. Postexperimental data processing is often performed on large computers because of the availability of sophisticated programs, but costs and data compatibility are negative factors. Parameter optimization can be accomplished on the small computer, offering ease of programming, data compatibility, and low cost. A previously proposed random-search algorithm ('random creep') was found to be very slow in convergence. A method is proposed (the 'random leap' algorithm) which starts in a global search mode and automatically adjusts step size to speed convergence. A FORTRAN executive program for the random-leap algorithm is presented which calls a user-supplied function subroutine. An example of a function subroutine is given which calculates maximum-likelihood estimates of receiver operating-characteristic parameters from binary response data. Other applications in parameter estimation, generalized least squares, and matrix inversion are discussed.

Curry, R. E.↗

Geologic mapping using LANDSAT data

The feasibility of automated classification for lithologic mapping with LANDSAT digital data was evaluated using three classification algorithms. The two supervised algorithms analyzed, a linear discriminant analysis algorithm and a hybrid algorithm which incorporated the Parallelepiped algorithm and the Bayesian maximum likelihood function, were comparable in terms of accuracy; however, classification was only 50 per cent accurate. The linear discriminant analysis algorithm was three times as efficient as the hybrid approach. The unsupervised classification technique, which incorporated the CLUS algorithm, delineated the major lithologic boundaries and, in general, correctly classified the most prominent geologic units. The unsupervised algorithm was not as efficient nor as accurate as the supervised algorithms. Analysis of spectral data for the lithologic units in the 0.4 to 2.5 microns region indicated that a greater separability of the spectral signatures could be obtained using wavelength bands outside the region sensed by LANDSAT.

Siegal, B. S.↗

Mapping forest vegetation with ERTS-1 MSS data and automatic data processing techniques

This study was undertaken with the intent of elucidating the forest mapping capabilities of ERTS-1 MSS data when analyzed with the aid of LARS' automatic data processing techniques. The site for this investigation was the Great Dismal Swamp, a 210,000 acre wilderness area located on the Middle Atlantic coastal plain. Due to inadequate ground truth information on the distribution of vegetation within the swamp, an unsupervised classification scheme was utilized. Initially pictureprints, resembling low resolution photographs, were generated in each of the four ERTS-1 channels. Data found within rectangular training fields was then clustered into 13 spectral groups and defined statistically. Using a maximum likelihood classification scheme, the unknown data points were subsequently classified into one of the designated training classes. Training field data was classified with a high degree of accuracy (greater than 95%), and progress is being made towards identifying the mapped spectral classes.

Messmore, J.↗

Convolutional code performance in the Rician fading channel

The performance of short constraint length convolutional codes in conjunction with binary phase-shift keyed (BPSK) modulation and Viterbi maximum likelihood decoding on the classical Rician fading channel is examined in detail. Primary interest is in the bit error probability performance as a function of E sub b/N sub 0 parameterized by the fading channel parameters. Fairly general upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results in the two extremes of zero channel memory and infinite channel memory. The efficacy of simple block interleaving in combating the memory of the channel is thoroughly explored. Results include the effects of fading on tracking loop performance and the subsequent impact on overall coded system performance. The approach is analytical where possible; otherwise resort is made to digital computer simulation.

Modestino, J. W.↗

The MIDAS processor

The MIDAS (Multivariate Interactive Digital Analysis System) processor is a high-speed processor designed to process multispectral scanner data (from Landsat, EOS, aircraft, etc.) quickly and cost-effectively to meet the requirements of users of remote sensor data, especially from very large areas. MIDAS consists of a fast multipipeline preprocessor and classifier, an interactive color display and color printer, and a medium scale computer system for analysis and control. The system is designed to process data having as many as 16 spectral bands per picture element at rates of 200,000 picture elements per second into as many as 17 classes using a maximum likelihood decision rule.

Kriegler, F. J.↗

A decision directed detector for the phase incoherent Gaussian channel

A vector digital signalling scheme is proposed for simultaneous adaptive data transmission and phase estimation. The use of maximum likelihood estimation methods predicts a better performance than the phase-locked loop. The phase estimate is shown to converge to the true value, so that the adaptive nature of the detector effectively achieves phase acquisition and improvement in performance. No separate synchronization interval is required and phase fluctuations can be tracked simultaneously with the transmission of information.

Kazakos, D.↗

Performance of coded MFSK in a Rician fading channel

The performance of convolutional codes in conjunction with noncoherent multiple frequency shift-keyed (MFSK) modulation and Viterbi maximum likelihood decoding on a Rician fading channel is examined in detail. While the primary motivation underlying this work has been concerned with system performance on the planetary entry channel, it is expected that the results are of considerably wider interest. Particular attention is given to modeling the channel in terms of a few meaningful parameters which can be correlated closely with the results of theoretical propagation studies. Fairly general upper bounds on bit error probability performance in the presence of fading are derived and compared with simulation results using both unquantized and quantized receiver outputs. The effects of receiver quantization and channel memory are investigated and it is concluded that the coded noncoherent MFSK system offers an attractive alternative to coherent BPSK in providing reliable low data rate communications in fading channels typical of planetary entry missions.

Modestino, J. W.↗

Performance of some block codes on a Gaussian channel

A technique proposed by Chase (1972) is used to evaluate the performance of several fairly long binary block codes on a wideband additive Gaussian channel. Considerations leading to the use of Chase's technique are discussed. Chase's concepts are first applied to the most powerful practical class of binary codes, the BCH codes with Berlekamp's (1972) decoding algorithm. Chase's algorithm is then described along with proposed selection of candidate codes. Results are presented of applying Chase's algorithm to four binary codes: (23, 12) Golay code, (32, 16) second-order Reed-Muller code, (63, 36) 5-error correcting BCH code, and (95, 39) 9-error correcting shortened BCH code. It is concluded that there are many block codes of length not exceeding 100 with extremely attractive maximum likelihood decoding performance on a Gaussian channel. BCH codes decoded via Berlekamp's binary decoding algorithm and Chase's idea are close to being practical competitors to short-constraint length convolutional codes with Viterbi decoding.

Baumert, L. D.↗