Results 261 to 270 of about 47,039 (298)
Some of the next articles are maybe not open access.
Strong markov random field model
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004The strong Markov random field (strong-MRF) model is a submodel of the more general MRF-Gibbs model. The strong-MRF model defines a system whose field is Markovian with respect to a defined neighborhood, and all subneighborhoods are also Markovian. A checkerboard pattern is a perfect example of a strong Markovian system.
openaire +3 more sources
2011
Let’s give Bayesian networks a break, and let us go back to our favorite topic, namely soccer. Suppose you want to develop a probabilistic model of the ranking of your team in the domestic soccer league championship at any given time t throughout the current season.
Antonino Freno, Edmondo Trentin
openaire +1 more source
Let’s give Bayesian networks a break, and let us go back to our favorite topic, namely soccer. Suppose you want to develop a probabilistic model of the ranking of your team in the domestic soccer league championship at any given time t throughout the current season.
Antonino Freno, Edmondo Trentin
openaire +1 more source
Multi-robot Markov random fields
International Joint Conference on Autonomous Agents and Multiagent Systems, 2008We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selection. The MRF model is well-suited to domains in which the joint probability over latent (action) and observed (perceived) variables can be factored into pairwise interactions ...
Jesse Butterfield +2 more
openaire +2 more sources
2000
Imagine a set S of people, the inhabitants of your home town, say. For every s I S there is a subset 𝒩 s of S: the people whom s knows, his or her neighbours, friends or colleagues. It happens that some people are infected by a dangerous disease D, the probability that a particular person s has D will naturally depend on the number of t ∈𝒩 s with D ...
openaire +1 more source
Imagine a set S of people, the inhabitants of your home town, say. For every s I S there is a subset 𝒩 s of S: the people whom s knows, his or her neighbours, friends or colleagues. It happens that some people are infected by a dangerous disease D, the probability that a particular person s has D will naturally depend on the number of t ∈𝒩 s with D ...
openaire +1 more source
2015
This chapter presents an introduction to Markov random fields (MRFs), also known as Markov networks, which are undirected graphical models. We describe how a Markov random field is represented, including its structure and parameters, with emphasis on regular MRFs.
openaire +1 more source
This chapter presents an introduction to Markov random fields (MRFs), also known as Markov networks, which are undirected graphical models. We describe how a Markov random field is represented, including its structure and parameters, with emphasis on regular MRFs.
openaire +1 more source
“Markov Times” for Random Fields
Theory of Probability & Its Applications, 1978openaire +1 more source
Subsampling of Markov random fields
Journal of Visual Communication and Image Representation, 1992openaire +1 more source
Journal of the American Statistical Association, 1984
Robert J. Adler, Yu A. Rozanov
openaire +2 more sources
Robert J. Adler, Yu A. Rozanov
openaire +2 more sources
Hidden markov random field model selection criteria based on mean field-like approximations
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003Florence Forbes
exaly
Image denoising based on hierarchical Markov random field
Pattern Recognition Letters, 2011Yupin Luo
exaly

