9 search results - page 1 / 2 » Quadratic programming relaxations for metric labeling and Ma... |
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
VLSM
2005
Springer
13 years 10 months ago
2005
Springer
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
NIPS
2007
13 years 6 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
ACCV
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. This paper deals with the classification of color video sequences using Markov Random Fields (MRF) taking into account motion information. The theoretical framework relie...