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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Kernelized Generalized Likelihood Ratio Test for Spectrum Sensing in Cognitive Radio

Spectrum sensing in next-generation wireless radio networks is considered a key technology to overcome the problem of spectrum scarcity. Unfortunately, many approaches to spectrum sensing do not work well in low signal-to-noise ratio (SNR) environments. This paper proposes and analyzes a new algorithm named kernelized generalized likelihood ratio test (KGLRT) for spectrum sensing in cognitive radio systems to overcome this problem. Effectively, KGLRT uses a nonlinear kernel to map input data onto a high-dimensional feature space; then, the widely accepted (linear) generalized likelihood ratio test is used for hypothesis testing. This new algorithm gives a gain of 4 dB in SNR over its linear counterpart. A theoretical analysis for this algorithm is given for the first time and is shown analogous to algorithms used in image signal processing. The detection metrics are found to be concentrated random variables; furthermore, the probability distributions of the detection metrics are proved to follow the F -distributions, which agree with the results obtained using the concentration inequality. The analytical thresholds are derived for target false-alarm probabilities. Here, the thresholds are independent of noise power; thus, the proposed algorithm can overcome noise uncertainty issues at very low SNR levels. Simulations validate the theoretical results.

47 OTHER INSTRUMENTATION↗
DOE OSTI2014

Task-based detectability in CT image reconstruction by filtered backprojection and penalized likelihood estimation

Purpose: Nonstationarity is an important aspect of imaging performance in CT and cone-beam CT (CBCT), especially for systems employing iterative reconstruction. This work presents a theoretical framework for both filtered-backprojection (FBP) and penalized-likelihood (PL) reconstruction that includes explicit descriptions of nonstationary noise, spatial resolution, and task-based detectability index. Potential utility of the model was demonstrated in the optimal selection of regularization parameters in PL reconstruction. Methods: Analytical models for local modulation transfer function (MTF) and noise-power spectrum (NPS) were investigated for both FBP and PL reconstruction, including explicit dependence on the object and spatial location. For FBP, a cascaded systems analysis framework was adapted to account for nonstationarity by separately calculating fluence and system gains for each ray passing through any given voxel. For PL, the point-spread function and covariance were derived using the implicit function theorem and first-order Taylor expansion according toFessler [“Mean and variance of implicitly defined biased estimators (such as penalized maximum likelihood): Applications to tomography,” IEEE Trans. Image Process. 5(3), 493–506 (1996)]. Detectability index was calculated for a variety of simple tasks. The model for PL was used in selecting the regularization strength parameter to optimize task-based performance, with both a constant and a spatially varying regularization map. Results: Theoretical models of FBP and PL were validated in 2D simulated fan-beam data and found to yield accurate predictions of local MTF and NPS as a function of the object and the spatial location. The NPS for both FBP and PL exhibit similar anisotropic nature depending on the pathlength (and therefore, the object and spatial location within the object) traversed by each ray, with the PL NPS experiencing greater smoothing along directions with higher noise. The MTF of FBP is isotropic and independent of location to a first order approximation, whereas the MTF of PL is anisotropic in a manner complementary to the NPS. Task-based detectability demonstrates dependence on the task, object, spatial location, and smoothing parameters. A spatially varying regularization “map” designed from locally optimal regularization can improve overall detectability beyond that achievable with the commonly used constant regularization parameter. Conclusions: Analytical models for task-based FBP and PL reconstruction are predictive of nonstationary noise and resolution characteristics, providing a valuable framework for understanding and optimizing system performance in CT and CBCT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2016

SU-C-207A-01: A Novel Maximum Likelihood Method for High-Resolution Proton Radiography/proton CT

