190 search results - page 13 / 38 » Markov Random Fields with Efficient Approximations |
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
PAMI
2007
13 years 7 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...