666 search results - page 11 / 134 » Unbalanced Graph Cuts |
STOC
2006
ACM
14 years 10 months ago
2006
ACM
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
MICCAI
2006
Springer
14 years 11 months ago
2006
Springer
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
CRV
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
ICCV
2003
IEEE
14 years 12 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...