Purpose: Multiple Coulomb scattering is the largest contributor to blurring in proton imaging. Here we tested a maximum likelihood least squares estimator (MLLSE) to improve the spatial resolution of proton radiography (pRad) and proton computed tomography (pCT). Methods: The object is discretized into voxels and the average relative stopping power through voxel columns defined from the source to the detector pixels is optimized such that it maximizes the likelihood of the proton energy loss. The length spent by individual protons in each column is calculated through an optimized cubic spline estimate. pRad images were first produced using Geant4 simulations. An anthropomorphic head phantom and the Catphan line-pair module for 3-D spatial resolution were studied and resulting images were analyzed. Both parallel and conical beam have been investigated for simulated pRad acquisition. Then, experimental data of a pediatric head phantom (CIRS) were acquired using a recently completed experimental pCT scanner. Specific filters were applied on proton angle and energy loss data to remove proton histories that underwent nuclear interactions. The MTF10% (lp/mm) was used to evaluate and compare spatial resolution. Results: Numerical simulations showed improvement in the pRad spatial resolution for the parallel (2.75 to 6.71 lp/cm) and conical beam (3.08 to 5.83 lp/cm) reconstructed with the MLLSE compared to averaging detector pixel signals. For full tomographic reconstruction, the improved pRad were used as input into a simultaneous algebraic reconstruction algorithm. The Catphan pCT reconstruction based on the MLLSE-enhanced projection showed spatial resolution improvement for the parallel (2.83 to 5.86 lp/cm) and conical beam (3.03 to 5.15 lp/cm). The anthropomorphic head pCT displayed important contrast gains in high-gradient regions. Experimental results also demonstrated significant improvement in spatial resolution of the pediatric head radiography. Conclusion: The proposed MLLSE shows promising potential to increase the spatial resolution (up to 244%) in proton imaging.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

Posterior propriety for hierarchical models with log-likelihoods that have norm bounds

Statisticians often use improper priors to express ignorance or to provide good frequency properties, requiring that posterior propriety be verified. Our paper addresses generalized linear mixed models, GLMMs, when Level I parameters have Normal distributions, with many commonly-used hyperpriors. It provides easy-to-verify sufficient posterior propriety conditions based on dimensions, matrix ranks, and exponentiated norm bounds, ENBs, for the Level I likelihood. Since many familiar likelihoods have ENBs, which is often verifiable via log-concavity and MLE finiteness, our novel use of ENBs permits unification of posterior propriety results and posterior MGF/moment results for many useful Level I distributions, including those commonly used with multilevel generalized linear models, e.g., GLMMs and hierarchical generalized linear models, HGLMs. Furthermore, those who need to verify existence of posterior distributions or of posterior MGFs/moments for a multilevel generalized linear model given a proper or improper multivariate F prior as in Section 1 should find the required results in Sections 1 and 2 and Theorem 3 (GLMMs), Theorem 4 (HGLMs), or Theorem 5 (posterior MGFs/moments).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Anomaly Attribution with Likelihood Compensation

This paper addresses the task of explaining anomalous predictions of a black-box regression model. When using a black-box model, such as one to predict building energy consumption from many sensor measurements, we often have a situation where some observed samples may significantly deviate from their prediction. It may be due to a sub-optimal black-box model, or simply because those samples are outliers. In either case, one would ideally want to compute a responsibility score indicative of the extent to which an input variable is responsible for the anomalous output. In this work, we formalize this task as a statistical inverse problem: Given model deviation from the expected value, infer the responsibility score of each of the input variables. We propose a new method called likelihood compensation (LC), which is founded on the likelihood principle and computes a correction to each input variable. To the best of our knowledge, this is the first principled framework that computes a responsibility score for real valued anomalous model deviations. We apply our approach to a real-world building energy prediction task and confirm its utility based on expert feedback.

Idé, Tsuyoshi↗
DOE OSTI2025

Probing Anisotropic Cosmic Birefringence with Foreground-Marginalised SPT B-mode Likelihoods

In this work, we construct foreground-marginalised versions of the SPT-3G D1 and SPTpol cosmic microwave background (CMB) B-mode polarisation likelihoods. The compression is performed using the CMB-lite framework and we use the resulting data sets to constrain anisotropic cosmic birefringence, parametrised by the amplitude of a scale-invariant anisotropic birefringence spectrum, A CB . Using the new SPT-3G data we report a upper limit on of 95% upper limit on A CB of 1.2 x 10 -4 , which tightens to 0.53 x 10 -4 when imposing a prior on the amplitude of gravitational lensing based on CMB lensing reconstruction analyses. These are the tightest constraints on anisotropic birefringence from BB power spectrum measurements to-date, demonstrating the constraining power of the South Pole Telescope. The likelihoods used in this work are made publicly available at https://github.com/lbalkenhol/candl_data

