Fast, approximate maximum a posteriori probability parameter estimation

Brian F. Harrison

doi:10.1109/97.566699

Return

Fast, approximate maximum a posteriori probability parameter estimation

1997-04-01

PRE

Brian F. Harrison

D.W. Tufts

R.J. Vaccaro

DOI：10.1109/97.566699

Original

Original request for help

Save

Abstract

En 中文

In many estimation problems, the set of unknown parameters can be divided into a subset of desired parameters and a subset of nuisance parameters. Using a maximum a posteriori (MAP) approach to parameter estimation, these nuisance parameters are integrated out in the estimation process. This can result in an extremely computationally intensive estimator. This letter proposes a method by which computationally intensive integration over the nuisance parameters required in Bayesian estimation can be avoided under certain conditions. The proposed method is an approximate MAP estimator, which is much more computationally efficient than direct, or even Monte Carlo, integration of the joint posteriori distribution of the desired and nuisance parameters. As an example, we apply the fast algorithm to matched-field source localization in an uncertain environment.

Keywords:

OCEAN

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.