Sciweavers

1133 search results - page 46 / 227
» Basics of Graph Cuts
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 7 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
PAMI
2010
139views more  PAMI 2010»
13 years 6 months ago
Order-Preserving Moves for Graph-Cut-Based Optimization
— 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 ...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu
SODA
2010
ACM
106views Algorithms» more  SODA 2010»
13 years 6 months ago
Genus and the Geometry of the Cut Graph
James R. Lee, Anastasios Sidiropoulos