Sciweavers

494 search results - page 23 / 99
» Optimal Carpet Cutting
Sort
View
ICCV
2005
IEEE
14 years 10 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
CVPR
2009
IEEE
15 years 3 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ICIP
2002
IEEE
14 years 10 months ago
Object contour tracking using graph cuts based active contours
In this paper, we present an object contour tracking approach using graph cuts based active contours (GCBAC). Our proposed algorithm does not need any a priori global shape model,...
Ning Xu, Narendra Ahuja
ISMM
2011
Springer
12 years 11 months ago
Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
We study hierarchical segmentations that are optimal in the sense of minimal spanning forests of the original image. We introduce a region-merging operation called uprooting, and w...
Jean Cousty, Laurent Najman
FSS
2002
96views more  FSS 2002»
13 years 8 months ago
An approach to stopping problems of a dynamic fuzzy system
We formulate a stopping problem for dynamic fuzzy systems concerning with fuzzy decision environment. It could be regarded as a natural fuzzification of non-fuzzy stopping problem...
Masami Kurano, Masami Yasuda, Jun-ichi Nakagami, Y...