1275 search results - page 113 / 255 » The Infinite Hidden Markov Model |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...
ICIP
2002
IEEE
16 years 23 days ago
2002
IEEE
The goal in image segmentation is to label pixels in an image based on the properties of each pixel and its surrounding region. Recently Content-Based Image Retrieval (CBIR) has e...
101
click to vote
NIPS
2008
15 years 18 days ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Many problems in vision involve the prediction of a class label for each frame in an unsegmented sequence. In this paper, we develop a discriminative framework for simultaneous se...