Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Fast, approximate maximum a posteriori probability parameter estimation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Harrison, B.F. ; Naval Underwater Syst. Center, Newport, RI, USA ; Tufts, D.W. ; Vaccaro, R.J.

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.

Published in:

Signal Processing Letters, IEEE  (Volume:4 ,  Issue: 4 )