273 search results - page 10 / 55 » Can Pure Cutting Plane Algorithms Work |
148
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
128
Voted
ECSQARU
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Although we can build a belief network starting from any ordering of its variables, its structure depends heavily on the ordering being selected: the topology of the netw...
135
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
139
Voted
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
127
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...