666 search results - page 91 / 134 » Unbalanced Graph Cuts |
97
Voted
PLDI
2000
ACM
15 years 5 months ago
2000
ACM
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
86
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
147
Voted
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
133
Voted
CVPR
2001
IEEE
16 years 2 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
97
Voted
ICIP
2008
IEEE
15 years 7 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...