42 search results - page 5 / 9 » LogCut - Efficient Graph Cut Optimization for Markov Random ... |
165
Voted
SIAMIS
2010
14 years 10 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
130
Voted
TIP
2010
14 years 10 months ago
2010
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
130
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
127
Voted
JMIV
2006
15 years 3 months ago
2006
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
142
Voted
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...