666 search results - page 10 / 134 » Unbalanced Graph Cuts |
TAMC
2010
Springer
14 years 3 months ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
EDBT
2012
ACM
12 years 10 days ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
ICIP
2010
IEEE
13 years 8 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
PAMI
2010
13 years 8 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
AAAI
2011
12 years 10 months ago
2011