Balkenhol, Lennart [Sorbonne Université, Paris (Fr↗
NASA NTRS1968

Maximum Likelihood Properties

Maximum likelihood properties and asymptotic distributions for limiting distribution of likelihood ratio statistic under class of local alternatives

Lever, W. E.↗
NASA NTRS1972

Longitudinal stability and control derivatives of a jet fighter airplane extracted from flight test data by utilizing maximum likelihood estimation

A method of parameter extraction for stability and control derivatives of aircraft from flight test data, implementing maximum likelihood estimation, was developed and successfully applied to actual longitudinal flight test data from a modern sophisticated jet fighter. The results of this application establish the merits of the estimation technique and its computer implementation(allowing full analyst interaction with the program) as well as provide data for the validation of a portion of the differential maneuvering simulator (DMS). The results are presented for all flight test runs in tabular form and as time history comparisons between the estimated states and the actual flight test data. Comparisons between extracted and manufacturer's values for five major derivatives are presented and reveal good agreement for these principal derivatives with one exception. This particular derivative is extensively investigated by utilizing the interactive capabilities of the computer program. The results of this investigation verify the numbers extracted by maximum likelihood estimation.

Steinmetz, G. G.↗
NASA NTRS1973

Maximum likelihood classification by thresholding

The standard maximum-likelihood classifier is reformulated so that, in most cases, only a small number of density functions need be computed each time a data point is to be classified. The technique relies upon class thresholds which are obtained at the beginning of the classification process and which remain fixed thereafter. The result of the reformulation is that a significant reduction in classification processing time is obtained while retaining complete consistency with the standard maximum-likelihood classifier.

Minter, T. C.↗
NASA NTRS1975

Maximum likelihood signature estimation

Maximum-likelihood estimates are discussed which are based on an unlabeled sample of observations, of unknown parameters in a mixture of normal distributions. Several successive approximation procedures for obtaining such maximum-likelihood estimates are described. These procedures, which are theoretically justified by the local contractibility of certain maps, are designed to take advantage of good initial estimates of the unknown parameters. They can be applied to the signature extension problem, in which good initial estimates of the unknown parameters are obtained from segments which are geographically near the segments from which the unlabeled samples are taken. Additional problems to which these methods are applicable include: estimation of proportions and adaptive classification (estimation of mean signatures and covariances).

Walker, H. F.↗
NASA NTRS1974

Computational aspects of maximum likelihood estimation and reduction in sensitivity function calculations

This paper discusses numerical aspects of computing maximum likelihood estimates for linear dynamical systems in state-vector form. Different gradient-based nonlinear programming methods are discussed in a unified framework and their applicability to maximum likelihood estimation is examined. The problems due to singular Hessian or singular information matrix that are common in practice are discussed in detail and methods for their solution are proposed. New results on the calculation of state sensitivity functions via reduced order models are given. Several methods for speeding convergence and reducing computation time are also discussed.

Gupta, N. K.↗
NASA NTRS1975

An iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions, Addendum

New results and insights concerning a previously published iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions were discussed. It was shown that the procedure converges locally to the consistent maximum likelihood estimate as long as a specified parameter is bounded between two limits. Bound values were given to yield optimal local convergence.

Peters, B. C., Jr.↗
NASA NTRS1976

The recursive maximum likelihood proportion estimator: User's guide and test results

Implementation of the recursive maximum likelihood proportion estimator is described. A user's guide to programs as they currently exist on the IBM 360/67 at LARS, Purdue is included, and test results on LANDSAT data are described. On Hill County data, the algorithm yields results comparable to the standard maximum likelihood proportion estimator.

Vanrooy, D. L.↗
NASA NTRS1975

A note on the consistency of maximum likelihood estimates for finite families of stochastic processes

The note considers families of stochastic processes indexed by a finite number of alternative parameter values. For general classes of stochastic processes, it is shown that maximum-likelihood estimates converge almost surely to the correct parameter value. This is established by use of a submartingale property of the sequence of maximized-likelihood ratios together with a technique first employed by Wald (1949) in the case of independent identically distributed random variables.

Caines, P. E.↗
NASA NTRS1975

Regions of constrained maximum likelihood parameter identifiability

This paper considers the parameter identification problem of general discrete-time, nonlinear, multiple-input/multiple-output dynamic systems with Gaussian-white distributed measurement errors. Knowledge of the system parameterization is assumed to be known. Regions of constrained maximum likelihood (CML) parameter identifiability are established. A computation procedure employing interval arithmetic is proposed for finding explicit regions of parameter identifiability for the case of linear systems. It is shown that if the vector of true parameters is locally CML identifiable, then with probability one, the vector of true parameters is a unique maximal point of the maximum likelihood function in the region of parameter identifiability and the CML estimation sequence will converge to the true parameters.

Lee, C.-H.↗