scispace - formally typeset
Search or ask a question
Topic

Maximum a posteriori estimation

About: Maximum a posteriori estimation is a research topic. Over the lifetime, 7486 publications have been published within this topic receiving 222291 citations. The topic is also known as: Maximum a posteriori, MAP & maximum a posteriori probability.


Papers
More filters
Journal ArticleDOI
TL;DR: The proposed frequency-coupled detector can significantly outperform the traditional decoupled one in wideband spectrum sensing in the presence of correlation between the occupancies of frequency subbands.
Abstract: In this letter, we consider wideband spectrum sensing in the presence of correlation between the occupancies of frequency subbands. We begin by formulating the maximum a posteriori (MAP) estimator of channel occupancy based on measurements from multiple frequency subbands. Since the MAP estimator's complexity grows exponentially with the number of subbands, we propose an alternative structure, in which the subband energy measurements are linearly combined according to a minimum mean-square error (MMSE) criterion to form a sufficient statistic for binary detection in each subband. Through analysis and numerical simulations, we show that the proposed frequency-coupled detector can significantly outperform the traditional decoupled one.

49 citations

Posted Content
TL;DR: In this paper, a generalized gamma family of hyperpriors is proposed to allow the impressed currents to be focal and a fast and efficient iterative algorithm, the Iterative Alternating Sequential (IAS) algorithm, is proposed for computing maximum a posteriori (MAP) estimates.
Abstract: Bayesian modeling and analysis of the MEG and EEG modalities provide a flexible framework for introducing prior information complementary to the measured data. This prior information is often qualitative in nature, making the translation of the available information into a computational model a challenging task. We propose a generalized gamma family of hyperpriors which allows the impressed currents to be focal and we advocate a fast and efficient iterative algorithm, the Iterative Alternating Sequential (IAS) algorithm for computing maximum a posteriori (MAP) estimates. Furthermore, we show that for particular choices of the scalar parameters specifying the hyperprior, the algorithm effectively approximates popular regularization strategies such as the Minimum Current Estimate and the Minimum Support Estimate. The connection between priorconditioning and adaptive regularization methods is also pointed out. The posterior densities are explored by means of a Markov Chain Monte Carlo (MCMC) strategy suitable for this family of hypermodels. The computed experiments suggest that the known preference of regularization methods for superficial sources over deep sources is a property of the MAP estimators only, and that estimation of the posterior mean in the hierarchical model is better adapted for localizing deep sources.

48 citations

Journal ArticleDOI
TL;DR: This paper forms the low-dose CT sinogram preprocessing as a standard maximum a posteriori (MAP) estimation, which takes full consideration of the statistical properties of the two intrinsic noise sources in low- dose CT, i.e., the X-ray photon statistics and the electronic noise background.
Abstract: Computed tomography (CT) image recovery from low-mAs acquisitions without adequate treatment is always severely degraded due to a number of physical factors. In this paper, we formulate the low-dose CT sinogram preprocessing as a standard maximum a posteriori (MAP) estimation, which takes full consideration of the statistical properties of the two intrinsic noise sources in low-dose CT, i.e., the X-ray photon statistics and the electronic noise background. In addition, instead of using a general image prior as found in the traditional sinogram recovery models, we design a new prior formulation to more rationally encode the piecewise-linear configurations underlying a sinogram than previously used ones, like the TV prior term. As compared with the previous methods, especially the MAP-based ones, both the likelihood/loss and prior/regularization terms in the proposed model are ameliorated in a more accurate manner and better comply with the statistical essence of the generation mechanism of a practical sinogram. We further construct an efficient alternating direction method of multipliers algorithm to solve the proposed MAP framework. Experiments on simulated and real low-dose CT data demonstrate the superiority of the proposed method according to both visual inspection and comprehensive quantitative performance evaluation.

48 citations

Journal ArticleDOI
TL;DR: An unsupervised segmentation algorithm for extracting moving regions from compressed video using global motion estimation (GME) and Markov random field (MRF) classification and a coarse segmentation map of the MV field is obtained.
Abstract: In this paper, we propose an unsupervised segmentation algorithm for extracting moving regions from compressed video using global motion estimation (GME) and Markov random field (MRF) classification. First, motion vectors (MVs) are compensated from global motion and quantized into several representative classes, from which MRF priors are estimated. Then, a coarse segmentation map of the MV field is obtained using a maximum a posteriori estimate of the MRF label process. Finally, the boundaries of segmented moving regions are refined using color and edge information. The algorithm has been validated on a number of test sequences, and experimental results are provided to demonstrate its advantages over state-of-the-art methods.

48 citations

Proceedings ArticleDOI
21 Apr 1997
TL;DR: Experimental results showed that the perplexity reduction of the adaptation went up to a maximum of 39% when the amount of text data in the adapted task was very small, and that the MAP (maximum a-posteriori probability) estimation of the N-gram statistics was accurate.
Abstract: Describes a method of task adaptation in N-gram language modeling for accurately estimating the N-gram statistics from the small amount of data of the target task. Assuming a task-independent N-gram to be a-priori knowledge, the N-gram is adapted to a target task by MAP (maximum a-posteriori probability) estimation. Experimental results showed that the perplexities of the task-adapted models were 15% (trigram) and 24% (bigram) lower than those of the task-independent model, and that the perplexity reduction of the adaptation went up to a maximum of 39% when the amount of text data in the adapted task was very small.

48 citations


Network Information
Related Topics (5)
Estimator
97.3K papers, 2.6M citations
86% related
Deep learning
79.8K papers, 2.1M citations
85% related
Convolutional neural network
74.7K papers, 2M citations
85% related
Feature extraction
111.8K papers, 2.1M citations
85% related
Image processing
229.9K papers, 3.5M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202364
2022125
2021211
2020244
2019250
2018236