3,070 research outputs found
Hidden Gibbs random fields model selection using Block Likelihood Information Criterion
Performing model selection between Gibbs random fields is a very challenging
task. Indeed, due to the Markovian dependence structure, the normalizing
constant of the fields cannot be computed using standard analytical or
numerical methods. Furthermore, such unobserved fields cannot be integrated out
and the likelihood evaluztion is a doubly intractable problem. This forms a
central issue to pick the model that best fits an observed data. We introduce a
new approximate version of the Bayesian Information Criterion. We partition the
lattice into continuous rectangular blocks and we approximate the probability
measure of the hidden Gibbs field by the product of some Gibbs distributions
over the blocks. On that basis, we estimate the likelihood and derive the Block
Likelihood Information Criterion (BLIC) that answers model choice questions
such as the selection of the dependency structure or the number of latent
states. We study the performances of BLIC for those questions. In addition, we
present a comparison with ABC algorithms to point out that the novel criterion
offers a better trade-off between time efficiency and reliable results
Accuracy of MAP segmentation with hidden Potts and Markov mesh prior models via Path Constrained Viterbi Training, Iterated Conditional Modes and Graph Cut based algorithms
In this paper, we study statistical classification accuracy of two different
Markov field environments for pixelwise image segmentation, considering the
labels of the image as hidden states and solving the estimation of such labels
as a solution of the MAP equation. The emission distribution is assumed the
same in all models, and the difference lays in the Markovian prior hypothesis
made over the labeling random field. The a priori labeling knowledge will be
modeled with a) a second order anisotropic Markov Mesh and b) a classical
isotropic Potts model. Under such models, we will consider three different
segmentation procedures, 2D Path Constrained Viterbi training for the Hidden
Markov Mesh, a Graph Cut based segmentation for the first order isotropic Potts
model, and ICM (Iterated Conditional Modes) for the second order isotropic
Potts model.
We provide a unified view of all three methods, and investigate goodness of
fit for classification, studying the influence of parameter estimation,
computational gain, and extent of automation in the statistical measures
Overall Accuracy, Relative Improvement and Kappa coefficient, allowing robust
and accurate statistical analysis on synthetic and real-life experimental data
coming from the field of Dental Diagnostic Radiography. All algorithms, using
the learned parameters, generate good segmentations with little interaction
when the images have a clear multimodal histogram. Suboptimal learning proves
to be frail in the case of non-distinctive modes, which limits the complexity
of usable models, and hence the achievable error rate as well.
All Matlab code written is provided in a toolbox available for download from
our website, following the Reproducible Research Paradigm
Hidden Markov random field and FRAME modelling for TCA-image analysis
Tooth Cementum Annulation (TCA) is an age estimation method carried out on thin cross sections of the root of human teeth. Age is computed by adding the tooth eruption age to the count of annual incremental lines that are called tooth rings and appear in the cementum band. Algorithms to denoise and segment the digital image of the tooth section are considered a crucial step towards computer-assisted TCA. The approach pursued in this paper relies on modelling the images as hidden Markov random fields, where gray values are assumed to be pixelwise conditionally independent and normally distributed, given a hidden random field of labels. These unknown labels have to be estimated to segment the image. To account for long-range dependence among the observed values and for periodicity in the placement of tooth rings, the Gibbsian label distribution is specified by a potential function that incorporates macro-features of the TCA-image (a FRAME model). Estimation of the model parameters is carried out by an EM-algorithm that exploits the mean field approximation of the label distribution. Segmentation is based on the predictive distribution of the labels given the observed gray values. KEYWORDS: EM, FRAME, Gibbs distribution, (hidden) Markov random field, mean field approximation, TCA
Fast joint detection-estimation of evoked brain activity in event-related fMRI using a variational approach
In standard clinical within-subject analyses of event-related fMRI data, two
steps are usually performed separately: detection of brain activity and
estimation of the hemodynamic response. Because these two steps are inherently
linked, we adopt the so-called region-based Joint Detection-Estimation (JDE)
framework that addresses this joint issue using a multivariate inference for
detection and estimation. JDE is built by making use of a regional bilinear
generative model of the BOLD response and constraining the parameter estimation
by physiological priors using temporal and spatial information in a Markovian
modeling. In contrast to previous works that use Markov Chain Monte Carlo
(MCMC) techniques to approximate the resulting intractable posterior
distribution, we recast the JDE into a missing data framework and derive a
Variational Expectation-Maximization (VEM) algorithm for its inference. A
variational approximation is used to approximate the Markovian model in the
unsupervised spatially adaptive JDE inference, which allows fine automatic
tuning of spatial regularisation parameters. It follows a new algorithm that
exhibits interesting properties compared to the previously used MCMC-based
approach. Experiments on artificial and real data show that VEM-JDE is robust
to model mis-specification and provides computational gain while maintaining
good performance in terms of activation detection and hemodynamic shape
recovery
Multiple Testing for Neuroimaging via Hidden Markov Random Field
Traditional voxel-level multiple testing procedures in neuroimaging, mostly
-value based, often ignore the spatial correlations among neighboring voxels
and thus suffer from substantial loss of power. We extend the
local-significance-index based procedure originally developed for the hidden
Markov chain models, which aims to minimize the false nondiscovery rate subject
to a constraint on the false discovery rate, to three-dimensional neuroimaging
data using a hidden Markov random field model. A generalized
expectation-maximization algorithm for maximizing the penalized likelihood is
proposed for estimating the model parameters. Extensive simulations show that
the proposed approach is more powerful than conventional false discovery rate
procedures. We apply the method to the comparison between mild cognitive
impairment, a disease status with increased risk of developing Alzheimer's or
another dementia, and normal controls in the FDG-PET imaging study of the
Alzheimer's Disease Neuroimaging Initiative.Comment: A MATLAB package implementing the proposed FDR procedure is available
with this paper at the Biometrics website on Wiley Online Librar
- âŠ