42 search results - page 3 / 9 » Classes of Submodular Constraints Expressible by Graph Cuts |
PAMI
2010
13 years 5 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
CPC
2006
13 years 7 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...