270 search results - page 8 / 54 » Estimation of non-stationary Markov Chain transition models |
UAI
2008
14 years 11 months ago
2008
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...
BMVC
2001
14 years 12 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
105
click to vote
ICDAR
1999
IEEE
15 years 1 months ago
1999
IEEE
We propose a two-state Markov chain model of degraded document images. The model generates random and burst noise to simulate isolated pixel reversal as well as blurring of a larg...
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
Hidden Markov Models (HMM) are probabilistic graphical models for interdependent classification. In this paper we experiment with different ways of combining the components of an ...
IPSN
2004
Springer
15 years 2 months ago
2004
Springer
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...