1115 search results - page 10 / 223 » Active Graph Cuts |
128
click to vote
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
123
Voted
ICIP
2010
IEEE
15 years 12 days 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...
294
click to vote
PAMI
2010
15 years 25 days 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...
STOC
2006
ACM
16 years 2 months ago
2006
ACM