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: It is found that the choice of the shape of the prior distribution affects the noise characteristics and edge sharpness in the final estimate and can generate reconstructions closer to the actual solution than maximum likelihood (ML).
Abstract: The effects of several of Gibbs prior distributions in terms of noise characteristics, edge sharpness, and overall quantitative accuracy of the final estimates obtained from an iterative maximum a posteriori (MAP) procedure applied to data from a realistic chest phantom are demonstrated. The effects of the adjustable parameters built into the prior distribution on these properties are examined. It is found that these parameter values influence the noise and edge characteristics of the final estimate and can generate reconstructions closer to the actual solution than maximum likelihood (ML). In addition, it is found that the choice of the shape of the prior distribution affects the noise characteristics and edge sharpness in the final estimate. >

112 citations

Journal ArticleDOI
TL;DR: The combination of region segmentation and edge detection proved to be a robust technique, as adequate clusters were automatically identified, regardless of the noise level and bias, in this work.
Abstract: Brain magnetic resonance imaging segmentation is accomplished in this work by applying nonparametric density estimation, using the mean shift algorithm in the joint spatial-range domain. The quality of the class boundaries is improved by including an edge confidence map, that represents the confidence of truly being in the presence of a border between adjacent regions; an adjacency graph is then constructed with the labeled regions, and analyzed and pruned to merge adjacent regions. In order to assign image regions to a cerebral tissue type, a spatial normalization between image data and standard probability maps is carried out, so that for each structure a maximum a posteriori probability criterion is applied. The method was applied to synthetic and real images, keeping all parameters constant throughout the process for each type of data. The combination of region segmentation and edge detection proved to be a robust technique, as adequate clusters were automatically identified, regardless of the noise level and bias. In a comparison with reference segmentations, average Tanimoto indexes of 0.90-0.99 were obtained for synthetic data and of 0.59-0.99 for real data, considering gray matter, white matter, and background.

111 citations

Journal ArticleDOI
TL;DR: In this article, the authors derived the form of the maximum likelihood (ML) estimate of the scintillation point given the photomultiplier counts in an Anger Scintillation camera.
Abstract: We derive the form of the maximum likelihood (ML) estimate of the location of the scintillation point given the photomultiplier counts in an Anger Scintillation camera. This estimate is also Maximum a Posteriori (MAP) if the prior probability density on the scintillation point is uniform in the object plane. The form of the estimate suggests the possibility of an optical filtering implementation. We note that the ML estimate implies a solution that is remarkably similar to the "optimum position arithmetic" derived by Tanaka, et al.

111 citations

Proceedings ArticleDOI
19 Jul 2004
TL;DR: This paper proposes a multiple object tracking algorithm that seeks the optimal state sequence which maximizes the joint state-observation probability and names this algorithm trajectory tracking since it estimates the state sequence or "trajectory" instead of the current state.
Abstract: Most tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework called Hidden Markov Model, where the distribution of the object state at current time instance is estimated based on current and previous observations. However this approach is prone to errors caused by temporal distractions such as occlusion, background clutter and multi-object confusion. In this paper we propose a multiple object tracking algorithm that seeks the optimal state sequence which maximizes the joint state-observation probability. We name this algorithm trajectory tracking since it estimates the state sequence or "trajectory" instead of the current state. The algorithm is capable of tracking multiple objects whose number is unknown and varies during tracking. We introduce an observation model which is composed of the original image, the foreground mask given by background subtraction and the object detection map generated by an object detector The image provides the object appearance information. The foreground mask enables the likelihood computation to consider the multi-object configuration in its entirety. The detection map consists of pixel-wise object detection scores, which drives the tracking algorithm to perform joint inference on both the number of objects and their configurations efficiently.

110 citations

Journal ArticleDOI
TL;DR: The proposed image deblocking algorithm outperforms the current state-of-the-art methods in both the objective quality and the perceptual quality and is developed as an optimization problem within maximum a posteriori framework.
Abstract: Due to independent and coarse quantization of transform coefficients in each block, block-based transform coding usually introduces visually annoying blocking artifacts at low bitrates, which greatly prevents further bit reduction. To alleviate the conflict between bit reduction and quality preservation, deblocking as a post-processing strategy is an attractive and promising solution without changing existing codec. In this paper, in order to reduce blocking artifacts and obtain high-quality image, image deblocking is formulated as an optimization problem within maximum a posteriori framework, and a novel algorithm for image deblocking using constrained non-convex low-rank model is proposed. The $l_{p}~(0 penalty function is extended on singular values of a matrix to characterize low-rank prior model rather than the nuclear norm, while the quantization constraint is explicitly transformed into the feasible solution space to constrain the non-convex low-rank optimization. Moreover, a new quantization noise model is developed, and an alternatively minimizing strategy with adaptive parameter adjustment is developed to solve the proposed optimization problem. This parameter-free advantage enables the whole algorithm more attractive and practical. Experiments demonstrate that the proposed image deblocking algorithm outperforms the current state-of-the-art methods in both the objective quality and the perceptual quality.

110 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